concentrate Isabelle specific physical rendering markup selection in isabelle_markup.scala;
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.
71 * Renamed class eq and constant eq (for code generation) to class equal
72 and constant equal, plus renaming of related facts and various tuning.
75 * Scala (2.8 or higher) has been added to the target languages of
78 * Dropped type classes mult_mono and mult_mono1. INCOMPATIBILITY.
80 * Theory SetsAndFunctions has been split into Function_Algebras and Set_Algebras;
81 canonical names for instance definitions for functions; various improvements.
84 * Records: logical foundation type for records do not carry a '_type' suffix
85 any longer. INCOMPATIBILITY.
87 * Code generation for records: more idiomatic representation of record types.
88 Warning: records are not covered by ancient SML code generation any longer.
89 INCOMPATIBILITY. In cases of need, a suitable rep_datatype declaration
90 helps to succeed then:
94 rep_datatype foo_ext ...
96 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
99 * Quickcheck in locales considers interpretations of that locale for
100 counter example search.
102 * Theory Library/Monad_Syntax provides do-syntax for monad types. Syntax
103 in Library/State_Monad has been changed to avoid ambiguities.
106 * Code generator: export_code without explicit file declaration prints
107 to standard output. INCOMPATIBILITY.
109 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
110 respectively. INCOMPATIBILITY.
112 * Constant "split" has been merged with constant "prod_case"; names
113 of ML functions, facts etc. involving split have been retained so far,
114 though. INCOMPATIBILITY.
116 * Dropped old infix syntax "mem" for List.member; use "in set"
117 instead. INCOMPATIBILITY.
119 * Refactoring of code-generation specific operations in List.thy
125 mem_iff ~> member_def
126 null_empty ~> null_def
128 INCOMPATIBILITY. Note that these were not suppossed to be used
129 regularly unless for striking reasons; their main purpose was code
132 * Some previously unqualified names have been qualified:
139 Trueprop ~> HOL.Trueprop
144 op --> ~> HOL.implies
156 Pair ~> Product_Type.Pair
157 fst ~> Product_Type.fst
158 snd ~> Product_Type.snd
159 curry ~> Product_Type.curry
161 Collect ~> Set.Collect
165 * Removed simplifier congruence rule of "prod_case", as has for long
166 been the case with "split". INCOMPATIBILITY.
168 * Datatype package: theorems generated for executable equality
169 (class eq) carry proper names and are treated as default code
172 * Removed lemma Option.is_none_none (Duplicate of is_none_def).
175 * List.thy: use various operations from the Haskell prelude when
176 generating Haskell code.
178 * code_simp.ML and method code_simp: simplification with rules determined
181 * code generator: do not print function definitions for case
182 combinators any longer.
184 * Multivariate Analysis: Introduced a type class for euclidean space. Most
185 theorems are now stated in terms of euclidean spaces instead of finite
189 real ^ 'n ~> 'a::real_vector
190 ~> 'a::euclidean_space
191 ~> 'a::ordered_euclidean_space
192 (depends on your needs)
196 \<chi> x. _ ~> \<chi>\<chi> x. _
199 Also note that the indices are now natural numbers and not from some finite
200 type. Finite cartesian products of euclidean spaces, products of euclidean
201 spaces the real and complex numbers are instantiated to be euclidean_spaces.
205 * Probability: Introduced pinfreal as real numbers with infinity. Use pinfreal
206 as value for measures. Introduces Lebesgue Measure based on the integral in
207 Multivariate Analysis. Proved Radon Nikodym for arbitrary sigma finite measure
212 * Inductive package: offers new command "inductive_simps" to automatically
213 derive instantiated and simplified equations for inductive predicates,
214 similar to inductive_cases.
216 * "bij f" is now an abbreviation of "bij_betw f UNIV UNIV". surj_on is a
217 generalization of surj, and "surj f" is now a abbreviation of "surj_on f UNIV".
218 The theorems bij_def and surj_def are unchanged.
222 * All constant names are now qualified. INCOMPATIBILITY.
227 * All constant names are now qualified. INCOMPATIBILITY.
232 * Configuration option show_question_marks only affects regular pretty
233 printing of types and terms, not raw Term.string_of_vname.
235 * ML_Context.thm and ML_Context.thms are no longer pervasive. Rare
236 INCOMPATIBILITY, superseded by static antiquotations @{thm} and
237 @{thms} for most purposes.
239 * ML structure Unsynchronized never opened, not even in Isar
240 interaction mode as before. Old Unsynchronized.set etc. have been
241 discontinued -- use plain := instead. This should be *rare* anyway,
242 since modern tools always work via official context data, notably
243 configuration options.
245 * ML antiquotations @{theory} and @{theory_ref} refer to named
246 theories from the ancestry of the current context, not any accidental
247 theory loader state as before. Potential INCOMPATIBILITY, subtle
253 * Discontinued support for Poly/ML 5.0 and 5.1 versions.
257 New in Isabelle2009-2 (June 2010)
258 ---------------------------------
262 * Authentic syntax for *all* logical entities (type classes, type
263 constructors, term constants): provides simple and robust
264 correspondence between formal entities and concrete syntax. Within
265 the parse tree / AST representations, "constants" are decorated by
266 their category (class, type, const) and spelled out explicitly with
267 their full internal name.
269 Substantial INCOMPATIBILITY concerning low-level syntax declarations
270 and translations (translation rules and translation functions in ML).
271 Some hints on upgrading:
273 - Many existing uses of 'syntax' and 'translations' can be replaced
274 by more modern 'type_notation', 'notation' and 'abbreviation',
275 which are independent of this issue.
277 - 'translations' require markup within the AST; the term syntax
278 provides the following special forms:
280 CONST c -- produces syntax version of constant c from context
281 XCONST c -- literally c, checked as constant from context
282 c -- literally c, if declared by 'syntax'
284 Plain identifiers are treated as AST variables -- occasionally the
285 system indicates accidental variables via the error "rhs contains
288 Type classes and type constructors are marked according to their
289 concrete syntax. Some old translations rules need to be written
290 for the "type" category, using type constructor application
291 instead of pseudo-term application of the default category
294 - 'parse_translation' etc. in ML may use the following
297 @{class_syntax c} -- type class c within parse tree / AST
298 @{term_syntax c} -- type constructor c within parse tree / AST
299 @{const_syntax c} -- ML version of "CONST c" above
300 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
302 - Literal types within 'typed_print_translations', i.e. those *not*
303 represented as pseudo-terms are represented verbatim. Use @{class
304 c} or @{type_name c} here instead of the above syntax
307 Note that old non-authentic syntax was based on unqualified base
308 names, so all of the above "constant" names would coincide. Recall
309 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
310 diagnose syntax problems.
312 * Type constructors admit general mixfix syntax, not just infix.
314 * Concrete syntax may be attached to local entities without a proof
315 body, too. This works via regular mixfix annotations for 'fix',
316 'def', 'obtain' etc. or via the explicit 'write' command, which is
317 similar to the 'notation' command in theory specifications.
319 * Discontinued unnamed infix syntax (legacy feature for many years) --
320 need to specify constant name and syntax separately. Internal ML
321 datatype constructors have been renamed from InfixName to Infix etc.
322 Minor INCOMPATIBILITY.
324 * Schematic theorem statements need to be explicitly markup as such,
325 via commands 'schematic_lemma', 'schematic_theorem',
326 'schematic_corollary'. Thus the relevance of the proof is made
327 syntactically clear, which impacts performance in a parallel or
328 asynchronous interactive environment. Minor INCOMPATIBILITY.
330 * Use of cumulative prems via "!" in some proof methods has been
331 discontinued (old legacy feature).
333 * References 'trace_simp' and 'debug_simp' have been replaced by
334 configuration options stored in the context. Enabling tracing (the
335 case of debugging is similar) in proofs works via
337 using [[trace_simp = true]]
339 Tracing is then active for all invocations of the simplifier in
340 subsequent goal refinement steps. Tracing may also still be enabled or
341 disabled via the ProofGeneral settings menu.
343 * Separate commands 'hide_class', 'hide_type', 'hide_const',
344 'hide_fact' replace the former 'hide' KIND command. Minor
347 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
348 more efficient than combinations with -q1 or -q2.
353 * Proofterms record type-class reasoning explicitly, using the
354 "unconstrain" operation internally. This eliminates all sort
355 constraints from a theorem and proof, introducing explicit
356 OFCLASS-premises. On the proof term level, this operation is
357 automatically applied at theorem boundaries, such that closed proofs
358 are always free of sort constraints. INCOMPATIBILITY for tools that
361 * Local theory specifications may depend on extra type variables that
362 are not present in the result type -- arguments TYPE('a) :: 'a itself
363 are added internally. For example:
365 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
367 * Predicates of locales introduced by classes carry a mandatory
368 "class" prefix. INCOMPATIBILITY.
370 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
372 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
375 * Command 'code_reflect' allows to incorporate generated ML code into
376 runtime environment; replaces immature code_datatype antiquotation.
379 * Code generator: simple concept for abstract datatypes obeying
382 * Code generator: details of internal data cache have no impact on the
383 user space functionality any longer.
385 * Methods "unfold_locales" and "intro_locales" ignore non-locale
386 subgoals. This is more appropriate for interpretations with 'where'.
389 * Command 'example_proof' opens an empty proof body. This allows to
390 experiment with Isar, without producing any persistent result.
392 * Commands 'type_notation' and 'no_type_notation' declare type syntax
393 within a local theory context, with explicit checking of the
394 constructors involved (in contrast to the raw 'syntax' versions).
396 * Commands 'types' and 'typedecl' now work within a local theory
397 context -- without introducing dependencies on parameters or
398 assumptions, which is not possible in Isabelle/Pure.
400 * Command 'defaultsort' has been renamed to 'default_sort', it works
401 within a local theory context. Minor INCOMPATIBILITY.
406 * Command 'typedef' now works within a local theory context -- without
407 introducing dependencies on parameters or assumptions, which is not
408 possible in Isabelle/Pure/HOL. Note that the logical environment may
409 contain multiple interpretations of local typedefs (with different
410 non-emptiness proofs), even in a global theory context.
412 * New package for quotient types. Commands 'quotient_type' and
413 'quotient_definition' may be used for defining types and constants by
414 quotient constructions. An example is the type of integers created by
415 quotienting pairs of natural numbers:
418 intrel :: "(nat * nat) => (nat * nat) => bool"
420 "intrel (x, y) (u, v) = (x + v = u + y)"
422 quotient_type int = "nat * nat" / intrel
423 by (auto simp add: equivp_def expand_fun_eq)
426 "0::int" is "(0::nat, 0::nat)"
428 The method "lifting" can be used to lift of theorems from the
429 underlying "raw" type to the quotient type. The example
430 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
431 construction and provides a reasoning infrastructure for finite sets.
433 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
434 clash with new theory Quotient in Main HOL.
436 * Moved the SMT binding into the main HOL session, eliminating
437 separate HOL-SMT session.
439 * List membership infix mem operation is only an input abbreviation.
442 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
443 for future developements; former Library/Word.thy is still present in
444 the AFP entry RSAPPS.
446 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
447 longer shadowed. INCOMPATIBILITY.
449 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
452 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
455 * Dropped normalizing_semiring etc; use the facts in semiring classes
456 instead. INCOMPATIBILITY.
458 * Dropped several real-specific versions of lemmas about floor and
459 ceiling; use the generic lemmas from theory "Archimedean_Field"
460 instead. INCOMPATIBILITY.
462 floor_number_of_eq ~> floor_number_of
463 le_floor_eq_number_of ~> number_of_le_floor
464 le_floor_eq_zero ~> zero_le_floor
465 le_floor_eq_one ~> one_le_floor
466 floor_less_eq_number_of ~> floor_less_number_of
467 floor_less_eq_zero ~> floor_less_zero
468 floor_less_eq_one ~> floor_less_one
469 less_floor_eq_number_of ~> number_of_less_floor
470 less_floor_eq_zero ~> zero_less_floor
471 less_floor_eq_one ~> one_less_floor
472 floor_le_eq_number_of ~> floor_le_number_of
473 floor_le_eq_zero ~> floor_le_zero
474 floor_le_eq_one ~> floor_le_one
475 floor_subtract_number_of ~> floor_diff_number_of
476 floor_subtract_one ~> floor_diff_one
477 ceiling_number_of_eq ~> ceiling_number_of
478 ceiling_le_eq_number_of ~> ceiling_le_number_of
479 ceiling_le_zero_eq ~> ceiling_le_zero
480 ceiling_le_eq_one ~> ceiling_le_one
481 less_ceiling_eq_number_of ~> number_of_less_ceiling
482 less_ceiling_eq_zero ~> zero_less_ceiling
483 less_ceiling_eq_one ~> one_less_ceiling
484 ceiling_less_eq_number_of ~> ceiling_less_number_of
485 ceiling_less_eq_zero ~> ceiling_less_zero
486 ceiling_less_eq_one ~> ceiling_less_one
487 le_ceiling_eq_number_of ~> number_of_le_ceiling
488 le_ceiling_eq_zero ~> zero_le_ceiling
489 le_ceiling_eq_one ~> one_le_ceiling
490 ceiling_subtract_number_of ~> ceiling_diff_number_of
491 ceiling_subtract_one ~> ceiling_diff_one
493 * Theory "Finite_Set": various folding_XXX locales facilitate the
494 application of the various fold combinators on finite sets.
496 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
497 provides abstract red-black tree type which is backed by "RBT_Impl" as
498 implementation. INCOMPATIBILTY.
500 * Theory Library/Coinductive_List has been removed -- superseded by
501 AFP/thys/Coinductive.
503 * Theory PReal, including the type "preal" and related operations, has
504 been removed. INCOMPATIBILITY.
506 * Real: new development using Cauchy Sequences.
508 * Split off theory "Big_Operators" containing setsum, setprod,
509 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
511 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
512 "Int" etc. INCOMPATIBILITY.
514 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
516 * New set of rules "ac_simps" provides combined assoc / commute
517 rewrites for all interpretations of the appropriate generic locales.
519 * Renamed theory "OrderedGroup" to "Groups" and split theory
520 "Ring_and_Field" into theories "Rings" and "Fields"; for more
521 appropriate and more consistent names suitable for name prefixes
522 within the HOL theories. INCOMPATIBILITY.
524 * Some generic constants have been put to appropriate theories:
525 - less_eq, less: Orderings
526 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
527 - inverse, divide: Rings
530 * More consistent naming of type classes involving orderings (and
533 lower_semilattice ~> semilattice_inf
534 upper_semilattice ~> semilattice_sup
536 dense_linear_order ~> dense_linorder
538 pordered_ab_group_add ~> ordered_ab_group_add
539 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
540 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
541 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
542 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
543 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
544 pordered_cancel_semiring ~> ordered_cancel_semiring
545 pordered_comm_monoid_add ~> ordered_comm_monoid_add
546 pordered_comm_ring ~> ordered_comm_ring
547 pordered_comm_semiring ~> ordered_comm_semiring
548 pordered_ring ~> ordered_ring
549 pordered_ring_abs ~> ordered_ring_abs
550 pordered_semiring ~> ordered_semiring
552 ordered_ab_group_add ~> linordered_ab_group_add
553 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
554 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
555 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
556 ordered_field ~> linordered_field
557 ordered_field_no_lb ~> linordered_field_no_lb
558 ordered_field_no_ub ~> linordered_field_no_ub
559 ordered_field_dense_linear_order ~> dense_linordered_field
560 ordered_idom ~> linordered_idom
561 ordered_ring ~> linordered_ring
562 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
563 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
564 ordered_ring_strict ~> linordered_ring_strict
565 ordered_semidom ~> linordered_semidom
566 ordered_semiring ~> linordered_semiring
567 ordered_semiring_1 ~> linordered_semiring_1
568 ordered_semiring_1_strict ~> linordered_semiring_1_strict
569 ordered_semiring_strict ~> linordered_semiring_strict
571 The following slightly odd type classes have been moved to a
572 separate theory Library/Lattice_Algebras:
574 lordered_ab_group_add ~> lattice_ab_group_add
575 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
576 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
577 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
578 lordered_ring ~> lattice_ring
582 * Refined field classes:
583 - classes division_ring_inverse_zero, field_inverse_zero,
584 linordered_field_inverse_zero include rule inverse 0 = 0 --
585 subsumes former division_by_zero class;
586 - numerous lemmas have been ported from field to division_ring.
589 * Refined algebra theorem collections:
590 - dropped theorem group group_simps, use algebra_simps instead;
591 - dropped theorem group ring_simps, use field_simps instead;
592 - proper theorem collection field_simps subsumes former theorem
593 groups field_eq_simps and field_simps;
594 - dropped lemma eq_minus_self_iff which is a duplicate for
598 * Theory Finite_Set and List: some lemmas have been generalized from
601 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
602 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
603 inter_Inter_fold_inter ~> inf_Inf_fold_inf
604 union_Union_fold_union ~> sup_Sup_fold_sup
605 Inter_fold_inter ~> Inf_fold_inf
606 Union_fold_union ~> Sup_fold_sup
607 inter_INTER_fold_inter ~> inf_INFI_fold_inf
608 union_UNION_fold_union ~> sup_SUPR_fold_sup
609 INTER_fold_inter ~> INFI_fold_inf
610 UNION_fold_union ~> SUPR_fold_sup
612 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
613 replaced by the more convenient lemmas Inf_empty and Sup_empty.
614 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
615 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
616 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
617 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
619 * Reorganized theory Multiset: swapped notation of pointwise and
622 - pointwise ordering is instance of class order with standard syntax
624 - multiset ordering has syntax <=# and <#; partial order properties
625 are provided by means of interpretation with prefix
627 - less duplication, less historical organization of sections,
628 conversion from associations lists to multisets, rudimentary code
630 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
635 multiset_eq_conv_count_eq ~> multiset_ext_iff
636 multi_count_ext ~> multiset_ext
637 diff_union_inverse2 ~> diff_union_cancelR
641 * Theory Permutation: replaced local "remove" by List.remove1.
643 * Code generation: ML and OCaml code is decorated with signatures.
645 * Theory List: added transpose.
647 * Library/Nat_Bijection.thy is a collection of bijective functions
648 between nat and other types, which supersedes the older libraries
649 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
652 Nat_Int_Bij.nat2_to_nat ~> prod_encode
653 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
654 Nat_Int_Bij.int_to_nat_bij ~> int_encode
655 Nat_Int_Bij.nat_to_int_bij ~> int_decode
656 Countable.pair_encode ~> prod_encode
657 NatIso.prod2nat ~> prod_encode
658 NatIso.nat2prod ~> prod_decode
659 NatIso.sum2nat ~> sum_encode
660 NatIso.nat2sum ~> sum_decode
661 NatIso.list2nat ~> list_encode
662 NatIso.nat2list ~> list_decode
663 NatIso.set2nat ~> set_encode
664 NatIso.nat2set ~> set_decode
667 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
668 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
669 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
670 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
671 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
672 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
673 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
674 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
675 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
676 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
677 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
678 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
679 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
682 - Renamed ATP commands:
683 atp_info ~> sledgehammer running_atps
684 atp_kill ~> sledgehammer kill_atps
685 atp_messages ~> sledgehammer messages
686 atp_minimize ~> sledgehammer minimize
687 print_atps ~> sledgehammer available_atps
689 - Added user's manual ("isabelle doc sledgehammer").
690 - Added option syntax and "sledgehammer_params" to customize
691 Sledgehammer's behavior. See the manual for details.
692 - Modified the Isar proof reconstruction code so that it produces
693 direct proofs rather than proofs by contradiction. (This feature
694 is still experimental.)
695 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
697 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
700 - Added and implemented "binary_ints" and "bits" options.
701 - Added "std" option and implemented support for nonstandard models.
702 - Added and implemented "finitize" option to improve the precision
703 of infinite datatypes based on a monotonicity analysis.
704 - Added support for quotient types.
705 - Added support for "specification" and "ax_specification"
707 - Added support for local definitions (for "function" and
708 "termination" proofs).
709 - Added support for term postprocessors.
710 - Optimized "Multiset.multiset" and "FinFun.finfun".
711 - Improved efficiency of "destroy_constrs" optimization.
712 - Fixed soundness bugs related to "destroy_constrs" optimization and
714 - Fixed soundness bug related to higher-order constructors.
715 - Fixed soundness bug when "full_descrs" is enabled.
716 - Improved precision of set constructs.
717 - Added "atoms" option.
718 - Added cache to speed up repeated Kodkod invocations on the same
720 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
721 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
722 "SAT4J_Light". INCOMPATIBILITY.
723 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
724 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
725 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
727 * Method "induct" now takes instantiations of the form t, where t is not
728 a variable, as a shorthand for "x == t", where x is a fresh variable.
729 If this is not intended, t has to be enclosed in parentheses.
730 By default, the equalities generated by definitional instantiations
731 are pre-simplified, which may cause parameters of inductive cases
732 to disappear, or may even delete some of the inductive cases.
733 Use "induct (no_simp)" instead of "induct" to restore the old
734 behaviour. The (no_simp) option is also understood by the "cases"
735 and "nominal_induct" methods, which now perform pre-simplification, too.
741 * Variable names in lemmas generated by the domain package have
742 changed; the naming scheme is now consistent with the HOL datatype
743 package. Some proof scripts may be affected, INCOMPATIBILITY.
745 * The domain package no longer defines the function "foo_copy" for
746 recursive domain "foo". The reach lemma is now stated directly in
747 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
748 be reformulated in terms of "foo_take", INCOMPATIBILITY.
750 * Most definedness lemmas generated by the domain package (previously
751 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
752 like "foo$x = UU <-> x = UU", which works better as a simp rule.
753 Proofs that used definedness lemmas as intro rules may break,
754 potential INCOMPATIBILITY.
756 * Induction and casedist rules generated by the domain package now
757 declare proper case_names (one called "bottom", and one named for each
758 constructor). INCOMPATIBILITY.
760 * For mutually-recursive domains, separate "reach" and "take_lemma"
761 rules are generated for each domain, INCOMPATIBILITY.
763 foo_bar.reach ~> foo.reach bar.reach
764 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
766 * Some lemmas generated by the domain package have been renamed for
767 consistency with the datatype package, INCOMPATIBILITY.
769 foo.ind ~> foo.induct
770 foo.finite_ind ~> foo.finite_induct
771 foo.coind ~> foo.coinduct
772 foo.casedist ~> foo.exhaust
773 foo.exhaust ~> foo.nchotomy
775 * For consistency with other definition packages, the fixrec package
776 now generates qualified theorem names, INCOMPATIBILITY.
778 foo_simps ~> foo.simps
779 foo_unfold ~> foo.unfold
780 foo_induct ~> foo.induct
782 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
783 method and internal fixrec proofs now use the default simpset instead.
786 * The "contlub" predicate has been removed. Proof scripts should use
787 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
789 * The "admw" predicate has been removed, INCOMPATIBILITY.
791 * The constants cpair, cfst, and csnd have been removed in favor of
792 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
797 * Antiquotations for basic formal entities:
799 @{class NAME} -- type class
800 @{class_syntax NAME} -- syntax representation of the above
802 @{type_name NAME} -- logical type
803 @{type_abbrev NAME} -- type abbreviation
804 @{nonterminal NAME} -- type of concrete syntactic category
805 @{type_syntax NAME} -- syntax representation of any of the above
807 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
808 @{const_abbrev NAME} -- abbreviated constant
809 @{const_syntax NAME} -- syntax representation of any of the above
811 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
812 syntax constant (cf. 'syntax' command).
814 * Antiquotation @{make_string} inlines a function to print arbitrary
815 values similar to the ML toplevel. The result is compiler dependent
816 and may fall back on "?" in certain situations.
818 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
819 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
820 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
821 not work with the asynchronous Isar document model.
823 * Configuration options now admit dynamic default values, depending on
824 the context or even global references.
826 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
827 uses an efficient external library if available (for Poly/ML).
829 * Renamed some important ML structures, while keeping the old names
830 for some time as aliases within the structure Legacy:
832 OuterKeyword ~> Keyword
835 OuterSyntax ~> Outer_Syntax
836 PrintMode ~> Print_Mode
837 SpecParse ~> Parse_Spec
840 ThyOutput ~> Thy_Output
841 TypeInfer ~> Type_Infer
843 Note that "open Legacy" simplifies porting of sources, but forgetting
844 to remove it again will complicate porting again in the future.
846 * Most operations that refer to a global context are named
847 accordingly, e.g. Simplifier.global_context or
848 ProofContext.init_global. There are some situations where a global
849 context actually works, but under normal circumstances one needs to
850 pass the proper local context through the code!
852 * Discontinued old TheoryDataFun with its copy/init operation -- data
853 needs to be pure. Functor Theory_Data_PP retains the traditional
854 Pretty.pp argument to merge, which is absent in the standard
857 * Sorts.certify_sort and derived "cert" operations for types and terms
858 no longer minimize sorts. Thus certification at the boundary of the
859 inference kernel becomes invariant under addition of class relations,
860 which is an important monotonicity principle. Sorts are now minimized
861 in the syntax layer only, at the boundary between the end-user and the
862 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
863 explicitly in rare situations.
865 * Renamed old-style Drule.standard to Drule.export_without_context, to
866 emphasize that this is in no way a standard operation.
869 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
870 usual for resolution. Rare INCOMPATIBILITY.
872 * Renamed varify/unvarify operations to varify_global/unvarify_global
873 to emphasize that these only work in a global situation (which is
876 * Curried take and drop in library.ML; negative length is interpreted
877 as infinity (as in chop). Subtle INCOMPATIBILITY.
879 * Proof terms: type substitutions on proof constants now use canonical
880 order of type variables. INCOMPATIBILITY for tools working with proof
883 * Raw axioms/defs may no longer carry sort constraints, and raw defs
884 may no longer carry premises. User-level specifications are
885 transformed accordingly by Thm.add_axiom/add_def.
890 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
891 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
892 proof terms are enabled unconditionally in the new HOL-Proofs image.
894 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
895 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
898 * Old lib/scripts/polyml-platform is superseded by the
899 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
900 variant, even on a 64 bit machine. The following example setting
901 prefers 64 bit if available:
903 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
905 * The preliminary Isabelle/jEdit application demonstrates the emerging
906 Isabelle/Scala layer for advanced prover interaction and integration.
907 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
910 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
911 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
912 similar to the default assignment of the document preparation system
913 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
914 provides some operations for direct access to the font without asking
915 the user for manual installation.
919 New in Isabelle2009-1 (December 2009)
920 -------------------------------------
924 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
925 one backslash should be used, even in ML sources.
930 * Locale interpretation propagates mixins along the locale hierarchy.
931 The currently only available mixins are the equations used to map
932 local definitions to terms of the target domain of an interpretation.
934 * Reactivated diagnostic command 'print_interps'. Use "print_interps
935 loc" to print all interpretations of locale "loc" in the theory.
936 Interpretations in proofs are not shown.
938 * Thoroughly revised locales tutorial. New section on conditional
941 * On instantiation of classes, remaining undefined class parameters
942 are formally declared. INCOMPATIBILITY.
945 *** Document preparation ***
947 * New generalized style concept for printing terms: @{foo (style) ...}
948 instead of @{foo_style style ...} (old form is still retained for
949 backward compatibility). Styles can be also applied for
950 antiquotations prop, term_type and typeof.
955 * New proof method "smt" for a combination of first-order logic with
956 equality, linear and nonlinear (natural/integer/real) arithmetic, and
957 fixed-size bitvectors; there is also basic support for higher-order
958 features (esp. lambda abstractions). It is an incomplete decision
959 procedure based on external SMT solvers using the oracle mechanism;
960 for the SMT solver Z3, this method is proof-producing. Certificates
961 are provided to avoid calling the external solvers solely for
962 re-checking proofs. Due to a remote SMT service there is no need for
963 installing SMT solvers locally. See src/HOL/SMT.
965 * New commands to load and prove verification conditions generated by
966 the Boogie program verifier or derived systems (e.g. the Verifying C
967 Compiler (VCC) or Spec#). See src/HOL/Boogie.
969 * New counterexample generator tool 'nitpick' based on the Kodkod
970 relational model finder. See src/HOL/Tools/Nitpick and
971 src/HOL/Nitpick_Examples.
973 * New commands 'code_pred' and 'values' to invoke the predicate
974 compiler and to enumerate values of inductive predicates.
976 * A tabled implementation of the reflexive transitive closure.
978 * New implementation of quickcheck uses generic code generator;
979 default generators are provided for all suitable HOL types, records
980 and datatypes. Old quickcheck can be re-activated importing theory
981 Library/SML_Quickcheck.
983 * New testing tool Mirabelle for automated proof tools. Applies
984 several tools and tactics like sledgehammer, metis, or quickcheck, to
985 every proof step in a theory. To be used in batch mode via the
988 * New proof method "sos" (sum of squares) for nonlinear real
989 arithmetic (originally due to John Harison). It requires theory
990 Library/Sum_Of_Squares. It is not a complete decision procedure but
991 works well in practice on quantifier-free real arithmetic with +, -,
992 *, ^, =, <= and <, i.e. boolean combinations of equalities and
993 inequalities between polynomials. It makes use of external
994 semidefinite programming solvers. Method "sos" generates a
995 certificate that can be pasted into the proof thus avoiding the need
996 to call an external tool every time the proof is checked. See
997 src/HOL/Library/Sum_Of_Squares.
999 * New method "linarith" invokes existing linear arithmetic decision
1002 * New command 'atp_minimal' reduces result produced by Sledgehammer.
1004 * New Sledgehammer option "Full Types" in Proof General settings menu.
1005 Causes full type information to be output to the ATPs. This slows
1006 ATPs down considerably but eliminates a source of unsound "proofs"
1009 * New method "metisFT": A version of metis that uses full type
1010 information in order to avoid failures of proof reconstruction.
1012 * New evaluator "approximate" approximates an real valued term using
1013 the same method as the approximation method.
1015 * Method "approximate" now supports arithmetic expressions as
1016 boundaries of intervals and implements interval splitting and Taylor
1019 * ML antiquotation @{code_datatype} inserts definition of a datatype
1020 generated by the code generator; e.g. see src/HOL/Predicate.thy.
1022 * New theory SupInf of the supremum and infimum operators for sets of
1025 * New theory Probability, which contains a development of measure
1026 theory, eventually leading to Lebesgue integration and probability.
1028 * Extended Multivariate Analysis to include derivation and Brouwer's
1031 * Reorganization of number theory, INCOMPATIBILITY:
1032 - new number theory development for nat and int, in theories Divides
1033 and GCD as well as in new session Number_Theory
1034 - some constants and facts now suffixed with _nat and _int
1036 - former session NumberTheory now named Old_Number_Theory, including
1037 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
1038 - moved theory Pocklington from src/HOL/Library to
1039 src/HOL/Old_Number_Theory
1041 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
1042 lcm of finite and infinite sets. It is shown that they form a complete
1045 * Class semiring_div requires superclass no_zero_divisors and proof of
1046 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
1047 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
1048 generalized to class semiring_div, subsuming former theorems
1049 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
1050 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
1053 * Refinements to lattice classes and sets:
1054 - less default intro/elim rules in locale variant, more default
1055 intro/elim rules in class variant: more uniformity
1056 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
1058 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
1060 - renamed ACI to inf_sup_aci
1061 - new class "boolean_algebra"
1062 - class "complete_lattice" moved to separate theory
1063 "Complete_Lattice"; corresponding constants (and abbreviations)
1064 renamed and with authentic syntax:
1065 Set.Inf ~> Complete_Lattice.Inf
1066 Set.Sup ~> Complete_Lattice.Sup
1067 Set.INFI ~> Complete_Lattice.INFI
1068 Set.SUPR ~> Complete_Lattice.SUPR
1069 Set.Inter ~> Complete_Lattice.Inter
1070 Set.Union ~> Complete_Lattice.Union
1071 Set.INTER ~> Complete_Lattice.INTER
1072 Set.UNION ~> Complete_Lattice.UNION
1073 - authentic syntax for
1076 - mere abbreviations:
1079 Set.inter (for inf, formerly Set.Int)
1080 Set.union (for sup, formerly Set.Un)
1081 Complete_Lattice.Inter (for Inf)
1082 Complete_Lattice.Union (for Sup)
1083 Complete_Lattice.INTER (for INFI)
1084 Complete_Lattice.UNION (for SUPR)
1085 - object-logic definitions as far as appropriate
1087 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
1088 Un_subset_iff are explicitly deleted as default simp rules; then also
1089 their lattice counterparts le_inf_iff and le_sup_iff have to be
1090 deleted to achieve the desired effect.
1092 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
1093 rules by default any longer; the same applies to min_max.inf_absorb1
1094 etc. INCOMPATIBILITY.
1096 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
1097 pred_set_conv by default. INCOMPATIBILITY.
1099 * Power operations on relations and functions are now one dedicated
1100 constant "compow" with infix syntax "^^". Power operation on
1101 multiplicative monoids retains syntax "^" and is now defined generic
1102 in class power. INCOMPATIBILITY.
1104 * Relation composition "R O S" now has a more standard argument order:
1105 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1106 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1107 break, since the O_assoc rule was not rewritten like this. Fix using
1108 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1110 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1111 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1114 * Most rules produced by inductive and datatype package have mandatory
1115 prefixes. INCOMPATIBILITY.
1117 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1118 the attribute of the same name. Each of the theorems in the list
1119 DERIV_intros assumes composition with an additional function and
1120 matches a variable to the derivative, which has to be solved by the
1121 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1122 of most elementary terms. Former Maclauren.DERIV_tac and
1123 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1126 * Code generator attributes follow the usual underscore convention:
1127 code_unfold replaces code unfold
1128 code_post replaces code post
1133 sizechange -> size_change
1134 induct_scheme -> induction_schema
1137 * Discontinued abbreviation "arbitrary" of constant "undefined".
1138 INCOMPATIBILITY, use "undefined" directly.
1141 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1142 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1143 Suc_plus1 -> Suc_eq_plus1
1144 *anti_sym -> *antisym*
1145 vector_less_eq_def -> vector_le_def
1148 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1151 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1157 * Theory Representable defines a class "rep" of domains that are
1158 representable (via an ep-pair) in the universal domain type "udom".
1159 Instances are provided for all type constructors defined in HOLCF.
1161 * The 'new_domain' command is a purely definitional version of the
1162 domain package, for representable domains. Syntax is identical to the
1163 old domain package. The 'new_domain' package also supports indirect
1164 recursion using previously-defined type constructors. See
1165 src/HOLCF/ex/New_Domain.thy for examples.
1167 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1168 on the left-hand side of an equation, and then performs
1169 simplification. Rewriting is done using rules declared with the
1170 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1171 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1173 * The pattern-match compiler in 'fixrec' can now handle constructors
1174 with HOL function types. Pattern-match combinators for the Pair
1175 constructor are pre-configured.
1177 * The 'fixrec' package now produces better fixed-point induction rules
1178 for mutually-recursive definitions: Induction rules have conclusions
1179 of the form "P foo bar" instead of "P <foo, bar>".
1181 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1182 been renamed to "below". The name "below" now replaces "less" in many
1183 theorem names. (Legacy theorem names using "less" are still supported
1186 * The 'fixrec' package now supports "bottom patterns". Bottom
1187 patterns can be used to generate strictness rules, or to make
1188 functions more strict (much like the bang-patterns supported by the
1189 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1195 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1196 errors and run-time exceptions, including detailed source positions.
1198 * Structure Name_Space (formerly NameSpace) now manages uniquely
1199 identified entries, with some additional information such as source
1200 position, logical grouping etc.
1202 * Theory and context data is now introduced by the simplified and
1203 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1204 to be pure, but the old TheoryDataFun for mutable data (with explicit
1205 copy operation) is still available for some time.
1207 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1208 provides a high-level programming interface to synchronized state
1209 variables with atomic update. This works via pure function
1210 application within a critical section -- its runtime should be as
1211 short as possible; beware of deadlocks if critical code is nested,
1212 either directly or indirectly via other synchronized variables!
1214 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1215 wraps raw ML references, explicitly indicating their non-thread-safe
1216 behaviour. The Isar toplevel keeps this structure open, to
1217 accommodate Proof General as well as quick and dirty interactive
1218 experiments with references.
1220 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1221 parallel tactical reasoning.
1223 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1224 are similar to SUBPROOF, but are slightly more flexible: only the
1225 specified parts of the subgoal are imported into the context, and the
1226 body tactic may introduce new subgoals and schematic variables.
1228 * Old tactical METAHYPS, which does not observe the proof context, has
1229 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1230 or Subgoal.FOCUS etc.
1232 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1233 functors have their own ML name space there is no point to mark them
1234 separately.) Minor INCOMPATIBILITY.
1236 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1238 * Renamed several structures FooBar to Foo_Bar. Occasional,
1241 * Operations of structure Skip_Proof no longer require quick_and_dirty
1242 mode, which avoids critical setmp.
1244 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1245 combinators for "args". INCOMPATIBILITY, need to use simplified
1246 Attrib/Method.setup introduced in Isabelle2009.
1248 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1249 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1250 last resort. INCOMPATIBILITY.
1252 * Display.pretty_thm now requires a proper context (cf. former
1253 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1254 or even Display.pretty_thm_without_context as last resort.
1257 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1258 Syntax.pretty_typ/term directly, preferably with proper context
1259 instead of global theory.
1264 * Further fine tuning of parallel proof checking, scales up to 8 cores
1265 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1268 * Support for additional "Isabelle components" via etc/components, see
1269 also the system manual.
1271 * The isabelle makeall tool now operates on all components with
1272 IsaMakefile, not just hardwired "logics".
1274 * Removed "compress" option from isabelle-process and isabelle usedir;
1275 this is always enabled.
1277 * Discontinued support for Poly/ML 4.x versions.
1279 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1280 on a given logic image. This requires the lighttpd webserver and is
1281 currently supported on Linux only.
1285 New in Isabelle2009 (April 2009)
1286 --------------------------------
1290 * Simplified main Isabelle executables, with less surprises on
1291 case-insensitive file-systems (such as Mac OS).
1293 - The main Isabelle tool wrapper is now called "isabelle" instead of
1296 - The former "isabelle" alias for "isabelle-process" has been
1297 removed (should rarely occur to regular users).
1299 - The former "isabelle-interface" and its alias "Isabelle" have been
1300 removed (interfaces are now regular Isabelle tools).
1302 Within scripts and make files, the Isabelle environment variables
1303 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1304 respectively. (The latter are still available as legacy feature.)
1306 The old isabelle-interface wrapper could react in confusing ways if
1307 the interface was uninstalled or changed otherwise. Individual
1308 interface tool configuration is now more explicit, see also the
1309 Isabelle system manual. In particular, Proof General is now available
1310 via "isabelle emacs".
1312 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1313 purge installed copies of Isabelle executables and re-run "isabelle
1314 install -p ...", or use symlinks.
1316 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1317 old ~/isabelle, which was slightly non-standard and apt to cause
1318 surprises on case-insensitive file-systems (such as Mac OS).
1320 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1321 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1322 care is required when using older releases of Isabelle. Note that
1323 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1324 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1326 * Proofs of fully specified statements are run in parallel on
1327 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1328 a regular 4-core machine, if the initial heap space is made reasonably
1329 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1331 * The main reference manuals ("isar-ref", "implementation", and
1332 "system") have been updated and extended. Formally checked references
1333 as hyperlinks are now available uniformly.
1338 * Complete re-implementation of locales. INCOMPATIBILITY in several
1339 respects. The most important changes are listed below. See the
1340 Tutorial on Locales ("locales" manual) for details.
1342 - In locale expressions, instantiation replaces renaming. Parameters
1343 must be declared in a for clause. To aid compatibility with previous
1344 parameter inheritance, in locale declarations, parameters that are not
1345 'touched' (instantiation position "_" or omitted) are implicitly added
1346 with their syntax at the beginning of the for clause.
1348 - Syntax from abbreviations and definitions in locales is available in
1349 locale expressions and context elements. The latter is particularly
1350 useful in locale declarations.
1352 - More flexible mechanisms to qualify names generated by locale
1353 expressions. Qualifiers (prefixes) may be specified in locale
1354 expressions, and can be marked as mandatory (syntax: "name!:") or
1355 optional (syntax "name?:"). The default depends for plain "name:"
1356 depends on the situation where a locale expression is used: in
1357 commands 'locale' and 'sublocale' prefixes are optional, in
1358 'interpretation' and 'interpret' prefixes are mandatory. The old
1359 implicit qualifiers derived from the parameter names of a locale are
1360 no longer generated.
1362 - Command "sublocale l < e" replaces "interpretation l < e". The
1363 instantiation clause in "interpretation" and "interpret" (square
1364 brackets) is no longer available. Use locale expressions.
1366 - When converting proof scripts, mandatory qualifiers in
1367 'interpretation' and 'interpret' should be retained by default, even
1368 if this is an INCOMPATIBILITY compared to former behavior. In the
1369 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1370 in locale expressions range over a single locale instance only.
1372 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1373 In existing theorem specifications replace the includes element by the
1374 respective context elements of the included locale, omitting those
1375 that are already present in the theorem specification. Multiple
1376 assume elements of a locale should be replaced by a single one
1377 involving the locale predicate. In the proof body, declarations (most
1378 notably theorems) may be regained by interpreting the respective
1379 locales in the proof context as required (command "interpret").
1381 If using "includes" in replacement of a target solely because the
1382 parameter types in the theorem are not as general as in the target,
1383 consider declaring a new locale with additional type constraints on
1384 the parameters (context element "constrains").
1386 - Discontinued "locale (open)". INCOMPATIBILITY.
1388 - Locale interpretation commands no longer attempt to simplify goal.
1389 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1390 methods intro_locales and unfold_locales to clarify.
1392 - Locale interpretation commands no longer accept interpretation
1393 attributes. INCOMPATIBILITY.
1395 * Class declaration: so-called "base sort" must not be given in import
1396 list any longer, but is inferred from the specification. Particularly
1403 class foo = type + ...
1405 * Class target: global versions of theorems stemming do not carry a
1406 parameter prefix any longer. INCOMPATIBILITY.
1408 * Class 'instance' command no longer accepts attached definitions.
1409 INCOMPATIBILITY, use proper 'instantiation' target instead.
1411 * Recovered hiding of consts, which was accidentally broken in
1412 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1413 makes c inaccessible; consider using ``hide (open) const c'' instead.
1415 * Slightly more coherent Pure syntax, with updated documentation in
1416 isar-ref manual. Removed locales meta_term_syntax and
1417 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1418 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1419 directly in regular applications.
1421 * There is a new syntactic category "float_const" for signed decimal
1422 fractions (e.g. 123.45 or -123.45).
1424 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1425 interface with 'setup' command instead.
1427 * Command 'local_setup' is similar to 'setup', but operates on a local
1430 * The 'axiomatization' command now only works within a global theory
1431 context. INCOMPATIBILITY.
1433 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1434 hypotheses. Sorts required in the course of reasoning need to be
1435 covered by the constraints in the initial statement, completed by the
1436 type instance information of the background theory. Non-trivial sort
1437 hypotheses, which rarely occur in practice, may be specified via
1438 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1440 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1442 The result contains an implicit sort hypotheses as before --
1443 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1446 * Generalized Isar history, with support for linear undo, direct state
1449 * Changed defaults for unify configuration options:
1451 unify_trace_bound = 50 (formerly 25)
1452 unify_search_bound = 60 (formerly 30)
1454 * Different bookkeeping for code equations (INCOMPATIBILITY):
1456 a) On theory merge, the last set of code equations for a particular
1457 constant is taken (in accordance with the policy applied by other
1458 parts of the code generator framework).
1460 b) Code equations stemming from explicit declarations (e.g. code
1461 attribute) gain priority over default code equations stemming
1462 from definition, primrec, fun etc.
1464 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1466 * Unified theorem tables for both code generators. Thus [code
1467 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1469 * Command 'find_consts' searches for constants based on type and name
1472 find_consts "_ => bool"
1474 By default, matching is against subtypes, but it may be restricted to
1475 the whole type. Searching by name is possible. Multiple queries are
1476 conjunctive and queries may be negated by prefixing them with a
1479 find_consts strict: "_ => bool" name: "Int" -"int => int"
1481 * New 'find_theorems' criterion "solves" matches theorems that
1482 directly solve the current goal (modulo higher-order unification).
1484 * Auto solve feature for main theorem statements: whenever a new goal
1485 is stated, "find_theorems solves" is called; any theorems that could
1486 solve the lemma directly are listed as part of the goal state.
1487 Cf. associated options in Proof General Isabelle settings menu,
1488 enabled by default, with reasonable timeout for pathological cases of
1489 higher-order unification.
1492 *** Document preparation ***
1494 * Antiquotation @{lemma} now imitates a regular terminal proof,
1495 demanding keyword 'by' and supporting the full method expression
1496 syntax just like the Isar command 'by'.
1501 * Integrated main parts of former image HOL-Complex with HOL. Entry
1502 points Main and Complex_Main remain as before.
1504 * Logic image HOL-Plain provides a minimal HOL with the most important
1505 tools available (inductive, datatype, primrec, ...). This facilitates
1506 experimentation and tool development. Note that user applications
1507 (and library theories) should never refer to anything below theory
1510 * Logic image HOL-Main stops at theory Main, and thus facilitates
1511 experimentation due to shorter build times.
1513 * Logic image HOL-NSA contains theories of nonstandard analysis which
1514 were previously part of former HOL-Complex. Entry point Hyperreal
1515 remains valid, but theories formerly using Complex_Main should now use
1516 new entry point Hypercomplex.
1518 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1519 Posix processes. Avoids potentially expensive forking of the ML
1520 process. New thread-based implementation also works on non-Unix
1521 platforms (Cygwin). Provers are no longer hardwired, but defined
1522 within the theory via plain ML wrapper functions. Basic Sledgehammer
1523 commands are covered in the isar-ref manual.
1525 * Wrapper scripts for remote SystemOnTPTP service allows to use
1526 sledgehammer without local ATP installation (Vampire etc.). Other
1527 provers may be included via suitable ML wrappers, see also
1528 src/HOL/ATP_Linkup.thy.
1530 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1533 * The metis method no longer fails because the theorem is too trivial
1534 (contains the empty clause).
1536 * The metis method now fails in the usual manner, rather than raising
1537 an exception, if it determines that it cannot prove the theorem.
1539 * Method "coherent" implements a prover for coherent logic (see also
1540 src/Tools/coherent.ML).
1542 * Constants "undefined" and "default" replace "arbitrary". Usually
1543 "undefined" is the right choice to replace "arbitrary", though
1544 logically there is no difference. INCOMPATIBILITY.
1546 * Command "value" now integrates different evaluation mechanisms. The
1547 result of the first successful evaluation mechanism is printed. In
1548 square brackets a particular named evaluation mechanisms may be
1549 specified (currently, [SML], [code] or [nbe]). See further
1550 src/HOL/ex/Eval_Examples.thy.
1552 * Normalization by evaluation now allows non-leftlinear equations.
1553 Declare with attribute [code nbe].
1555 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1556 as the structured Isar versions "cases" and "induct", cf. the
1557 corresponding "cases" and "induct" attributes. Mutual induction rules
1558 are now presented as a list of individual projections
1559 (e.g. foo_bar.inducts for types foo and bar); the old format with
1560 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1561 rare situations a different rule is selected --- notably nested tuple
1562 elimination instead of former prod.exhaust: use explicit (case_tac t
1563 rule: prod.exhaust) here.
1565 * Attributes "cases", "induct", "coinduct" support "del" option.
1567 * Removed fact "case_split_thm", which duplicates "case_split".
1569 * The option datatype has been moved to a new theory Option. Renamed
1570 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1572 * New predicate "strict_mono" classifies strict functions on partial
1573 orders. With strict functions on linear orders, reasoning about
1574 (in)equalities is facilitated by theorems "strict_mono_eq",
1575 "strict_mono_less_eq" and "strict_mono_less".
1577 * Some set operations are now proper qualified constants with
1578 authentic syntax. INCOMPATIBILITY:
1589 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1592 * Auxiliary class "itself" has disappeared -- classes without any
1593 parameter are treated as expected by the 'class' command.
1595 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1597 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1598 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1600 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1601 method "approximation". It proves formulas on real values by using
1602 interval arithmetic. In the formulas are also the transcendental
1603 functions sin, cos, tan, atan, ln, exp and the constant pi are
1604 allowed. For examples see
1605 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1607 * Theory "Reflection" now resides in HOL/Library.
1609 * Entry point to Word library now simply named "Word".
1612 * Made source layout more coherent with logical distribution
1615 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1616 src/HOL/Library/Code_Message.thy ~> src/HOL/
1617 src/HOL/Library/GCD.thy ~> src/HOL/
1618 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1619 src/HOL/Library/Parity.thy ~> src/HOL/
1620 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1621 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1622 src/HOL/Real/Lubs.thy ~> src/HOL/
1623 src/HOL/Real/PReal.thy ~> src/HOL/
1624 src/HOL/Real/Rational.thy ~> src/HOL/
1625 src/HOL/Real/RComplete.thy ~> src/HOL/
1626 src/HOL/Real/RealDef.thy ~> src/HOL/
1627 src/HOL/Real/RealPow.thy ~> src/HOL/
1628 src/HOL/Real/Real.thy ~> src/HOL/
1629 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1630 src/HOL/Complex/Complex.thy ~> src/HOL/
1631 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1632 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1633 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1634 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1635 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1636 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1637 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1638 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1639 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1640 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1641 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1642 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1643 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1644 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1645 src/HOL/Real/Float ~> src/HOL/Library/
1646 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1647 src/HOL/Real/RealVector.thy ~> src/HOL/
1649 src/HOL/arith_data.ML ~> src/HOL/Tools
1650 src/HOL/hologic.ML ~> src/HOL/Tools
1651 src/HOL/simpdata.ML ~> src/HOL/Tools
1652 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1653 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1654 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1655 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1656 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1657 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1658 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1660 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1661 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1662 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1663 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1664 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1665 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1667 * If methods "eval" and "evaluation" encounter a structured proof
1668 state with !!/==>, only the conclusion is evaluated to True (if
1669 possible), avoiding strange error messages.
1671 * Method "sizechange" automates termination proofs using (a
1672 modification of) the size-change principle. Requires SAT solver. See
1673 src/HOL/ex/Termination.thy for examples.
1675 * Simplifier: simproc for let expressions now unfolds if bound
1676 variable occurs at most once in let expression body. INCOMPATIBILITY.
1678 * Method "arith": Linear arithmetic now ignores all inequalities when
1679 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1681 * New attribute "arith" for facts that should always be used
1682 automatically by arithmetic. It is intended to be used locally in
1685 assumes [arith]: "x > 0"
1687 Global usage is discouraged because of possible performance impact.
1689 * New classes "top" and "bot" with corresponding operations "top" and
1690 "bot" in theory Orderings; instantiation of class "complete_lattice"
1691 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1693 * Changed definition lemma "less_fun_def" in order to provide an
1694 instance for preorders on functions; use lemma "less_le" instead.
1697 * Theory Orderings: class "wellorder" moved here, with explicit
1698 induction rule "less_induct" as assumption. For instantiation of
1699 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1702 * Theory Orderings: added class "preorder" as superclass of "order".
1703 INCOMPATIBILITY: Instantiation proofs for order, linorder
1704 etc. slightly changed. Some theorems named order_class.* now named
1707 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1710 * Theory Finite_Set: added a new fold combinator of type
1712 ('a => 'b => 'b) => 'b => 'a set => 'b
1714 Occasionally this is more convenient than the old fold combinator
1715 which is now defined in terms of the new one and renamed to
1718 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1719 and "ring_simps" have been replaced by "algebra_simps" (which can be
1720 extended with further lemmas!). At the moment both still exist but
1721 the former will disappear at some point.
1723 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1724 class recpower. Type-specific simp rules for various recpower types
1725 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1727 rat_power_0 -> power_0
1728 rat_power_Suc -> power_Suc
1729 realpow_0 -> power_0
1730 realpow_Suc -> power_Suc
1731 complexpow_0 -> power_0
1732 complexpow_Suc -> power_Suc
1733 power_poly_0 -> power_0
1734 power_poly_Suc -> power_Suc
1736 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1737 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1738 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1739 of lemmas from Divides has been generalized from nat to class
1740 semiring_div. INCOMPATIBILITY. This involves the following theorem
1741 renames resulting from duplicate elimination:
1743 dvd_def_mod ~> dvd_eq_mod_eq_0
1744 zero_dvd_iff ~> dvd_0_left_iff
1745 dvd_0 ~> dvd_0_right
1746 DIVISION_BY_ZERO_DIV ~> div_by_0
1747 DIVISION_BY_ZERO_MOD ~> mod_by_0
1748 mult_div ~> div_mult_self2_is_id
1749 mult_mod ~> mod_mult_self2_is_0
1751 * Theory IntDiv: removed many lemmas that are instances of class-based
1752 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1753 rename old lemmas as follows:
1755 dvd_diff -> nat_dvd_diff
1756 dvd_zminus_iff -> dvd_minus_iff
1757 mod_add1_eq -> mod_add_eq
1758 mod_mult1_eq -> mod_mult_right_eq
1759 mod_mult1_eq' -> mod_mult_left_eq
1760 mod_mult_distrib_mod -> mod_mult_eq
1761 nat_mod_add_left_eq -> mod_add_left_eq
1762 nat_mod_add_right_eq -> mod_add_right_eq
1763 nat_mod_div_trivial -> mod_div_trivial
1764 nat_mod_mod_trivial -> mod_mod_trivial
1765 zdiv_zadd_self1 -> div_add_self1
1766 zdiv_zadd_self2 -> div_add_self2
1767 zdiv_zmult_self1 -> div_mult_self2_is_id
1768 zdiv_zmult_self2 -> div_mult_self1_is_id
1769 zdvd_triv_left -> dvd_triv_left
1770 zdvd_triv_right -> dvd_triv_right
1771 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1772 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1773 zmod_zadd_left_eq -> mod_add_left_eq
1774 zmod_zadd_right_eq -> mod_add_right_eq
1775 zmod_zadd_self1 -> mod_add_self1
1776 zmod_zadd_self2 -> mod_add_self2
1777 zmod_zadd1_eq -> mod_add_eq
1778 zmod_zdiff1_eq -> mod_diff_eq
1779 zmod_zdvd_zmod -> mod_mod_cancel
1780 zmod_zmod_cancel -> mod_mod_cancel
1781 zmod_zmult_self1 -> mod_mult_self2_is_0
1782 zmod_zmult_self2 -> mod_mult_self1_is_0
1785 zdvd_abs1 -> abs_dvd_iff
1786 zdvd_abs2 -> dvd_abs_iff
1787 zdvd_refl -> dvd_refl
1788 zdvd_trans -> dvd_trans
1789 zdvd_zadd -> dvd_add
1790 zdvd_zdiff -> dvd_diff
1791 zdvd_zminus_iff -> dvd_minus_iff
1792 zdvd_zminus2_iff -> minus_dvd_iff
1793 zdvd_zmultD -> dvd_mult_right
1794 zdvd_zmultD2 -> dvd_mult_left
1795 zdvd_zmult_mono -> mult_dvd_mono
1796 zdvd_0_right -> dvd_0_right
1797 zdvd_0_left -> dvd_0_left_iff
1798 zdvd_1_left -> one_dvd
1799 zminus_dvd_iff -> minus_dvd_iff
1801 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1803 * The real numbers offer decimal input syntax: 12.34 is translated
1804 into 1234/10^2. This translation is not reversed upon output.
1806 * Theory Library/Polynomial defines an abstract type 'a poly of
1807 univariate polynomials with coefficients of type 'a. In addition to
1808 the standard ring operations, it also supports div and mod. Code
1809 generation is also supported, using list-style constructors.
1811 * Theory Library/Inner_Product defines a class of real_inner for real
1812 inner product spaces, with an overloaded operation inner :: 'a => 'a
1813 => real. Class real_inner is a subclass of real_normed_vector from
1816 * Theory Library/Product_Vector provides instances for the product
1817 type 'a * 'b of several classes from RealVector and Inner_Product.
1818 Definitions of addition, subtraction, scalar multiplication, norms,
1819 and inner products are included.
1821 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1822 addition to the field operations, numerals and case syntax are also
1825 * Theory Library/Diagonalize provides constructive version of Cantor's
1826 first diagonalization argument.
1828 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1829 zlcm (for int); carried together from various gcd/lcm developements in
1830 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1831 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1832 may recover tupled syntax as follows:
1834 hide (open) const gcd
1835 abbreviation gcd where
1836 "gcd == (%(a, b). GCD.gcd a b)"
1838 GCD.gcd ("gcd '(_, _')")
1840 The same works for lcm, zgcd, zlcm.
1842 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1843 instantiations for algebraic structures. Removed some duplicate
1844 theorems. Changes in simp rules. INCOMPATIBILITY.
1846 * ML antiquotation @{code} takes a constant as argument and generates
1847 corresponding code in background and inserts name of the corresponding
1848 resulting ML value/function/datatype constructor binding in place.
1849 All occurrences of @{code} with a single ML block are generated
1850 simultaneously. Provides a generic and safe interface for
1851 instrumentalizing code generation. See
1852 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1853 In future you ought to refrain from ad-hoc compiling generated SML
1854 code on the ML toplevel. Note that (for technical reasons) @{code}
1855 cannot refer to constants for which user-defined serializations are
1856 set. Refer to the corresponding ML counterpart directly in that
1859 * Command 'rep_datatype': instead of theorem names the command now
1860 takes a list of terms denoting the constructors of the type to be
1861 represented as datatype. The characteristic theorems have to be
1862 proven. INCOMPATIBILITY. Also observe that the following theorems
1863 have disappeared in favour of existing ones:
1865 unit_induct ~> unit.induct
1866 prod_induct ~> prod.induct
1867 sum_induct ~> sum.induct
1868 Suc_Suc_eq ~> nat.inject
1869 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1874 * New locales for orders and lattices where the equivalence relation
1875 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1876 locales use a record structure with field eq for the equivalence.
1878 * New theory of factorial domains.
1880 * Units_l_inv and Units_r_inv are now simp rules by default.
1881 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1882 and/or r_inv will now also require deletion of these lemmas.
1884 * Renamed the following theorems, INCOMPATIBILITY:
1886 UpperD ~> Upper_memD
1887 LowerD ~> Lower_memD
1888 least_carrier ~> least_closed
1889 greatest_carrier ~> greatest_closed
1890 greatest_Lower_above ~> greatest_Lower_below
1891 one_zero ~> carrier_one_zero
1892 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1897 * Nominal datatypes can now contain type-variables.
1899 * Commands 'nominal_inductive' and 'equivariance' work with local
1902 * Nominal primrec can now works with local theory targets and its
1903 specification syntax now conforms to the general format as seen in
1906 * Method "perm_simp" honours the standard simplifier attributes
1907 (no_asm), (no_asm_use) etc.
1909 * The new predicate #* is defined like freshness, except that on the
1910 left hand side can be a set or list of atoms.
1912 * Experimental command 'nominal_inductive2' derives strong induction
1913 principles for inductive definitions. In contrast to
1914 'nominal_inductive', which can only deal with a fixed number of
1915 binders, it can deal with arbitrary expressions standing for sets of
1916 atoms to be avoided. The only inductive definition we have at the
1917 moment that needs this generalisation is the typing rule for Lets in
1920 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1921 -----------------------------------------------------------------
1922 Gamma |- Let x be t1 in t2 : T2
1924 In this rule one wants to avoid all the binders that are introduced by
1925 "close Gamma T1". We are looking for other examples where this
1926 feature might be useful. Please let us know.
1931 * Reimplemented the simplification procedure for proving continuity
1932 subgoals. The new simproc is extensible; users can declare additional
1933 continuity introduction rules with the attribute [cont2cont].
1935 * The continuity simproc now uses a different introduction rule for
1936 solving continuity subgoals on terms with lambda abstractions. In
1937 some rare cases the new simproc may fail to solve subgoals that the
1938 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1939 Potential INCOMPATIBILITY.
1941 * Command 'fixrec': specification syntax now conforms to the general
1942 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1943 examples. INCOMPATIBILITY.
1948 * Proof of Zorn's Lemma for partial orders.
1953 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1954 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1955 depends on multithreading, so timouts will not work before Poly/ML
1958 * High-level support for concurrent ML programming, see
1959 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1960 particularly convenient to organize independent functional
1961 computations. The concept of "synchronized variables" provides a
1962 higher-order interface for components with shared state, avoiding the
1963 delicate details of mutexes and condition variables. (Requires
1964 Poly/ML 5.2.1 or later.)
1966 * ML bindings produced via Isar commands are stored within the Isar
1967 context (theory or proof). Consequently, commands like 'use' and 'ML'
1968 become thread-safe and work with undo as expected (concerning
1969 top-level bindings, not side-effects on global references).
1970 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1971 compiler at runtime; really global bindings need to be given outside a
1972 theory. (Requires Poly/ML 5.2 or later.)
1974 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1975 context. Top-level ML bindings are stored within the proof context in
1976 a purely sequential fashion, disregarding the nested proof structure.
1977 ML bindings introduced by 'ML_prf' are discarded at the end of the
1978 proof. (Requires Poly/ML 5.2 or later.)
1980 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1981 and Method.setup, as well as Isar commands 'attribute_setup' and
1982 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1983 existing code accordingly, or use plain 'setup' together with old
1986 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1987 to 'a -> thm, while results are always tagged with an authentic oracle
1988 name. The Isar command 'oracle' is now polymorphic, no argument type
1989 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1990 accordingly. Note that extra performance may be gained by producing
1991 the cterm carefully, avoiding slow Thm.cterm_of.
1993 * Simplified interface for defining document antiquotations via
1994 ThyOutput.antiquotation, ThyOutput.output, and optionally
1995 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1996 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1999 * More systematic treatment of long names, abstract name bindings, and
2000 name space operations. Basic operations on qualified names have been
2001 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
2002 Long_Name.append. Old type bstring has been mostly replaced by
2003 abstract type binding (see structure Binding), which supports precise
2004 qualification by packages and local theory targets, as well as proper
2005 tracking of source positions. INCOMPATIBILITY, need to wrap old
2006 bstring values into Binding.name, or better pass through abstract
2007 bindings everywhere. See further src/Pure/General/long_name.ML,
2008 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
2010 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
2011 LocalTheory.note etc.) now refer to the *full* internal name, not the
2012 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
2014 * Disposed old type and term read functions (Sign.read_def_typ,
2015 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
2016 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
2017 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
2018 Syntax.read_term_global etc.; see also OldGoals.read_term as last
2019 resort for legacy applications.
2021 * Disposed old declarations, tactics, tactic combinators that refer to
2022 the simpset or claset of an implicit theory (such as Addsimps,
2023 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
2024 embedded ML text, or local_simpset_of with a proper context passed as
2025 explicit runtime argument.
2027 * Rules and tactics that read instantiations (read_instantiate,
2028 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
2029 context, which is required for parsing and type-checking. Moreover,
2030 the variables are specified as plain indexnames, not string encodings
2031 thereof. INCOMPATIBILITY.
2033 * Generic Toplevel.add_hook interface allows to analyze the result of
2034 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
2035 for theorem dependency output of transactions resulting in a new
2038 * ML antiquotations: block-structured compilation context indicated by
2039 \<lbrace> ... \<rbrace>; additional antiquotation forms:
2041 @{binding name} - basic name binding
2042 @{let ?pat = term} - term abbreviation (HO matching)
2043 @{note name = fact} - fact abbreviation
2044 @{thm fact} - singleton fact (with attributes)
2045 @{thms fact} - general fact (with attributes)
2046 @{lemma prop by method} - singleton goal
2047 @{lemma prop by meth1 meth2} - singleton goal
2048 @{lemma prop1 ... propN by method} - general goal
2049 @{lemma prop1 ... propN by meth1 meth2} - general goal
2050 @{lemma (open) ...} - open derivation
2055 * The Isabelle "emacs" tool provides a specific interface to invoke
2056 Proof General / Emacs, with more explicit failure if that is not
2057 installed (the old isabelle-interface script silently falls back on
2058 isabelle-process). The PROOFGENERAL_HOME setting determines the
2059 installation location of the Proof General distribution.
2061 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
2062 the Isabelle process into a JVM/Scala application. See
2063 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
2064 process wrapper has been discontinued.)
2066 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
2068 * Various status messages (with exact source position information) are
2069 emitted, if proper markup print mode is enabled. This allows
2070 user-interface components to provide detailed feedback on internal
2075 New in Isabelle2008 (June 2008)
2076 -------------------------------
2080 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
2081 and updated, with formally checked references as hyperlinks.
2083 * Theory loader: use_thy (and similar operations) no longer set the
2084 implicit ML context, which was occasionally hard to predict and in
2085 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
2086 provides a proper context already.
2088 * Theory loader: old-style ML proof scripts being *attached* to a thy
2089 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
2090 'use' within a theory file will do the job.
2092 * Name space merge now observes canonical order, i.e. the second space
2093 is inserted into the first one, while existing entries in the first
2094 space take precedence. INCOMPATIBILITY in rare situations, may try to
2095 swap theory imports.
2097 * Syntax: symbol \<chi> is now considered a letter. Potential
2098 INCOMPATIBILITY in identifier syntax etc.
2100 * Outer syntax: string tokens no longer admit escaped white space,
2101 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2102 white space without escapes.
2104 * Outer syntax: string tokens may contain arbitrary character codes
2105 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2111 * Context-dependent token translations. Default setup reverts locally
2112 fixed variables, and adds hilite markup for undeclared frees.
2114 * Unused theorems can be found using the new command 'unused_thms'.
2115 There are three ways of invoking it:
2118 Only finds unused theorems in the current theory.
2120 (2) unused_thms thy_1 ... thy_n -
2121 Finds unused theorems in the current theory and all of its ancestors,
2122 excluding the theories thy_1 ... thy_n and all of their ancestors.
2124 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2125 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2126 their ancestors, excluding the theories thy_1 ... thy_n and all of
2129 In order to increase the readability of the list produced by
2130 unused_thms, theorems that have been created by a particular instance
2131 of a theory command such as 'inductive' or 'function' are considered
2132 to belong to the same "group", meaning that if at least one theorem in
2133 this group is used, the other theorems in the same group are no longer
2134 reported as unused. Moreover, if all theorems in the group are
2135 unused, only one theorem in the group is displayed.
2137 Note that proof objects have to be switched on in order for
2138 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2139 usually the case when using Proof General with the default settings).
2141 * Authentic naming of facts disallows ad-hoc overwriting of previous
2142 theorems within the same name space. INCOMPATIBILITY, need to remove
2143 duplicate fact bindings, or even accidental fact duplications. Note
2144 that tools may maintain dynamically scoped facts systematically, using
2145 PureThy.add_thms_dynamic.
2147 * Command 'hide' now allows to hide from "fact" name space as well.
2149 * Eliminated destructive theorem database, simpset, claset, and
2150 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2151 update of theories within ML code.
2153 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2154 INCOMPATIBILITY, object-logics depending on former Pure require
2155 additional setup PureThy.old_appl_syntax_setup; object-logics
2156 depending on former CPure need to refer to Pure.
2158 * Commands 'use' and 'ML' are now purely functional, operating on
2159 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2160 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2163 * Command 'setup': discontinued implicit version with ML reference.
2165 * Instantiation target allows for simultaneous specification of class
2166 instance operations together with an instantiation proof.
2167 Type-checking phase allows to refer to class operations uniformly.
2168 See src/HOL/Complex/Complex.thy for an Isar example and
2169 src/HOL/Library/Eval.thy for an ML example.
2171 * Indexing of literal facts: be more serious about including only
2172 facts from the visible specification/proof context, but not the
2173 background context (locale etc.). Affects `prop` notation and method
2174 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2177 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2178 "(open)" option, which used to expose internal bound variables to the
2181 * Isar statements: removed obsolete case "rule_context".
2182 INCOMPATIBILITY, better use explicit fixes/assumes.
2184 * Locale proofs: default proof step now includes 'unfold_locales';
2185 hence 'proof' without argument may be used to unfold locale
2189 *** Document preparation ***
2191 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2192 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2193 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2194 spot); renamed link color from "darkblue" to "linkcolor" (default
2195 value unchanged, can be redefined via \definecolor); no longer sets
2196 "a4paper" option (unnecessary or even intrusive).
2198 * Antiquotation @{lemma A method} proves proposition A by the given
2199 method (either a method name or a method name plus (optional) method
2200 arguments in parentheses) and prints A just like @{prop A}.
2205 * New primrec package. Specification syntax conforms in style to
2206 definition/function/.... No separate induction rule is provided. The
2207 "primrec" command distinguishes old-style and new-style specifications
2208 by syntax. The former primrec package is now named OldPrimrecPackage.
2209 When adjusting theories, beware: constants stemming from new-style
2210 primrec specifications have authentic syntax.
2212 * Metis prover is now an order of magnitude faster, and also works
2213 with multithreading.
2215 * Metis: the maximum number of clauses that can be produced from a
2216 theorem is now given by the attribute max_clauses. Theorems that
2217 exceed this number are ignored, with a warning printed.
2219 * Sledgehammer no longer produces structured proofs by default. To
2220 enable, declare [[sledgehammer_full = true]]. Attributes
2221 reconstruction_modulus, reconstruction_sorts renamed
2222 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2224 * Method "induct_scheme" derives user-specified induction rules
2225 from well-founded induction and completeness of patterns. This factors
2226 out some operations that are done internally by the function package
2227 and makes them available separately. See
2228 src/HOL/ex/Induction_Scheme.thy for examples.
2230 * More flexible generation of measure functions for termination
2231 proofs: Measure functions can be declared by proving a rule of the
2232 form "is_measure f" and giving it the [measure_function] attribute.
2233 The "is_measure" predicate is logically meaningless (always true), and
2234 just guides the heuristic. To find suitable measure functions, the
2235 termination prover sets up the goal "is_measure ?f" of the appropriate
2236 type and generates all solutions by prolog-style backwards proof using
2239 This setup also deals with rules like
2241 "is_measure f ==> is_measure (list_size f)"
2243 which accommodates nested datatypes that recurse through lists.
2244 Similar rules are predeclared for products and option types.
2246 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2250 - Definitions of overloaded constants on sets have to be replaced by
2251 definitions on => and bool.
2253 - Some definitions of overloaded operators on sets can now be proved
2254 using the definitions of the operators on => and bool. Therefore,
2255 the following theorems have been renamed:
2257 subset_def -> subset_eq
2258 psubset_def -> psubset_eq
2259 set_diff_def -> set_diff_eq
2260 Compl_def -> Compl_eq
2261 Sup_set_def -> Sup_set_eq
2262 Inf_set_def -> Inf_set_eq
2263 sup_set_def -> sup_set_eq
2264 inf_set_def -> inf_set_eq
2266 - Due to the incompleteness of the HO unification algorithm, some
2267 rules such as subst may require manual instantiation, if some of
2268 the unknowns in the rule is a set.
2270 - Higher order unification and forward proofs:
2273 have "P (S::'a set)" <...>
2274 then have "EX S. P S" ..
2276 no longer works (due to the incompleteness of the HO unification
2277 algorithm) and must be replaced by the pattern
2284 - Calculational reasoning with subst (or similar rules):
2287 have "P (S::'a set)" <...>
2288 also have "S = T" <...>
2289 finally have "P T" .
2291 no longer works (for similar reasons as the previous example) and
2292 must be replaced by something like
2294 have "P (S::'a set)" <...>
2295 moreover have "S = T" <...>
2296 ultimately have "P T" by simp
2298 - Tactics or packages written in ML code:
2299 Code performing pattern matching on types via
2301 Type ("set", [T]) => ...
2303 must be rewritten. Moreover, functions like strip_type or
2304 binder_types no longer return the right value when applied to a
2307 T1 => ... => Tn => U => bool
2311 T1 => ... => Tn => U set
2313 * Merged theories Wellfounded_Recursion, Accessible_Part and
2314 Wellfounded_Relations to theory Wellfounded.
2316 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2318 * Class finite no longer treats UNIV as class parameter. Use class
2319 enum from theory Library/Enum instead to achieve a similar effect.
2322 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2323 and "Cons". INCOMPATIBILITY.
2325 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2326 Potential INCOMPATIBILITY.
2328 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2329 injective_fst_snd removed, use split_eta and prod_eqI instead.
2330 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2332 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2333 the same name in theory Orderings:
2343 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2344 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2345 and different variable names.
2347 * Library/Option_ord.thy: Canonical order on option type.
2349 * Library/RBT.thy: Red-black trees, an efficient implementation of
2352 * Library/Countable.thy: Type class for countable types.
2354 * Theory Int: The representation of numerals has changed. The infix
2355 operator BIT and the bit datatype with constructors B0 and B1 have
2356 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2357 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2358 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2361 * Theory Nat: definition of <= and < on natural numbers no longer
2362 depend on well-founded relations. INCOMPATIBILITY. Definitions
2363 le_def and less_def have disappeared. Consider lemmas not_less
2364 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2366 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2367 (whose purpose mainly is for various fold_set functionals) have been
2368 abandoned in favor of the existing algebraic classes
2369 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2370 lower_semilattice (resp. upper_semilattice) and linorder.
2373 * Theory Transitive_Closure: induct and cases rules now declare proper
2374 case_names ("base" and "step"). INCOMPATIBILITY.
2376 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2377 lattices. The form set-specific version is available as
2378 Inductive.lfp_ordinal_induct_set.
2380 * Renamed theorems "power.simps" to "power_int.simps".
2383 * Class semiring_div provides basic abstract properties of semirings
2384 with division and modulo operations. Subsumes former class dvd_mod.
2386 * Merged theories IntDef, Numeral and IntArith into unified theory
2387 Int. INCOMPATIBILITY.
2389 * Theory Library/Code_Index: type "index" now represents natural
2390 numbers rather than integers. INCOMPATIBILITY.
2392 * New class "uminus" with operation "uminus" (split of from class
2393 "minus" which now only has operation "minus", binary).
2396 * Constants "card", "internal_split", "option_map" now with authentic
2397 syntax. INCOMPATIBILITY.
2399 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2400 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2401 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2402 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2403 Sup_set_def, le_def, less_def, option_map_def now with object
2404 equality. INCOMPATIBILITY.
2406 * Records. Removed K_record, and replaced it by pure lambda term
2407 %x. c. The simplifier setup is now more robust against eta expansion.
2408 INCOMPATIBILITY: in cases explicitly referring to K_record.
2410 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2412 * Library/ListVector: new theory of arithmetic vector operations.
2414 * Library/Order_Relation: new theory of various orderings as sets of
2415 pairs. Defines preorders, partial orders, linear orders and
2416 well-orders on sets and on types.
2421 * Renamed some theories to allow to loading both ZF and HOL in the
2424 Datatype -> Datatype_ZF
2425 Inductive -> Inductive_ZF
2432 INCOMPATIBILITY: ZF theories that import individual theories below
2433 Main might need to be adapted. Regular theory Main is still
2434 available, as trivial extension of Main_ZF.
2439 * ML within Isar: antiquotation @{const name} or @{const
2440 name(typargs)} produces statically-checked Const term.
2442 * Functor NamedThmsFun: data is available to the user as dynamic fact
2443 (of the same name). Removed obsolete print command.
2445 * Removed obsolete "use_legacy_bindings" function.
2447 * The ``print mode'' is now a thread-local value derived from a global
2448 template (the former print_mode reference), thus access becomes
2449 non-critical. The global print_mode reference is for session
2450 management only; user-code should use print_mode_value,
2451 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2453 * Functions system/system_out provide a robust way to invoke external
2454 shell commands, with propagation of interrupts (requires Poly/ML
2455 5.2.1). Do not use OS.Process.system etc. from the basis library!
2460 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2461 in accordance with Proof General 3.7, which prefers GNU emacs.
2463 * isatool tty runs Isabelle process with plain tty interaction;
2464 optional line editor may be specified via ISABELLE_LINE_EDITOR
2465 setting, the default settings attempt to locate "ledit" and "rlwrap".
2467 * isatool browser now works with Cygwin as well, using general
2468 "javapath" function defined in Isabelle process environment.
2470 * YXML notation provides a simple and efficient alternative to
2471 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2472 isatool yxml as described in the Isabelle system manual.
2474 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2475 provides general wrapper for managing an Isabelle process in a robust
2476 fashion, with ``cooked'' output from stdin/stderr.
2478 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2479 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2481 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2482 way of changing the user's settings is via
2483 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2486 * Multithreading.max_threads := 0 refers to the number of actual CPU
2487 cores of the underlying machine, which is a good starting point for
2488 optimal performance tuning. The corresponding usedir option -M allows
2489 "max" as an alias for "0". WARNING: does not work on certain versions
2490 of Mac OS (with Poly/ML 5.1).
2492 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2493 adverse effect of Isabelle flooding interactive front-ends (notably
2494 ProofGeneral / XEmacs).
2498 New in Isabelle2007 (November 2007)
2499 -----------------------------------
2503 * More uniform information about legacy features, notably a
2504 warning/error of "Legacy feature: ...", depending on the state of the
2505 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2506 legacy features will disappear eventually.
2508 * Theory syntax: the header format ``theory A = B + C:'' has been
2509 discontinued in favour of ``theory A imports B C begin''. Use isatool
2510 fixheaders to convert existing theory files. INCOMPATIBILITY.
2512 * Theory syntax: the old non-Isar theory file format has been
2513 discontinued altogether. Note that ML proof scripts may still be used
2514 with Isar theories; migration is usually quite simple with the ML
2515 function use_legacy_bindings. INCOMPATIBILITY.
2517 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2518 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2521 * Theory loader: be more serious about observing the static theory
2522 header specifications (including optional directories), but not the
2523 accidental file locations of previously successful loads. The strict
2524 update policy of former update_thy is now already performed by
2525 use_thy, so the former has been removed; use_thys updates several
2526 theories simultaneously, just as 'imports' within a theory header
2527 specification, but without merging the results. Potential
2528 INCOMPATIBILITY: may need to refine theory headers and commands
2529 ROOT.ML which depend on load order.
2531 * Theory loader: optional support for content-based file
2532 identification, instead of the traditional scheme of full physical
2533 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2534 (cf. the system manual). The new scheme allows to work with
2535 non-finished theories in persistent session images, such that source
2536 files may be moved later on without requiring reloads.
2538 * Theory loader: old-style ML proof scripts being *attached* to a thy
2539 file (with the same base name as the theory) are considered a legacy
2540 feature, which will disappear eventually. Even now, the theory loader
2541 no longer maintains dependencies on such files.
2543 * Syntax: the scope for resolving ambiguities via type-inference is
2544 now limited to individual terms, instead of whole simultaneous
2545 specifications as before. This greatly reduces the complexity of the
2546 syntax module and improves flexibility by separating parsing and
2547 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2548 'fixes' etc.) are required in rare situations.
2550 * Syntax: constants introduced by new-style packages ('definition',
2551 'abbreviation' etc.) are passed through the syntax module in
2552 ``authentic mode''. This means that associated mixfix annotations
2553 really stick to such constants, independently of potential name space
2554 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2555 trees are represented slightly differently, may need to adapt syntax
2556 translations accordingly. Use CONST marker in 'translations' and
2557 @{const_syntax} antiquotation in 'parse_translation' etc.
2559 * Legacy goal package: reduced interface to the bare minimum required
2560 to keep existing proof scripts running. Most other user-level
2561 functions are now part of the OldGoals structure, which is *not* open
2562 by default (consider isatool expandshort before open OldGoals).
2563 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2564 these tend to cause confusion about the actual goal (!) context being
2565 used here, which is not necessarily the same as the_context().
2567 * Command 'find_theorems': supports "*" wild-card in "name:"
2568 criterion; "with_dups" option. Certain ProofGeneral versions might
2569 support a specific search form (see ProofGeneral/CHANGES).
2571 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2572 by default, which means that "prems" (and also "fixed variables") are
2573 suppressed from proof state output. Note that the ProofGeneral
2574 settings mechanism allows to change and save options persistently, but
2575 older versions of Isabelle will fail to start up if a negative prems
2578 * Local theory targets may be specified by non-nested blocks of
2579 ``context/locale/class ... begin'' followed by ``end''. The body may
2580 contain definitions, theorems etc., including any derived mechanism
2581 that has been implemented on top of these primitives. This concept
2582 generalizes the existing ``theorem (in ...)'' towards more versatility
2585 * Proof General interface: proper undo of final 'end' command;
2586 discontinued Isabelle/classic mode (ML proof scripts).
2589 *** Document preparation ***
2591 * Added antiquotation @{theory name} which prints the given name,
2592 after checking that it refers to a valid ancestor theory in the
2595 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2596 check the given source text as ML type/structure, printing verbatim.
2598 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2599 "c args == rhs" given in the current context. (Any number of
2600 arguments may be given on the LHS.)
2605 * The 'class' package offers a combination of axclass and locale to
2606 achieve Haskell-like type classes in Isabelle. Definitions and
2607 theorems within a class context produce both relative results (with
2608 implicit parameters according to the locale context), and polymorphic
2609 constants with qualified polymorphism (according to the class
2610 context). Within the body context of a 'class' target, a separate
2611 syntax layer ("user space type system") takes care of converting
2612 between global polymorphic consts and internal locale representation.
2613 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2614 "isatool doc classes" provides a tutorial.
2616 * Generic code generator framework allows to generate executable
2617 code for ML and Haskell (including Isabelle classes). A short usage
2620 internal compilation:
2621 export_code <list of constants (term syntax)> in SML
2622 writing SML code to a file:
2623 export_code <list of constants (term syntax)> in SML <filename>
2624 writing OCaml code to a file:
2625 export_code <list of constants (term syntax)> in OCaml <filename>
2626 writing Haskell code to a bunch of files:
2627 export_code <list of constants (term syntax)> in Haskell <filename>
2629 evaluating closed propositions to True/False using code generation:
2632 Reasonable default setup of framework in HOL.
2634 Theorem attributs for selecting and transforming function equations theorems:
2636 [code fun]: select a theorem as function equation for a specific constant
2637 [code fun del]: deselect a theorem as function equation for a specific constant
2638 [code inline]: select an equation theorem for unfolding (inlining) in place
2639 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2641 User-defined serializations (target in {SML, OCaml, Haskell}):
2643 code_const <and-list of constants (term syntax)>
2644 {(target) <and-list of const target syntax>}+
2646 code_type <and-list of type constructors>
2647 {(target) <and-list of type target syntax>}+
2649 code_instance <and-list of instances>
2651 where instance ::= <type constructor> :: <class>
2653 code_class <and_list of classes>
2654 {(target) <and-list of class target syntax>}+
2655 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2657 code_instance and code_class only are effective to target Haskell.
2659 For example usage see src/HOL/ex/Codegenerator.thy and
2660 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2661 generation from Isabelle/HOL theories is available via "isatool doc
2664 * Code generator: consts in 'consts_code' Isar commands are now
2665 referred to by usual term syntax (including optional type
2668 * Command 'no_translations' removes translation rules from theory
2671 * Overloaded definitions are now actually checked for acyclic
2672 dependencies. The overloading scheme is slightly more general than
2673 that of Haskell98, although Isabelle does not demand an exact
2674 correspondence to type class and instance declarations.
2675 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2676 exotic versions of overloading -- at the discretion of the user!
2678 Polymorphic constants are represented via type arguments, i.e. the
2679 instantiation that matches an instance against the most general
2680 declaration given in the signature. For example, with the declaration
2681 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2682 as c(nat). Overloading is essentially simultaneous structural
2683 recursion over such type arguments. Incomplete specification patterns
2684 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2685 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2686 Command 'print_theory' outputs the normalized system of recursive
2687 equations, see section "definitions".
2689 * Configuration options are maintained within the theory or proof
2690 context (with name and type bool/int/string), providing a very simple
2691 interface to a poor-man's version of general context data. Tools may
2692 declare options in ML (e.g. using Attrib.config_int) and then refer to
2693 these values using Config.get etc. Users may change options via an
2694 associated attribute of the same name. This form of context
2695 declaration works particularly well with commands 'declare' or
2696 'using', for example ``declare [[foo = 42]]''. Thus it has become
2697 very easy to avoid global references, which would not observe Isar
2698 toplevel undo/redo and fail to work with multithreading.
2700 Various global ML references of Pure and HOL have been turned into
2701 configuration options:
2703 Unify.search_bound unify_search_bound
2704 Unify.trace_bound unify_trace_bound
2705 Unify.trace_simp unify_trace_simp
2706 Unify.trace_types unify_trace_types
2707 Simplifier.simp_depth_limit simp_depth_limit
2708 Blast.depth_limit blast_depth_limit
2709 DatatypeProp.dtK datatype_distinctness_limit
2710 fast_arith_neq_limit fast_arith_neq_limit
2711 fast_arith_split_limit fast_arith_split_limit
2713 * Named collections of theorems may be easily installed as context
2714 data using the functor NamedThmsFun (see also
2715 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2716 attributes; there is also a toplevel print command. This facility is
2717 just a common case of general context data, which is the preferred way
2718 for anything more complex than just a list of facts in canonical
2721 * Isar: command 'declaration' augments a local theory by generic
2722 declaration functions written in ML. This enables arbitrary content
2723 being added to the context, depending on a morphism that tells the
2724 difference of the original declaration context wrt. the application
2725 context encountered later on.
2727 * Isar: proper interfaces for simplification procedures. Command
2728 'simproc_setup' declares named simprocs (with match patterns, and body
2729 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2730 context. ML antiquotation @{simproc name} retrieves named simprocs.
2732 * Isar: an extra pair of brackets around attribute declarations
2733 abbreviates a theorem reference involving an internal dummy fact,
2734 which will be ignored later --- only the effect of the attribute on
2735 the background context will persist. This form of in-place
2736 declarations is particularly useful with commands like 'declare' and
2737 'using', for example ``have A using [[simproc a]] by simp''.
2739 * Isar: method "assumption" (and implicit closing of subproofs) now
2740 takes simple non-atomic goal assumptions into account: after applying
2741 an assumption as a rule the resulting subgoals are solved by atomic
2742 assumption steps. This is particularly useful to finish 'obtain'
2743 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2744 without referring to the original premise "!!x. P x ==> thesis" in the
2745 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2748 * Isar: implicit use of prems from the Isar proof context is
2749 considered a legacy feature. Common applications like ``have A .''
2750 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2751 referencing facts explicitly here improves readability and
2752 maintainability of proof texts.
2754 * Isar: improper proof element 'guess' is like 'obtain', but derives
2755 the obtained context from the course of reasoning! For example:
2757 assume "EX x y. A x & B y" -- "any previous fact"
2758 then guess x and y by clarify
2760 This technique is potentially adventurous, depending on the facts and
2761 proof tools being involved here.
2763 * Isar: known facts from the proof context may be specified as literal
2764 propositions, using ASCII back-quote syntax. This works wherever
2765 named facts used to be allowed so far, in proof commands, proof
2766 methods, attributes etc. Literal facts are retrieved from the context
2767 according to unification of type and term parameters. For example,
2768 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2769 theorems in the current context, then these are valid literal facts:
2770 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2772 There is also a proof method "fact" which does the same composition
2773 for explicit goal states, e.g. the following proof texts coincide with
2774 certain special cases of literal facts:
2776 have "A" by fact == note `A`
2777 have "A ==> B" by fact == note `A ==> B`
2778 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2779 have "P a ==> Q a" by fact == note `P a ==> Q a`
2781 * Isar: ":" (colon) is no longer a symbolic identifier character in
2782 outer syntax. Thus symbolic identifiers may be used without
2783 additional white space in declarations like this: ``assume *: A''.
2785 * Isar: 'print_facts' prints all local facts of the current context,
2786 both named and unnamed ones.
2788 * Isar: 'def' now admits simultaneous definitions, e.g.:
2790 def x == "t" and y == "u"
2792 * Isar: added command 'unfolding', which is structurally similar to
2793 'using', but affects both the goal state and facts by unfolding given
2794 rewrite rules. Thus many occurrences of the 'unfold' method or
2795 'unfolded' attribute may be replaced by first-class proof text.
2797 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2798 and command 'unfolding' now all support object-level equalities
2799 (potentially conditional). The underlying notion of rewrite rule is
2800 analogous to the 'rule_format' attribute, but *not* that of the
2801 Simplifier (which is usually more generous).
2803 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2804 premises of a theorem by n. Useful in conjunction with drule.
2806 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2807 method expression within a sandbox consisting of the first N
2808 sub-goals, which need to exist. For example, ``simp_all [3]''
2809 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2810 simplifies all new goals that emerge from applying rule foo to the
2811 originally first one.
2813 * Isar: schematic goals are no longer restricted to higher-order
2814 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2817 * Isar: the conclusion of a long theorem statement is now either
2818 'shows' (a simultaneous conjunction, as before), or 'obtains'
2819 (essentially a disjunction of cases with local parameters and
2820 assumptions). The latter allows to express general elimination rules
2821 adequately; in this notation common elimination rules look like this:
2823 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2825 obtains x where "P x"
2827 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2831 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2837 The subsequent classical rules even refer to the formal "thesis"
2840 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2843 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2844 obtains "thesis ==> something"
2846 The actual proof of an 'obtains' statement is analogous to that of the
2847 Isar proof element 'obtain', only that there may be several cases.
2848 Optional case names may be specified in parentheses; these will be
2849 available both in the present proof and as annotations in the
2850 resulting rule, for later use with the 'cases' method (cf. attribute
2853 * Isar: the assumptions of a long theorem statement are available as
2854 "assms" fact in the proof context. This is more appropriate than the
2855 (historical) "prems", which refers to all assumptions of the current
2856 context, including those from the target locale, proof body etc.
2858 * Isar: 'print_statement' prints theorems from the current theory or
2859 proof context in long statement form, according to the syntax of a
2862 * Isar: 'obtain' takes an optional case name for the local context
2863 introduction rule (default "that").
2865 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2866 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2869 * Pure: syntax "CONST name" produces a fully internalized constant
2870 according to the current context. This is particularly useful for
2871 syntax translations that should refer to internal constant
2872 representations independently of name spaces.
2874 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2875 instead of "FOO ". This allows multiple binder declarations to coexist
2876 in the same context. INCOMPATIBILITY.
2878 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2879 primitive that also works in a locale context (both for constants and
2880 fixed variables). Type declaration and internal syntactic representation
2881 of given constants retrieved from the context. Likewise, the
2882 'no_notation' command allows to remove given syntax annotations from the
2885 * Isar/locales: new derived specification elements 'axiomatization',
2886 'definition', 'abbreviation', which support type-inference, admit
2887 object-level specifications (equality, equivalence). See also the
2888 isar-ref manual. Examples:
2891 eq (infix "===" 50) where
2892 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2894 definition "f x y = x + y + 1"
2895 definition g where "g x = f x x"
2898 neq (infix "=!=" 50) where
2899 "x =!= y == ~ (x === y)"
2901 These specifications may be also used in a locale context. Then the
2902 constants being introduced depend on certain fixed parameters, and the
2903 constant name is qualified by the locale base name. An internal
2904 abbreviation takes care for convenient input and output, making the
2905 parameters implicit and using the original short name. See also
2906 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2907 entities from a monomorphic theory.
2909 Presently, abbreviations are only available 'in' a target locale, but
2910 not inherited by general import expressions. Also note that
2911 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2912 'translations' in common applications. The "no_abbrevs" print mode
2913 prevents folding of abbreviations in term output.
2915 Concrete syntax is attached to specified constants in internal form,
2916 independently of name spaces. The parse tree representation is
2917 slightly different -- use 'notation' instead of raw 'syntax', and
2918 'translations' with explicit "CONST" markup to accommodate this.
2920 * Pure/Isar: unified syntax for new-style specification mechanisms
2921 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2922 full type inference and dummy patterns ("_"). For example:
2924 definition "K x _ = x"
2926 inductive conj for A B
2927 where "A ==> B ==> conj A B"
2929 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2930 the current context. Print mode "no_abbrevs" prevents inversion of
2931 abbreviations on output.
2933 * Isar/locales: improved parameter handling: use of locales "var" and
2934 "struct" no longer necessary; - parameter renamings are no longer
2935 required to be injective. For example, this allows to define
2936 endomorphisms as locale endom = homom mult mult h.
2938 * Isar/locales: changed the way locales with predicates are defined.
2939 Instead of accumulating the specification, the imported expression is
2940 now an interpretation. INCOMPATIBILITY: different normal form of
2941 locale expressions. In particular, in interpretations of locales with
2942 predicates, goals repesenting already interpreted fragments are not
2943 removed automatically. Use methods `intro_locales' and
2944 `unfold_locales'; see below.
2946 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2947 provide backward reasoning on locales predicates. The methods are
2948 aware of interpretations and discharge corresponding goals.
2949 `intro_locales' is less aggressive then `unfold_locales' and does not
2950 unfold predicates to assumptions.
2952 * Isar/locales: the order in which locale fragments are accumulated
2953 has changed. This enables to override declarations from fragments due
2954 to interpretations -- for example, unwanted simp rules.
2956 * Isar/locales: interpretation in theories and proof contexts has been
2957 extended. One may now specify (and prove) equations, which are
2958 unfolded in interpreted theorems. This is useful for replacing
2959 defined concepts (constants depending on locale parameters) by
2960 concepts already existing in the target context. Example:
2962 interpretation partial_order ["op <= :: [int, int] => bool"]
2963 where "partial_order.less (op <=) (x::int) y = (x < y)"
2965 Typically, the constant `partial_order.less' is created by a
2966 definition specification element in the context of locale
2969 * Method "induct": improved internal context management to support
2970 local fixes and defines on-the-fly. Thus explicit meta-level
2971 connectives !! and ==> are rarely required anymore in inductive goals
2972 (using object-logic connectives for this purpose has been long
2973 obsolete anyway). Common proof patterns are explained in
2974 src/HOL/Induct/Common_Patterns.thy, see also
2975 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2978 * Method "induct": improved handling of simultaneous goals. Instead of
2979 introducing object-level conjunction, the statement is now split into
2980 several conclusions, while the corresponding symbolic cases are nested
2981 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2982 see src/HOL/Induct/Common_Patterns.thy, for example.
2984 * Method "induct": mutual induction rules are now specified as a list
2985 of rule sharing the same induction cases. HOL packages usually provide
2986 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2987 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2988 mutual induction rules differently, i.e. like this:
2990 (induct rule: foo_bar.inducts)
2991 (induct set: foo bar)
2992 (induct pred: foo bar)
2993 (induct type: foo bar)
2995 The ML function ProjectRule.projections turns old-style rules into the
2998 * Method "coinduct": dual of induction, see
2999 src/HOL/Library/Coinductive_List.thy for various examples.
3001 * Method "cases", "induct", "coinduct": the ``(open)'' option is
3002 considered a legacy feature.
3004 * Attribute "symmetric" produces result with standardized schematic
3005 variables (index 0). Potential INCOMPATIBILITY.
3007 * Simplifier: by default the simplifier trace only shows top level
3008 rewrites now. That is, trace_simp_depth_limit is set to 1 by
3009 default. Thus there is less danger of being flooded by the trace. The
3010 trace indicates where parts have been suppressed.
3012 * Provers/classical: removed obsolete classical version of elim_format
3013 attribute; classical elim/dest rules are now treated uniformly when
3014 manipulating the claset.
3016 * Provers/classical: stricter checks to ensure that supplied intro,
3017 dest and elim rules are well-formed; dest and elim rules must have at
3020 * Provers/classical: attributes dest/elim/intro take an optional
3021 weight argument for the rule (just as the Pure versions). Weights are
3022 ignored by automated tools, but determine the search order of single
3025 * Syntax: input syntax now supports dummy variable binding "%_. b",
3026 where the body does not mention the bound variable. Note that dummy
3027 patterns implicitly depend on their context of bounds, which makes
3028 "{_. _}" match any set comprehension as expected. Potential
3029 INCOMPATIBILITY -- parse translations need to cope with syntactic
3030 constant "_idtdummy" in the binding position.
3032 * Syntax: removed obsolete syntactic constant "_K" and its associated
3033 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
3034 for example "A -> B" => "Pi A (%_. B)".
3036 * Pure: 'class_deps' command visualizes the subclass relation, using
3037 the graph browser tool.
3039 * Pure: 'print_theory' now suppresses certain internal declarations by
3040 default; use '!' option for full details.
3045 * Method "metis" proves goals by applying the Metis general-purpose
3046 resolution prover (see also http://gilith.com/software/metis/).
3047 Examples are in the directory MetisExamples. WARNING: the
3048 Isabelle/HOL-Metis integration does not yet work properly with
3051 * Command 'sledgehammer' invokes external automatic theorem provers as
3052 background processes. It generates calls to the "metis" method if
3053 successful. These can be pasted into the proof. Users do not have to
3054 wait for the automatic provers to return. WARNING: does not really
3055 work with multi-threading.
3057 * New "auto_quickcheck" feature tests outermost goal statements for
3058 potential counter-examples. Controlled by ML references
3059 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
3060 5000 milliseconds). Fails silently if statements is outside of
3061 executable fragment, or any other codgenerator problem occurs.
3063 * New constant "undefined" with axiom "undefined x = undefined".
3065 * Added class "HOL.eq", allowing for code generation with polymorphic
3068 * Some renaming of class constants due to canonical name prefixing in
3069 the new 'class' package:
3071 HOL.abs ~> HOL.abs_class.abs
3072 HOL.divide ~> HOL.divide_class.divide
3073 0 ~> HOL.zero_class.zero
3074 1 ~> HOL.one_class.one
3075 op + ~> HOL.plus_class.plus
3076 op - ~> HOL.minus_class.minus
3077 uminus ~> HOL.minus_class.uminus
3078 op * ~> HOL.times_class.times
3079 op < ~> HOL.ord_class.less
3080 op <= > HOL.ord_class.less_eq
3081 Nat.power ~> Power.power_class.power
3082 Nat.size ~> Nat.size_class.size
3083 Numeral.number_of ~> Numeral.number_class.number_of
3084 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
3085 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
3086 Orderings.min ~> Orderings.ord_class.min
3087 Orderings.max ~> Orderings.ord_class.max
3088 Divides.op div ~> Divides.div_class.div
3089 Divides.op mod ~> Divides.div_class.mod
3090 Divides.op dvd ~> Divides.div_class.dvd
3092 INCOMPATIBILITY. Adaptions may be required in the following cases:
3094 a) User-defined constants using any of the names "plus", "minus",
3095 "times", "less" or "less_eq". The standard syntax translations for
3096 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
3099 b) Variables named "plus", "minus", "times", "less", "less_eq"
3100 INCOMPATIBILITY: use more specific names.
3102 c) Permutative equations (e.g. "a + b = b + a")
3103 Since the change of names also changes the order of terms, permutative
3104 rewrite rules may get applied in a different order. Experience shows
3105 that this is rarely the case (only two adaptions in the whole Isabelle
3106 distribution). INCOMPATIBILITY: rewrite proofs
3108 d) ML code directly refering to constant names
3109 This in general only affects hand-written proof tactics, simprocs and
3110 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3111 Consider using @{const_name} antiquotation.
3113 * New class "default" with associated constant "default".
3115 * Function "sgn" is now overloaded and available on int, real, complex
3116 (and other numeric types), using class "sgn". Two possible defs of
3117 sgn are given as equational assumptions in the classes sgn_if and
3118 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3121 * Locale "partial_order" now unified with class "order" (cf. theory
3122 Orderings), added parameter "less". INCOMPATIBILITY.
3124 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3125 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3126 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3128 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3129 changed order of proof goals in instance proofs.
3131 * The transitivity reasoner for partial and linear orders is set up
3132 for classes "order" and "linorder". Instances of the reasoner are available
3133 in all contexts importing or interpreting the corresponding locales.
3134 Method "order" invokes the reasoner separately; the reasoner
3135 is also integrated with the Simplifier as a solver. Diagnostic
3136 command 'print_orders' shows the available instances of the reasoner
3137 in the current context.
3139 * Localized monotonicity predicate in theory "Orderings"; integrated
3140 lemmas max_of_mono and min_of_mono with this predicate.
3143 * Formulation of theorem "dense" changed slightly due to integration
3144 with new class dense_linear_order.
3146 * Uniform lattice theory development in HOL.
3148 constants "meet" and "join" now named "inf" and "sup"
3149 constant "Meet" now named "Inf"
3151 classes "meet_semilorder" and "join_semilorder" now named
3152 "lower_semilattice" and "upper_semilattice"
3153 class "lorder" now named "lattice"
3154 class "comp_lat" now named "complete_lattice"
3156 Instantiation of lattice classes allows explicit definitions
3157 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3159 INCOMPATIBILITY. Theorem renames:
3161 meet_left_le ~> inf_le1
3162 meet_right_le ~> inf_le2
3163 join_left_le ~> sup_ge1
3164 join_right_le ~> sup_ge2
3165 meet_join_le ~> inf_sup_ord
3168 le_meet ~> le_inf_iff
3169 le_join ~> ge_sup_conv
3170 meet_idempotent ~> inf_idem
3171 join_idempotent ~> sup_idem
3172 meet_comm ~> inf_commute
3173 join_comm ~> sup_commute
3174 meet_leI1 ~> le_infI1
3175 meet_leI2 ~> le_infI2
3176 le_joinI1 ~> le_supI1
3177 le_joinI2 ~> le_supI2
3178 meet_assoc ~> inf_assoc
3179 join_assoc ~> sup_assoc
3180 meet_left_comm ~> inf_left_commute
3181 meet_left_idempotent ~> inf_left_idem
3182 join_left_comm ~> sup_left_commute
3183 join_left_idempotent ~> sup_left_idem
3186 le_def_meet ~> le_iff_inf
3187 le_def_join ~> le_iff_sup
3188 join_absorp2 ~> sup_absorb2
3189 join_absorp1 ~> sup_absorb1
3190 meet_absorp1 ~> inf_absorb1
3191 meet_absorp2 ~> inf_absorb2
3192 meet_join_absorp ~> inf_sup_absorb
3193 join_meet_absorp ~> sup_inf_absorb
3194 distrib_join_le ~> distrib_sup_le
3195 distrib_meet_le ~> distrib_inf_le
3197 add_meet_distrib_left ~> add_inf_distrib_left
3198 add_join_distrib_left ~> add_sup_distrib_left
3199 is_join_neg_meet ~> is_join_neg_inf
3200 is_meet_neg_join ~> is_meet_neg_sup
3201 add_meet_distrib_right ~> add_inf_distrib_right
3202 add_join_distrib_right ~> add_sup_distrib_right
3203 add_meet_join_distribs ~> add_sup_inf_distribs
3204 join_eq_neg_meet ~> sup_eq_neg_inf
3205 meet_eq_neg_join ~> inf_eq_neg_sup
3206 add_eq_meet_join ~> add_eq_inf_sup
3207 meet_0_imp_0 ~> inf_0_imp_0
3208 join_0_imp_0 ~> sup_0_imp_0
3209 meet_0_eq_0 ~> inf_0_eq_0
3210 join_0_eq_0 ~> sup_0_eq_0
3211 neg_meet_eq_join ~> neg_inf_eq_sup
3212 neg_join_eq_meet ~> neg_sup_eq_inf
3213 join_eq_if ~> sup_eq_if
3215 mono_meet ~> mono_inf
3216 mono_join ~> mono_sup
3217 meet_bool_eq ~> inf_bool_eq
3218 join_bool_eq ~> sup_bool_eq
3219 meet_fun_eq ~> inf_fun_eq
3220 join_fun_eq ~> sup_fun_eq
3221 meet_set_eq ~> inf_set_eq
3222 join_set_eq ~> sup_set_eq
3223 meet1_iff ~> inf1_iff
3224 meet2_iff ~> inf2_iff
3233 join1_iff ~> sup1_iff
3234 join2_iff ~> sup2_iff
3244 is_meet_Meet ~> is_meet_Inf
3245 Meet_bool_def ~> Inf_bool_def
3246 Meet_fun_def ~> Inf_fun_def
3247 Meet_greatest ~> Inf_greatest
3248 Meet_lower ~> Inf_lower
3249 Meet_set_def ~> Inf_set_def
3252 Sup_bool_eq ~> Sup_bool_def
3253 Sup_fun_eq ~> Sup_fun_def
3254 Sup_set_eq ~> Sup_set_def
3256 listsp_meetI ~> listsp_infI
3257 listsp_meet_eq ~> listsp_inf_eq
3262 * Added syntactic class "size"; overloaded constant "size" now has
3263 type "'a::size ==> bool"
3265 * Internal reorganisation of `size' of datatypes: size theorems
3266 "foo.size" are no longer subsumed by "foo.simps" (but are still
3267 simplification rules by default!); theorems "prod.size" now named
3270 * Class "div" now inherits from class "times" rather than "type".
3273 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3274 Linorder etc. have disappeared; operations defined in terms of
3275 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3277 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3279 * HOL-Word: New extensive library and type for generic, fixed size
3280 machine words, with arithemtic, bit-wise, shifting and rotating
3281 operations, reflection into int, nat, and bool lists, automation for
3282 linear arithmetic (by automatic reflection into nat or int), including
3283 lemmas on overflow and monotonicity. Instantiated to all appropriate
3284 arithmetic type classes, supporting automatic simplification of
3285 numerals on all operations.
3287 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3289 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3291 * Code generator library theories:
3292 - Code_Integer represents HOL integers by big integer literals in target
3294 - Code_Char represents HOL characters by character literals in target
3296 - Code_Char_chr like Code_Char, but also offers treatment of character
3297 codes; includes Code_Integer.
3298 - Executable_Set allows to generate code for finite sets using lists.
3299 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3301 - Executable_Real implements a subset of real numbers, namly those
3302 representable by rational numbers.
3303 - Efficient_Nat implements natural numbers by integers, which in general will
3304 result in higher efficency; pattern matching with 0/Suc is eliminated;
3305 includes Code_Integer.
3306 - Code_Index provides an additional datatype index which is mapped to
3307 target-language built-in integers.
3308 - Code_Message provides an additional datatype message_string which is isomorphic to
3309 strings; messages are mapped to target-language strings.
3311 * New package for inductive predicates
3313 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3316 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3317 for z_1 :: U_1 and ... and z_n :: U_m
3319 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3322 with full support for type-inference, rather than
3324 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3326 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3327 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3329 inductive "s z_1 ... z_m"
3331 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3334 For backward compatibility, there is a wrapper allowing inductive
3335 sets to be defined with the new package via
3338 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3339 for z_1 :: U_1 and ... and z_n :: U_m
3341 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3347 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3348 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3349 for z_1 :: U_1 and ... and z_n :: U_m
3351 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3352 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3355 if the additional syntax "p ..." is required.
3357 Numerous examples can be found in the subdirectories src/HOL/Auth,
3358 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3362 - Since declaration and definition of inductive sets or predicates
3363 is no longer separated, abbreviations involving the newly
3364 introduced sets or predicates must be specified together with the
3365 introduction rules after the 'where' keyword (see above), rather
3366 than before the actual inductive definition.
3368 - The variables in induction and elimination rules are now
3369 quantified in the order of their occurrence in the introduction
3370 rules, rather than in alphabetical order. Since this may break
3371 some proofs, these proofs either have to be repaired, e.g. by
3372 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3373 statements of the form
3375 case (rule_i a_i_1 ... a_i_{k_i})
3377 or the old order of quantification has to be restored by explicitly adding
3378 meta-level quantifiers in the introduction rules, i.e.
3380 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3382 - The format of the elimination rules is now
3384 p z_1 ... z_m x_1 ... x_n ==>
3385 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3390 (x_1, ..., x_n) : s z_1 ... z_m ==>
3391 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3394 for sets rather than
3396 x : s z_1 ... z_m ==>
3397 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3400 This may require terms in goals to be expanded to n-tuples
3401 (e.g. using case_tac or simplification with the split_paired_all
3402 rule) before the above elimination rule is applicable.
3404 - The elimination or case analysis rules for (mutually) inductive
3405 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3406 list of rules "p_1_..._p_k.elims" is no longer available.
3408 * New package "function"/"fun" for general recursive functions,
3409 supporting mutual and nested recursion, definitions in local contexts,
3410 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3411 for small examples, and the separate tutorial on the function
3412 package. The old recdef "package" is still available as before, but
3413 users are encouraged to use the new package.
3415 * Method "lexicographic_order" automatically synthesizes termination
3416 relations as lexicographic combinations of size measures.
3418 * Case-expressions allow arbitrary constructor-patterns (including
3419 "_") and take their order into account, like in functional
3420 programming. Internally, this is translated into nested
3421 case-expressions; missing cases are added and mapped to the predefined
3422 constant "undefined". In complicated cases printing may no longer show
3423 the original input but the internal form. Lambda-abstractions allow
3424 the same form of pattern matching: "% pat1 => e1 | ..." is an
3425 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3428 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3429 is an abbreviation for "of_nat :: nat => int". The simplification
3430 rules for "of_nat" have been changed to work like "int" did
3431 previously. Potential INCOMPATIBILITY:
3432 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3433 - of_nat_diff and of_nat_mult are no longer default simp rules
3435 * Method "algebra" solves polynomial equations over (semi)rings using
3436 Groebner bases. The (semi)ring structure is defined by locales and the
3437 tool setup depends on that generic context. Installing the method for
3438 a specific type involves instantiating the locale and possibly adding
3439 declarations for computation on the coefficients. The method is
3440 already instantiated for natural numbers and for the axiomatic class
3441 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3442 CALCULEMUS 2007 for the general principles underlying this
3443 architecture of context-aware proof-tools.
3445 * Method "ferrack" implements quantifier elimination over
3446 special-purpose dense linear orders using locales (analogous to
3447 "algebra"). The method is already installed for class
3448 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3451 * Former constant "List.op @" now named "List.append". Use ML
3452 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3453 circumvent possible incompatibilities when working on ML level.
3455 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3457 * New function listsum :: 'a list => 'a for arbitrary monoids.
3458 Special syntax: "SUM x <- xs. f x" (and latex variants)
3460 * New syntax for Haskell-like list comprehension (input only), eg.
3461 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3463 * The special syntax for function "filter" has changed from [x :
3464 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3465 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3467 * [a..b] is now defined for arbitrary linear orders. It used to be
3468 defined on nat only, as an abbreviation for [a..<Suc b]
3471 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3473 * New functions "sorted" and "sort" in src/HOL/List.thy.
3475 * New lemma collection field_simps (an extension of ring_simps) for
3476 manipulating (in)equations involving division. Multiplies with all
3477 denominators that can be proved to be non-zero (in equations) or
3478 positive/negative (in inequations).
3480 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3481 have been improved and renamed to ring_simps, group_simps and
3482 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3483 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3485 * Theory Library/Commutative_Ring: switched from recdef to function
3486 package; constants add, mul, pow now curried. Infix syntax for
3487 algebraic operations.
3489 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3492 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3495 * HOL/records: generalised field-update to take a function on the
3496 field rather than the new value: r(|A := x|) is translated to A_update
3497 (K x) r The K-combinator that is internally used is called K_record.
3498 INCOMPATIBILITY: Usage of the plain update functions has to be
3501 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3502 * x = 0, which are required for a semiring. Richer structures do not
3503 inherit from semiring_0 anymore, because this property is a theorem
3504 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3505 there is more to prove, but this is mostly trivial.
3507 * Class "recpower" is generalized to arbitrary monoids, not just
3508 commutative semirings. INCOMPATIBILITY: may need to incorporate
3509 commutativity or semiring properties additionally.
3511 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3512 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3513 better use 'abbreviation'.
3515 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3517 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3518 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3519 significant changes for setting up numeral syntax for types:
3520 - New constants Numeral.pred and Numeral.succ instead
3521 of former Numeral.bin_pred and Numeral.bin_succ.
3522 - Use integer operations instead of bin_add, bin_mult and so on.
3523 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3524 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3526 See src/HOL/Integ/IntArith.thy for an example setup.
3528 * Command 'normal_form' computes the normal form of a term that may
3529 contain free variables. For example ``normal_form "rev [a, b, c]"''
3530 produces ``[b, c, a]'' (without proof). This command is suitable for
3531 heavy-duty computations because the functions are compiled to ML
3532 first. Correspondingly, a method "normalization" is provided. See
3533 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3535 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3536 25 like -->); output depends on the "iff" print_mode, the default is
3537 "A = B" (with priority 50).
3539 * Relations less (<) and less_eq (<=) are also available on type bool.
3540 Modified syntax to disallow nesting without explicit parentheses,
3541 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3544 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3546 * Relation composition operator "op O" now has precedence 75 and binds
3547 stronger than union and intersection. INCOMPATIBILITY.
3549 * The old set interval syntax "{m..n(}" (and relatives) has been
3550 removed. Use "{m..<n}" (and relatives) instead.
3552 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3553 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3554 ``declare [[simproc del: neq]]''.
3556 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3559 * Theorem Cons_eq_map_conv no longer declared as "simp".
3561 * Theorem setsum_mult renamed to setsum_right_distrib.
3563 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3566 * Reimplemented methods "sat" and "satx", with several improvements:
3567 goals no longer need to be stated as "<prems> ==> False", equivalences
3568 (i.e. "=" on type bool) are handled, variable names of the form
3569 "lit_<n>" are no longer reserved, significant speedup.
3571 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3572 zChaff is still supported as well.
3574 * 'inductive' and 'datatype': provide projections of mutual rules,
3575 bundled as foo_bar.inducts;
3577 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3580 * Library: moved theory Accessible_Part to main HOL.
3582 * Library: added theory Coinductive_List of potentially infinite lists
3583 as greatest fixed-point.
3585 * Library: added theory AssocList which implements (finite) maps as
3588 * Method "evaluation" solves goals (i.e. a boolean expression)
3589 efficiently by compiling it to ML. The goal is "proved" (via an
3590 oracle) if it evaluates to True.
3592 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3593 also when invoked by the simplifier. This results in the Simplifier
3594 being more powerful on arithmetic goals. INCOMPATIBILITY.
3595 Configuration option fast_arith_split_limit=0 recovers the old
3598 * Support for hex (0x20) and binary (0b1001) numerals.
3600 * New method: reify eqs (t), where eqs are equations for an
3601 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3602 parameter, computes a term s::'b and a list xs::'a list and proves the
3603 theorem I xs s = t. This is also known as reification or quoting. The
3604 resulting theorem is applied to the subgoal to substitute t with I xs
3605 s. If t is omitted, the subgoal itself is reified.
3607 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3608 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3609 where f is supposed to be a computable function (in the sense of code
3610 generattion). The method uses reify to compute s and xs as above then
3611 applies corr_thm and uses normalization by evaluation to "prove" f s =
3612 r and finally gets the theorem t = r, which is again applied to the
3613 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3615 * Reflection: Automatic reification now handels binding, an example is
3616 available in src/HOL/ex/ReflectionEx.thy
3618 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3619 command 'statespace' that is similar to 'record', but introduces an
3620 abstract specification based on the locale infrastructure instead of
3621 HOL types. This leads to extra flexibility in composing state spaces,
3622 in particular multiple inheritance and renaming of components.
3627 * Hyperreal: Functions root and sqrt are now defined on negative real
3628 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3629 Nonnegativity side conditions have been removed from many lemmas, so
3630 that more subgoals may now be solved by simplification; potential
3633 * Real: new type classes formalize real normed vector spaces and
3634 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3635 and norm :: 'a => real.
3637 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3638 reals into other types. The overloaded constant Reals :: 'a set is now
3639 defined as range of_real; potential INCOMPATIBILITY.
3641 * Real: proper support for ML code generation, including 'quickcheck'.
3642 Reals are implemented as arbitrary precision rationals.
3644 * Hyperreal: Several constants that previously worked only for the
3645 reals have been generalized, so they now work over arbitrary vector
3646 spaces. Type annotations may need to be added in some cases; potential
3649 Infinitesimal :: ('a::real_normed_vector) star set
3650 HFinite :: ('a::real_normed_vector) star set
3651 HInfinite :: ('a::real_normed_vector) star set
3652 approx :: ('a::real_normed_vector) star => 'a star => bool
3653 monad :: ('a::real_normed_vector) star => 'a star set
3654 galaxy :: ('a::real_normed_vector) star => 'a star set
3655 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3656 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3657 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3658 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3659 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3660 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3661 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3662 sgn :: 'a::real_normed_vector => 'a
3663 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3665 * Complex: Some complex-specific constants are now abbreviations for
3666 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3667 hnorm. Other constants have been entirely removed in favor of the
3668 polymorphic versions (INCOMPATIBILITY):
3672 HInfinite <-- CInfinite
3673 Infinitesimal <-- CInfinitesimal
3676 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3677 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3678 (ns)deriv <-- (ns)cderiv
3683 * Formalisation of ideals and the quotient construction over rings.
3685 * Order and lattice theory no longer based on records.
3688 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3689 greatest_closed. INCOMPATIBILITY.
3691 * Method algebra is now set up via an attribute. For examples see
3692 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3693 of algebraic structures.
3695 * Renamed theory CRing to Ring.
3700 * Substantial, yet incomplete support for nominal datatypes (binding
3701 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3702 src/HOL/Nominal/Examples. Prospective users should consult
3703 http://isabelle.in.tum.de/nominal/
3708 * ML basics: just one true type int, which coincides with IntInf.int
3711 * ML within Isar: antiquotations allow to embed statically-checked
3712 formal entities in the source, referring to the context available at
3713 compile-time. For example:
3715 ML {* @{sort "{zero,one}"} *}
3716 ML {* @{typ "'a => 'b"} *}
3717 ML {* @{term "%x. x"} *}
3718 ML {* @{prop "x == y"} *}
3719 ML {* @{ctyp "'a => 'b"} *}
3720 ML {* @{cterm "%x. x"} *}
3721 ML {* @{cprop "x == y"} *}
3722 ML {* @{thm asm_rl} *}
3723 ML {* @{thms asm_rl} *}
3724 ML {* @{type_name c} *}
3725 ML {* @{type_syntax c} *}
3726 ML {* @{const_name c} *}
3727 ML {* @{const_syntax c} *}
3730 ML {* @{theory Pure} *}
3731 ML {* @{theory_ref} *}
3732 ML {* @{theory_ref Pure} *}
3735 ML {* @{clasimpset} *}
3737 The same works for sources being ``used'' within an Isar context.
3739 * ML in Isar: improved error reporting; extra verbosity with
3740 ML_Context.trace enabled.
3742 * Pure/General/table.ML: the join operations now works via exceptions
3743 DUP/SAME instead of type option. This is simpler in simple cases, and
3744 admits slightly more efficient complex applications.
3746 * Pure: 'advanced' translation functions (parse_translation etc.) now
3747 use Context.generic instead of just theory.
3749 * Pure: datatype Context.generic joins theory/Proof.context and
3750 provides some facilities for code that works in either kind of
3751 context, notably GenericDataFun for uniform theory and proof data.
3753 * Pure: simplified internal attribute type, which is now always
3754 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3755 local (Proof.context) attributes have been discontinued, while
3756 minimizing code duplication. Thm.rule_attribute and
3757 Thm.declaration_attribute build canonical attributes; see also structure
3758 Context for further operations on Context.generic, notably
3759 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3760 declarations and definitions.
3762 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3763 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3764 init only required for impure data. INCOMPATIBILITY: empty really need
3765 to be empty (no dependencies on theory content!)
3767 * Pure/kernel: consts certification ignores sort constraints given in
3768 signature declarations. (This information is not relevant to the
3769 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3770 potential INCOMPATIBILITY.
3772 * Pure: axiomatic type classes are now purely definitional, with
3773 explicit proofs of class axioms and super class relations performed
3774 internally. See Pure/axclass.ML for the main internal interfaces --
3775 notably AxClass.define_class supercedes AxClass.add_axclass, and
3776 AxClass.axiomatize_class/classrel/arity supersede
3777 Sign.add_classes/classrel/arities.
3779 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3780 global/local versions on theory vs. Proof.context have been
3781 discontinued; Attrib.syntax and Method.syntax have been adapted
3782 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3783 attributes, methods, etc.
3785 * Pure: several functions of signature "... -> theory -> theory * ..."
3786 have been reoriented to "... -> theory -> ... * theory" in order to
3787 allow natural usage in combination with the ||>, ||>>, |-> and
3788 fold_map combinators.
3790 * Pure: official theorem names (closed derivations) and additional
3791 comments (tags) are now strictly separate. Name hints -- which are
3792 maintained as tags -- may be attached any time without affecting the
3795 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3796 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3797 achieve the old behaviour.
3799 * Pure: the "Goal" constant is now called "prop", supporting a
3800 slightly more general idea of ``protecting'' meta-level rule
3803 * Pure: Logic.(un)varify only works in a global context, which is now
3804 enforced instead of silently assumed. INCOMPATIBILITY, may use
3805 Logic.legacy_(un)varify as temporary workaround.
3807 * Pure: structure Name provides scalable operations for generating
3808 internal variable names, notably Name.variants etc. This replaces
3809 some popular functions from term.ML:
3811 Term.variant -> Name.variant
3812 Term.variantlist -> Name.variant_list
3813 Term.invent_names -> Name.invent_list
3815 Note that low-level renaming rarely occurs in new code -- operations
3816 from structure Variable are used instead (see below).
3818 * Pure: structure Variable provides fundamental operations for proper
3819 treatment of fixed/schematic variables in a context. For example,
3820 Variable.import introduces fixes for schematics of given facts and
3821 Variable.export reverses the effect (up to renaming) -- this replaces
3822 various freeze_thaw operations.
3824 * Pure: structure Goal provides simple interfaces for
3825 init/conclude/finish and tactical prove operations (replacing former
3826 Tactic.prove). Goal.prove is the canonical way to prove results
3827 within a given context; Goal.prove_global is a degraded version for
3828 theory level goals, including a global Drule.standard. Note that
3829 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3830 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3831 in a locale context).
3833 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3834 and type checking (Syntax.check_term etc.), with common combinations
3835 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3836 which are considered legacy and await removal.
3838 * Pure/Syntax: generic interfaces for type unchecking
3839 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3840 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3841 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3842 available for convenience, but refer to the very same operations using
3843 a mere theory instead of a full context.
3845 * Isar: simplified treatment of user-level errors, using exception
3846 ERROR of string uniformly. Function error now merely raises ERROR,
3847 without any side effect on output channels. The Isar toplevel takes
3848 care of proper display of ERROR exceptions. ML code may use plain
3849 handle/can/try; cat_error may be used to concatenate errors like this:
3851 ... handle ERROR msg => cat_error msg "..."
3853 Toplevel ML code (run directly or through the Isar toplevel) may be
3854 embedded into the Isar toplevel with exception display/debug like
3857 Isar.toplevel (fn () => ...)
3859 INCOMPATIBILITY, removed special transform_error facilities, removed
3860 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3861 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3862 -- use plain ERROR instead.
3864 * Isar: theory setup now has type (theory -> theory), instead of a
3865 list. INCOMPATIBILITY, may use #> to compose setup functions.
3867 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3868 ProofContext.debug/verbose flags.
3870 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3871 theory before entering a proof state. Transactions now always see a
3872 quasi-functional intermediate checkpoint, both in interactive and
3875 * Isar: simplified interfaces for outer syntax. Renamed
3876 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3877 OuterSyntax.add_parsers -- this functionality is now included in
3878 OuterSyntax.command etc. INCOMPATIBILITY.
3880 * Simplifier: the simpset of a running simplification process now
3881 contains a proof context (cf. Simplifier.the_context), which is the
3882 very context that the initial simpset has been retrieved from (by
3883 simpset_of/local_simpset_of). Consequently, all plug-in components
3884 (solver, looper etc.) may depend on arbitrary proof data.
3886 * Simplifier.inherit_context inherits the proof context (plus the
3887 local bounds) of the current simplification process; any simproc
3888 etc. that calls the Simplifier recursively should do this! Removed
3889 former Simplifier.inherit_bounds, which is already included here --
3890 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3891 specify an explicit context using Simplifier.context/theory_context.
3893 * Simplifier/Classical Reasoner: more abstract interfaces
3894 change_simpset/claset for modifying the simpset/claset reference of a
3895 theory; raw versions simpset/claset_ref etc. have been discontinued --
3898 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3904 * settings: the default heap location within ISABELLE_HOME_USER now
3905 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3906 Isabelle installations.
3908 * isabelle-process: option -S (secure mode) disables some critical
3909 operations, notably runtime compilation and evaluation of ML source
3912 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3914 * Support for parallel execution, using native multicore support of
3915 Poly/ML 5.1. The theory loader exploits parallelism when processing
3916 independent theories, according to the given theory header
3917 specifications. The maximum number of worker threads is specified via
3918 usedir option -M or the "max-threads" setting in Proof General. A
3919 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3920 to 6 on a 8-core machine. User-code needs to observe certain
3921 guidelines for thread-safe programming, see appendix A in the Isar
3922 Implementation manual.
3926 New in Isabelle2005 (October 2005)
3927 ----------------------------------
3931 * Theory headers: the new header syntax for Isar theories is
3934 imports <theory1> ... <theoryN>
3935 uses <file1> ... <fileM>
3938 where the 'uses' part is optional. The previous syntax
3940 theory <name> = <theory1> + ... + <theoryN>:
3942 will disappear in the next release. Use isatool fixheaders to convert
3943 existing theory files. Note that there is no change in ancient
3944 non-Isar theories now, but these will disappear soon.
3946 * Theory loader: parent theories can now also be referred to via
3947 relative and absolute paths.
3949 * Command 'find_theorems' searches for a list of criteria instead of a
3950 list of constants. Known criteria are: intro, elim, dest, name:string,
3951 simp:term, and any term. Criteria can be preceded by '-' to select
3952 theorems that do not match. Intro, elim, dest select theorems that
3953 match the current goal, name:s selects theorems whose fully qualified
3954 name contain s, and simp:term selects all simplification rules whose
3955 lhs match term. Any other term is interpreted as pattern and selects
3956 all theorems matching the pattern. Available in ProofGeneral under
3957 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3959 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3961 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3962 matching the current goal as introduction rule and not having "HOL."
3963 in their name (i.e. not being defined in theory HOL).
3965 * Command 'thms_containing' has been discontinued in favour of
3966 'find_theorems'; INCOMPATIBILITY.
3968 * Communication with Proof General is now 8bit clean, which means that
3969 Unicode text in UTF-8 encoding may be used within theory texts (both
3970 formal and informal parts). Cf. option -U of the Isabelle Proof
3971 General interface. Here are some simple examples (cf. src/HOL/ex):
3973 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3974 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3976 * Improved efficiency of the Simplifier and, to a lesser degree, the
3977 Classical Reasoner. Typical big applications run around 2 times
3981 *** Document preparation ***
3983 * Commands 'display_drafts' and 'print_drafts' perform simple output
3984 of raw sources. Only those symbols that do not require additional
3985 LaTeX packages (depending on comments in isabellesym.sty) are
3986 displayed properly, everything else is left verbatim. isatool display
3987 and isatool print are used as front ends (these are subject to the
3988 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3990 * Command tags control specific markup of certain regions of text,
3991 notably folding and hiding. Predefined tags include "theory" (for
3992 theory begin and end), "proof" for proof commands, and "ML" for
3993 commands involving ML code; the additional tags "visible" and
3994 "invisible" are unused by default. Users may give explicit tag
3995 specifications in the text, e.g. ''by %invisible (auto)''. The
3996 interpretation of tags is determined by the LaTeX job during document
3997 preparation: see option -V of isatool usedir, or options -n and -t of
3998 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
4001 Several document versions may be produced at the same time via isatool
4002 usedir (the generated index.html will link all of them). Typical
4003 specifications include ''-V document=theory,proof,ML'' to present
4004 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
4005 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
4006 these parts without any formal replacement text. The Isabelle site
4007 default settings produce ''document'' and ''outline'' versions as
4010 * Several new antiquotations:
4012 @{term_type term} prints a term with its type annotated;
4014 @{typeof term} prints the type of a term;
4016 @{const const} is the same as @{term const}, but checks that the
4017 argument is a known logical constant;
4019 @{term_style style term} and @{thm_style style thm} print a term or
4020 theorem applying a "style" to it
4024 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
4025 definitions, equations, inequations etc., 'concl' printing only the
4026 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
4027 to print the specified premise. TermStyle.add_style provides an ML
4028 interface for introducing further styles. See also the "LaTeX Sugar"
4029 document practical applications. The ML antiquotation prints
4030 type-checked ML expressions verbatim.
4032 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
4033 and 'text' support optional locale specification '(in loc)', which
4034 specifies the default context for interpreting antiquotations. For
4035 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
4037 * Option 'locale=NAME' of antiquotations specifies an alternative
4038 context interpreting the subsequent argument. For example: @{thm
4039 [locale=lattice] inf_assoc}.
4041 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
4044 * Proper output of antiquotations for theory commands involving a
4045 proof context (such as 'locale' or 'theorem (in loc) ...').
4047 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
4048 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
4050 * isatool usedir: new option -C (default true) controls whether option
4051 -D should include a copy of the original document directory; -C false
4052 prevents unwanted effects such as copying of administrative CVS data.
4057 * Considerably improved version of 'constdefs' command. Now performs
4058 automatic type-inference of declared constants; additional support for
4059 local structure declarations (cf. locales and HOL records), see also
4060 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
4061 sequential dependencies of definitions within a single 'constdefs'
4062 section; moreover, the declared name needs to be an identifier. If
4063 all fails, consider to fall back on 'consts' and 'defs' separately.
4065 * Improved indexed syntax and implicit structures. First of all,
4066 indexed syntax provides a notational device for subscripted
4067 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
4068 expressions. Secondly, in a local context with structure
4069 declarations, number indexes \<^sub>n or the empty index (default
4070 number 1) refer to a certain fixed variable implicitly; option
4071 show_structs controls printing of implicit structures. Typical
4072 applications of these concepts involve record types and locales.
4074 * New command 'no_syntax' removes grammar declarations (and
4075 translations) resulting from the given syntax specification, which is
4076 interpreted in the same manner as for the 'syntax' command.
4078 * 'Advanced' translation functions (parse_translation etc.) may depend
4079 on the signature of the theory context being presently used for
4080 parsing/printing, see also isar-ref manual.
4082 * Improved 'oracle' command provides a type-safe interface to turn an
4083 ML expression of type theory -> T -> term into a primitive rule of
4084 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
4085 is already included here); see also FOL/ex/IffExample.thy;
4088 * axclass: name space prefix for class "c" is now "c_class" (was "c"
4089 before); "cI" is no longer bound, use "c.intro" instead.
4090 INCOMPATIBILITY. This change avoids clashes of fact bindings for
4091 axclasses vs. locales.
4093 * Improved internal renaming of symbolic identifiers -- attach primes
4094 instead of base 26 numbers.
4096 * New flag show_question_marks controls printing of leading question
4097 marks in schematic variable names.
4099 * In schematic variable names, *any* symbol following \<^isub> or
4100 \<^isup> is now treated as part of the base name. For example, the
4101 following works without printing of awkward ".0" indexes:
4103 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4106 * Inner syntax includes (*(*nested*) comments*).
4108 * Pretty printer now supports unbreakable blocks, specified in mixfix
4109 annotations as "(00...)".
4111 * Clear separation of logical types and nonterminals, where the latter
4112 may only occur in 'syntax' specifications or type abbreviations.
4113 Before that distinction was only partially implemented via type class
4114 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4115 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4116 exotic syntax specifications may require further adaption
4117 (e.g. Cube/Cube.thy).
4119 * Removed obsolete type class "logic", use the top sort {} instead.
4120 Note that non-logical types should be declared as 'nonterminals'
4121 rather than 'types'. INCOMPATIBILITY for new object-logic
4124 * Attributes 'induct' and 'cases': type or set names may now be
4125 locally fixed variables as well.
4127 * Simplifier: can now control the depth to which conditional rewriting
4128 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4131 * Simplifier: simplification procedures may now take the current
4132 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4133 interface), which is very useful for calling the Simplifier
4134 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4135 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4136 low-level mk_simproc no longer applies Logic.varify internally, to
4137 allow for use in a context of fixed variables.
4139 * thin_tac now works even if the assumption being deleted contains !!
4140 or ==>. More generally, erule now works even if the major premise of
4141 the elimination rule contains !! or ==>.
4143 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4145 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4146 from Pure, which contains all common declarations already. Both
4147 theories are defined via plain Isabelle/Isar .thy files.
4148 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4149 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4150 use isatool fixcpure to adapt your theory and ML sources.
4152 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4153 selections of theorems in named facts via index ranges.
4155 * 'print_theorems': in theory mode, really print the difference
4156 wrt. the last state (works for interactive theory development only),
4157 in proof mode print all local facts (cf. 'print_facts');
4159 * 'hide': option '(open)' hides only base names.
4161 * More efficient treatment of intermediate checkpoints in interactive
4164 * Code generator is now invoked via code_module (incremental code
4165 generation) and code_library (modular code generation, ML structures
4166 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4167 must be quoted when used as identifiers.
4169 * New 'value' command for reading, evaluating and printing terms using
4170 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4171 quoted when used as identifier.
4176 * New commands for the interpretation of locale expressions in
4177 theories (1), locales (2) and proof contexts (3). These generate
4178 proof obligations from the expression specification. After the
4179 obligations have been discharged, theorems of the expression are added
4180 to the theory, target locale or proof context. The synopsis of the
4181 commands is a follows:
4183 (1) interpretation expr inst
4184 (2) interpretation target < expr
4185 (3) interpret expr inst
4187 Interpretation in theories and proof contexts require a parameter
4188 instantiation of terms from the current context. This is applied to
4189 specifications and theorems of the interpreted expression.
4190 Interpretation in locales only permits parameter renaming through the
4191 locale expression. Interpretation is smart in that interpretations
4192 that are active already do not occur in proof obligations, neither are
4193 instantiated theorems stored in duplicate. Use 'print_interps' to
4194 inspect active interpretations of a particular locale. For details,
4195 see the Isar Reference manual. Examples can be found in
4196 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4198 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4199 'interpret' instead.
4201 * New context element 'constrains' for adding type constraints to
4204 * Context expressions: renaming of parameters with syntax
4207 * Locale declaration: 'includes' disallowed.
4209 * Proper static binding of attribute syntax -- i.e. types / terms /
4210 facts mentioned as arguments are always those of the locale definition
4211 context, independently of the context of later invocations. Moreover,
4212 locale operations (renaming and type / term instantiation) are applied
4213 to attribute arguments as expected.
4215 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4216 actual attributes; rare situations may require Attrib.attribute to
4217 embed those attributes into Attrib.src that lack concrete syntax.
4218 Attribute implementations need to cooperate properly with the static
4219 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4220 Attrib.XXX_thm etc. already do the right thing without further
4221 intervention. Only unusual applications -- such as "where" or "of"
4222 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4223 on the context and the facts involved -- may have to assign parsed
4224 values to argument tokens explicitly.
4226 * Changed parameter management in theorem generation for long goal
4227 statements with 'includes'. INCOMPATIBILITY: produces a different
4228 theorem statement in rare situations.
4230 * Locale inspection command 'print_locale' omits notes elements. Use
4231 'print_locale!' to have them included in the output.
4236 * Provers/hypsubst.ML: improved version of the subst method, for
4237 single-step rewriting: it now works in bound variable contexts. New is
4238 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4239 rewrite a different subterm than the original subst method, which is
4240 still available as 'simplesubst'.
4242 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4245 * Provers/trancl.ML: new transitivity reasoner for transitive and
4246 reflexive-transitive closure of relations.
4248 * Provers/blast.ML: new reference depth_limit to make blast's depth
4249 limit (previously hard-coded with a value of 20) user-definable.
4251 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4252 is peformed already. Object-logics merely need to finish their
4253 initial simpset configuration as before. INCOMPATIBILITY.
4258 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4261 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4263 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4264 and x-symbol; use option '-m epsilon' to get it actually printed.
4265 Moreover, the mathematically important symbolic identifier \<epsilon>
4266 becomes available as variable, constant etc. INCOMPATIBILITY,
4268 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4269 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4270 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4271 support corresponding Isar calculations.
4273 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4276 * theory SetInterval: changed the syntax for open intervals:
4285 The old syntax is still supported but will disappear in the next
4286 release. For conversion use the following Emacs search and replace
4287 patterns (these are not perfect but work quite well):
4289 {)\([^\.]*\)\.\. -> {\1<\.\.}
4290 \.\.\([^(}]*\)(} -> \.\.<\1}
4292 * Theory Commutative_Ring (in Library): method comm_ring for proving
4293 equalities in commutative rings; method 'algebra' provides a generic
4296 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4297 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4298 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4301 Some new syntax forms are available:
4303 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4304 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4305 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4306 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4308 The latter form "\<Sum>x < k. e" used to be based on a separate
4309 function "Summation", which has been discontinued.
4311 * theory Finite_Set: in structured induction proofs, the insert case
4312 is now 'case (insert x F)' instead of the old counterintuitive 'case
4315 * The 'refute' command has been extended to support a much larger
4316 fragment of HOL, including axiomatic type classes, constdefs and
4317 typedefs, inductive datatypes and recursion.
4319 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4320 Requires zChaff with proof generation to be installed. See
4321 HOL/ex/SAT_Examples.thy for examples.
4323 * Datatype induction via method 'induct' now preserves the name of the
4324 induction variable. For example, when proving P(xs::'a list) by
4325 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4326 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4327 in unstructured proof scripts.
4329 * Reworked implementation of records. Improved scalability for
4330 records with many fields, avoiding performance problems for type
4331 inference. Records are no longer composed of nested field types, but
4332 of nested extension types. Therefore the record type only grows linear
4333 in the number of extensions and not in the number of fields. The
4334 top-level (users) view on records is preserved. Potential
4335 INCOMPATIBILITY only in strange cases, where the theory depends on the
4336 old record representation. The type generated for a record is called
4337 <record_name>_ext_type.
4339 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4340 proofs triggered by a record definition or a simproc (if
4341 quick_and_dirty is enabled). Definitions of large records can take
4344 New simproc record_upd_simproc for simplification of multiple record
4345 updates enabled by default. Moreover, trivial updates are also
4346 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4347 occasionally, since simplification is more powerful by default.
4349 * typedef: proper support for polymorphic sets, which contain extra
4350 type-variables in the term.
4352 * Simplifier: automatically reasons about transitivity chains
4353 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4354 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4355 old proofs break occasionally as simplification may now solve more
4356 goals than previously.
4358 * Simplifier: converts x <= y into x = y if assumption y <= x is
4359 present. Works for all partial orders (class "order"), in particular
4360 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4363 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4364 bound variable or a constant then the let is unfolded. Otherwise
4365 first a is simplified to b, and then f b is simplified to g. If
4366 possible we abstract b from g arriving at "let x = b in h x",
4367 otherwise we unfold the let and arrive at g. The simproc can be
4368 enabled/disabled by the reference use_let_simproc. Potential
4369 INCOMPATIBILITY since simplification is more powerful by default.
4371 * Classical reasoning: the meson method now accepts theorems as arguments.
4373 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4374 jobs to provide advice on the provability of subgoals.
4376 * Theory OrderedGroup and Ring_and_Field: various additions and
4377 improvements to faciliate calculations involving equalities and
4380 The following theorems have been eliminated or modified
4383 abs_eq now named abs_of_nonneg
4384 abs_of_ge_0 now named abs_of_nonneg
4385 abs_minus_eq now named abs_of_nonpos
4386 imp_abs_id now named abs_of_nonneg
4387 imp_abs_neg_id now named abs_of_nonpos
4388 mult_pos now named mult_pos_pos
4389 mult_pos_le now named mult_nonneg_nonneg
4390 mult_pos_neg_le now named mult_nonneg_nonpos
4391 mult_pos_neg2_le now named mult_nonneg_nonpos2
4392 mult_neg now named mult_neg_neg
4393 mult_neg_le now named mult_nonpos_nonpos
4395 * The following lemmas in Ring_and_Field have been added to the simplifier:
4398 not_square_less_zero
4400 The following lemmas have been deleted from Real/RealPow:
4410 * Theory Parity: added rules for simplifying exponents.
4414 The following theorems have been eliminated or modified
4417 list_all_Nil now named list_all.simps(1)
4418 list_all_Cons now named list_all.simps(2)
4419 list_all_conv now named list_all_iff
4420 set_mem_eq now named mem_iff
4422 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4423 asymptotic "big O" calculations. See the notes in BigO.thy.
4428 * Theory RealDef: better support for embedding natural numbers and
4429 integers in the reals.
4431 The following theorems have been eliminated or modified
4434 exp_ge_add_one_self now requires no hypotheses
4435 real_of_int_add reversed direction of equality (use [symmetric])
4436 real_of_int_minus reversed direction of equality (use [symmetric])
4437 real_of_int_diff reversed direction of equality (use [symmetric])
4438 real_of_int_mult reversed direction of equality (use [symmetric])
4440 * Theory RComplete: expanded support for floor and ceiling functions.
4442 * Theory Ln is new, with properties of the natural logarithm
4444 * Hyperreal: There is a new type constructor "star" for making
4445 nonstandard types. The old type names are now type synonyms:
4449 hcomplex = complex star
4451 * Hyperreal: Many groups of similarly-defined constants have been
4452 replaced by polymorphic versions (INCOMPATIBILITY):
4454 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4456 starset <-- starsetNat, starsetC
4457 *s* <-- *sNat*, *sc*
4458 starset_n <-- starsetNat_n, starsetC_n
4459 *sn* <-- *sNatn*, *scn*
4460 InternalSets <-- InternalNatSets, InternalCSets
4462 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4463 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4464 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4465 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4466 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4468 * Hyperreal: Many type-specific theorems have been removed in favor of
4469 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4471 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4472 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4473 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4474 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4475 right_minus <-- hypreal_add_minus
4476 left_minus <-- {hypreal,hcomplex}_add_minus_left
4477 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4478 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4479 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4480 mult_1_right <-- hcomplex_mult_one_right
4481 mult_zero_left <-- hcomplex_mult_zero_left
4482 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4483 right_distrib <-- hypnat_add_mult_distrib2
4484 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4485 right_inverse <-- hypreal_mult_inverse
4486 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4487 order_refl <-- {hypreal,hypnat}_le_refl
4488 order_trans <-- {hypreal,hypnat}_le_trans
4489 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4490 order_less_le <-- {hypreal,hypnat}_less_le
4491 linorder_linear <-- {hypreal,hypnat}_le_linear
4492 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4493 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4494 add_nonneg_nonneg <-- hypreal_le_add_order
4496 * Hyperreal: Separate theorems having to do with type-specific
4497 versions of constants have been merged into theorems that apply to the
4498 new polymorphic constants (INCOMPATIBILITY):
4500 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4501 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4502 STAR_Un <-- {STAR,NatStar,STARC}_Un
4503 STAR_Int <-- {STAR,NatStar,STARC}_Int
4504 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4505 STAR_subset <-- {STAR,NatStar,STARC}_subset
4506 STAR_mem <-- {STAR,NatStar,STARC}_mem
4507 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4508 STAR_diff <-- {STAR,STARC}_diff
4509 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4510 STARC_hcomplex_of_complex}_image_subset
4511 starset_n_Un <-- starset{Nat,C}_n_Un
4512 starset_n_Int <-- starset{Nat,C}_n_Int
4513 starset_n_Compl <-- starset{Nat,C}_n_Compl
4514 starset_n_diff <-- starset{Nat,C}_n_diff
4515 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4516 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4517 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4518 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4519 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4520 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4521 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4522 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4523 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4524 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4525 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4526 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4527 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4528 starfun_diff <-- starfun{C,RC,CR}_diff
4529 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4530 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4531 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4532 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4533 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4534 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4535 starfun_Id <-- starfunC_Id
4536 starfun_approx <-- starfun{Nat,CR}_approx
4537 starfun_capprox <-- starfun{C,RC}_capprox
4538 starfun_abs <-- starfunNat_rabs
4539 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4540 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4541 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4542 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4543 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4544 starfun_add_approx <-- starfunCR_add_approx
4545 starfun_inverse_inverse <-- starfunC_inverse_inverse
4546 starfun_divide <-- starfun{C,CR,RC}_divide
4547 starfun_n <-- starfun{Nat,C}_n
4548 starfun_n_mult <-- starfun{Nat,C}_n_mult
4549 starfun_n_add <-- starfun{Nat,C}_n_add
4550 starfun_n_add_minus <-- starfunNat_n_add_minus
4551 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4552 starfun_n_minus <-- starfun{Nat,C}_n_minus
4553 starfun_n_eq <-- starfun{Nat,C}_n_eq
4555 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4556 star_n_minus <-- {hypreal,hcomplex}_minus
4557 star_n_diff <-- {hypreal,hcomplex}_diff
4558 star_n_mult <-- {hypreal,hcomplex}_mult
4559 star_n_inverse <-- {hypreal,hcomplex}_inverse
4560 star_n_le <-- {hypreal,hypnat}_le
4561 star_n_less <-- {hypreal,hypnat}_less
4562 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4563 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4564 star_n_abs <-- hypreal_hrabs
4565 star_n_divide <-- hcomplex_divide
4567 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4568 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4569 star_of_diff <-- hypreal_of_real_diff
4570 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4571 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4572 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4573 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4574 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4575 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4576 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4577 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4578 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4579 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4580 star_of_number_of <-- {hypreal,hcomplex}_number_of
4581 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4582 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4583 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4584 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4585 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4586 star_of_power <-- hypreal_of_real_power
4587 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4589 * Hyperreal: new method "transfer" that implements the transfer
4590 principle of nonstandard analysis. With a subgoal that mentions
4591 nonstandard types like "'a star", the command "apply transfer"
4592 replaces it with an equivalent one that mentions only standard types.
4593 To be successful, all free variables must have standard types; non-
4594 standard variables must have explicit universal quantifiers.
4596 * Hyperreal: A theory of Taylor series.
4601 * Discontinued special version of 'constdefs' (which used to support
4602 continuous functions) in favor of the general Pure one with full
4605 * New simplification procedure for solving continuity conditions; it
4606 is much faster on terms with many nested lambda abstractions (cubic
4607 instead of exponential time).
4609 * New syntax for domain package: selector names are now optional.
4610 Parentheses should be omitted unless argument is lazy, for example:
4612 domain 'a stream = cons "'a" (lazy "'a stream")
4614 * New command 'fixrec' for defining recursive functions with pattern
4615 matching; defining multiple functions with mutual recursion is also
4616 supported. Patterns may include the constants cpair, spair, up, sinl,
4617 sinr, or any data constructor defined by the domain package. The given
4618 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4619 syntax and examples.
4621 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4622 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4623 but the proof obligation additionally includes an admissibility
4624 requirement. The packages generate instances of class cpo or pcpo,
4625 with continuity and strictness theorems for Rep and Abs.
4627 * HOLCF: Many theorems have been renamed according to a more standard naming
4628 scheme (INCOMPATIBILITY):
4630 foo_inject: "foo$x = foo$y ==> x = y"
4631 foo_eq: "(foo$x = foo$y) = (x = y)"
4632 foo_less: "(foo$x << foo$y) = (x << y)"
4633 foo_strict: "foo$UU = UU"
4634 foo_defined: "... ==> foo$x ~= UU"
4635 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4640 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4641 including the First Isomorphism Theorem (on quotienting by the kernel
4644 * ZF/Simplifier: install second copy of type solver that actually
4645 makes use of TC rules declared to Isar proof contexts (or locales);
4646 the old version is still required for ML proof scripts.
4651 * Converted to Isar theory format; use locales instead of axiomatic
4657 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4660 * Pure/library.ML no longer defines its own option datatype, but uses
4661 that of the SML basis, which has constructors NONE and SOME instead of
4662 None and Some, as well as exception Option.Option instead of OPTION.
4663 The functions the, if_none, is_some, is_none have been adapted
4664 accordingly, while Option.map replaces apsome.
4666 * Pure/library.ML: the exception LIST has been given up in favour of
4667 the standard exceptions Empty and Subscript, as well as
4668 Library.UnequalLengths. Function like Library.hd and Library.tl are
4669 superceded by the standard hd and tl functions etc.
4671 A number of basic list functions are no longer exported to the ML
4672 toplevel, as they are variants of predefined functions. The following
4673 suggests how one can translate existing code:
4675 rev_append xs ys = List.revAppend (xs, ys)
4676 nth_elem (i, xs) = List.nth (xs, i)
4677 last_elem xs = List.last xs
4678 flat xss = List.concat xss
4679 seq fs = List.app fs
4680 partition P xs = List.partition P xs
4681 mapfilter f xs = List.mapPartial f xs
4683 * Pure/library.ML: several combinators for linear functional
4684 transformations, notably reverse application and composition:
4687 (x, y) |-> f f #-> g
4689 * Pure/library.ML: introduced/changed precedence of infix operators:
4691 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4693 infix 3 o oo ooo oooo;
4694 infix 4 ~~ upto downto;
4696 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4699 * Pure/library.ML: natural list combinators fold, fold_rev, and
4700 fold_map support linear functional transformations and nesting. For
4703 fold f [x1, ..., xN] y =
4704 y |> f x1 |> ... |> f xN
4706 (fold o fold) f [xs1, ..., xsN] y =
4707 y |> fold f xs1 |> ... |> fold f xsN
4709 fold f [x1, ..., xN] =
4712 (fold o fold) f [xs1, ..., xsN] =
4713 fold f xs1 #> ... #> fold f xsN
4715 * Pure/library.ML: the following selectors on type 'a option are
4718 the: 'a option -> 'a (*partial*)
4719 these: 'a option -> 'a where 'a = 'b list
4720 the_default: 'a -> 'a option -> 'a
4721 the_list: 'a option -> 'a list
4723 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4724 basic operations for association lists, following natural argument
4725 order; moreover the explicit equality predicate passed here avoids
4726 potentially expensive polymorphic runtime equality checks.
4727 The old functions may be expressed as follows:
4729 assoc = uncurry (AList.lookup (op =))
4730 assocs = these oo AList.lookup (op =)
4731 overwrite = uncurry (AList.update (op =)) o swap
4733 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4735 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4736 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4738 replacing make_keylist and keyfilter (occassionally used)
4741 make_keylist = AList.make
4742 keyfilter = AList.find (op =)
4744 * eq_fst and eq_snd now take explicit equality parameter, thus
4745 avoiding eqtypes. Naive rewrites:
4747 eq_fst = eq_fst (op =)
4748 eq_snd = eq_snd (op =)
4750 * Removed deprecated apl and apr (rarely used).
4753 apl (n, op) =>>= curry op n
4754 apr (op, m) =>>= fn n => op (n, m)
4756 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4757 provides a reasonably efficient light-weight implementation of sets as
4760 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4761 few new operations; existing lookup and update are now curried to
4762 follow natural argument order (for use with fold etc.);
4763 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4765 * Pure/General: output via the Isabelle channels of
4766 writeln/warning/error etc. is now passed through Output.output, with a
4767 hook for arbitrary transformations depending on the print_mode
4768 (cf. Output.add_mode -- the first active mode that provides a output
4769 function wins). Already formatted output may be embedded into further
4770 text via Output.raw; the result of Pretty.string_of/str_of and derived
4771 functions (string_of_term/cterm/thm etc.) is already marked raw to
4772 accommodate easy composition of diagnostic messages etc. Programmers
4773 rarely need to care about Output.output or Output.raw at all, with
4774 some notable exceptions: Output.output is required when bypassing the
4775 standard channels (writeln etc.), or in token translations to produce
4776 properly formatted results; Output.raw is required when capturing
4777 already output material that will eventually be presented to the user
4778 a second time. For the default print mode, both Output.output and
4779 Output.raw have no effect.
4781 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4782 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4783 cumulative results are displayed at the end of a batch session.
4785 * Pure/General: File.sysify_path and File.quote_sysify path have been
4786 replaced by File.platform_path and File.shell_path (with appropriate
4787 hooks). This provides a clean interface for unusual systems where the
4788 internal and external process view of file names are different.
4790 * Pure: more efficient orders for basic syntactic entities: added
4791 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4792 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4793 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4794 orders now -- potential INCOMPATIBILITY for code that depends on a
4795 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4796 Library.sort_strings on result).
4798 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4799 fold_types traverse types/terms from left to right, observing natural
4800 argument order. Supercedes previous foldl_XXX versions, add_frees,
4801 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4803 * Pure: name spaces have been refined, with significant changes of the
4804 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4805 to extern(_table). The plain name entry path is superceded by a
4806 general 'naming' context, which also includes the 'policy' to produce
4807 a fully qualified name and external accesses of a fully qualified
4808 name; NameSpace.extend is superceded by context dependent
4809 Sign.declare_name. Several theory and proof context operations modify
4810 the naming context. Especially note Theory.restore_naming and
4811 ProofContext.restore_naming to get back to a sane state; note that
4812 Theory.add_path is no longer sufficient to recover from
4813 Theory.absolute_path in particular.
4815 * Pure: new flags short_names (default false) and unique_names
4816 (default true) for controlling output of qualified names. If
4817 short_names is set, names are printed unqualified. If unique_names is
4818 reset, the name prefix is reduced to the minimum required to achieve
4819 the original result when interning again, even if there is an overlap
4820 with earlier declarations.
4822 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4823 now 'extend', and 'merge' gets an additional Pretty.pp argument
4824 (useful for printing error messages). INCOMPATIBILITY.
4826 * Pure: major reorganization of the theory context. Type Sign.sg and
4827 Theory.theory are now identified, referring to the universal
4828 Context.theory (see Pure/context.ML). Actual signature and theory
4829 content is managed as theory data. The old code and interfaces were
4830 spread over many files and structures; the new arrangement introduces
4831 considerable INCOMPATIBILITY to gain more clarity:
4833 Context -- theory management operations (name, identity, inclusion,
4834 parents, ancestors, merge, etc.), plus generic theory data;
4836 Sign -- logical signature and syntax operations (declaring consts,
4837 types, etc.), plus certify/read for common entities;
4839 Theory -- logical theory operations (stating axioms, definitions,
4840 oracles), plus a copy of logical signature operations (consts,
4841 types, etc.); also a few basic management operations (Theory.copy,
4844 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4845 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4846 for convenience -- they merely return the theory.
4848 * Pure: type Type.tsig is superceded by theory in most interfaces.
4850 * Pure: the Isar proof context type is already defined early in Pure
4851 as Context.proof (note that ProofContext.context and Proof.context are
4852 aliases, where the latter is the preferred name). This enables other
4853 Isabelle components to refer to that type even before Isar is present.
4855 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4856 typeK, constK, axiomK, oracleK), but provide explicit operations for
4857 any of these kinds. For example, Sign.intern typeK is now
4858 Sign.intern_type, Theory.hide_space Sign.typeK is now
4859 Theory.hide_types. Also note that former
4860 Theory.hide_classes/types/consts are now
4861 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4862 internalize their arguments! INCOMPATIBILITY.
4864 * Pure: get_thm interface (of PureThy and ProofContext) expects
4865 datatype thmref (with constructors Name and NameSelection) instead of
4866 plain string -- INCOMPATIBILITY;
4868 * Pure: cases produced by proof methods specify options, where NONE
4869 means to remove case bindings -- INCOMPATIBILITY in
4872 * Pure: the following operations retrieve axioms or theorems from a
4873 theory node or theory hierarchy, respectively:
4875 Theory.axioms_of: theory -> (string * term) list
4876 Theory.all_axioms_of: theory -> (string * term) list
4877 PureThy.thms_of: theory -> (string * thm) list
4878 PureThy.all_thms_of: theory -> (string * thm) list
4880 * Pure: print_tac now outputs the goal through the trace channel.
4882 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4883 Reference Toplevel.debug (default false) controls detailed printing
4884 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4885 controls execution profiling -- set to 1 for time and 2 for space
4886 (both increase the runtime).
4888 * Isar session: The initial use of ROOT.ML is now always timed,
4889 i.e. the log will show the actual process times, in contrast to the
4890 elapsed wall-clock time that the outer shell wrapper produces.
4892 * Simplifier: improved handling of bound variables (nameless
4893 representation, avoid allocating new strings). Simprocs that invoke
4894 the Simplifier recursively should use Simplifier.inherit_bounds to
4895 avoid local name clashes. Failure to do so produces warnings
4896 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4897 for further details.
4899 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4900 bindings for all theorems stored within a given theory; this may help
4901 in porting non-Isar theories to Isar ones, while keeping ML proof
4902 scripts for the time being.
4904 * ML operator HTML.with_charset specifies the charset begin used for
4905 generated HTML files. For example:
4907 HTML.with_charset "utf-8" use_thy "Hebrew";
4908 HTML.with_charset "utf-8" use_thy "Chinese";
4913 * Allow symlinks to all proper Isabelle executables (Isabelle,
4914 isabelle, isatool etc.).
4916 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4917 isatool doc, isatool mkdir, display_drafts etc.).
4919 * isatool usedir: option -f allows specification of the ML file to be
4920 used by Isabelle; default is ROOT.ML.
4922 * New isatool version outputs the version identifier of the Isabelle
4923 distribution being used.
4925 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4926 (containing Boolean satisfiability problems) into Isabelle/HOL
4931 New in Isabelle2004 (April 2004)
4932 --------------------------------
4936 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4937 Replaces linorder.ML.
4939 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4940 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4941 (\<a>...\<z>), are now considered normal letters, and can therefore
4942 be used anywhere where an ASCII letter (a...zA...Z) has until
4943 now. COMPATIBILITY: This obviously changes the parsing of some
4944 terms, especially where a symbol has been used as a binder, say
4945 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4946 as an identifier. Fix it by inserting a space around former
4947 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4948 existing theory and ML files.
4950 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4952 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4953 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4954 a normal (but invisible) letter. For multiple letter subscripts repeat
4955 \<^isub> like this: x\<^isub>1\<^isub>2.
4957 * Pure: There are now sub-/superscripts that can span more than one
4958 character. Text between \<^bsub> and \<^esub> is set in subscript in
4959 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4960 superscript. The new control characters are not identifier parts.
4962 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4963 content of "..." to the latex file instead of \isacntrl... . The "..."
4964 may consist of any printable characters excluding the end bracket >.
4966 * Pure: Using new Isar command "finalconsts" (or the ML functions
4967 Theory.add_finals or Theory.add_finals_i) it is now possible to
4968 declare constants "final", which prevents their being given a definition
4969 later. It is useful for constants whose behaviour is fixed axiomatically
4970 rather than definitionally, such as the meta-logic connectives.
4972 * Pure: 'instance' now handles general arities with general sorts
4973 (i.e. intersections of classes),
4975 * Presentation: generated HTML now uses a CSS style sheet to make layout
4976 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4977 It can be changed to alter the colors/layout of generated pages.
4982 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4983 cut_tac, subgoal_tac and thin_tac:
4984 - Now understand static (Isar) contexts. As a consequence, users of Isar
4985 locales are no longer forced to write Isar proof scripts.
4986 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4988 - INCOMPATIBILITY: names of variables to be instantiated may no
4989 longer be enclosed in quotes. Instead, precede variable name with `?'.
4990 This is consistent with the instantiation attribute "where".
4992 * Attributes "where" and "of":
4993 - Now take type variables of instantiated theorem into account when reading
4994 the instantiation string. This fixes a bug that caused instantiated
4995 theorems to have too special types in some circumstances.
4996 - "where" permits explicit instantiations of type variables.
4998 * Calculation commands "moreover" and "also" no longer interfere with
4999 current facts ("this"), admitting arbitrary combinations with "then"
5003 - Goal statements involving the context element "includes" no longer
5004 generate theorems with internal delta predicates (those ending on
5005 "_axioms") in the premise.
5006 Resolve particular premise with <locale>.intro to obtain old form.
5007 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
5008 specification and "includes" elements in goal statement.
5009 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
5010 [intro?] and [elim?] (respectively) by default.
5011 - Experimental command for instantiation of locales in proof contexts:
5012 instantiate <label>[<attrs>]: <loc>
5013 Instantiates locale <loc> and adds all its theorems to the current context
5014 taking into account their attributes. Label and attrs are optional
5015 modifiers, like in theorem declarations. If present, names of
5016 instantiated theorems are qualified with <label>, and the attributes
5017 <attrs> are applied after any attributes these theorems might have already.
5018 If the locale has assumptions, a chained fact of the form
5019 "<loc> t1 ... tn" is expected from which instantiations of the parameters
5020 are derived. The command does not support old-style locales declared
5021 with "locale (open)".
5022 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
5024 * HOL: Tactic emulation methods induct_tac and case_tac understand static
5030 * Proof import: new image HOL4 contains the imported library from
5031 the HOL4 system with about 2500 theorems. It is imported by
5032 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
5033 can be used like any other Isabelle image. See
5034 HOL/Import/HOL/README for more information.
5037 - Much improved handling of linear and partial orders.
5038 Reasoners for linear and partial orders are set up for type classes
5039 "linorder" and "order" respectively, and are added to the default simpset
5040 as solvers. This means that the simplifier can build transitivity chains
5041 to solve goals from the assumptions.
5042 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
5043 of blast or auto after simplification become unnecessary because the goal
5044 is solved by simplification already.
5046 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
5047 all proved in axiomatic type classes for semirings, rings and fields.
5050 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
5051 now formalized using the Ring_and_Field theory mentioned above.
5052 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
5053 than before, because now they are set up once in a generic manner.
5054 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
5055 Look for the general versions in Ring_and_Field (and Power if they concern
5058 * Type "rat" of the rational numbers is now available in HOL-Complex.
5061 - Record types are now by default printed with their type abbreviation
5062 instead of the list of all field types. This can be configured via
5063 the reference "print_record_type_abbr".
5064 - Simproc "record_upd_simproc" for simplification of multiple updates added
5065 (not enabled by default).
5066 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
5067 EX x. x = sel r to True (not enabled by default).
5068 - Tactic "record_split_simp_tac" to split and simplify records added.
5070 * 'specification' command added, allowing for definition by
5071 specification. There is also an 'ax_specification' command that
5072 introduces the new constants axiomatically.
5074 * arith(_tac) is now able to generate counterexamples for reals as well.
5076 * HOL-Algebra: new locale "ring" for non-commutative rings.
5078 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
5079 definitions, thanks to Sava Krsti\'{c} and John Matthews.
5081 * HOL-Matrix: a first theory for matrices in HOL with an application of
5082 matrix theory to linear programming.
5084 * Unions and Intersections:
5085 The latex output syntax of UN and INT has been changed
5086 from "\Union x \in A. B" to "\Union_{x \in A} B"
5087 i.e. the index formulae has become a subscript.
5088 Similarly for "\Union x. B", and for \Inter instead of \Union.
5090 * Unions and Intersections over Intervals:
5091 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
5092 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
5093 like in normal math, and corresponding versions for < and for intersection.
5095 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
5096 lexicographic dictonary ordering has been added as "lexord".
5098 * ML: the legacy theory structures Int and List have been removed. They had
5099 conflicted with ML Basis Library structures having the same names.
5101 * 'refute' command added to search for (finite) countermodels. Only works
5102 for a fragment of HOL. The installation of an external SAT solver is
5103 highly recommended. See "HOL/Refute.thy" for details.
5105 * 'quickcheck' command: Allows to find counterexamples by evaluating
5106 formulae under an assignment of free variables to random values.
5107 In contrast to 'refute', it can deal with inductive datatypes,
5108 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5114 * Streams now come with concatenation and are part of the HOLCF image
5118 New in Isabelle2003 (May 2003)
5119 ------------------------------
5123 * Provers/simplifier:
5125 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5126 Assumptions are now subject to complete mutual simplification,
5127 not just from left to right. The simplifier now preserves
5128 the order of assumptions.
5130 Potential INCOMPATIBILITY:
5132 -- simp sometimes diverges where the old version did
5133 not, e.g. invoking simp on the goal
5135 [| P (f x); y = x; f x = f y |] ==> Q
5137 now gives rise to the infinite reduction sequence
5139 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5141 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5144 -- Tactics combining classical reasoner and simplification (such as auto)
5145 are also affected by this change, because many of them rely on
5146 simp. They may sometimes diverge as well or yield a different numbers
5147 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5148 in case of problems. Sometimes subsequent calls to the classical
5149 reasoner will fail because a preceeding call to the simplifier too
5150 eagerly simplified the goal, e.g. deleted redundant premises.
5152 - The simplifier trace now shows the names of the applied rewrite rules
5154 - You can limit the number of recursive invocations of the simplifier
5155 during conditional rewriting (where the simplifie tries to solve the
5156 conditions before applying the rewrite rule):
5157 ML "simp_depth_limit := n"
5158 where n is an integer. Thus you can force termination where previously
5159 the simplifier would diverge.
5161 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5163 - No longer aborts on failed congruence proof. Instead, the
5164 congruence is ignored.
5166 * Pure: New generic framework for extracting programs from constructive
5167 proofs. See HOL/Extraction.thy for an example instantiation, as well
5168 as HOL/Extraction for some case studies.
5170 * Pure: The main goal of the proof state is no longer shown by default, only
5171 the subgoals. This behaviour is controlled by a new flag.
5172 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5173 (ML: Proof.show_main_goal).
5175 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5176 rules whose conclusion matches subgoal 1:
5177 PG menu: Isabelle/Isar -> Show me -> matching rules
5178 The rules are ordered by how closely they match the subgoal.
5179 In particular, rules that solve a subgoal outright are displayed first
5180 (or rather last, the way they are printed).
5181 (ML: ProofGeneral.print_intros())
5183 * Pure: New flag trace_unify_fail causes unification to print
5184 diagnostic information (PG: in trace buffer) when it fails. This is
5185 useful for figuring out why single step proofs like rule, erule or
5188 * Pure: Locale specifications now produce predicate definitions
5189 according to the body of text (covering assumptions modulo local
5190 definitions); predicate "loc_axioms" covers newly introduced text,
5191 while "loc" is cumulative wrt. all included locale expressions; the
5192 latter view is presented only on export into the global theory
5193 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5194 on the old view without predicates;
5196 * Pure: predefined locales "var" and "struct" are useful for sharing
5197 parameters (as in CASL, for example); just specify something like
5198 ``var x + var y + struct M'' as import;
5200 * Pure: improved thms_containing: proper indexing of facts instead of
5201 raw theorems; check validity of results wrt. current name space;
5202 include local facts of proof configuration (also covers active
5203 locales), cover fixed variables in index; may use "_" in term
5204 specification; an optional limit for the number of printed facts may
5205 be given (the default is 40);
5207 * Pure: disallow duplicate fact bindings within new-style theory files
5210 * Provers: improved induct method: assumptions introduced by case
5211 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5212 the goal statement); "foo" still refers to all facts collectively;
5214 * Provers: the function blast.overloaded has been removed: all constants
5215 are regarded as potentially overloaded, which improves robustness in exchange
5216 for slight decrease in efficiency;
5218 * Provers/linorder: New generic prover for transitivity reasoning over
5219 linear orders. Note: this prover is not efficient!
5221 * Isar: preview of problems to finish 'show' now produce an error
5222 rather than just a warning (in interactive mode);
5229 - Produces a counter example if it cannot prove a goal.
5230 Note that the counter example may be spurious if the goal is not a formula
5231 of quantifier-free linear arithmetic.
5232 In ProofGeneral the counter example appears in the trace buffer.
5234 - Knows about div k and mod k where k is a numeral of type nat or int.
5236 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5237 linear arithmetic fails. This takes account of quantifiers and divisibility.
5238 Presburger arithmetic can also be called explicitly via presburger(_tac).
5240 * simp's arithmetic capabilities have been enhanced a bit: it now
5241 takes ~= in premises into account (by performing a case split);
5243 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5244 are distributed over a sum of terms;
5246 * New tactic "trans_tac" and method "trans" instantiate
5247 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5250 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5251 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5253 * 'typedef' command has new option "open" to suppress the set
5256 * functions Min and Max on finite sets have been introduced (theory
5259 * attribute [symmetric] now works for relations as well; it turns
5260 (x,y) : R^-1 into (y,x) : R, and vice versa;
5262 * induct over a !!-quantified statement (say !!x1..xn):
5263 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5265 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5266 %x. None. Warning: empty_def now refers to the previously hidden definition
5269 * Algebra: formalization of classical algebra. Intended as base for
5270 any algebraic development in Isabelle. Currently covers group theory
5271 (up to Sylow's theorem) and ring theory (Universal Property of
5272 Univariate Polynomials). Contributions welcome;
5274 * GroupTheory: deleted, since its material has been moved to Algebra;
5276 * Complex: new directory of the complex numbers with numeric constants,
5277 nonstandard complex numbers, and some complex analysis, standard and
5278 nonstandard (Jacques Fleuriot);
5280 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5282 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5285 * Real/HahnBanach: updated and adapted to locales;
5287 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5290 * UNITY: added the Meier-Sanders theory of progress sets;
5292 * MicroJava: bytecode verifier and lightweight bytecode verifier
5293 as abstract algorithms, instantiated to the JVM;
5295 * Bali: Java source language formalization. Type system, operational
5296 semantics, axiomatic semantics. Supported language features:
5297 classes, interfaces, objects,virtual methods, static methods,
5298 static/instance fields, arrays, access modifiers, definite
5299 assignment, exceptions.
5304 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5307 * Main ZF: virtually all theories converted to new-style format;
5312 * Pure: Tactic.prove provides sane interface for internal proofs;
5313 omits the infamous "standard" operation, so this is more appropriate
5314 than prove_goalw_cterm in many situations (e.g. in simprocs);
5316 * Pure: improved error reporting of simprocs;
5318 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5322 *** Document preparation ***
5324 * uses \par instead of \\ for line breaks in theory text. This may
5325 shift some page breaks in large documents. To get the old behaviour
5326 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5328 * minimized dependencies of isabelle.sty and isabellesym.sty on
5331 * \<euro> now needs package babel/greek instead of marvosym (which
5334 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5339 New in Isabelle2002 (March 2002)
5340 --------------------------------
5342 *** Document preparation ***
5344 * greatly simplified document preparation setup, including more
5345 graceful interpretation of isatool usedir -i/-d/-D options, and more
5346 instructive isatool mkdir; users should basically be able to get
5347 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5348 users may run a separate document processing stage manually like this:
5349 "isatool usedir -D output HOL Test && isatool document Test/output";
5351 * theory dependency graph may now be incorporated into documents;
5352 isatool usedir -g true will produce session_graph.eps/.pdf for use
5353 with \includegraphics of LaTeX;
5355 * proper spacing of consecutive markup elements, especially text
5356 blocks after section headings;
5358 * support bold style (for single symbols only), input syntax is like
5359 this: "\<^bold>\<alpha>" or "\<^bold>A";
5361 * \<bullet> is now output as bold \cdot by default, which looks much
5362 better in printed text;
5364 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5365 note that these symbols are currently unavailable in Proof General /
5366 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5368 * isatool latex no longer depends on changed TEXINPUTS, instead
5369 isatool document copies the Isabelle style files to the target
5375 * Pure/Provers: improved proof by cases and induction;
5376 - 'case' command admits impromptu naming of parameters (such as
5378 - 'induct' method divinates rule instantiation from the inductive
5379 claim; no longer requires excessive ?P bindings for proper
5380 instantiation of cases;
5381 - 'induct' method properly enumerates all possibilities of set/type
5382 rules; as a consequence facts may be also passed through *type*
5383 rules without further ado;
5384 - 'induct' method now derives symbolic cases from the *rulified*
5385 rule (before it used to rulify cases stemming from the internal
5386 atomized version); this means that the context of a non-atomic
5387 statement becomes is included in the hypothesis, avoiding the
5388 slightly cumbersome show "PROP ?case" form;
5389 - 'induct' may now use elim-style induction rules without chaining
5390 facts, using ``missing'' premises from the goal state; this allows
5391 rules stemming from inductive sets to be applied in unstructured
5392 scripts, while still benefitting from proper handling of non-atomic
5393 statements; NB: major inductive premises need to be put first, all
5394 the rest of the goal is passed through the induction;
5395 - 'induct' proper support for mutual induction involving non-atomic
5396 rule statements (uses the new concept of simultaneous goals, see
5398 - append all possible rule selections, but only use the first
5399 success (no backtracking);
5400 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5401 - undeclared rule case names default to numbers 1, 2, 3, ...;
5402 - added 'print_induct_rules' (covered by help item in recent Proof
5404 - moved induct/cases attributes to Pure, methods to Provers;
5405 - generic method setup instantiated for FOL and HOL;
5407 * Pure: support multiple simultaneous goal statements, for example
5408 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5409 meta-level mechanism, this acts as if several individual goals had
5410 been stated separately; in particular common proof methods need to be
5411 repeated in order to cover all claims; note that a single elimination
5412 step is *not* sufficient to establish the two conjunctions, so this
5415 assume "A & B" then have A and B .. (*".." fails*)
5417 better use "obtain" in situations as above; alternative refer to
5418 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5420 * Pure: proper integration with ``locales''; unlike the original
5421 version by Florian Kammller, Isar locales package high-level proof
5422 contexts rather than raw logical ones (e.g. we admit to include
5423 attributes everywhere); operations on locales include merge and
5424 rename; support for implicit arguments (``structures''); simultaneous
5425 type-inference over imports and text; see also HOL/ex/Locales.thy for
5428 * Pure: the following commands have been ``localized'', supporting a
5429 target locale specification "(in name)": 'lemma', 'theorem',
5430 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5431 stored both within the locale and at the theory level (exported and
5432 qualified by the locale name);
5434 * Pure: theory goals may now be specified in ``long'' form, with
5435 ad-hoc contexts consisting of arbitrary locale elements. for example
5436 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5437 definitions may be given, too); the result is a meta-level rule with
5438 the context elements being discharged in the obvious way;
5440 * Pure: new proof command 'using' allows to augment currently used
5441 facts after a goal statement ('using' is syntactically analogous to
5442 'apply', but acts on the goal's facts only); this allows chained facts
5443 to be separated into parts given before and after a claim, as in
5444 ``from a and b have C using d and e <proof>'';
5446 * Pure: renamed "antecedent" case to "rule_context";
5448 * Pure: new 'judgment' command records explicit information about the
5449 object-logic embedding (used by several tools internally); no longer
5450 use hard-wired "Trueprop";
5452 * Pure: added 'corollary' command;
5454 * Pure: fixed 'token_translation' command;
5456 * Pure: removed obsolete 'exported' attribute;
5458 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5459 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5460 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5462 * Pure: method 'atomize' presents local goal premises as object-level
5463 statements (atomic meta-level propositions); setup controlled via
5464 rewrite rules declarations of 'atomize' attribute; example
5465 application: 'induct' method with proper rule statements in improper
5468 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5469 now consider the syntactic context of assumptions, giving a better
5470 chance to get type-inference of the arguments right (this is
5471 especially important for locales);
5473 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5476 * Pure/obtain: the formal conclusion "thesis", being marked as
5477 ``internal'', may no longer be reference directly in the text;
5478 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5481 * Pure: generic 'sym' attribute which declares a rule both as pure
5482 'elim?' and for the 'symmetric' operation;
5484 * Pure: marginal comments ``--'' may now occur just anywhere in the
5485 text; the fixed correlation with particular command syntax has been
5488 * Pure: new method 'rules' is particularly well-suited for proof
5489 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5490 but often produces more compact proof terms with less detours;
5492 * Pure/Provers/classical: simplified integration with pure rule
5493 attributes and methods; the classical "intro?/elim?/dest?"
5494 declarations coincide with the pure ones; the "rule" method no longer
5495 includes classically swapped intros; "intro" and "elim" methods no
5496 longer pick rules from the context; also got rid of ML declarations
5497 AddXIs/AddXEs/AddXDs; all of this has some potential for
5500 * Provers/classical: attribute 'swapped' produces classical inversions
5501 of introduction rules;
5503 * Provers/simplifier: 'simplified' attribute may refer to explicit
5504 rules instead of full simplifier context; 'iff' attribute handles
5507 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5509 * HOL: 'recdef' now fails on unfinished automated proofs, use
5510 "(permissive)" option to recover old behavior;
5512 * HOL: 'inductive' no longer features separate (collective) attributes
5513 for 'intros' (was found too confusing);
5515 * HOL: properly declared induction rules less_induct and
5521 * HOL: moved over to sane numeral syntax; the new policy is as
5524 - 0 and 1 are polymorphic constants, which are defined on any
5525 numeric type (nat, int, real etc.);
5527 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5528 binary representation internally;
5530 - type nat has special constructor Suc, and generally prefers Suc 0
5531 over 1::nat and Suc (Suc 0) over 2::nat;
5533 This change may cause significant problems of INCOMPATIBILITY; here
5534 are some hints on converting existing sources:
5536 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5537 entities, so expressions involving "-" (unary or binary minus) need
5538 to be spaced properly;
5540 - existing occurrences of "1" may need to be constraint "1::nat" or
5541 even replaced by Suc 0; similar for old "2";
5543 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5545 - remove all special provisions on numerals in proofs;
5547 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5548 representation (depends on bin_arith_simps in the default context);
5550 * HOL: symbolic syntax for x^2 (numeral 2);
5552 * HOL: the class of all HOL types is now called "type" rather than
5553 "term"; INCOMPATIBILITY, need to adapt references to this type class
5554 in axclass/classes, instance/arities, and (usually rare) occurrences
5555 in typings (of consts etc.); internally the class is called
5556 "HOL.type", ML programs should refer to HOLogic.typeS;
5558 * HOL/record package improvements:
5559 - new derived operations "fields" to build a partial record section,
5560 "extend" to promote a fixed record to a record scheme, and
5561 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5562 declared as simp by default;
5563 - shared operations ("more", "fields", etc.) now need to be always
5564 qualified) --- potential INCOMPATIBILITY;
5565 - removed "make_scheme" operations (use "make" with "extend") --
5567 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5568 - provides cases/induct rules for use with corresponding Isar
5569 methods (for concrete records, record schemes, concrete more
5570 parts, and schematic more parts -- in that order);
5571 - internal definitions directly based on a light-weight abstract
5572 theory of product types over typedef rather than datatype;
5574 * HOL: generic code generator for generating executable ML code from
5575 specifications; specific support for HOL constructs such as inductive
5576 datatypes and sets, as well as recursive functions; can be invoked
5577 via 'generate_code' theory section;
5579 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5581 * HOL: consolidated and renamed several theories. In particular:
5582 Ord.thy has been absorbed into HOL.thy
5583 String.thy has been absorbed into List.thy
5585 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5586 (beware of argument permutation!);
5588 * HOL: linorder_less_split superseded by linorder_cases;
5590 * HOL/List: "nodups" renamed to "distinct";
5592 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5593 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5594 - Ex_def has changed, now need to use some_eq_ex
5596 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5597 in this (rare) case use:
5599 delSWrapper "split_all_tac"
5600 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5602 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5605 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5606 Isabelle's type classes, ^ on functions and relations has too general
5607 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5608 necessary to attach explicit type constraints;
5610 * HOL/Relation: the prefix name of the infix "O" has been changed from
5611 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5612 renamed accordingly (eg "compI" -> "rel_compI").
5614 * HOL: syntax translations now work properly with numerals and records
5617 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5618 of "lam" -- INCOMPATIBILITY;
5620 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5621 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5622 renamed "Product_Type.unit";
5624 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5626 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5627 the "cases" method);
5629 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5632 * HOL/IMP: updated and converted to new-style theory format; several
5633 parts turned into readable document, with proper Isar proof texts and
5634 some explanations (by Gerwin Klein);
5636 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5638 * HOL-Hyperreal is now a logic image;
5643 * Isar: consts/constdefs supports mixfix syntax for continuous
5646 * Isar: domain package adapted to new-style theory format, e.g. see
5649 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5650 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5651 lift.induct_tac, always use UU instead of Undef;
5653 * HOLCF/IMP: updated and converted to new-style theory;
5658 * Isar: proper integration of logic-specific tools and packages,
5659 including theory commands '(co)inductive', '(co)datatype',
5660 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5661 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5663 * theory Main no longer includes AC; for the Axiom of Choice, base
5664 your theory on Main_ZFC;
5666 * the integer library now covers quotients and remainders, with many
5667 laws relating division to addition, multiplication, etc.;
5669 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5670 typeless version of the formalism;
5672 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5675 * ZF/Induct: new directory for examples of inductive definitions,
5676 including theory Multiset for multiset orderings; converted to
5677 new-style theory format;
5679 * ZF: many new theorems about lists, ordinals, etc.;
5684 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5685 variable proof controls level of detail: 0 = no proofs (only oracle
5686 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5687 also ref manual for further ML interfaces;
5689 * Pure/axclass: removed obsolete ML interface
5690 goal_subclass/goal_arity;
5692 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5693 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5694 separate tokens, so expressions involving minus need to be spaced
5697 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5698 rather than "infixl" or "infixr";
5700 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5701 sort constraint specifications in type inference; e.g. "x::_::foo"
5702 ensures that the type of "x" is of sort "foo" (but not necessarily a
5705 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5706 control output of nested => (types); the default behavior is
5709 * Pure/syntax: builtin parse translation for "_constify" turns valued
5710 tokens into AST constants;
5712 * Pure/syntax: prefer later declarations of translations and print
5713 translation functions; potential INCOMPATIBILITY: need to reverse
5714 multiple declarations for same syntax element constant;
5716 * Pure/show_hyps reset by default (in accordance to existing Isar
5719 * Provers/classical: renamed addaltern to addafter, addSaltern to
5722 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5725 * system: tested support for MacOS X; should be able to get Isabelle +
5726 Proof General to work in a plain Terminal after installing Poly/ML
5727 (e.g. from the Isabelle distribution area) and GNU bash alone
5728 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5729 support requires further installations, e.g. from
5730 http://fink.sourceforge.net/);
5732 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5734 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5735 of 40 MB), cf. ML_OPTIONS;
5737 * system: Proof General keywords specification is now part of the
5738 Isabelle distribution (see etc/isar-keywords.el);
5740 * system: support for persistent Proof General sessions (refrain from
5741 outdating all loaded theories on startup); user may create writable
5742 logic images like this: ``isabelle -q HOL Test'';
5744 * system: smart selection of Isabelle process versus Isabelle
5745 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5746 run both "isabelle" and "Isabelle" even if file names are badly
5747 damaged (executable inspects the case of the first letter of its own
5748 name); added separate "isabelle-process" and "isabelle-interface";
5750 * system: refrain from any attempt at filtering input streams; no
5751 longer support ``8bit'' encoding of old isabelle font, instead proper
5752 iso-latin characters may now be used; the related isatools
5753 "symbolinput" and "nonascii" have disappeared as well;
5755 * system: removed old "xterm" interface (the print modes "xterm" and
5756 "xterm_color" are still available for direct use in a suitable
5761 New in Isabelle99-2 (February 2001)
5762 -----------------------------------
5764 *** Overview of INCOMPATIBILITIES ***
5766 * HOL: please note that theories in the Library and elsewhere often use the
5767 new-style (Isar) format; to refer to their theorems in an ML script you must
5768 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5770 * HOL: inductive package no longer splits induction rule aggressively,
5771 but only as far as specified by the introductions given; the old
5772 format may be recovered via ML function complete_split_rule or attribute
5773 'split_rule (complete)';
5775 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5776 gfp_Tarski to gfp_unfold;
5778 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5780 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5781 relation); infix "^^" has been renamed "``"; infix "``" has been
5782 renamed "`"; "univalent" has been renamed "single_valued";
5784 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5787 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5789 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5791 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5792 consequence, it is no longer monotonic wrt. the local goal context
5793 (which is now passed through the inductive cases);
5795 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5796 \<gg> to \<ggreater>;
5799 *** Document preparation ***
5801 * \isabellestyle{NAME} selects version of Isabelle output (currently
5802 available: are "it" for near math-mode best-style output, "sl" for
5803 slanted text style, and "tt" for plain type-writer; if no
5804 \isabellestyle command is given, output is according to slanted
5807 * support sub/super scripts (for single symbols only), input syntax is
5808 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5810 * some more standard symbols; see Appendix A of the system manual for
5811 the complete list of symbols defined in isabellesym.sty;
5813 * improved isabelle style files; more abstract symbol implementation
5814 (should now use \isamath{...} and \isatext{...} in custom symbol
5817 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5818 state; Note that presentation of goal states does not conform to
5819 actual human-readable proof documents. Please do not include goal
5820 states into document output unless you really know what you are doing!
5822 * proper indentation of antiquoted output with proportional LaTeX
5825 * no_document ML operator temporarily disables LaTeX document
5828 * isatool unsymbolize tunes sources for plain ASCII communication;
5833 * Pure: Isar now suffers initial goal statements to contain unbound
5834 schematic variables (this does not conform to actual readable proof
5835 documents, due to unpredictable outcome and non-compositional proof
5836 checking); users who know what they are doing may use schematic goals
5837 for Prolog-style synthesis of proven results;
5839 * Pure: assumption method (an implicit finishing) now handles actual
5842 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5843 initial goal, declare "that" only as Pure intro (only for single
5844 steps); the "that" rule assumption may now be involved in implicit
5845 finishing, thus ".." becomes a feasible for trivial obtains;
5847 * Pure: default proof step now includes 'intro_classes'; thus trivial
5848 instance proofs may be performed by "..";
5850 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5853 * Pure: more robust selection of calculational rules;
5855 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5856 rule (as well as the assumption rule);
5858 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5859 lemmas, using the graph browser tool;
5861 * Pure: predict failure of "show" in interactive mode;
5863 * Pure: 'thms_containing' now takes actual terms as arguments;
5865 * HOL: improved method 'induct' --- now handles non-atomic goals
5866 (potential INCOMPATIBILITY); tuned error handling;
5868 * HOL: cases and induct rules now provide explicit hints about the
5869 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5870 any remaining facts are inserted into the goal verbatim;
5872 * HOL: local contexts (aka cases) may now contain term bindings as
5873 well; the 'cases' and 'induct' methods new provide a ?case binding for
5874 the result to be shown in each case;
5876 * HOL: added 'recdef_tc' command;
5878 * isatool convert assists in eliminating legacy ML scripts;
5883 * HOL/Library: a collection of generic theories to be used together
5884 with main HOL; the theory loader path already includes this directory
5885 by default; the following existing theories have been moved here:
5886 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5887 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5889 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5890 modelling and verification task performed in Isabelle/HOL +
5891 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5893 * HOL/Algebra: special summation operator SUM no longer exists, it has
5894 been replaced by setsum; infix 'assoc' now has priority 50 (like
5895 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5896 'domain', this makes the theory consistent with mathematical
5899 * HOL basics: added overloaded operations "inverse" and "divide"
5900 (infix "/"), syntax for generic "abs" operation, generic summation
5903 * HOL/typedef: simplified package, provide more useful rules (see also
5906 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5907 now expressed as a proper nested rule (old-style tactic scripts may
5908 require atomize_strip_tac to cope with non-atomic premises);
5910 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5911 to "split_conv" (old name still available for compatibility);
5913 * HOL: improved concrete syntax for strings (e.g. allows translation
5914 rules with string literals);
5916 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5917 and Fleuriot's mechanization of analysis, including the transcendental
5918 functions for the reals;
5920 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5925 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5926 "lam" is displayed as TWO lambda-symbols
5928 * CTT: theory Main now available, containing everything (that is, Bool
5934 * Pure: the Simplifier has been implemented properly as a derived rule
5935 outside of the actual kernel (at last!); the overall performance
5936 penalty in practical applications is about 50%, while reliability of
5937 the Isabelle inference kernel has been greatly improved;
5939 * print modes "brackets" and "no_brackets" control output of nested =>
5940 (types) and ==> (props); the default behaviour is "brackets";
5942 * Provers: fast_tac (and friends) now handle actual object-logic rules
5943 as assumptions as well;
5945 * system: support Poly/ML 4.0;
5947 * system: isatool install handles KDE version 1 or 2;
5951 New in Isabelle99-1 (October 2000)
5952 ----------------------------------
5954 *** Overview of INCOMPATIBILITIES ***
5956 * HOL: simplification of natural numbers is much changed; to partly
5957 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5958 issue the following ML commands:
5960 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5961 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5963 * HOL: simplification no longer dives into case-expressions; this is
5964 controlled by "t.weak_case_cong" for each datatype t;
5966 * HOL: nat_less_induct renamed to less_induct;
5968 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5969 fixsome to patch .thy and .ML sources automatically;
5971 select_equality -> some_equality
5972 select_eq_Ex -> some_eq_ex
5973 selectI2EX -> someI2_ex
5976 select1_equality -> some1_equality
5977 Eps_sym_eq -> some_sym_eq_trivial
5978 Eps_eq -> some_eq_trivial
5980 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5982 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5985 * HOL: the recursion equations generated by 'recdef' are now called
5986 f.simps instead of f.rules;
5988 * HOL: qed_spec_mp now also handles bounded ALL as well;
5990 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5991 sometimes be needed;
5993 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5995 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5997 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5998 product is now "<*>" instead of "Times"; the lexicographic product is
5999 now "<*lex*>" instead of "**";
6001 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
6002 of main HOL, but was unused); better use HOL's datatype package;
6004 * HOL: removed "symbols" syntax for constant "override" of theory Map;
6005 the old syntax may be recovered as follows:
6008 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
6009 (infixl "\\<oplus>" 100)
6011 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6013 * HOL/ML: even fewer consts are declared as global (see theories Ord,
6014 Lfp, Gfp, WF); this only affects ML packages that refer to const names
6017 * HOL and ZF: syntax for quotienting wrt an equivalence relation
6018 changed from A/r to A//r;
6020 * ZF: new treatment of arithmetic (nat & int) may break some old
6023 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
6024 rulify -> rule_format, elimify -> elim_format, ...);
6026 * Isar/Provers: intro/elim/dest attributes changed; renamed
6027 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
6028 should have to change intro!! to intro? only); replaced "delrule" by
6031 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
6033 * Provers: strengthened force_tac by using new first_best_tac;
6035 * LaTeX document preparation: several changes of isabelle.sty (see
6039 *** Document preparation ***
6041 * formal comments (text blocks etc.) in new-style theories may now
6042 contain antiquotations of thm/prop/term/typ/text to be presented
6043 according to latex print mode; concrete syntax is like this:
6044 @{term[show_types] "f(x) = a + x"};
6046 * isatool mkdir provides easy setup of Isabelle session directories,
6047 including proper document sources;
6049 * generated LaTeX sources are now deleted after successful run
6050 (isatool document -c); may retain a copy somewhere else via -D option
6053 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
6054 style files, achieving self-contained LaTeX sources and simplifying
6057 * old-style theories now produce (crude) LaTeX output as well;
6059 * browser info session directories are now self-contained (may be put
6060 on WWW server seperately); improved graphs of nested sessions; removed
6061 graph for 'all sessions';
6063 * several improvements in isabelle style files; \isabellestyle{it}
6064 produces fake math mode output; \isamarkupheader is now \section by
6065 default; see lib/texinputs/isabelle.sty etc.;
6070 * Isar/Pure: local results and corresponding term bindings are now
6071 subject to Hindley-Milner polymorphism (similar to ML); this
6072 accommodates incremental type-inference very nicely;
6074 * Isar/Pure: new derived language element 'obtain' supports
6075 generalized existence reasoning;
6077 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
6078 support accumulation of results, without applying any rules yet;
6079 useful to collect intermediate results without explicit name
6080 references, and for use with transitivity rules with more than 2
6083 * Isar/Pure: scalable support for case-analysis type proofs: new
6084 'case' language element refers to local contexts symbolically, as
6085 produced by certain proof methods; internally, case names are attached
6086 to theorems as "tags";
6088 * Isar/Pure: theory command 'hide' removes declarations from
6089 class/type/const name spaces;
6091 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
6092 indicate potential overloading;
6094 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
6096 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
6097 "{a,b,c}" instead of {a,b,c};
6099 * Isar/Pure now provides its own version of intro/elim/dest
6100 attributes; useful for building new logics, but beware of confusion
6101 with the version in Provers/classical;
6103 * Isar/Pure: the local context of (non-atomic) goals is provided via
6104 case name 'antecedent';
6106 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6107 to the current context is now done automatically);
6109 * Isar/Pure: theory command 'method_setup' provides a simple interface
6110 for definining proof methods in ML;
6112 * Isar/Provers: intro/elim/dest attributes changed; renamed
6113 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6114 most cases, one should have to change intro!! to intro? only);
6115 replaced "delrule" by "rule del";
6117 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6118 'symmetric' attribute (the latter supercedes [RS sym]);
6120 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6121 method modifier); 'simp' method: 'only:' modifier removes loopers as
6122 well (including splits);
6124 * Isar/Provers: Simplifier and Classical methods now support all kind
6125 of modifiers used in the past, including 'cong', 'iff', etc.
6127 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6128 of Simplifier and Classical reasoner);
6130 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6131 now support named cases; major packages (inductive, datatype, primrec,
6132 recdef) support case names and properly name parameters;
6134 * Isar/HOL: new transitivity rules for substitution in inequalities --
6135 monotonicity conditions are extracted to be proven at end of
6138 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6141 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6142 split_if split_if_asm; datatype package provides theorems foo.splits =
6143 foo.split foo.split_asm for each datatype;
6145 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6146 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6147 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6148 use "(cases (simplified))" method in proper proof texts);
6150 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6152 * Isar: names of theorems etc. may be natural numbers as well;
6154 * Isar: 'pr' command: optional arguments for goals_limit and
6155 ProofContext.prems_limit; no longer prints theory contexts, but only
6158 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6159 additional print modes to be specified; e.g. "pr(latex)" will print
6160 proof state according to the Isabelle LaTeX style;
6162 * Isar: improved support for emulating tactic scripts, including proof
6163 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6164 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6165 (for HOL datatypes);
6167 * Isar: simplified (more robust) goal selection of proof methods: 1st
6168 goal, all goals, or explicit goal specifier (tactic emulation); thus
6169 'proof method scripts' have to be in depth-first order;
6171 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6173 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6174 should instead use individual commands for printing items
6175 (print_commands, print_methods etc.);
6177 * Isar: added 'nothing' --- the empty list of theorems;
6182 * HOL/MicroJava: formalization of a fragment of Java, together with a
6183 corresponding virtual machine and a specification of its bytecode
6184 verifier and a lightweight bytecode verifier, including proofs of
6185 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6186 Cornelia Pusch (see also the homepage of project Bali at
6187 http://isabelle.in.tum.de/Bali/);
6189 * HOL/Algebra: new theory of rings and univariate polynomials, by
6192 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6193 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6196 * HOL/Lattice: fundamental concepts of lattice theory and order
6197 structures, including duals, properties of bounds versus algebraic
6198 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6199 Theorem for complete lattices etc.; may also serve as a demonstration
6200 for abstract algebraic reasoning using axiomatic type classes, and
6201 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6203 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6206 * HOL/IMPP: extension of IMP with local variables and mutually
6207 recursive procedures, by David von Oheimb;
6209 * HOL/Lambda: converted into new-style theory and document;
6211 * HOL/ex/Multiquote: example of multiple nested quotations and
6212 anti-quotations -- basically a generalized version of de-Bruijn
6213 representation; very useful in avoiding lifting of operations;
6215 * HOL/record: added general record equality rule to simpset; fixed
6216 select-update simplification procedure to handle extended records as
6217 well; admit "r" as field name;
6219 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6220 other numeric types and also as the identity of groups, rings, etc.;
6222 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6223 Types nat and int belong to this axclass;
6225 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6226 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6227 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6228 two terms #m*u and #n*u are replaced by #(m+n)*u
6229 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6230 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6231 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6233 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6234 powerful prover for predicate logic but knows nothing of clasets; see
6235 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6237 * HOL: new version of "case_tac" subsumes both boolean case split and
6238 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6239 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6241 * HOL: simplification no longer dives into case-expressions: only the
6242 selector expression is simplified, but not the remaining arms; to
6243 enable full simplification of case-expressions for datatype t, you may
6244 remove t.weak_case_cong from the simpset, either globally (Delcongs
6245 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6247 * HOL/recdef: the recursion equations generated by 'recdef' for
6248 function 'f' are now called f.simps instead of f.rules; if all
6249 termination conditions are proved automatically, these simplification
6250 rules are added to the simpset, as in primrec; rules may be named
6251 individually as well, resulting in a separate list of theorems for
6254 * HOL/While is a new theory that provides a while-combinator. It
6255 permits the definition of tail-recursive functions without the
6256 provision of a termination measure. The latter is necessary once the
6257 invariant proof rule for while is applied.
6259 * HOL: new (overloaded) notation for the set of elements below/above
6260 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6262 * HOL: theorems impI, allI, ballI bound as "strip";
6264 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6265 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6266 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6268 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6270 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6271 main HOL, but was unused);
6273 * HOL: fewer consts declared as global (e.g. have to refer to
6274 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6276 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6277 in case of overlap with user translations (e.g. judgements over
6278 tuples); (note that the underlying logical represenation is still
6284 * ZF: simplification automatically cancels common terms in arithmetic
6285 expressions over nat and int;
6287 * ZF: new treatment of nat to minimize type-checking: all operators
6288 coerce their operands to a natural number using the function natify,
6289 making the algebraic laws unconditional;
6291 * ZF: as above, for int: operators coerce their operands to an integer
6292 using the function intify;
6294 * ZF: the integer library now contains many of the usual laws for the
6295 orderings, including $<=, and monotonicity laws for $+ and $*;
6297 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6300 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6301 to the simplifier and classical reasoner simultaneously;
6306 * Provers: blast_tac now handles actual object-logic rules as
6307 assumptions; note that auto_tac uses blast_tac internally as well;
6309 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6310 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6312 * Provers: delrules now handles destruct rules as well (no longer need
6313 explicit make_elim);
6315 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6316 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6317 use instead the strong form,
6318 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6319 in HOL, FOL and ZF the function cla_make_elim will create such rules
6320 from destruct-rules;
6322 * Provers: Simplifier.easy_setup provides a fast path to basic
6323 Simplifier setup for new object-logics;
6325 * Pure: AST translation rules no longer require constant head on LHS;
6327 * Pure: improved name spaces: ambiguous output is qualified; support
6328 for hiding of names;
6330 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6331 XSYMBOL_HOME; no longer need to do manual configuration in most
6334 * system: compression of ML heaps images may now be controlled via -c
6335 option of isabelle and isatool usedir (currently only observed by
6338 * system: isatool installfonts may handle X-Symbol fonts as well (very
6339 useful for remote X11);
6341 * system: provide TAGS file for Isabelle sources;
6343 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6346 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6347 timing flag supersedes proof_timing and Toplevel.trace;
6349 * ML: new combinators |>> and |>>> for incremental transformations
6350 with secondary results (e.g. certain theory extensions):
6352 * ML: PureThy.add_defs gets additional argument to indicate potential
6353 overloading (usually false);
6355 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6360 New in Isabelle99 (October 1999)
6361 --------------------------------
6363 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6365 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6366 are no longer simplified. (This allows the simplifier to unfold recursive
6367 functional programs.) To restore the old behaviour, declare
6369 Delcongs [if_weak_cong];
6371 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6374 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6376 * HOL/datatype: mutual_induct_tac no longer exists --
6377 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6379 * HOL/typedef: fixed type inference for representing set; type
6380 arguments now have to occur explicitly on the rhs as type constraints;
6382 * ZF: The con_defs part of an inductive definition may no longer refer
6383 to constants declared in the same theory;
6385 * HOL, ZF: the function mk_cases, generated by the inductive
6386 definition package, has lost an argument. To simplify its result, it
6387 uses the default simpset instead of a supplied list of theorems.
6389 * HOL/List: the constructors of type list are now Nil and Cons;
6391 * Simplifier: the type of the infix ML functions
6392 setSSolver addSSolver setSolver addSolver
6393 is now simpset * solver -> simpset where `solver' is a new abstract type
6394 for packaging solvers. A solver is created via
6395 mk_solver: string -> (thm list -> int -> tactic) -> solver
6396 where the string argument is only a comment.
6401 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6402 decision procedure for linear arithmetic. Currently it is used for
6403 types `nat', `int', and `real' in HOL (see below); it can, should and
6404 will be instantiated for other types and logics as well.
6406 * The simplifier now accepts rewrite rules with flexible heads, eg
6407 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6408 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6414 * New Isabelle/Isar subsystem provides an alternative to traditional
6415 tactical theorem proving; together with the ProofGeneral/isar user
6416 interface it offers an interactive environment for developing human
6417 readable proof documents (Isar == Intelligible semi-automated
6418 reasoning); for further information see isatool doc isar-ref,
6419 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6421 * improved and simplified presentation of theories: better HTML markup
6422 (including colors), graph views in several sizes; isatool usedir now
6423 provides a proper interface for user theories (via -P option); actual
6424 document preparation based on (PDF)LaTeX is available as well (for
6425 new-style theories only); see isatool doc system for more information;
6427 * native support for Proof General, both for classic Isabelle and
6430 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6431 using the graph browser tool;
6433 * Isabelle manuals now also available as PDF;
6435 * theory loader rewritten from scratch (may not be fully
6436 bug-compatible); old loadpath variable has been replaced by show_path,
6437 add_path, del_path, reset_path functions; new operations such as
6438 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6441 * improved isatool install: option -k creates KDE application icon,
6442 option -p DIR installs standalone binaries;
6444 * added ML_PLATFORM setting (useful for cross-platform installations);
6445 more robust handling of platform specific ML images for SML/NJ;
6447 * the settings environment is now statically scoped, i.e. it is never
6448 created again in sub-processes invoked from isabelle, isatool, or
6451 * path element specification '~~' refers to '$ISABELLE_HOME';
6453 * in locales, the "assumes" and "defines" parts may be omitted if
6456 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6459 * new print_mode "HTML";
6461 * new flag show_tags controls display of tags of theorems (which are
6462 basically just comments that may be attached by some tools);
6464 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6465 mode and goal output format:
6467 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6469 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6471 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6472 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6474 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6476 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6478 * function bind_thms stores lists of theorems (cf. bind_thm);
6480 * new shorthand tactics ftac, eatac, datac, fatac;
6482 * qed (and friends) now accept "" as result name; in that case the
6483 theorem is not stored, but proper checks and presentation of the
6486 * theorem database now also indexes constants "Trueprop", "all",
6487 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6492 ** HOL arithmetic **
6494 * There are now decision procedures for linear arithmetic over nat and
6497 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6498 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6499 are treated as atomic; subformulae not involving type `nat' or `int'
6500 are ignored; quantified subformulae are ignored unless they are
6501 positive universal or negative existential. The tactic has to be
6502 invoked by hand and can be a little bit slow. In particular, the
6503 running time is exponential in the number of occurrences of `min' and
6504 `max', and `-' on `nat'.
6506 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6507 (negated) (in)equalities among the premises and the conclusion into
6508 account (i.e. no compound formulae) and does not know about `min' and
6509 `max', and `-' on `nat'. It is fast and is used automatically by the
6512 NB: At the moment, these decision procedures do not cope with mixed
6513 nat/int formulae where the two parts interact, such as `m < n ==>
6516 * HOL/Numeral provides a generic theory of numerals (encoded
6517 efficiently as bit strings); setup for types nat/int/real is in place;
6518 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6519 int, existing theories and proof scripts may require a few additional
6522 * integer division and remainder can now be performed on constant
6525 * many properties of integer multiplication, division and remainder
6528 * An interface to the Stanford Validity Checker (SVC) is available through the
6529 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6530 are proved automatically. SVC must be installed separately, and its results
6531 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6532 invocation of the underlying oracle). For SVC see
6533 http://verify.stanford.edu/SVC
6535 * IsaMakefile: the HOL-Real target now builds an actual image;
6540 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6541 (in Isabelle/Isar) -- by Gertrud Bauer;
6543 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6544 analysis for assembly languages with subtypes;
6546 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6547 -- avoids syntactic ambiguities and treats state, transition, and
6548 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6549 changed syntax and (many) tactics;
6551 * HOL/inductive: Now also handles more general introduction rules such
6552 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6553 theorems are now maintained within the theory (maintained via the
6556 * HOL/datatype: Now also handles arbitrarily branching datatypes
6557 (using function types) such as
6559 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6561 * HOL/record: record_simproc (part of the default simpset) takes care
6562 of selectors applied to updated records; record_split_tac is no longer
6563 part of the default claset; update_defs may now be removed from the
6564 simpset in many cases; COMPATIBILITY: old behavior achieved by
6566 claset_ref () := claset() addSWrapper record_split_wrapper;
6567 Delsimprocs [record_simproc]
6569 * HOL/typedef: fixed type inference for representing set; type
6570 arguments now have to occur explicitly on the rhs as type constraints;
6572 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6573 names rather than an ML expression;
6575 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6576 supplied later. Program schemes can be defined, such as
6577 "While B C s = (if B s then While B C (C s) else s)"
6578 where the well-founded relation can be chosen after B and C have been given.
6580 * HOL/List: the constructors of type list are now Nil and Cons;
6581 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6582 course, ML tools referring to List.list.op # etc. have to be adapted;
6584 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6585 disabled by default; run isabelle with option -m HOL to get back to
6586 the original Gordon/HOL-style output;
6588 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6589 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6591 * HOL basic syntax simplified (more orthogonal): all variants of
6592 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6593 Eps operator is provided as well: "SOME x. P[x]";
6595 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6597 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6598 thus available for user theories;
6600 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6601 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6604 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6605 several times and then mp;
6610 * the notation <<...>> is now available as a notation for sequences of
6613 * the simplifier is now installed
6615 * the axiom system has been generalized (thanks to Soren Heilmann)
6617 * the classical reasoner now has a default rule database
6622 * new primrec section allows primitive recursive functions to be given
6623 directly (as in HOL) over datatypes and the natural numbers;
6625 * new tactics induct_tac and exhaust_tac for induction (or case
6626 analysis) over datatypes and the natural numbers;
6628 * the datatype declaration of type T now defines the recursor T_rec;
6630 * simplification automatically does freeness reasoning for datatype
6633 * automatic type-inference, with AddTCs command to insert new
6634 type-checking rules;
6636 * datatype introduction rules are now added as Safe Introduction rules
6639 * the syntax "if P then x else y" is now available in addition to
6643 *** Internal programming interfaces ***
6645 * tuned simplifier trace output; new flag debug_simp;
6647 * structures Vartab / Termtab (instances of TableFun) offer efficient
6648 tables indexed by indexname_ord / term_ord (compatible with aconv);
6650 * AxClass.axclass_tac lost the theory argument;
6652 * tuned current_goals_markers semantics: begin / end goal avoids
6653 printing empty lines;
6655 * removed prs and prs_fn hook, which was broken because it did not
6656 include \n in its semantics, forcing writeln to add one
6657 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6658 string -> unit if you really want to output text without newline;
6660 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6661 plain output, interface builders may have to enable 'isabelle_font'
6662 mode to get Isabelle font glyphs as before;
6664 * refined token_translation interface; INCOMPATIBILITY: output length
6665 now of type real instead of int;
6667 * theory loader actions may be traced via new ThyInfo.add_hook
6668 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6669 your own database of information attached to *whole* theories -- as
6670 opposed to intra-theory data slots offered via TheoryDataFun;
6672 * proper handling of dangling sort hypotheses (at last!);
6673 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6674 extra sort hypotheses that can be witnessed from the type signature;
6675 the force_strip_shyps flag is gone, any remaining shyps are simply
6676 left in the theorem (with a warning issued by strip_shyps_warning);
6680 New in Isabelle98-1 (October 1998)
6681 ----------------------------------
6683 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6685 * several changes of automated proof tools;
6687 * HOL: major changes to the inductive and datatype packages, including
6688 some minor incompatibilities of theory syntax;
6690 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6693 * HOL: removed duplicate thms in Arith:
6694 less_imp_add_less should be replaced by trans_less_add1
6695 le_imp_add_le should be replaced by trans_le_add1
6697 * HOL: unary minus is now overloaded (new type constraints may be
6700 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6701 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6702 now taken as an integer constant.
6704 * Pure: ML function 'theory_of' renamed to 'theory';
6710 1. Asm_full_simp_tac is now more aggressive.
6711 1. It will sometimes reorient premises if that increases their power to
6713 2. It does no longer proceed strictly from left to right but may also
6714 rotate premises to achieve further simplification.
6715 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6716 old Asm_full_simp_tac in that it does not rotate premises.
6717 2. The simplifier now knows a little bit about nat-arithmetic.
6719 * Classical reasoner: wrapper mechanism for the classical reasoner now
6720 allows for selected deletion of wrappers, by introduction of names for
6721 wrapper functionals. This implies that addbefore, addSbefore,
6722 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6723 and that adding two tactics with the same name overwrites the first
6724 one (emitting a warning).
6725 type wrapper = (int -> tactic) -> (int -> tactic)
6726 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6727 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6728 delWrapper, delSWrapper: claset * string -> claset
6729 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6731 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6732 semantics; addbefore now affects only the unsafe part of step_tac
6733 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6734 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6737 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6738 compWrapper; added safe wrapper (and access functions for it);
6740 * HOL/split_all_tac is now much faster and fails if there is nothing
6741 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6742 and the names of the automatically generated variables have changed.
6743 split_all_tac has moved within claset() from unsafe wrappers to safe
6744 wrappers, which means that !!-bound variables are split much more
6745 aggressively, and safe_tac and clarify_tac now split such variables.
6746 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6747 Note: the same holds for record_split_tac, which does the job of
6748 split_all_tac for record fields.
6750 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6751 permanently to the default simpset using Addsplits just like
6752 Addsimps. They can be removed via Delsplits just like
6753 Delsimps. Lower-case versions are also available.
6755 * HOL/Simplifier: The rule split_if is now part of the default
6756 simpset. This means that the simplifier will eliminate all occurrences
6757 of if-then-else in the conclusion of a goal. To prevent this, you can
6758 either remove split_if completely from the default simpset by
6759 `Delsplits [split_if]' or remove it in a specific call of the
6760 simplifier using `... delsplits [split_if]'. You can also add/delete
6761 other case splitting rules to/from the default simpset: every datatype
6762 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6763 t is the name of the datatype).
6765 * Classical reasoner / Simplifier combination: new force_tac (and
6766 derivatives Force_tac, force) combines rewriting and classical
6767 reasoning (and whatever other tools) similarly to auto_tac, but is
6768 aimed to solve the given subgoal completely.
6773 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6774 and `goalw': the theory is no longer needed as an explicit argument -
6775 the current theory context is used; assumptions are no longer returned
6776 at the ML-level unless one of them starts with ==> or !!; it is
6777 recommended to convert to these new commands using isatool fixgoal
6778 (backup your sources first!);
6780 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6781 the current theory context, and 'theory' to lookup stored theories;
6783 * new theory section 'locale' for declaring constants, assumptions and
6784 definitions that have local scope;
6786 * new theory section 'nonterminals' for purely syntactic types;
6788 * new theory section 'setup' for generic ML setup functions
6789 (e.g. package initialization);
6791 * the distribution now includes Isabelle icons: see
6792 lib/logo/isabelle-{small,tiny}.xpm;
6794 * isatool install - install binaries with absolute references to
6797 * isatool logo -- create instances of the Isabelle logo (as EPS);
6799 * print mode 'emacs' reserved for Isamode;
6801 * support multiple print (ast) translations per constant name;
6803 * theorems involving oracles are now printed with a suffixed [!];
6808 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6810 * HOL/inductive package reorganized and improved: now supports mutual
6816 oddI "n : EVEN ==> Suc n : ODD"
6817 evenI "n : ODD ==> Suc n : EVEN"
6819 new theorem list "elims" contains an elimination rule for each of the
6820 recursive sets; inductive definitions now handle disjunctive premises
6821 correctly (also ZF);
6823 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6824 "mutual_induct" no longer exists - the induction rule is always
6825 contained in "induct";
6828 * HOL/datatype package re-implemented and greatly improved: now
6829 supports mutually recursive datatypes such as
6832 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6833 | SUM ('a aexp) ('a aexp)
6834 | DIFF ('a aexp) ('a aexp)
6837 'a bexp = LESS ('a aexp) ('a aexp)
6838 | AND ('a bexp) ('a bexp)
6839 | OR ('a bexp) ('a bexp)
6841 as well as indirectly recursive datatypes such as
6844 ('a, 'b) term = Var 'a
6845 | App 'b ((('a, 'b) term) list)
6847 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6848 induction on mutually / indirectly recursive datatypes.
6850 Primrec equations are now stored in theory and can be accessed via
6851 <function_name>.simps.
6855 - Theories using datatypes must now have theory Datatype as an
6857 - The specific <typename>.induct_tac no longer exists - use the
6858 generic induct_tac instead.
6859 - natE has been renamed to nat.exhaust - use exhaust_tac
6860 instead of res_inst_tac ... natE. Note that the variable
6861 names in nat.exhaust differ from the names in natE, this
6862 may cause some "fragile" proofs to fail.
6863 - The theorems split_<typename>_case and split_<typename>_case_asm
6864 have been renamed to <typename>.split and <typename>.split_asm.
6865 - Since default sorts of type variables are now handled correctly,
6866 some datatype definitions may have to be annotated with explicit
6868 - Primrec definitions no longer require function name and type
6869 of recursive argument.
6871 Consider using isatool fixdatatype to adapt your theories and proof
6872 scripts to the new package (backup your sources first!).
6875 * HOL/record package: considerably improved implementation; now
6876 includes concrete syntax for record types, terms, updates; theorems
6877 for surjective pairing and splitting !!-bound record variables; proof
6878 support is as follows:
6880 1) standard conversions (selectors or updates applied to record
6881 constructor terms) are part of the standard simpset;
6883 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6884 made part of standard simpset and claset via addIffs;
6886 3) a tactic for record field splitting (record_split_tac) is part of
6887 the standard claset (addSWrapper);
6889 To get a better idea about these rules you may retrieve them via
6890 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6891 the name of your record type.
6893 The split tactic 3) conceptually simplifies by the following rule:
6895 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6897 Thus any record variable that is bound by meta-all will automatically
6898 blow up into some record constructor term, consequently the
6899 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6900 solve record problems automatically.
6903 * reorganized the main HOL image: HOL/Integ and String loaded by
6904 default; theory Main includes everything;
6906 * automatic simplification of integer sums and comparisons, using cancellation;
6908 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6910 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6912 * many new identities for unions, intersections, set difference, etc.;
6914 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6915 called split_if, split_split, split_sum_case and split_nat_case (to go
6916 with add/delsplits);
6918 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6919 (?x::unit) = (); this is made part of the default simpset, which COULD
6920 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6921 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6922 unit_abs_eta_conv is added in order to counter the effect of
6923 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6926 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6929 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6930 It and 'sym RS equals0D' are now in the default claset, giving automatic
6931 disjointness reasoning but breaking a few old proofs.
6933 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6934 to 'converse' from 'inverse' (for compatibility with ZF and some
6937 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6938 the well-founded relation;
6940 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6941 Compl A. The "Compl" syntax remains available as input syntax for this
6944 * HOL/Update: new theory of function updates:
6945 f(a:=b) == %x. if x=a then b else f x
6946 may also be iterated as in f(a:=b,c:=d,...);
6948 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6951 - new function list_update written xs[i:=v] that updates the i-th
6952 list position. May also be iterated as in xs[i:=a,j:=b,...].
6953 - new function `upt' written [i..j(] which generates the list
6954 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6955 bound write [i..j], which is a shorthand for [i..j+1(].
6956 - new lexicographic orderings and corresponding wellfoundedness theorems.
6959 - removed 'pred' (predecessor) function;
6960 - generalized some theorems about n-1;
6961 - many new laws about "div" and "mod";
6962 - new laws about greatest common divisors (see theory ex/Primes);
6964 * HOL/Relation: renamed the relational operator r^-1 "converse"
6965 instead of "inverse";
6967 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6968 of the multiset ordering;
6970 * directory HOL/Real: a construction of the reals using Dedekind cuts
6971 (not included by default);
6973 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6975 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6976 programs, i.e. different program variables may have different types.
6978 * calling (stac rew i) now fails if "rew" has no effect on the goal
6979 [previously, this check worked only if the rewrite rule was unconditional]
6980 Now rew can involve either definitions or equalities (either == or =).
6985 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6986 only the theorems proved on ZF.ML;
6988 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6989 It and 'sym RS equals0D' are now in the default claset, giving automatic
6990 disjointness reasoning but breaking a few old proofs.
6992 * ZF/Update: new theory of function updates
6993 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6994 may also be iterated as in f(a:=b,c:=d,...);
6996 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6998 * calling (stac rew i) now fails if "rew" has no effect on the goal
6999 [previously, this check worked only if the rewrite rule was unconditional]
7000 Now rew can involve either definitions or equalities (either == or =).
7002 * case_tac provided for compatibility with HOL
7003 (like the old excluded_middle_tac, but with subgoals swapped)
7006 *** Internal programming interfaces ***
7008 * Pure: several new basic modules made available for general use, see
7009 also src/Pure/README;
7011 * improved the theory data mechanism to support encapsulation (data
7012 kind name replaced by private Object.kind, acting as authorization
7013 key); new type-safe user interface via functor TheoryDataFun; generic
7014 print_data function becomes basically useless;
7016 * removed global_names compatibility flag -- all theory declarations
7017 are qualified by default;
7019 * module Pure/Syntax now offers quote / antiquote translation
7020 functions (useful for Hoare logic etc. with implicit dependencies);
7021 see HOL/ex/Antiquote for an example use;
7023 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
7026 * new tactical CHANGED_GOAL for checking that a tactic modifies a
7029 * Display.print_goals function moved to Locale.print_goals;
7031 * standard print function for goals supports current_goals_markers
7032 variable for marking begin of proof, end of proof, start of goal; the
7033 default is ("", "", ""); setting current_goals_markers := ("<proof>",
7034 "</proof>", "<goal>") causes SGML like tagged proof state printing,
7039 New in Isabelle98 (January 1998)
7040 --------------------------------
7042 *** Overview of INCOMPATIBILITIES (see below for more details) ***
7044 * changed lexical syntax of terms / types: dots made part of long
7045 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
7047 * simpset (and claset) reference variable replaced by functions
7048 simpset / simpset_ref;
7050 * no longer supports theory aliases (via merge) and non-trivial
7051 implicit merge of thms' signatures;
7053 * most internal names of constants changed due to qualified names;
7055 * changed Pure/Sequence interface (see Pure/seq.ML);
7058 *** General Changes ***
7060 * hierachically structured name spaces (for consts, types, axms, thms
7061 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
7062 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
7063 isatool fixdots ensures space after dots (e.g. "%x. x"); set
7064 long_names for fully qualified output names; NOTE: ML programs
7065 (special tactics, packages etc.) referring to internal names may have
7066 to be adapted to cope with fully qualified names; in case of severe
7067 backward campatibility problems try setting 'global_names' at compile
7068 time to have enrything declared within a flat name space; one may also
7069 fine tune name declarations in theories via the 'global' and 'local'
7072 * reimplemented the implicit simpset and claset using the new anytype
7073 data filed in signatures; references simpset:simpset ref etc. are
7074 replaced by functions simpset:unit->simpset and
7075 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
7076 to patch your ML files accordingly;
7078 * HTML output now includes theory graph data for display with Java
7079 applet or isatool browser; data generated automatically via isatool
7080 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
7082 * defs may now be conditional; improved rewrite_goals_tac to handle
7083 conditional equations;
7085 * defs now admits additional type arguments, using TYPE('a) syntax;
7087 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
7088 creates a new theory node; implicit merge of thms' signatures is
7089 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
7090 transfer:theory->thm->thm in (rare) cases;
7092 * improved handling of draft signatures / theories; draft thms (and
7093 ctyps, cterms) are automatically promoted to real ones;
7095 * slightly changed interfaces for oracles: admit many per theory, named
7096 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
7098 * print_goals: optional output of const types (set show_consts and
7101 * improved output of warnings (###) and errors (***);
7103 * subgoal_tac displays a warning if the new subgoal has type variables;
7105 * removed old README and Makefiles;
7107 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7109 * removed obsolete init_pps and init_database;
7111 * deleted the obsolete tactical STATE, which was declared by
7112 fun STATE tacfun st = tacfun st st;
7114 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7115 (which abbreviates $HOME);
7117 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7118 use isatool fixseq to adapt your ML programs (this works for fully
7119 qualified references to the Sequence structure only!);
7121 * use_thy no longer requires writable current directory; it always
7122 reloads .ML *and* .thy file, if either one is out of date;
7125 *** Classical Reasoner ***
7127 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7128 tactics that use classical reasoning to simplify a subgoal without
7129 splitting it into several subgoals;
7131 * Safe_tac: like safe_tac but uses the default claset;
7136 * added simplification meta rules:
7137 (asm_)(full_)simplify: simpset -> thm -> thm;
7139 * simplifier.ML no longer part of Pure -- has to be loaded by object
7142 * added prems argument to simplification procedures;
7144 * HOL, FOL, ZF: added infix function `addsplits':
7145 instead of `<simpset> setloop (split_tac <thms>)'
7146 you can simply write `<simpset> addsplits <thms>'
7151 * TYPE('a) syntax for type reflection terms;
7153 * no longer handles consts with name "" -- declare as 'syntax' instead;
7155 * pretty printer: changed order of mixfix annotation preference (again!);
7157 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7162 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7163 with `addloop' of the simplifier to faciliate case splitting in premises.
7165 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7167 * HOL/Auth: new protocol proofs including some for the Internet
7170 * HOL/Map: new theory of `maps' a la VDM;
7172 * HOL/simplifier: simplification procedures nat_cancel_sums for
7173 cancelling out common nat summands from =, <, <= (in)equalities, or
7174 differences; simplification procedures nat_cancel_factor for
7175 cancelling common factor from =, <, <= (in)equalities over natural
7176 sums; nat_cancel contains both kinds of procedures, it is installed by
7177 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7179 * HOL/simplifier: terms of the form
7180 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7182 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7183 and those of the form
7184 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7186 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7189 Each datatype `t' now comes with a theorem `split_t_case' of the form
7191 P(t_case f1 ... fn x) =
7192 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7194 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7197 and a theorem `split_t_case_asm' of the form
7199 P(t_case f1 ... fn x) =
7200 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7202 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7204 which can be added to a simpset via `addsplits'. The existing theorems
7205 expand_list_case and expand_option_case have been renamed to
7206 split_list_case and split_option_case.
7209 - `pred n' is automatically converted to `n-1'.
7210 Users are strongly encouraged not to use `pred' any longer,
7211 because it will disappear altogether at some point.
7212 - Users are strongly encouraged to write "0 < n" rather than
7213 "n ~= 0". Theorems and proof tools have been modified towards this
7217 the function "set_of_list" has been renamed "set" (and its theorems too);
7218 the function "nth" now takes its arguments in the reverse order and
7219 has acquired the infix notation "!" as in "xs!n".
7221 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7223 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7224 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7226 * HOL/record: extensible records with schematic structural subtyping
7227 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7228 still lacks various theorems and concrete record syntax;
7233 * removed "axioms" and "generated by" sections;
7235 * replaced "ops" section by extended "consts" section, which is capable of
7236 handling the continuous function space "->" directly;
7239 . proves theorems immediately and stores them in the theory,
7240 . creates hierachical name space,
7241 . now uses normal mixfix annotations (instead of cinfix...),
7242 . minor changes to some names and values (for consistency),
7243 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7244 . separator between mutual domain defs: changed "," to "and",
7245 . improved handling of sort constraints; now they have to
7246 appear on the left-hand side of the equations only;
7248 * fixed LAM <x,y,zs>.b syntax;
7250 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7251 adm (%x. P (t x)), where P is chainfinite and t continuous;
7256 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7257 with `addloop' of the simplifier to faciliate case splitting in premises.
7259 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7260 in HOL, they strip ALL and --> from proved theorems;
7264 New in Isabelle94-8 (May 1997)
7265 ------------------------------
7267 *** General Changes ***
7269 * new utilities to build / run / maintain Isabelle etc. (in parts
7270 still somewhat experimental); old Makefiles etc. still functional;
7272 * new 'Isabelle System Manual';
7274 * INSTALL text, together with ./configure and ./build scripts;
7276 * reimplemented type inference for greater efficiency, better error
7277 messages and clean internal interface;
7279 * prlim command for dealing with lots of subgoals (an easier way of
7280 setting goals_limit);
7285 * supports alternative (named) syntax tables (parser and pretty
7286 printer); internal interface is provided by add_modesyntax(_i);
7288 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7289 be used in conjunction with the Isabelle symbol font; uses the
7290 "symbols" syntax table;
7292 * added token_translation interface (may translate name tokens in
7293 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7294 the current print_mode); IMPORTANT: user print translation functions
7295 are responsible for marking newly introduced bounds
7296 (Syntax.mark_boundT);
7298 * token translations for modes "xterm" and "xterm_color" that display
7299 names in bold, underline etc. or colors (which requires a color
7302 * infixes may now be declared with names independent of their syntax;
7304 * added typed_print_translation (like print_translation, but may
7305 access type of constant);
7308 *** Classical Reasoner ***
7310 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7311 some limitations. Blast_tac...
7312 + ignores addss, addbefore, addafter; this restriction is intrinsic
7313 + ignores elimination rules that don't have the correct format
7314 (the conclusion MUST be a formula variable)
7315 + ignores types, which can make HOL proofs fail
7316 + rules must not require higher-order unification, e.g. apply_type in ZF
7317 [message "Function Var's argument not a bound variable" relates to this]
7318 + its proof strategy is more general but can actually be slower
7320 * substitution with equality assumptions no longer permutes other
7323 * minor changes in semantics of addafter (now called addaltern); renamed
7324 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7325 (and access functions for it);
7327 * improved combination of classical reasoner and simplifier:
7328 + functions for handling clasimpsets
7329 + improvement of addss: now the simplifier is called _after_ the
7331 + safe variant of addss called addSss: uses safe simplifications
7332 _during_ the safe steps. It is more complete as it allows multiple
7333 instantiations of unknowns (e.g. with slow_tac).
7337 * added interface for simplification procedures (functions that
7338 produce *proven* rewrite rules on the fly, depending on current
7341 * ordering on terms as parameter (used for ordered rewriting);
7343 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7345 * the solver is now split into a safe and an unsafe part.
7346 This should be invisible for the normal user, except that the
7347 functions setsolver and addsolver have been renamed to setSolver and
7348 addSolver; added safe_asm_full_simp_tac;
7353 * a generic induction tactic `induct_tac' which works for all datatypes and
7354 also for type `nat';
7356 * a generic case distinction tactic `exhaust_tac' which works for all
7357 datatypes and also for type `nat';
7359 * each datatype comes with a function `size';
7361 * patterns in case expressions allow tuple patterns as arguments to
7362 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7364 * primrec now also works with type nat;
7366 * recdef: a new declaration form, allows general recursive functions to be
7367 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7369 * the constant for negation has been renamed from "not" to "Not" to
7370 harmonize with FOL, ZF, LK, etc.;
7372 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7375 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7377 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7378 problems in commutative rings, using axiomatic type classes for + and *;
7380 * more examples in HOL/MiniML and HOL/Auth;
7382 * more default rewrite rules for quantifiers, union/intersection;
7384 * a new constant `arbitrary == @x.False';
7386 * HOLCF/IOA replaces old HOL/IOA;
7388 * HOLCF changes: derived all rules and arities
7389 + axiomatic type classes instead of classes
7390 + typedef instead of faking type definitions
7391 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7392 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7393 + eliminated the types void, one, tr
7394 + use unit lift and bool lift (with translations) instead of one and tr
7395 + eliminated blift from Lift3.thy (use Def instead of blift)
7396 all eliminated rules are derived as theorems --> no visible changes ;
7401 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7402 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7403 as ZF_cs addSIs [equalityI];
7407 New in Isabelle94-7 (November 96)
7408 ---------------------------------
7410 * allowing negative levels (as offsets) in prlev and choplev;
7412 * super-linear speedup for large simplifications;
7414 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7415 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7416 FAIL); can suppress it using the command Delsimps (ex_simps @
7417 all_simps); De Morgan laws are also now included, by default;
7419 * improved printing of ==> : ~:
7421 * new object-logic "Sequents" adds linear logic, while replacing LK
7422 and Modal (thanks to Sara Kalvala);
7424 * HOL/Auth: correctness proofs for authentication protocols;
7426 * HOL: new auto_tac combines rewriting and classical reasoning (many
7427 examples on HOL/Auth);
7429 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7430 the rewriter and classical reasoner simultaneously;
7432 * function uresult no longer returns theorems in "standard" format;
7433 regain previous version by: val uresult = standard o uresult;
7440 * oracles -- these establish an interface between Isabelle and trusted
7441 external reasoners, which may deliver results as theorems;
7443 * proof objects (in particular record all uses of oracles);
7445 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7447 * "constdefs" section in theory files;
7449 * "primrec" section (HOL) no longer requires names;
7451 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7458 * reduced space requirements;
7460 * automatic HTML generation from theories;
7462 * theory files no longer require "..." (quotes) around most types;
7464 * new examples, including two proofs of the Church-Rosser theorem;
7466 * non-curried (1994) version of HOL is no longer distributed;
7473 * greatly reduced space requirements;
7475 * theory files (.thy) no longer require \...\ escapes at line breaks;
7477 * searchable theorem database (see the section "Retrieving theorems" on
7478 page 8 of the Reference Manual);
7480 * new examples, including Grabczewski's monumental case study of the
7483 * The previous version of HOL renamed to Old_HOL;
7485 * The new version of HOL (previously called CHOL) uses a curried syntax
7486 for functions. Application looks like f a b instead of f(a,b);
7488 * Mutually recursive inductive definitions finally work in HOL;
7490 * In ZF, pattern-matching on tuples is now available in all abstractions and
7491 translates to the operator "split";
7498 * new infix operator, addss, allowing the classical reasoner to
7499 perform simplification at each step of its search. Example:
7500 fast_tac (cs addss ss)
7502 * a new logic, CHOL, the same as HOL, but with a curried syntax
7503 for functions. Application looks like f a b instead of f(a,b). Also pairs
7504 look like (a,b) instead of <a,b>;
7506 * PLEASE NOTE: CHOL will eventually replace HOL!
7508 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7509 It translates to the operator "split". A new theory of integers is available;
7511 * In ZF, integer numerals now denote two's-complement binary integers.
7512 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7514 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7515 of the Axiom of Choice;
7522 * Significantly faster resolution;
7524 * the different sections in a .thy file can now be mixed and repeated
7527 * Database of theorems for FOL, HOL and ZF. New
7528 commands including qed, qed_goal and bind_thm store theorems in the database.
7530 * Simple database queries: return a named theorem (get_thm) or all theorems of
7531 a given theory (thms_of), or find out what theory a theorem was proved in
7534 * Bugs fixed in the inductive definition and datatype packages;
7536 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7537 and HOL_dup_cs obsolete;
7539 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7542 * Simpler definition of function space in ZF;
7544 * new results about cardinal and ordinal arithmetic in ZF;
7546 * 'subtype' facility in HOL for introducing new types as subsets of existing
7549 :mode=text:wrap=hard:maxLineLen=72: