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 * Special treatment of ML file names has been discontinued.
18 Historically, optional extensions .ML or .sml were added on demand --
19 at the cost of clarity of file dependencies. Recall that Isabelle/ML
20 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
25 * code generator: export_code without explicit file declaration prints
26 to standard output. INCOMPATIBILITY.
28 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
29 respectively. INCOMPATIBILITY.
31 * Constant "split" has been merged with constant "prod_case"; names
32 of ML functions, facts etc. involving split have been retained so far,
33 though. INCOMPATIBILITY.
35 * Dropped old infix syntax "mem" for List.member; use "in set"
36 instead. INCOMPATIBILITY.
38 * Refactoring of code-generation specific operations in List.thy
45 null_empty ~> null_def
47 INCOMPATIBILITY. Note that these were not suppossed to be used
48 regularly unless for striking reasons; their main purpose was code
51 * Some previously unqualified names have been qualified:
60 Pair ~> Product_Type.Pair
61 fst ~> Product_Type.fst
62 snd ~> Product_Type.snd
63 curry ~> Product_Type.curry
65 Collect ~> Set.Collect
69 * Removed simplifier congruence rule of "prod_case", as has for long
70 been the case with "split".
72 * Datatype package: theorems generated for executable equality
73 (class eq) carry proper names and are treated as default code
76 * List.thy: use various operations from the Haskell prelude when
77 generating Haskell code.
79 * code_simp.ML: simplification with rules determined by
82 * code generator: do not print function definitions for case
83 combinators any longer.
85 * Multivariate Analysis: Introduced a type class for euclidean space. Most
86 theorems are now stated in terms of euclidean spaces instead of finite
90 real ^ 'n ~> 'a::real_vector
91 ~> 'a::euclidean_space
92 ~> 'a::ordered_euclidean_space
93 (depends on your needs)
97 \<chi> x. _ ~> \<chi>\<chi> x. _
100 Also note that the indices are now natural numbers and not from some finite
101 type. Finite cartesian products of euclidean spaces, products of euclidean
102 spaces the real and complex numbers are instantiated to be euclidean_spaces.
106 * Inductive package: offers new command "inductive_simps" to automatically
107 derive instantiated and simplified equations for inductive predicates,
108 similar to inductive_cases.
113 * ML antiquotations @{theory} and @{theory_ref} refer to named
114 theories from the ancestry of the current context, not any accidental
115 theory loader state as before. Potential INCOMPATIBILITY, subtle
120 New in Isabelle2009-2 (June 2010)
121 ---------------------------------
125 * Authentic syntax for *all* logical entities (type classes, type
126 constructors, term constants): provides simple and robust
127 correspondence between formal entities and concrete syntax. Within
128 the parse tree / AST representations, "constants" are decorated by
129 their category (class, type, const) and spelled out explicitly with
130 their full internal name.
132 Substantial INCOMPATIBILITY concerning low-level syntax declarations
133 and translations (translation rules and translation functions in ML).
134 Some hints on upgrading:
136 - Many existing uses of 'syntax' and 'translations' can be replaced
137 by more modern 'type_notation', 'notation' and 'abbreviation',
138 which are independent of this issue.
140 - 'translations' require markup within the AST; the term syntax
141 provides the following special forms:
143 CONST c -- produces syntax version of constant c from context
144 XCONST c -- literally c, checked as constant from context
145 c -- literally c, if declared by 'syntax'
147 Plain identifiers are treated as AST variables -- occasionally the
148 system indicates accidental variables via the error "rhs contains
151 Type classes and type constructors are marked according to their
152 concrete syntax. Some old translations rules need to be written
153 for the "type" category, using type constructor application
154 instead of pseudo-term application of the default category
157 - 'parse_translation' etc. in ML may use the following
160 @{class_syntax c} -- type class c within parse tree / AST
161 @{term_syntax c} -- type constructor c within parse tree / AST
162 @{const_syntax c} -- ML version of "CONST c" above
163 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
165 - Literal types within 'typed_print_translations', i.e. those *not*
166 represented as pseudo-terms are represented verbatim. Use @{class
167 c} or @{type_name c} here instead of the above syntax
170 Note that old non-authentic syntax was based on unqualified base
171 names, so all of the above "constant" names would coincide. Recall
172 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
173 diagnose syntax problems.
175 * Type constructors admit general mixfix syntax, not just infix.
177 * Concrete syntax may be attached to local entities without a proof
178 body, too. This works via regular mixfix annotations for 'fix',
179 'def', 'obtain' etc. or via the explicit 'write' command, which is
180 similar to the 'notation' command in theory specifications.
182 * Discontinued unnamed infix syntax (legacy feature for many years) --
183 need to specify constant name and syntax separately. Internal ML
184 datatype constructors have been renamed from InfixName to Infix etc.
185 Minor INCOMPATIBILITY.
187 * Schematic theorem statements need to be explicitly markup as such,
188 via commands 'schematic_lemma', 'schematic_theorem',
189 'schematic_corollary'. Thus the relevance of the proof is made
190 syntactically clear, which impacts performance in a parallel or
191 asynchronous interactive environment. Minor INCOMPATIBILITY.
193 * Use of cumulative prems via "!" in some proof methods has been
194 discontinued (old legacy feature).
196 * References 'trace_simp' and 'debug_simp' have been replaced by
197 configuration options stored in the context. Enabling tracing (the
198 case of debugging is similar) in proofs works via
200 using [[trace_simp = true]]
202 Tracing is then active for all invocations of the simplifier in
203 subsequent goal refinement steps. Tracing may also still be enabled or
204 disabled via the ProofGeneral settings menu.
206 * Separate commands 'hide_class', 'hide_type', 'hide_const',
207 'hide_fact' replace the former 'hide' KIND command. Minor
210 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
211 more efficient than combinations with -q1 or -q2.
216 * Proofterms record type-class reasoning explicitly, using the
217 "unconstrain" operation internally. This eliminates all sort
218 constraints from a theorem and proof, introducing explicit
219 OFCLASS-premises. On the proof term level, this operation is
220 automatically applied at theorem boundaries, such that closed proofs
221 are always free of sort constraints. INCOMPATIBILITY for tools that
224 * Local theory specifications may depend on extra type variables that
225 are not present in the result type -- arguments TYPE('a) :: 'a itself
226 are added internally. For example:
228 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
230 * Predicates of locales introduced by classes carry a mandatory
231 "class" prefix. INCOMPATIBILITY.
233 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
235 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
238 * Command 'code_reflect' allows to incorporate generated ML code into
239 runtime environment; replaces immature code_datatype antiquotation.
242 * Code generator: simple concept for abstract datatypes obeying
245 * Code generator: details of internal data cache have no impact on the
246 user space functionality any longer.
248 * Methods "unfold_locales" and "intro_locales" ignore non-locale
249 subgoals. This is more appropriate for interpretations with 'where'.
252 * Command 'example_proof' opens an empty proof body. This allows to
253 experiment with Isar, without producing any persistent result.
255 * Commands 'type_notation' and 'no_type_notation' declare type syntax
256 within a local theory context, with explicit checking of the
257 constructors involved (in contrast to the raw 'syntax' versions).
259 * Commands 'types' and 'typedecl' now work within a local theory
260 context -- without introducing dependencies on parameters or
261 assumptions, which is not possible in Isabelle/Pure.
263 * Command 'defaultsort' has been renamed to 'default_sort', it works
264 within a local theory context. Minor INCOMPATIBILITY.
269 * Command 'typedef' now works within a local theory context -- without
270 introducing dependencies on parameters or assumptions, which is not
271 possible in Isabelle/Pure/HOL. Note that the logical environment may
272 contain multiple interpretations of local typedefs (with different
273 non-emptiness proofs), even in a global theory context.
275 * New package for quotient types. Commands 'quotient_type' and
276 'quotient_definition' may be used for defining types and constants by
277 quotient constructions. An example is the type of integers created by
278 quotienting pairs of natural numbers:
281 intrel :: "(nat * nat) => (nat * nat) => bool"
283 "intrel (x, y) (u, v) = (x + v = u + y)"
285 quotient_type int = "nat * nat" / intrel
286 by (auto simp add: equivp_def expand_fun_eq)
289 "0::int" is "(0::nat, 0::nat)"
291 The method "lifting" can be used to lift of theorems from the
292 underlying "raw" type to the quotient type. The example
293 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
294 construction and provides a reasoning infrastructure for finite sets.
296 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
297 clash with new theory Quotient in Main HOL.
299 * Moved the SMT binding into the main HOL session, eliminating
300 separate HOL-SMT session.
302 * List membership infix mem operation is only an input abbreviation.
305 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
306 for future developements; former Library/Word.thy is still present in
307 the AFP entry RSAPPS.
309 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
310 longer shadowed. INCOMPATIBILITY.
312 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
315 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
318 * Dropped normalizing_semiring etc; use the facts in semiring classes
319 instead. INCOMPATIBILITY.
321 * Dropped several real-specific versions of lemmas about floor and
322 ceiling; use the generic lemmas from theory "Archimedean_Field"
323 instead. INCOMPATIBILITY.
325 floor_number_of_eq ~> floor_number_of
326 le_floor_eq_number_of ~> number_of_le_floor
327 le_floor_eq_zero ~> zero_le_floor
328 le_floor_eq_one ~> one_le_floor
329 floor_less_eq_number_of ~> floor_less_number_of
330 floor_less_eq_zero ~> floor_less_zero
331 floor_less_eq_one ~> floor_less_one
332 less_floor_eq_number_of ~> number_of_less_floor
333 less_floor_eq_zero ~> zero_less_floor
334 less_floor_eq_one ~> one_less_floor
335 floor_le_eq_number_of ~> floor_le_number_of
336 floor_le_eq_zero ~> floor_le_zero
337 floor_le_eq_one ~> floor_le_one
338 floor_subtract_number_of ~> floor_diff_number_of
339 floor_subtract_one ~> floor_diff_one
340 ceiling_number_of_eq ~> ceiling_number_of
341 ceiling_le_eq_number_of ~> ceiling_le_number_of
342 ceiling_le_zero_eq ~> ceiling_le_zero
343 ceiling_le_eq_one ~> ceiling_le_one
344 less_ceiling_eq_number_of ~> number_of_less_ceiling
345 less_ceiling_eq_zero ~> zero_less_ceiling
346 less_ceiling_eq_one ~> one_less_ceiling
347 ceiling_less_eq_number_of ~> ceiling_less_number_of
348 ceiling_less_eq_zero ~> ceiling_less_zero
349 ceiling_less_eq_one ~> ceiling_less_one
350 le_ceiling_eq_number_of ~> number_of_le_ceiling
351 le_ceiling_eq_zero ~> zero_le_ceiling
352 le_ceiling_eq_one ~> one_le_ceiling
353 ceiling_subtract_number_of ~> ceiling_diff_number_of
354 ceiling_subtract_one ~> ceiling_diff_one
356 * Theory "Finite_Set": various folding_XXX locales facilitate the
357 application of the various fold combinators on finite sets.
359 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
360 provides abstract red-black tree type which is backed by "RBT_Impl" as
361 implementation. INCOMPATIBILTY.
363 * Theory Library/Coinductive_List has been removed -- superseded by
364 AFP/thys/Coinductive.
366 * Theory PReal, including the type "preal" and related operations, has
367 been removed. INCOMPATIBILITY.
369 * Real: new development using Cauchy Sequences.
371 * Split off theory "Big_Operators" containing setsum, setprod,
372 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
374 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
375 "Int" etc. INCOMPATIBILITY.
377 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
379 * New set of rules "ac_simps" provides combined assoc / commute
380 rewrites for all interpretations of the appropriate generic locales.
382 * Renamed theory "OrderedGroup" to "Groups" and split theory
383 "Ring_and_Field" into theories "Rings" and "Fields"; for more
384 appropriate and more consistent names suitable for name prefixes
385 within the HOL theories. INCOMPATIBILITY.
387 * Some generic constants have been put to appropriate theories:
388 - less_eq, less: Orderings
389 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
390 - inverse, divide: Rings
393 * More consistent naming of type classes involving orderings (and
396 lower_semilattice ~> semilattice_inf
397 upper_semilattice ~> semilattice_sup
399 dense_linear_order ~> dense_linorder
401 pordered_ab_group_add ~> ordered_ab_group_add
402 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
403 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
404 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
405 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
406 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
407 pordered_cancel_semiring ~> ordered_cancel_semiring
408 pordered_comm_monoid_add ~> ordered_comm_monoid_add
409 pordered_comm_ring ~> ordered_comm_ring
410 pordered_comm_semiring ~> ordered_comm_semiring
411 pordered_ring ~> ordered_ring
412 pordered_ring_abs ~> ordered_ring_abs
413 pordered_semiring ~> ordered_semiring
415 ordered_ab_group_add ~> linordered_ab_group_add
416 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
417 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
418 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
419 ordered_field ~> linordered_field
420 ordered_field_no_lb ~> linordered_field_no_lb
421 ordered_field_no_ub ~> linordered_field_no_ub
422 ordered_field_dense_linear_order ~> dense_linordered_field
423 ordered_idom ~> linordered_idom
424 ordered_ring ~> linordered_ring
425 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
426 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
427 ordered_ring_strict ~> linordered_ring_strict
428 ordered_semidom ~> linordered_semidom
429 ordered_semiring ~> linordered_semiring
430 ordered_semiring_1 ~> linordered_semiring_1
431 ordered_semiring_1_strict ~> linordered_semiring_1_strict
432 ordered_semiring_strict ~> linordered_semiring_strict
434 The following slightly odd type classes have been moved to a
435 separate theory Library/Lattice_Algebras:
437 lordered_ab_group_add ~> lattice_ab_group_add
438 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
439 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
440 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
441 lordered_ring ~> lattice_ring
445 * Refined field classes:
446 - classes division_ring_inverse_zero, field_inverse_zero,
447 linordered_field_inverse_zero include rule inverse 0 = 0 --
448 subsumes former division_by_zero class;
449 - numerous lemmas have been ported from field to division_ring.
452 * Refined algebra theorem collections:
453 - dropped theorem group group_simps, use algebra_simps instead;
454 - dropped theorem group ring_simps, use field_simps instead;
455 - proper theorem collection field_simps subsumes former theorem
456 groups field_eq_simps and field_simps;
457 - dropped lemma eq_minus_self_iff which is a duplicate for
461 * Theory Finite_Set and List: some lemmas have been generalized from
464 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
465 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
466 inter_Inter_fold_inter ~> inf_Inf_fold_inf
467 union_Union_fold_union ~> sup_Sup_fold_sup
468 Inter_fold_inter ~> Inf_fold_inf
469 Union_fold_union ~> Sup_fold_sup
470 inter_INTER_fold_inter ~> inf_INFI_fold_inf
471 union_UNION_fold_union ~> sup_SUPR_fold_sup
472 INTER_fold_inter ~> INFI_fold_inf
473 UNION_fold_union ~> SUPR_fold_sup
475 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
476 replaced by the more convenient lemmas Inf_empty and Sup_empty.
477 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
478 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
479 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
480 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
482 * Reorganized theory Multiset: swapped notation of pointwise and
485 - pointwise ordering is instance of class order with standard syntax
487 - multiset ordering has syntax <=# and <#; partial order properties
488 are provided by means of interpretation with prefix
490 - less duplication, less historical organization of sections,
491 conversion from associations lists to multisets, rudimentary code
493 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
498 multiset_eq_conv_count_eq ~> multiset_ext_iff
499 multi_count_ext ~> multiset_ext
500 diff_union_inverse2 ~> diff_union_cancelR
504 * Theory Permutation: replaced local "remove" by List.remove1.
506 * Code generation: ML and OCaml code is decorated with signatures.
508 * Theory List: added transpose.
510 * Library/Nat_Bijection.thy is a collection of bijective functions
511 between nat and other types, which supersedes the older libraries
512 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
515 Nat_Int_Bij.nat2_to_nat ~> prod_encode
516 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
517 Nat_Int_Bij.int_to_nat_bij ~> int_encode
518 Nat_Int_Bij.nat_to_int_bij ~> int_decode
519 Countable.pair_encode ~> prod_encode
520 NatIso.prod2nat ~> prod_encode
521 NatIso.nat2prod ~> prod_decode
522 NatIso.sum2nat ~> sum_encode
523 NatIso.nat2sum ~> sum_decode
524 NatIso.list2nat ~> list_encode
525 NatIso.nat2list ~> list_decode
526 NatIso.set2nat ~> set_encode
527 NatIso.nat2set ~> set_decode
530 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
531 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
532 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
533 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
534 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
535 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
536 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
537 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
538 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
539 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
540 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
541 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
542 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
545 - Renamed ATP commands:
546 atp_info ~> sledgehammer running_atps
547 atp_kill ~> sledgehammer kill_atps
548 atp_messages ~> sledgehammer messages
549 atp_minimize ~> sledgehammer minimize
550 print_atps ~> sledgehammer available_atps
552 - Added user's manual ("isabelle doc sledgehammer").
553 - Added option syntax and "sledgehammer_params" to customize
554 Sledgehammer's behavior. See the manual for details.
555 - Modified the Isar proof reconstruction code so that it produces
556 direct proofs rather than proofs by contradiction. (This feature
557 is still experimental.)
558 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
560 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
563 - Added and implemented "binary_ints" and "bits" options.
564 - Added "std" option and implemented support for nonstandard models.
565 - Added and implemented "finitize" option to improve the precision
566 of infinite datatypes based on a monotonicity analysis.
567 - Added support for quotient types.
568 - Added support for "specification" and "ax_specification"
570 - Added support for local definitions (for "function" and
571 "termination" proofs).
572 - Added support for term postprocessors.
573 - Optimized "Multiset.multiset" and "FinFun.finfun".
574 - Improved efficiency of "destroy_constrs" optimization.
575 - Fixed soundness bugs related to "destroy_constrs" optimization and
577 - Fixed soundness bug related to higher-order constructors.
578 - Fixed soundness bug when "full_descrs" is enabled.
579 - Improved precision of set constructs.
580 - Added "atoms" option.
581 - Added cache to speed up repeated Kodkod invocations on the same
583 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
584 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
585 "SAT4J_Light". INCOMPATIBILITY.
586 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
587 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
588 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
590 * Method "induct" now takes instantiations of the form t, where t is not
591 a variable, as a shorthand for "x == t", where x is a fresh variable.
592 If this is not intended, t has to be enclosed in parentheses.
593 By default, the equalities generated by definitional instantiations
594 are pre-simplified, which may cause parameters of inductive cases
595 to disappear, or may even delete some of the inductive cases.
596 Use "induct (no_simp)" instead of "induct" to restore the old
597 behaviour. The (no_simp) option is also understood by the "cases"
598 and "nominal_induct" methods, which now perform pre-simplification, too.
604 * Variable names in lemmas generated by the domain package have
605 changed; the naming scheme is now consistent with the HOL datatype
606 package. Some proof scripts may be affected, INCOMPATIBILITY.
608 * The domain package no longer defines the function "foo_copy" for
609 recursive domain "foo". The reach lemma is now stated directly in
610 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
611 be reformulated in terms of "foo_take", INCOMPATIBILITY.
613 * Most definedness lemmas generated by the domain package (previously
614 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
615 like "foo$x = UU <-> x = UU", which works better as a simp rule.
616 Proofs that used definedness lemmas as intro rules may break,
617 potential INCOMPATIBILITY.
619 * Induction and casedist rules generated by the domain package now
620 declare proper case_names (one called "bottom", and one named for each
621 constructor). INCOMPATIBILITY.
623 * For mutually-recursive domains, separate "reach" and "take_lemma"
624 rules are generated for each domain, INCOMPATIBILITY.
626 foo_bar.reach ~> foo.reach bar.reach
627 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
629 * Some lemmas generated by the domain package have been renamed for
630 consistency with the datatype package, INCOMPATIBILITY.
632 foo.ind ~> foo.induct
633 foo.finite_ind ~> foo.finite_induct
634 foo.coind ~> foo.coinduct
635 foo.casedist ~> foo.exhaust
636 foo.exhaust ~> foo.nchotomy
638 * For consistency with other definition packages, the fixrec package
639 now generates qualified theorem names, INCOMPATIBILITY.
641 foo_simps ~> foo.simps
642 foo_unfold ~> foo.unfold
643 foo_induct ~> foo.induct
645 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
646 method and internal fixrec proofs now use the default simpset instead.
649 * The "contlub" predicate has been removed. Proof scripts should use
650 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
652 * The "admw" predicate has been removed, INCOMPATIBILITY.
654 * The constants cpair, cfst, and csnd have been removed in favor of
655 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
660 * Antiquotations for basic formal entities:
662 @{class NAME} -- type class
663 @{class_syntax NAME} -- syntax representation of the above
665 @{type_name NAME} -- logical type
666 @{type_abbrev NAME} -- type abbreviation
667 @{nonterminal NAME} -- type of concrete syntactic category
668 @{type_syntax NAME} -- syntax representation of any of the above
670 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
671 @{const_abbrev NAME} -- abbreviated constant
672 @{const_syntax NAME} -- syntax representation of any of the above
674 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
675 syntax constant (cf. 'syntax' command).
677 * Antiquotation @{make_string} inlines a function to print arbitrary
678 values similar to the ML toplevel. The result is compiler dependent
679 and may fall back on "?" in certain situations.
681 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
682 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
683 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
684 not work with the asynchronous Isar document model.
686 * Configuration options now admit dynamic default values, depending on
687 the context or even global references.
689 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
690 uses an efficient external library if available (for Poly/ML).
692 * Renamed some important ML structures, while keeping the old names
693 for some time as aliases within the structure Legacy:
695 OuterKeyword ~> Keyword
698 OuterSyntax ~> Outer_Syntax
699 PrintMode ~> Print_Mode
700 SpecParse ~> Parse_Spec
703 ThyOutput ~> Thy_Output
704 TypeInfer ~> Type_Infer
706 Note that "open Legacy" simplifies porting of sources, but forgetting
707 to remove it again will complicate porting again in the future.
709 * Most operations that refer to a global context are named
710 accordingly, e.g. Simplifier.global_context or
711 ProofContext.init_global. There are some situations where a global
712 context actually works, but under normal circumstances one needs to
713 pass the proper local context through the code!
715 * Discontinued old TheoryDataFun with its copy/init operation -- data
716 needs to be pure. Functor Theory_Data_PP retains the traditional
717 Pretty.pp argument to merge, which is absent in the standard
720 * Sorts.certify_sort and derived "cert" operations for types and terms
721 no longer minimize sorts. Thus certification at the boundary of the
722 inference kernel becomes invariant under addition of class relations,
723 which is an important monotonicity principle. Sorts are now minimized
724 in the syntax layer only, at the boundary between the end-user and the
725 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
726 explicitly in rare situations.
728 * Renamed old-style Drule.standard to Drule.export_without_context, to
729 emphasize that this is in no way a standard operation.
732 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
733 usual for resolution. Rare INCOMPATIBILITY.
735 * Renamed varify/unvarify operations to varify_global/unvarify_global
736 to emphasize that these only work in a global situation (which is
739 * Curried take and drop in library.ML; negative length is interpreted
740 as infinity (as in chop). Subtle INCOMPATIBILITY.
742 * Proof terms: type substitutions on proof constants now use canonical
743 order of type variables. INCOMPATIBILITY for tools working with proof
746 * Raw axioms/defs may no longer carry sort constraints, and raw defs
747 may no longer carry premises. User-level specifications are
748 transformed accordingly by Thm.add_axiom/add_def.
753 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
754 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
755 proof terms are enabled unconditionally in the new HOL-Proofs image.
757 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
758 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
761 * Old lib/scripts/polyml-platform is superseded by the
762 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
763 variant, even on a 64 bit machine. The following example setting
764 prefers 64 bit if available:
766 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
768 * The preliminary Isabelle/jEdit application demonstrates the emerging
769 Isabelle/Scala layer for advanced prover interaction and integration.
770 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
773 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
774 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
775 similar to the default assignment of the document preparation system
776 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
777 provides some operations for direct access to the font without asking
778 the user for manual installation.
782 New in Isabelle2009-1 (December 2009)
783 -------------------------------------
787 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
788 one backslash should be used, even in ML sources.
793 * Locale interpretation propagates mixins along the locale hierarchy.
794 The currently only available mixins are the equations used to map
795 local definitions to terms of the target domain of an interpretation.
797 * Reactivated diagnostic command 'print_interps'. Use "print_interps
798 loc" to print all interpretations of locale "loc" in the theory.
799 Interpretations in proofs are not shown.
801 * Thoroughly revised locales tutorial. New section on conditional
804 * On instantiation of classes, remaining undefined class parameters
805 are formally declared. INCOMPATIBILITY.
808 *** Document preparation ***
810 * New generalized style concept for printing terms: @{foo (style) ...}
811 instead of @{foo_style style ...} (old form is still retained for
812 backward compatibility). Styles can be also applied for
813 antiquotations prop, term_type and typeof.
818 * New proof method "smt" for a combination of first-order logic with
819 equality, linear and nonlinear (natural/integer/real) arithmetic, and
820 fixed-size bitvectors; there is also basic support for higher-order
821 features (esp. lambda abstractions). It is an incomplete decision
822 procedure based on external SMT solvers using the oracle mechanism;
823 for the SMT solver Z3, this method is proof-producing. Certificates
824 are provided to avoid calling the external solvers solely for
825 re-checking proofs. Due to a remote SMT service there is no need for
826 installing SMT solvers locally. See src/HOL/SMT.
828 * New commands to load and prove verification conditions generated by
829 the Boogie program verifier or derived systems (e.g. the Verifying C
830 Compiler (VCC) or Spec#). See src/HOL/Boogie.
832 * New counterexample generator tool 'nitpick' based on the Kodkod
833 relational model finder. See src/HOL/Tools/Nitpick and
834 src/HOL/Nitpick_Examples.
836 * New commands 'code_pred' and 'values' to invoke the predicate
837 compiler and to enumerate values of inductive predicates.
839 * A tabled implementation of the reflexive transitive closure.
841 * New implementation of quickcheck uses generic code generator;
842 default generators are provided for all suitable HOL types, records
843 and datatypes. Old quickcheck can be re-activated importing theory
844 Library/SML_Quickcheck.
846 * New testing tool Mirabelle for automated proof tools. Applies
847 several tools and tactics like sledgehammer, metis, or quickcheck, to
848 every proof step in a theory. To be used in batch mode via the
851 * New proof method "sos" (sum of squares) for nonlinear real
852 arithmetic (originally due to John Harison). It requires theory
853 Library/Sum_Of_Squares. It is not a complete decision procedure but
854 works well in practice on quantifier-free real arithmetic with +, -,
855 *, ^, =, <= and <, i.e. boolean combinations of equalities and
856 inequalities between polynomials. It makes use of external
857 semidefinite programming solvers. Method "sos" generates a
858 certificate that can be pasted into the proof thus avoiding the need
859 to call an external tool every time the proof is checked. See
860 src/HOL/Library/Sum_Of_Squares.
862 * New method "linarith" invokes existing linear arithmetic decision
865 * New command 'atp_minimal' reduces result produced by Sledgehammer.
867 * New Sledgehammer option "Full Types" in Proof General settings menu.
868 Causes full type information to be output to the ATPs. This slows
869 ATPs down considerably but eliminates a source of unsound "proofs"
872 * New method "metisFT": A version of metis that uses full type
873 information in order to avoid failures of proof reconstruction.
875 * New evaluator "approximate" approximates an real valued term using
876 the same method as the approximation method.
878 * Method "approximate" now supports arithmetic expressions as
879 boundaries of intervals and implements interval splitting and Taylor
882 * ML antiquotation @{code_datatype} inserts definition of a datatype
883 generated by the code generator; e.g. see src/HOL/Predicate.thy.
885 * New theory SupInf of the supremum and infimum operators for sets of
888 * New theory Probability, which contains a development of measure
889 theory, eventually leading to Lebesgue integration and probability.
891 * Extended Multivariate Analysis to include derivation and Brouwer's
894 * Reorganization of number theory, INCOMPATIBILITY:
895 - new number theory development for nat and int, in theories Divides
896 and GCD as well as in new session Number_Theory
897 - some constants and facts now suffixed with _nat and _int
899 - former session NumberTheory now named Old_Number_Theory, including
900 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
901 - moved theory Pocklington from src/HOL/Library to
902 src/HOL/Old_Number_Theory
904 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
905 lcm of finite and infinite sets. It is shown that they form a complete
908 * Class semiring_div requires superclass no_zero_divisors and proof of
909 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
910 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
911 generalized to class semiring_div, subsuming former theorems
912 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
913 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
916 * Refinements to lattice classes and sets:
917 - less default intro/elim rules in locale variant, more default
918 intro/elim rules in class variant: more uniformity
919 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
921 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
923 - renamed ACI to inf_sup_aci
924 - new class "boolean_algebra"
925 - class "complete_lattice" moved to separate theory
926 "Complete_Lattice"; corresponding constants (and abbreviations)
927 renamed and with authentic syntax:
928 Set.Inf ~> Complete_Lattice.Inf
929 Set.Sup ~> Complete_Lattice.Sup
930 Set.INFI ~> Complete_Lattice.INFI
931 Set.SUPR ~> Complete_Lattice.SUPR
932 Set.Inter ~> Complete_Lattice.Inter
933 Set.Union ~> Complete_Lattice.Union
934 Set.INTER ~> Complete_Lattice.INTER
935 Set.UNION ~> Complete_Lattice.UNION
936 - authentic syntax for
939 - mere abbreviations:
942 Set.inter (for inf, formerly Set.Int)
943 Set.union (for sup, formerly Set.Un)
944 Complete_Lattice.Inter (for Inf)
945 Complete_Lattice.Union (for Sup)
946 Complete_Lattice.INTER (for INFI)
947 Complete_Lattice.UNION (for SUPR)
948 - object-logic definitions as far as appropriate
950 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
951 Un_subset_iff are explicitly deleted as default simp rules; then also
952 their lattice counterparts le_inf_iff and le_sup_iff have to be
953 deleted to achieve the desired effect.
955 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
956 rules by default any longer; the same applies to min_max.inf_absorb1
957 etc. INCOMPATIBILITY.
959 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
960 pred_set_conv by default. INCOMPATIBILITY.
962 * Power operations on relations and functions are now one dedicated
963 constant "compow" with infix syntax "^^". Power operation on
964 multiplicative monoids retains syntax "^" and is now defined generic
965 in class power. INCOMPATIBILITY.
967 * Relation composition "R O S" now has a more standard argument order:
968 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
969 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
970 break, since the O_assoc rule was not rewritten like this. Fix using
971 O_assoc[symmetric]. The same applies to the curried version "R OO S".
973 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
974 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
977 * Most rules produced by inductive and datatype package have mandatory
978 prefixes. INCOMPATIBILITY.
980 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
981 the attribute of the same name. Each of the theorems in the list
982 DERIV_intros assumes composition with an additional function and
983 matches a variable to the derivative, which has to be solved by the
984 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
985 of most elementary terms. Former Maclauren.DERIV_tac and
986 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
989 * Code generator attributes follow the usual underscore convention:
990 code_unfold replaces code unfold
991 code_post replaces code post
996 sizechange -> size_change
997 induct_scheme -> induction_schema
1000 * Discontinued abbreviation "arbitrary" of constant "undefined".
1001 INCOMPATIBILITY, use "undefined" directly.
1004 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1005 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1006 Suc_plus1 -> Suc_eq_plus1
1007 *anti_sym -> *antisym*
1008 vector_less_eq_def -> vector_le_def
1011 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1014 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1020 * Theory Representable defines a class "rep" of domains that are
1021 representable (via an ep-pair) in the universal domain type "udom".
1022 Instances are provided for all type constructors defined in HOLCF.
1024 * The 'new_domain' command is a purely definitional version of the
1025 domain package, for representable domains. Syntax is identical to the
1026 old domain package. The 'new_domain' package also supports indirect
1027 recursion using previously-defined type constructors. See
1028 src/HOLCF/ex/New_Domain.thy for examples.
1030 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1031 on the left-hand side of an equation, and then performs
1032 simplification. Rewriting is done using rules declared with the
1033 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1034 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1036 * The pattern-match compiler in 'fixrec' can now handle constructors
1037 with HOL function types. Pattern-match combinators for the Pair
1038 constructor are pre-configured.
1040 * The 'fixrec' package now produces better fixed-point induction rules
1041 for mutually-recursive definitions: Induction rules have conclusions
1042 of the form "P foo bar" instead of "P <foo, bar>".
1044 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1045 been renamed to "below". The name "below" now replaces "less" in many
1046 theorem names. (Legacy theorem names using "less" are still supported
1049 * The 'fixrec' package now supports "bottom patterns". Bottom
1050 patterns can be used to generate strictness rules, or to make
1051 functions more strict (much like the bang-patterns supported by the
1052 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1058 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1059 errors and run-time exceptions, including detailed source positions.
1061 * Structure Name_Space (formerly NameSpace) now manages uniquely
1062 identified entries, with some additional information such as source
1063 position, logical grouping etc.
1065 * Theory and context data is now introduced by the simplified and
1066 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1067 to be pure, but the old TheoryDataFun for mutable data (with explicit
1068 copy operation) is still available for some time.
1070 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1071 provides a high-level programming interface to synchronized state
1072 variables with atomic update. This works via pure function
1073 application within a critical section -- its runtime should be as
1074 short as possible; beware of deadlocks if critical code is nested,
1075 either directly or indirectly via other synchronized variables!
1077 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1078 wraps raw ML references, explicitly indicating their non-thread-safe
1079 behaviour. The Isar toplevel keeps this structure open, to
1080 accommodate Proof General as well as quick and dirty interactive
1081 experiments with references.
1083 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1084 parallel tactical reasoning.
1086 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1087 are similar to SUBPROOF, but are slightly more flexible: only the
1088 specified parts of the subgoal are imported into the context, and the
1089 body tactic may introduce new subgoals and schematic variables.
1091 * Old tactical METAHYPS, which does not observe the proof context, has
1092 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1093 or Subgoal.FOCUS etc.
1095 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1096 functors have their own ML name space there is no point to mark them
1097 separately.) Minor INCOMPATIBILITY.
1099 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1101 * Renamed several structures FooBar to Foo_Bar. Occasional,
1104 * Operations of structure Skip_Proof no longer require quick_and_dirty
1105 mode, which avoids critical setmp.
1107 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1108 combinators for "args". INCOMPATIBILITY, need to use simplified
1109 Attrib/Method.setup introduced in Isabelle2009.
1111 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1112 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1113 last resort. INCOMPATIBILITY.
1115 * Display.pretty_thm now requires a proper context (cf. former
1116 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1117 or even Display.pretty_thm_without_context as last resort.
1120 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1121 Syntax.pretty_typ/term directly, preferably with proper context
1122 instead of global theory.
1127 * Further fine tuning of parallel proof checking, scales up to 8 cores
1128 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1131 * Support for additional "Isabelle components" via etc/components, see
1132 also the system manual.
1134 * The isabelle makeall tool now operates on all components with
1135 IsaMakefile, not just hardwired "logics".
1137 * Removed "compress" option from isabelle-process and isabelle usedir;
1138 this is always enabled.
1140 * Discontinued support for Poly/ML 4.x versions.
1142 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1143 on a given logic image. This requires the lighttpd webserver and is
1144 currently supported on Linux only.
1148 New in Isabelle2009 (April 2009)
1149 --------------------------------
1153 * Simplified main Isabelle executables, with less surprises on
1154 case-insensitive file-systems (such as Mac OS).
1156 - The main Isabelle tool wrapper is now called "isabelle" instead of
1159 - The former "isabelle" alias for "isabelle-process" has been
1160 removed (should rarely occur to regular users).
1162 - The former "isabelle-interface" and its alias "Isabelle" have been
1163 removed (interfaces are now regular Isabelle tools).
1165 Within scripts and make files, the Isabelle environment variables
1166 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1167 respectively. (The latter are still available as legacy feature.)
1169 The old isabelle-interface wrapper could react in confusing ways if
1170 the interface was uninstalled or changed otherwise. Individual
1171 interface tool configuration is now more explicit, see also the
1172 Isabelle system manual. In particular, Proof General is now available
1173 via "isabelle emacs".
1175 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1176 purge installed copies of Isabelle executables and re-run "isabelle
1177 install -p ...", or use symlinks.
1179 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1180 old ~/isabelle, which was slightly non-standard and apt to cause
1181 surprises on case-insensitive file-systems (such as Mac OS).
1183 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1184 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1185 care is required when using older releases of Isabelle. Note that
1186 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1187 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1189 * Proofs of fully specified statements are run in parallel on
1190 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1191 a regular 4-core machine, if the initial heap space is made reasonably
1192 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1194 * The main reference manuals ("isar-ref", "implementation", and
1195 "system") have been updated and extended. Formally checked references
1196 as hyperlinks are now available uniformly.
1201 * Complete re-implementation of locales. INCOMPATIBILITY in several
1202 respects. The most important changes are listed below. See the
1203 Tutorial on Locales ("locales" manual) for details.
1205 - In locale expressions, instantiation replaces renaming. Parameters
1206 must be declared in a for clause. To aid compatibility with previous
1207 parameter inheritance, in locale declarations, parameters that are not
1208 'touched' (instantiation position "_" or omitted) are implicitly added
1209 with their syntax at the beginning of the for clause.
1211 - Syntax from abbreviations and definitions in locales is available in
1212 locale expressions and context elements. The latter is particularly
1213 useful in locale declarations.
1215 - More flexible mechanisms to qualify names generated by locale
1216 expressions. Qualifiers (prefixes) may be specified in locale
1217 expressions, and can be marked as mandatory (syntax: "name!:") or
1218 optional (syntax "name?:"). The default depends for plain "name:"
1219 depends on the situation where a locale expression is used: in
1220 commands 'locale' and 'sublocale' prefixes are optional, in
1221 'interpretation' and 'interpret' prefixes are mandatory. The old
1222 implicit qualifiers derived from the parameter names of a locale are
1223 no longer generated.
1225 - Command "sublocale l < e" replaces "interpretation l < e". The
1226 instantiation clause in "interpretation" and "interpret" (square
1227 brackets) is no longer available. Use locale expressions.
1229 - When converting proof scripts, mandatory qualifiers in
1230 'interpretation' and 'interpret' should be retained by default, even
1231 if this is an INCOMPATIBILITY compared to former behavior. In the
1232 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1233 in locale expressions range over a single locale instance only.
1235 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1236 In existing theorem specifications replace the includes element by the
1237 respective context elements of the included locale, omitting those
1238 that are already present in the theorem specification. Multiple
1239 assume elements of a locale should be replaced by a single one
1240 involving the locale predicate. In the proof body, declarations (most
1241 notably theorems) may be regained by interpreting the respective
1242 locales in the proof context as required (command "interpret").
1244 If using "includes" in replacement of a target solely because the
1245 parameter types in the theorem are not as general as in the target,
1246 consider declaring a new locale with additional type constraints on
1247 the parameters (context element "constrains").
1249 - Discontinued "locale (open)". INCOMPATIBILITY.
1251 - Locale interpretation commands no longer attempt to simplify goal.
1252 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1253 methods intro_locales and unfold_locales to clarify.
1255 - Locale interpretation commands no longer accept interpretation
1256 attributes. INCOMPATIBILITY.
1258 * Class declaration: so-called "base sort" must not be given in import
1259 list any longer, but is inferred from the specification. Particularly
1266 class foo = type + ...
1268 * Class target: global versions of theorems stemming do not carry a
1269 parameter prefix any longer. INCOMPATIBILITY.
1271 * Class 'instance' command no longer accepts attached definitions.
1272 INCOMPATIBILITY, use proper 'instantiation' target instead.
1274 * Recovered hiding of consts, which was accidentally broken in
1275 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1276 makes c inaccessible; consider using ``hide (open) const c'' instead.
1278 * Slightly more coherent Pure syntax, with updated documentation in
1279 isar-ref manual. Removed locales meta_term_syntax and
1280 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1281 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1282 directly in regular applications.
1284 * There is a new syntactic category "float_const" for signed decimal
1285 fractions (e.g. 123.45 or -123.45).
1287 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1288 interface with 'setup' command instead.
1290 * Command 'local_setup' is similar to 'setup', but operates on a local
1293 * The 'axiomatization' command now only works within a global theory
1294 context. INCOMPATIBILITY.
1296 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1297 hypotheses. Sorts required in the course of reasoning need to be
1298 covered by the constraints in the initial statement, completed by the
1299 type instance information of the background theory. Non-trivial sort
1300 hypotheses, which rarely occur in practice, may be specified via
1301 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1303 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1305 The result contains an implicit sort hypotheses as before --
1306 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1309 * Generalized Isar history, with support for linear undo, direct state
1312 * Changed defaults for unify configuration options:
1314 unify_trace_bound = 50 (formerly 25)
1315 unify_search_bound = 60 (formerly 30)
1317 * Different bookkeeping for code equations (INCOMPATIBILITY):
1319 a) On theory merge, the last set of code equations for a particular
1320 constant is taken (in accordance with the policy applied by other
1321 parts of the code generator framework).
1323 b) Code equations stemming from explicit declarations (e.g. code
1324 attribute) gain priority over default code equations stemming
1325 from definition, primrec, fun etc.
1327 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1329 * Unified theorem tables for both code generators. Thus [code
1330 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1332 * Command 'find_consts' searches for constants based on type and name
1335 find_consts "_ => bool"
1337 By default, matching is against subtypes, but it may be restricted to
1338 the whole type. Searching by name is possible. Multiple queries are
1339 conjunctive and queries may be negated by prefixing them with a
1342 find_consts strict: "_ => bool" name: "Int" -"int => int"
1344 * New 'find_theorems' criterion "solves" matches theorems that
1345 directly solve the current goal (modulo higher-order unification).
1347 * Auto solve feature for main theorem statements: whenever a new goal
1348 is stated, "find_theorems solves" is called; any theorems that could
1349 solve the lemma directly are listed as part of the goal state.
1350 Cf. associated options in Proof General Isabelle settings menu,
1351 enabled by default, with reasonable timeout for pathological cases of
1352 higher-order unification.
1355 *** Document preparation ***
1357 * Antiquotation @{lemma} now imitates a regular terminal proof,
1358 demanding keyword 'by' and supporting the full method expression
1359 syntax just like the Isar command 'by'.
1364 * Integrated main parts of former image HOL-Complex with HOL. Entry
1365 points Main and Complex_Main remain as before.
1367 * Logic image HOL-Plain provides a minimal HOL with the most important
1368 tools available (inductive, datatype, primrec, ...). This facilitates
1369 experimentation and tool development. Note that user applications
1370 (and library theories) should never refer to anything below theory
1373 * Logic image HOL-Main stops at theory Main, and thus facilitates
1374 experimentation due to shorter build times.
1376 * Logic image HOL-NSA contains theories of nonstandard analysis which
1377 were previously part of former HOL-Complex. Entry point Hyperreal
1378 remains valid, but theories formerly using Complex_Main should now use
1379 new entry point Hypercomplex.
1381 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1382 Posix processes. Avoids potentially expensive forking of the ML
1383 process. New thread-based implementation also works on non-Unix
1384 platforms (Cygwin). Provers are no longer hardwired, but defined
1385 within the theory via plain ML wrapper functions. Basic Sledgehammer
1386 commands are covered in the isar-ref manual.
1388 * Wrapper scripts for remote SystemOnTPTP service allows to use
1389 sledgehammer without local ATP installation (Vampire etc.). Other
1390 provers may be included via suitable ML wrappers, see also
1391 src/HOL/ATP_Linkup.thy.
1393 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1396 * The metis method no longer fails because the theorem is too trivial
1397 (contains the empty clause).
1399 * The metis method now fails in the usual manner, rather than raising
1400 an exception, if it determines that it cannot prove the theorem.
1402 * Method "coherent" implements a prover for coherent logic (see also
1403 src/Tools/coherent.ML).
1405 * Constants "undefined" and "default" replace "arbitrary". Usually
1406 "undefined" is the right choice to replace "arbitrary", though
1407 logically there is no difference. INCOMPATIBILITY.
1409 * Command "value" now integrates different evaluation mechanisms. The
1410 result of the first successful evaluation mechanism is printed. In
1411 square brackets a particular named evaluation mechanisms may be
1412 specified (currently, [SML], [code] or [nbe]). See further
1413 src/HOL/ex/Eval_Examples.thy.
1415 * Normalization by evaluation now allows non-leftlinear equations.
1416 Declare with attribute [code nbe].
1418 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1419 as the structured Isar versions "cases" and "induct", cf. the
1420 corresponding "cases" and "induct" attributes. Mutual induction rules
1421 are now presented as a list of individual projections
1422 (e.g. foo_bar.inducts for types foo and bar); the old format with
1423 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1424 rare situations a different rule is selected --- notably nested tuple
1425 elimination instead of former prod.exhaust: use explicit (case_tac t
1426 rule: prod.exhaust) here.
1428 * Attributes "cases", "induct", "coinduct" support "del" option.
1430 * Removed fact "case_split_thm", which duplicates "case_split".
1432 * The option datatype has been moved to a new theory Option. Renamed
1433 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1435 * New predicate "strict_mono" classifies strict functions on partial
1436 orders. With strict functions on linear orders, reasoning about
1437 (in)equalities is facilitated by theorems "strict_mono_eq",
1438 "strict_mono_less_eq" and "strict_mono_less".
1440 * Some set operations are now proper qualified constants with
1441 authentic syntax. INCOMPATIBILITY:
1452 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1455 * Auxiliary class "itself" has disappeared -- classes without any
1456 parameter are treated as expected by the 'class' command.
1458 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1460 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1461 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1463 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1464 method "approximation". It proves formulas on real values by using
1465 interval arithmetic. In the formulas are also the transcendental
1466 functions sin, cos, tan, atan, ln, exp and the constant pi are
1467 allowed. For examples see
1468 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1470 * Theory "Reflection" now resides in HOL/Library.
1472 * Entry point to Word library now simply named "Word".
1475 * Made source layout more coherent with logical distribution
1478 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1479 src/HOL/Library/Code_Message.thy ~> src/HOL/
1480 src/HOL/Library/GCD.thy ~> src/HOL/
1481 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1482 src/HOL/Library/Parity.thy ~> src/HOL/
1483 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1484 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1485 src/HOL/Real/Lubs.thy ~> src/HOL/
1486 src/HOL/Real/PReal.thy ~> src/HOL/
1487 src/HOL/Real/Rational.thy ~> src/HOL/
1488 src/HOL/Real/RComplete.thy ~> src/HOL/
1489 src/HOL/Real/RealDef.thy ~> src/HOL/
1490 src/HOL/Real/RealPow.thy ~> src/HOL/
1491 src/HOL/Real/Real.thy ~> src/HOL/
1492 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1493 src/HOL/Complex/Complex.thy ~> src/HOL/
1494 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1495 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1496 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1497 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1498 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1499 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1500 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1501 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1502 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1503 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1504 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1505 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1506 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1507 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1508 src/HOL/Real/Float ~> src/HOL/Library/
1509 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1510 src/HOL/Real/RealVector.thy ~> src/HOL/
1512 src/HOL/arith_data.ML ~> src/HOL/Tools
1513 src/HOL/hologic.ML ~> src/HOL/Tools
1514 src/HOL/simpdata.ML ~> src/HOL/Tools
1515 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1516 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1517 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1518 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1519 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1520 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1521 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1523 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1524 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1525 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1526 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1527 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1528 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1530 * If methods "eval" and "evaluation" encounter a structured proof
1531 state with !!/==>, only the conclusion is evaluated to True (if
1532 possible), avoiding strange error messages.
1534 * Method "sizechange" automates termination proofs using (a
1535 modification of) the size-change principle. Requires SAT solver. See
1536 src/HOL/ex/Termination.thy for examples.
1538 * Simplifier: simproc for let expressions now unfolds if bound
1539 variable occurs at most once in let expression body. INCOMPATIBILITY.
1541 * Method "arith": Linear arithmetic now ignores all inequalities when
1542 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1544 * New attribute "arith" for facts that should always be used
1545 automatically by arithmetic. It is intended to be used locally in
1548 assumes [arith]: "x > 0"
1550 Global usage is discouraged because of possible performance impact.
1552 * New classes "top" and "bot" with corresponding operations "top" and
1553 "bot" in theory Orderings; instantiation of class "complete_lattice"
1554 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1556 * Changed definition lemma "less_fun_def" in order to provide an
1557 instance for preorders on functions; use lemma "less_le" instead.
1560 * Theory Orderings: class "wellorder" moved here, with explicit
1561 induction rule "less_induct" as assumption. For instantiation of
1562 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1565 * Theory Orderings: added class "preorder" as superclass of "order".
1566 INCOMPATIBILITY: Instantiation proofs for order, linorder
1567 etc. slightly changed. Some theorems named order_class.* now named
1570 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1573 * Theory Finite_Set: added a new fold combinator of type
1575 ('a => 'b => 'b) => 'b => 'a set => 'b
1577 Occasionally this is more convenient than the old fold combinator
1578 which is now defined in terms of the new one and renamed to
1581 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1582 and "ring_simps" have been replaced by "algebra_simps" (which can be
1583 extended with further lemmas!). At the moment both still exist but
1584 the former will disappear at some point.
1586 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1587 class recpower. Type-specific simp rules for various recpower types
1588 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1590 rat_power_0 -> power_0
1591 rat_power_Suc -> power_Suc
1592 realpow_0 -> power_0
1593 realpow_Suc -> power_Suc
1594 complexpow_0 -> power_0
1595 complexpow_Suc -> power_Suc
1596 power_poly_0 -> power_0
1597 power_poly_Suc -> power_Suc
1599 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1600 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1601 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1602 of lemmas from Divides has been generalized from nat to class
1603 semiring_div. INCOMPATIBILITY. This involves the following theorem
1604 renames resulting from duplicate elimination:
1606 dvd_def_mod ~> dvd_eq_mod_eq_0
1607 zero_dvd_iff ~> dvd_0_left_iff
1608 dvd_0 ~> dvd_0_right
1609 DIVISION_BY_ZERO_DIV ~> div_by_0
1610 DIVISION_BY_ZERO_MOD ~> mod_by_0
1611 mult_div ~> div_mult_self2_is_id
1612 mult_mod ~> mod_mult_self2_is_0
1614 * Theory IntDiv: removed many lemmas that are instances of class-based
1615 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1616 rename old lemmas as follows:
1618 dvd_diff -> nat_dvd_diff
1619 dvd_zminus_iff -> dvd_minus_iff
1620 mod_add1_eq -> mod_add_eq
1621 mod_mult1_eq -> mod_mult_right_eq
1622 mod_mult1_eq' -> mod_mult_left_eq
1623 mod_mult_distrib_mod -> mod_mult_eq
1624 nat_mod_add_left_eq -> mod_add_left_eq
1625 nat_mod_add_right_eq -> mod_add_right_eq
1626 nat_mod_div_trivial -> mod_div_trivial
1627 nat_mod_mod_trivial -> mod_mod_trivial
1628 zdiv_zadd_self1 -> div_add_self1
1629 zdiv_zadd_self2 -> div_add_self2
1630 zdiv_zmult_self1 -> div_mult_self2_is_id
1631 zdiv_zmult_self2 -> div_mult_self1_is_id
1632 zdvd_triv_left -> dvd_triv_left
1633 zdvd_triv_right -> dvd_triv_right
1634 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1635 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1636 zmod_zadd_left_eq -> mod_add_left_eq
1637 zmod_zadd_right_eq -> mod_add_right_eq
1638 zmod_zadd_self1 -> mod_add_self1
1639 zmod_zadd_self2 -> mod_add_self2
1640 zmod_zadd1_eq -> mod_add_eq
1641 zmod_zdiff1_eq -> mod_diff_eq
1642 zmod_zdvd_zmod -> mod_mod_cancel
1643 zmod_zmod_cancel -> mod_mod_cancel
1644 zmod_zmult_self1 -> mod_mult_self2_is_0
1645 zmod_zmult_self2 -> mod_mult_self1_is_0
1648 zdvd_abs1 -> abs_dvd_iff
1649 zdvd_abs2 -> dvd_abs_iff
1650 zdvd_refl -> dvd_refl
1651 zdvd_trans -> dvd_trans
1652 zdvd_zadd -> dvd_add
1653 zdvd_zdiff -> dvd_diff
1654 zdvd_zminus_iff -> dvd_minus_iff
1655 zdvd_zminus2_iff -> minus_dvd_iff
1656 zdvd_zmultD -> dvd_mult_right
1657 zdvd_zmultD2 -> dvd_mult_left
1658 zdvd_zmult_mono -> mult_dvd_mono
1659 zdvd_0_right -> dvd_0_right
1660 zdvd_0_left -> dvd_0_left_iff
1661 zdvd_1_left -> one_dvd
1662 zminus_dvd_iff -> minus_dvd_iff
1664 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1666 * The real numbers offer decimal input syntax: 12.34 is translated
1667 into 1234/10^2. This translation is not reversed upon output.
1669 * Theory Library/Polynomial defines an abstract type 'a poly of
1670 univariate polynomials with coefficients of type 'a. In addition to
1671 the standard ring operations, it also supports div and mod. Code
1672 generation is also supported, using list-style constructors.
1674 * Theory Library/Inner_Product defines a class of real_inner for real
1675 inner product spaces, with an overloaded operation inner :: 'a => 'a
1676 => real. Class real_inner is a subclass of real_normed_vector from
1679 * Theory Library/Product_Vector provides instances for the product
1680 type 'a * 'b of several classes from RealVector and Inner_Product.
1681 Definitions of addition, subtraction, scalar multiplication, norms,
1682 and inner products are included.
1684 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1685 addition to the field operations, numerals and case syntax are also
1688 * Theory Library/Diagonalize provides constructive version of Cantor's
1689 first diagonalization argument.
1691 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1692 zlcm (for int); carried together from various gcd/lcm developements in
1693 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1694 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1695 may recover tupled syntax as follows:
1697 hide (open) const gcd
1698 abbreviation gcd where
1699 "gcd == (%(a, b). GCD.gcd a b)"
1701 GCD.gcd ("gcd '(_, _')")
1703 The same works for lcm, zgcd, zlcm.
1705 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1706 instantiations for algebraic structures. Removed some duplicate
1707 theorems. Changes in simp rules. INCOMPATIBILITY.
1709 * ML antiquotation @{code} takes a constant as argument and generates
1710 corresponding code in background and inserts name of the corresponding
1711 resulting ML value/function/datatype constructor binding in place.
1712 All occurrences of @{code} with a single ML block are generated
1713 simultaneously. Provides a generic and safe interface for
1714 instrumentalizing code generation. See
1715 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1716 In future you ought to refrain from ad-hoc compiling generated SML
1717 code on the ML toplevel. Note that (for technical reasons) @{code}
1718 cannot refer to constants for which user-defined serializations are
1719 set. Refer to the corresponding ML counterpart directly in that
1722 * Command 'rep_datatype': instead of theorem names the command now
1723 takes a list of terms denoting the constructors of the type to be
1724 represented as datatype. The characteristic theorems have to be
1725 proven. INCOMPATIBILITY. Also observe that the following theorems
1726 have disappeared in favour of existing ones:
1728 unit_induct ~> unit.induct
1729 prod_induct ~> prod.induct
1730 sum_induct ~> sum.induct
1731 Suc_Suc_eq ~> nat.inject
1732 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1737 * New locales for orders and lattices where the equivalence relation
1738 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1739 locales use a record structure with field eq for the equivalence.
1741 * New theory of factorial domains.
1743 * Units_l_inv and Units_r_inv are now simp rules by default.
1744 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1745 and/or r_inv will now also require deletion of these lemmas.
1747 * Renamed the following theorems, INCOMPATIBILITY:
1749 UpperD ~> Upper_memD
1750 LowerD ~> Lower_memD
1751 least_carrier ~> least_closed
1752 greatest_carrier ~> greatest_closed
1753 greatest_Lower_above ~> greatest_Lower_below
1754 one_zero ~> carrier_one_zero
1755 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1760 * Nominal datatypes can now contain type-variables.
1762 * Commands 'nominal_inductive' and 'equivariance' work with local
1765 * Nominal primrec can now works with local theory targets and its
1766 specification syntax now conforms to the general format as seen in
1769 * Method "perm_simp" honours the standard simplifier attributes
1770 (no_asm), (no_asm_use) etc.
1772 * The new predicate #* is defined like freshness, except that on the
1773 left hand side can be a set or list of atoms.
1775 * Experimental command 'nominal_inductive2' derives strong induction
1776 principles for inductive definitions. In contrast to
1777 'nominal_inductive', which can only deal with a fixed number of
1778 binders, it can deal with arbitrary expressions standing for sets of
1779 atoms to be avoided. The only inductive definition we have at the
1780 moment that needs this generalisation is the typing rule for Lets in
1783 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1784 -----------------------------------------------------------------
1785 Gamma |- Let x be t1 in t2 : T2
1787 In this rule one wants to avoid all the binders that are introduced by
1788 "close Gamma T1". We are looking for other examples where this
1789 feature might be useful. Please let us know.
1794 * Reimplemented the simplification procedure for proving continuity
1795 subgoals. The new simproc is extensible; users can declare additional
1796 continuity introduction rules with the attribute [cont2cont].
1798 * The continuity simproc now uses a different introduction rule for
1799 solving continuity subgoals on terms with lambda abstractions. In
1800 some rare cases the new simproc may fail to solve subgoals that the
1801 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1802 Potential INCOMPATIBILITY.
1804 * Command 'fixrec': specification syntax now conforms to the general
1805 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1806 examples. INCOMPATIBILITY.
1811 * Proof of Zorn's Lemma for partial orders.
1816 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1817 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1818 depends on multithreading, so timouts will not work before Poly/ML
1821 * High-level support for concurrent ML programming, see
1822 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1823 particularly convenient to organize independent functional
1824 computations. The concept of "synchronized variables" provides a
1825 higher-order interface for components with shared state, avoiding the
1826 delicate details of mutexes and condition variables. (Requires
1827 Poly/ML 5.2.1 or later.)
1829 * ML bindings produced via Isar commands are stored within the Isar
1830 context (theory or proof). Consequently, commands like 'use' and 'ML'
1831 become thread-safe and work with undo as expected (concerning
1832 top-level bindings, not side-effects on global references).
1833 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1834 compiler at runtime; really global bindings need to be given outside a
1835 theory. (Requires Poly/ML 5.2 or later.)
1837 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1838 context. Top-level ML bindings are stored within the proof context in
1839 a purely sequential fashion, disregarding the nested proof structure.
1840 ML bindings introduced by 'ML_prf' are discarded at the end of the
1841 proof. (Requires Poly/ML 5.2 or later.)
1843 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1844 and Method.setup, as well as Isar commands 'attribute_setup' and
1845 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1846 existing code accordingly, or use plain 'setup' together with old
1849 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1850 to 'a -> thm, while results are always tagged with an authentic oracle
1851 name. The Isar command 'oracle' is now polymorphic, no argument type
1852 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1853 accordingly. Note that extra performance may be gained by producing
1854 the cterm carefully, avoiding slow Thm.cterm_of.
1856 * Simplified interface for defining document antiquotations via
1857 ThyOutput.antiquotation, ThyOutput.output, and optionally
1858 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1859 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1862 * More systematic treatment of long names, abstract name bindings, and
1863 name space operations. Basic operations on qualified names have been
1864 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1865 Long_Name.append. Old type bstring has been mostly replaced by
1866 abstract type binding (see structure Binding), which supports precise
1867 qualification by packages and local theory targets, as well as proper
1868 tracking of source positions. INCOMPATIBILITY, need to wrap old
1869 bstring values into Binding.name, or better pass through abstract
1870 bindings everywhere. See further src/Pure/General/long_name.ML,
1871 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1873 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1874 LocalTheory.note etc.) now refer to the *full* internal name, not the
1875 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1877 * Disposed old type and term read functions (Sign.read_def_typ,
1878 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1879 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1880 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1881 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1882 resort for legacy applications.
1884 * Disposed old declarations, tactics, tactic combinators that refer to
1885 the simpset or claset of an implicit theory (such as Addsimps,
1886 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1887 embedded ML text, or local_simpset_of with a proper context passed as
1888 explicit runtime argument.
1890 * Rules and tactics that read instantiations (read_instantiate,
1891 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1892 context, which is required for parsing and type-checking. Moreover,
1893 the variables are specified as plain indexnames, not string encodings
1894 thereof. INCOMPATIBILITY.
1896 * Generic Toplevel.add_hook interface allows to analyze the result of
1897 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1898 for theorem dependency output of transactions resulting in a new
1901 * ML antiquotations: block-structured compilation context indicated by
1902 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1904 @{binding name} - basic name binding
1905 @{let ?pat = term} - term abbreviation (HO matching)
1906 @{note name = fact} - fact abbreviation
1907 @{thm fact} - singleton fact (with attributes)
1908 @{thms fact} - general fact (with attributes)
1909 @{lemma prop by method} - singleton goal
1910 @{lemma prop by meth1 meth2} - singleton goal
1911 @{lemma prop1 ... propN by method} - general goal
1912 @{lemma prop1 ... propN by meth1 meth2} - general goal
1913 @{lemma (open) ...} - open derivation
1918 * The Isabelle "emacs" tool provides a specific interface to invoke
1919 Proof General / Emacs, with more explicit failure if that is not
1920 installed (the old isabelle-interface script silently falls back on
1921 isabelle-process). The PROOFGENERAL_HOME setting determines the
1922 installation location of the Proof General distribution.
1924 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1925 the Isabelle process into a JVM/Scala application. See
1926 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1927 process wrapper has been discontinued.)
1929 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1931 * Various status messages (with exact source position information) are
1932 emitted, if proper markup print mode is enabled. This allows
1933 user-interface components to provide detailed feedback on internal
1938 New in Isabelle2008 (June 2008)
1939 -------------------------------
1943 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1944 and updated, with formally checked references as hyperlinks.
1946 * Theory loader: use_thy (and similar operations) no longer set the
1947 implicit ML context, which was occasionally hard to predict and in
1948 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1949 provides a proper context already.
1951 * Theory loader: old-style ML proof scripts being *attached* to a thy
1952 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1953 'use' within a theory file will do the job.
1955 * Name space merge now observes canonical order, i.e. the second space
1956 is inserted into the first one, while existing entries in the first
1957 space take precedence. INCOMPATIBILITY in rare situations, may try to
1958 swap theory imports.
1960 * Syntax: symbol \<chi> is now considered a letter. Potential
1961 INCOMPATIBILITY in identifier syntax etc.
1963 * Outer syntax: string tokens no longer admit escaped white space,
1964 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1965 white space without escapes.
1967 * Outer syntax: string tokens may contain arbitrary character codes
1968 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1974 * Context-dependent token translations. Default setup reverts locally
1975 fixed variables, and adds hilite markup for undeclared frees.
1977 * Unused theorems can be found using the new command 'unused_thms'.
1978 There are three ways of invoking it:
1981 Only finds unused theorems in the current theory.
1983 (2) unused_thms thy_1 ... thy_n -
1984 Finds unused theorems in the current theory and all of its ancestors,
1985 excluding the theories thy_1 ... thy_n and all of their ancestors.
1987 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1988 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1989 their ancestors, excluding the theories thy_1 ... thy_n and all of
1992 In order to increase the readability of the list produced by
1993 unused_thms, theorems that have been created by a particular instance
1994 of a theory command such as 'inductive' or 'function' are considered
1995 to belong to the same "group", meaning that if at least one theorem in
1996 this group is used, the other theorems in the same group are no longer
1997 reported as unused. Moreover, if all theorems in the group are
1998 unused, only one theorem in the group is displayed.
2000 Note that proof objects have to be switched on in order for
2001 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2002 usually the case when using Proof General with the default settings).
2004 * Authentic naming of facts disallows ad-hoc overwriting of previous
2005 theorems within the same name space. INCOMPATIBILITY, need to remove
2006 duplicate fact bindings, or even accidental fact duplications. Note
2007 that tools may maintain dynamically scoped facts systematically, using
2008 PureThy.add_thms_dynamic.
2010 * Command 'hide' now allows to hide from "fact" name space as well.
2012 * Eliminated destructive theorem database, simpset, claset, and
2013 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2014 update of theories within ML code.
2016 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2017 INCOMPATIBILITY, object-logics depending on former Pure require
2018 additional setup PureThy.old_appl_syntax_setup; object-logics
2019 depending on former CPure need to refer to Pure.
2021 * Commands 'use' and 'ML' are now purely functional, operating on
2022 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2023 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2026 * Command 'setup': discontinued implicit version with ML reference.
2028 * Instantiation target allows for simultaneous specification of class
2029 instance operations together with an instantiation proof.
2030 Type-checking phase allows to refer to class operations uniformly.
2031 See src/HOL/Complex/Complex.thy for an Isar example and
2032 src/HOL/Library/Eval.thy for an ML example.
2034 * Indexing of literal facts: be more serious about including only
2035 facts from the visible specification/proof context, but not the
2036 background context (locale etc.). Affects `prop` notation and method
2037 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2040 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2041 "(open)" option, which used to expose internal bound variables to the
2044 * Isar statements: removed obsolete case "rule_context".
2045 INCOMPATIBILITY, better use explicit fixes/assumes.
2047 * Locale proofs: default proof step now includes 'unfold_locales';
2048 hence 'proof' without argument may be used to unfold locale
2052 *** Document preparation ***
2054 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2055 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2056 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2057 spot); renamed link color from "darkblue" to "linkcolor" (default
2058 value unchanged, can be redefined via \definecolor); no longer sets
2059 "a4paper" option (unnecessary or even intrusive).
2061 * Antiquotation @{lemma A method} proves proposition A by the given
2062 method (either a method name or a method name plus (optional) method
2063 arguments in parentheses) and prints A just like @{prop A}.
2068 * New primrec package. Specification syntax conforms in style to
2069 definition/function/.... No separate induction rule is provided. The
2070 "primrec" command distinguishes old-style and new-style specifications
2071 by syntax. The former primrec package is now named OldPrimrecPackage.
2072 When adjusting theories, beware: constants stemming from new-style
2073 primrec specifications have authentic syntax.
2075 * Metis prover is now an order of magnitude faster, and also works
2076 with multithreading.
2078 * Metis: the maximum number of clauses that can be produced from a
2079 theorem is now given by the attribute max_clauses. Theorems that
2080 exceed this number are ignored, with a warning printed.
2082 * Sledgehammer no longer produces structured proofs by default. To
2083 enable, declare [[sledgehammer_full = true]]. Attributes
2084 reconstruction_modulus, reconstruction_sorts renamed
2085 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2087 * Method "induct_scheme" derives user-specified induction rules
2088 from well-founded induction and completeness of patterns. This factors
2089 out some operations that are done internally by the function package
2090 and makes them available separately. See
2091 src/HOL/ex/Induction_Scheme.thy for examples.
2093 * More flexible generation of measure functions for termination
2094 proofs: Measure functions can be declared by proving a rule of the
2095 form "is_measure f" and giving it the [measure_function] attribute.
2096 The "is_measure" predicate is logically meaningless (always true), and
2097 just guides the heuristic. To find suitable measure functions, the
2098 termination prover sets up the goal "is_measure ?f" of the appropriate
2099 type and generates all solutions by prolog-style backwards proof using
2102 This setup also deals with rules like
2104 "is_measure f ==> is_measure (list_size f)"
2106 which accommodates nested datatypes that recurse through lists.
2107 Similar rules are predeclared for products and option types.
2109 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2113 - Definitions of overloaded constants on sets have to be replaced by
2114 definitions on => and bool.
2116 - Some definitions of overloaded operators on sets can now be proved
2117 using the definitions of the operators on => and bool. Therefore,
2118 the following theorems have been renamed:
2120 subset_def -> subset_eq
2121 psubset_def -> psubset_eq
2122 set_diff_def -> set_diff_eq
2123 Compl_def -> Compl_eq
2124 Sup_set_def -> Sup_set_eq
2125 Inf_set_def -> Inf_set_eq
2126 sup_set_def -> sup_set_eq
2127 inf_set_def -> inf_set_eq
2129 - Due to the incompleteness of the HO unification algorithm, some
2130 rules such as subst may require manual instantiation, if some of
2131 the unknowns in the rule is a set.
2133 - Higher order unification and forward proofs:
2136 have "P (S::'a set)" <...>
2137 then have "EX S. P S" ..
2139 no longer works (due to the incompleteness of the HO unification
2140 algorithm) and must be replaced by the pattern
2147 - Calculational reasoning with subst (or similar rules):
2150 have "P (S::'a set)" <...>
2151 also have "S = T" <...>
2152 finally have "P T" .
2154 no longer works (for similar reasons as the previous example) and
2155 must be replaced by something like
2157 have "P (S::'a set)" <...>
2158 moreover have "S = T" <...>
2159 ultimately have "P T" by simp
2161 - Tactics or packages written in ML code:
2162 Code performing pattern matching on types via
2164 Type ("set", [T]) => ...
2166 must be rewritten. Moreover, functions like strip_type or
2167 binder_types no longer return the right value when applied to a
2170 T1 => ... => Tn => U => bool
2174 T1 => ... => Tn => U set
2176 * Merged theories Wellfounded_Recursion, Accessible_Part and
2177 Wellfounded_Relations to theory Wellfounded.
2179 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2181 * Class finite no longer treats UNIV as class parameter. Use class
2182 enum from theory Library/Enum instead to achieve a similar effect.
2185 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2186 and "Cons". INCOMPATIBILITY.
2188 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2189 Potential INCOMPATIBILITY.
2191 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2192 injective_fst_snd removed, use split_eta and prod_eqI instead.
2193 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2195 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2196 the same name in theory Orderings:
2206 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2207 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2208 and different variable names.
2210 * Library/Option_ord.thy: Canonical order on option type.
2212 * Library/RBT.thy: Red-black trees, an efficient implementation of
2215 * Library/Countable.thy: Type class for countable types.
2217 * Theory Int: The representation of numerals has changed. The infix
2218 operator BIT and the bit datatype with constructors B0 and B1 have
2219 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2220 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2221 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2224 * Theory Nat: definition of <= and < on natural numbers no longer
2225 depend on well-founded relations. INCOMPATIBILITY. Definitions
2226 le_def and less_def have disappeared. Consider lemmas not_less
2227 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2229 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2230 (whose purpose mainly is for various fold_set functionals) have been
2231 abandoned in favor of the existing algebraic classes
2232 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2233 lower_semilattice (resp. upper_semilattice) and linorder.
2236 * Theory Transitive_Closure: induct and cases rules now declare proper
2237 case_names ("base" and "step"). INCOMPATIBILITY.
2239 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2240 lattices. The form set-specific version is available as
2241 Inductive.lfp_ordinal_induct_set.
2243 * Renamed theorems "power.simps" to "power_int.simps".
2246 * Class semiring_div provides basic abstract properties of semirings
2247 with division and modulo operations. Subsumes former class dvd_mod.
2249 * Merged theories IntDef, Numeral and IntArith into unified theory
2250 Int. INCOMPATIBILITY.
2252 * Theory Library/Code_Index: type "index" now represents natural
2253 numbers rather than integers. INCOMPATIBILITY.
2255 * New class "uminus" with operation "uminus" (split of from class
2256 "minus" which now only has operation "minus", binary).
2259 * Constants "card", "internal_split", "option_map" now with authentic
2260 syntax. INCOMPATIBILITY.
2262 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2263 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2264 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2265 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2266 Sup_set_def, le_def, less_def, option_map_def now with object
2267 equality. INCOMPATIBILITY.
2269 * Records. Removed K_record, and replaced it by pure lambda term
2270 %x. c. The simplifier setup is now more robust against eta expansion.
2271 INCOMPATIBILITY: in cases explicitly referring to K_record.
2273 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2275 * Library/ListVector: new theory of arithmetic vector operations.
2277 * Library/Order_Relation: new theory of various orderings as sets of
2278 pairs. Defines preorders, partial orders, linear orders and
2279 well-orders on sets and on types.
2284 * Renamed some theories to allow to loading both ZF and HOL in the
2287 Datatype -> Datatype_ZF
2288 Inductive -> Inductive_ZF
2295 INCOMPATIBILITY: ZF theories that import individual theories below
2296 Main might need to be adapted. Regular theory Main is still
2297 available, as trivial extension of Main_ZF.
2302 * ML within Isar: antiquotation @{const name} or @{const
2303 name(typargs)} produces statically-checked Const term.
2305 * Functor NamedThmsFun: data is available to the user as dynamic fact
2306 (of the same name). Removed obsolete print command.
2308 * Removed obsolete "use_legacy_bindings" function.
2310 * The ``print mode'' is now a thread-local value derived from a global
2311 template (the former print_mode reference), thus access becomes
2312 non-critical. The global print_mode reference is for session
2313 management only; user-code should use print_mode_value,
2314 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2316 * Functions system/system_out provide a robust way to invoke external
2317 shell commands, with propagation of interrupts (requires Poly/ML
2318 5.2.1). Do not use OS.Process.system etc. from the basis library!
2323 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2324 in accordance with Proof General 3.7, which prefers GNU emacs.
2326 * isatool tty runs Isabelle process with plain tty interaction;
2327 optional line editor may be specified via ISABELLE_LINE_EDITOR
2328 setting, the default settings attempt to locate "ledit" and "rlwrap".
2330 * isatool browser now works with Cygwin as well, using general
2331 "javapath" function defined in Isabelle process environment.
2333 * YXML notation provides a simple and efficient alternative to
2334 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2335 isatool yxml as described in the Isabelle system manual.
2337 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2338 provides general wrapper for managing an Isabelle process in a robust
2339 fashion, with ``cooked'' output from stdin/stderr.
2341 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2342 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2344 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2345 way of changing the user's settings is via
2346 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2349 * Multithreading.max_threads := 0 refers to the number of actual CPU
2350 cores of the underlying machine, which is a good starting point for
2351 optimal performance tuning. The corresponding usedir option -M allows
2352 "max" as an alias for "0". WARNING: does not work on certain versions
2353 of Mac OS (with Poly/ML 5.1).
2355 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2356 adverse effect of Isabelle flooding interactive front-ends (notably
2357 ProofGeneral / XEmacs).
2361 New in Isabelle2007 (November 2007)
2362 -----------------------------------
2366 * More uniform information about legacy features, notably a
2367 warning/error of "Legacy feature: ...", depending on the state of the
2368 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2369 legacy features will disappear eventually.
2371 * Theory syntax: the header format ``theory A = B + C:'' has been
2372 discontinued in favour of ``theory A imports B C begin''. Use isatool
2373 fixheaders to convert existing theory files. INCOMPATIBILITY.
2375 * Theory syntax: the old non-Isar theory file format has been
2376 discontinued altogether. Note that ML proof scripts may still be used
2377 with Isar theories; migration is usually quite simple with the ML
2378 function use_legacy_bindings. INCOMPATIBILITY.
2380 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2381 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2384 * Theory loader: be more serious about observing the static theory
2385 header specifications (including optional directories), but not the
2386 accidental file locations of previously successful loads. The strict
2387 update policy of former update_thy is now already performed by
2388 use_thy, so the former has been removed; use_thys updates several
2389 theories simultaneously, just as 'imports' within a theory header
2390 specification, but without merging the results. Potential
2391 INCOMPATIBILITY: may need to refine theory headers and commands
2392 ROOT.ML which depend on load order.
2394 * Theory loader: optional support for content-based file
2395 identification, instead of the traditional scheme of full physical
2396 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2397 (cf. the system manual). The new scheme allows to work with
2398 non-finished theories in persistent session images, such that source
2399 files may be moved later on without requiring reloads.
2401 * Theory loader: old-style ML proof scripts being *attached* to a thy
2402 file (with the same base name as the theory) are considered a legacy
2403 feature, which will disappear eventually. Even now, the theory loader
2404 no longer maintains dependencies on such files.
2406 * Syntax: the scope for resolving ambiguities via type-inference is
2407 now limited to individual terms, instead of whole simultaneous
2408 specifications as before. This greatly reduces the complexity of the
2409 syntax module and improves flexibility by separating parsing and
2410 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2411 'fixes' etc.) are required in rare situations.
2413 * Syntax: constants introduced by new-style packages ('definition',
2414 'abbreviation' etc.) are passed through the syntax module in
2415 ``authentic mode''. This means that associated mixfix annotations
2416 really stick to such constants, independently of potential name space
2417 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2418 trees are represented slightly differently, may need to adapt syntax
2419 translations accordingly. Use CONST marker in 'translations' and
2420 @{const_syntax} antiquotation in 'parse_translation' etc.
2422 * Legacy goal package: reduced interface to the bare minimum required
2423 to keep existing proof scripts running. Most other user-level
2424 functions are now part of the OldGoals structure, which is *not* open
2425 by default (consider isatool expandshort before open OldGoals).
2426 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2427 these tend to cause confusion about the actual goal (!) context being
2428 used here, which is not necessarily the same as the_context().
2430 * Command 'find_theorems': supports "*" wild-card in "name:"
2431 criterion; "with_dups" option. Certain ProofGeneral versions might
2432 support a specific search form (see ProofGeneral/CHANGES).
2434 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2435 by default, which means that "prems" (and also "fixed variables") are
2436 suppressed from proof state output. Note that the ProofGeneral
2437 settings mechanism allows to change and save options persistently, but
2438 older versions of Isabelle will fail to start up if a negative prems
2441 * Local theory targets may be specified by non-nested blocks of
2442 ``context/locale/class ... begin'' followed by ``end''. The body may
2443 contain definitions, theorems etc., including any derived mechanism
2444 that has been implemented on top of these primitives. This concept
2445 generalizes the existing ``theorem (in ...)'' towards more versatility
2448 * Proof General interface: proper undo of final 'end' command;
2449 discontinued Isabelle/classic mode (ML proof scripts).
2452 *** Document preparation ***
2454 * Added antiquotation @{theory name} which prints the given name,
2455 after checking that it refers to a valid ancestor theory in the
2458 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2459 check the given source text as ML type/structure, printing verbatim.
2461 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2462 "c args == rhs" given in the current context. (Any number of
2463 arguments may be given on the LHS.)
2468 * The 'class' package offers a combination of axclass and locale to
2469 achieve Haskell-like type classes in Isabelle. Definitions and
2470 theorems within a class context produce both relative results (with
2471 implicit parameters according to the locale context), and polymorphic
2472 constants with qualified polymorphism (according to the class
2473 context). Within the body context of a 'class' target, a separate
2474 syntax layer ("user space type system") takes care of converting
2475 between global polymorphic consts and internal locale representation.
2476 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2477 "isatool doc classes" provides a tutorial.
2479 * Generic code generator framework allows to generate executable
2480 code for ML and Haskell (including Isabelle classes). A short usage
2483 internal compilation:
2484 export_code <list of constants (term syntax)> in SML
2485 writing SML code to a file:
2486 export_code <list of constants (term syntax)> in SML <filename>
2487 writing OCaml code to a file:
2488 export_code <list of constants (term syntax)> in OCaml <filename>
2489 writing Haskell code to a bunch of files:
2490 export_code <list of constants (term syntax)> in Haskell <filename>
2492 evaluating closed propositions to True/False using code generation:
2495 Reasonable default setup of framework in HOL.
2497 Theorem attributs for selecting and transforming function equations theorems:
2499 [code fun]: select a theorem as function equation for a specific constant
2500 [code fun del]: deselect a theorem as function equation for a specific constant
2501 [code inline]: select an equation theorem for unfolding (inlining) in place
2502 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2504 User-defined serializations (target in {SML, OCaml, Haskell}):
2506 code_const <and-list of constants (term syntax)>
2507 {(target) <and-list of const target syntax>}+
2509 code_type <and-list of type constructors>
2510 {(target) <and-list of type target syntax>}+
2512 code_instance <and-list of instances>
2514 where instance ::= <type constructor> :: <class>
2516 code_class <and_list of classes>
2517 {(target) <and-list of class target syntax>}+
2518 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2520 code_instance and code_class only are effective to target Haskell.
2522 For example usage see src/HOL/ex/Codegenerator.thy and
2523 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2524 generation from Isabelle/HOL theories is available via "isatool doc
2527 * Code generator: consts in 'consts_code' Isar commands are now
2528 referred to by usual term syntax (including optional type
2531 * Command 'no_translations' removes translation rules from theory
2534 * Overloaded definitions are now actually checked for acyclic
2535 dependencies. The overloading scheme is slightly more general than
2536 that of Haskell98, although Isabelle does not demand an exact
2537 correspondence to type class and instance declarations.
2538 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2539 exotic versions of overloading -- at the discretion of the user!
2541 Polymorphic constants are represented via type arguments, i.e. the
2542 instantiation that matches an instance against the most general
2543 declaration given in the signature. For example, with the declaration
2544 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2545 as c(nat). Overloading is essentially simultaneous structural
2546 recursion over such type arguments. Incomplete specification patterns
2547 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2548 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2549 Command 'print_theory' outputs the normalized system of recursive
2550 equations, see section "definitions".
2552 * Configuration options are maintained within the theory or proof
2553 context (with name and type bool/int/string), providing a very simple
2554 interface to a poor-man's version of general context data. Tools may
2555 declare options in ML (e.g. using Attrib.config_int) and then refer to
2556 these values using Config.get etc. Users may change options via an
2557 associated attribute of the same name. This form of context
2558 declaration works particularly well with commands 'declare' or
2559 'using', for example ``declare [[foo = 42]]''. Thus it has become
2560 very easy to avoid global references, which would not observe Isar
2561 toplevel undo/redo and fail to work with multithreading.
2563 Various global ML references of Pure and HOL have been turned into
2564 configuration options:
2566 Unify.search_bound unify_search_bound
2567 Unify.trace_bound unify_trace_bound
2568 Unify.trace_simp unify_trace_simp
2569 Unify.trace_types unify_trace_types
2570 Simplifier.simp_depth_limit simp_depth_limit
2571 Blast.depth_limit blast_depth_limit
2572 DatatypeProp.dtK datatype_distinctness_limit
2573 fast_arith_neq_limit fast_arith_neq_limit
2574 fast_arith_split_limit fast_arith_split_limit
2576 * Named collections of theorems may be easily installed as context
2577 data using the functor NamedThmsFun (see also
2578 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2579 attributes; there is also a toplevel print command. This facility is
2580 just a common case of general context data, which is the preferred way
2581 for anything more complex than just a list of facts in canonical
2584 * Isar: command 'declaration' augments a local theory by generic
2585 declaration functions written in ML. This enables arbitrary content
2586 being added to the context, depending on a morphism that tells the
2587 difference of the original declaration context wrt. the application
2588 context encountered later on.
2590 * Isar: proper interfaces for simplification procedures. Command
2591 'simproc_setup' declares named simprocs (with match patterns, and body
2592 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2593 context. ML antiquotation @{simproc name} retrieves named simprocs.
2595 * Isar: an extra pair of brackets around attribute declarations
2596 abbreviates a theorem reference involving an internal dummy fact,
2597 which will be ignored later --- only the effect of the attribute on
2598 the background context will persist. This form of in-place
2599 declarations is particularly useful with commands like 'declare' and
2600 'using', for example ``have A using [[simproc a]] by simp''.
2602 * Isar: method "assumption" (and implicit closing of subproofs) now
2603 takes simple non-atomic goal assumptions into account: after applying
2604 an assumption as a rule the resulting subgoals are solved by atomic
2605 assumption steps. This is particularly useful to finish 'obtain'
2606 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2607 without referring to the original premise "!!x. P x ==> thesis" in the
2608 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2611 * Isar: implicit use of prems from the Isar proof context is
2612 considered a legacy feature. Common applications like ``have A .''
2613 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2614 referencing facts explicitly here improves readability and
2615 maintainability of proof texts.
2617 * Isar: improper proof element 'guess' is like 'obtain', but derives
2618 the obtained context from the course of reasoning! For example:
2620 assume "EX x y. A x & B y" -- "any previous fact"
2621 then guess x and y by clarify
2623 This technique is potentially adventurous, depending on the facts and
2624 proof tools being involved here.
2626 * Isar: known facts from the proof context may be specified as literal
2627 propositions, using ASCII back-quote syntax. This works wherever
2628 named facts used to be allowed so far, in proof commands, proof
2629 methods, attributes etc. Literal facts are retrieved from the context
2630 according to unification of type and term parameters. For example,
2631 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2632 theorems in the current context, then these are valid literal facts:
2633 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2635 There is also a proof method "fact" which does the same composition
2636 for explicit goal states, e.g. the following proof texts coincide with
2637 certain special cases of literal facts:
2639 have "A" by fact == note `A`
2640 have "A ==> B" by fact == note `A ==> B`
2641 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2642 have "P a ==> Q a" by fact == note `P a ==> Q a`
2644 * Isar: ":" (colon) is no longer a symbolic identifier character in
2645 outer syntax. Thus symbolic identifiers may be used without
2646 additional white space in declarations like this: ``assume *: A''.
2648 * Isar: 'print_facts' prints all local facts of the current context,
2649 both named and unnamed ones.
2651 * Isar: 'def' now admits simultaneous definitions, e.g.:
2653 def x == "t" and y == "u"
2655 * Isar: added command 'unfolding', which is structurally similar to
2656 'using', but affects both the goal state and facts by unfolding given
2657 rewrite rules. Thus many occurrences of the 'unfold' method or
2658 'unfolded' attribute may be replaced by first-class proof text.
2660 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2661 and command 'unfolding' now all support object-level equalities
2662 (potentially conditional). The underlying notion of rewrite rule is
2663 analogous to the 'rule_format' attribute, but *not* that of the
2664 Simplifier (which is usually more generous).
2666 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2667 premises of a theorem by n. Useful in conjunction with drule.
2669 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2670 method expression within a sandbox consisting of the first N
2671 sub-goals, which need to exist. For example, ``simp_all [3]''
2672 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2673 simplifies all new goals that emerge from applying rule foo to the
2674 originally first one.
2676 * Isar: schematic goals are no longer restricted to higher-order
2677 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2680 * Isar: the conclusion of a long theorem statement is now either
2681 'shows' (a simultaneous conjunction, as before), or 'obtains'
2682 (essentially a disjunction of cases with local parameters and
2683 assumptions). The latter allows to express general elimination rules
2684 adequately; in this notation common elimination rules look like this:
2686 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2688 obtains x where "P x"
2690 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2694 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2700 The subsequent classical rules even refer to the formal "thesis"
2703 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2706 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2707 obtains "thesis ==> something"
2709 The actual proof of an 'obtains' statement is analogous to that of the
2710 Isar proof element 'obtain', only that there may be several cases.
2711 Optional case names may be specified in parentheses; these will be
2712 available both in the present proof and as annotations in the
2713 resulting rule, for later use with the 'cases' method (cf. attribute
2716 * Isar: the assumptions of a long theorem statement are available as
2717 "assms" fact in the proof context. This is more appropriate than the
2718 (historical) "prems", which refers to all assumptions of the current
2719 context, including those from the target locale, proof body etc.
2721 * Isar: 'print_statement' prints theorems from the current theory or
2722 proof context in long statement form, according to the syntax of a
2725 * Isar: 'obtain' takes an optional case name for the local context
2726 introduction rule (default "that").
2728 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2729 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2732 * Pure: syntax "CONST name" produces a fully internalized constant
2733 according to the current context. This is particularly useful for
2734 syntax translations that should refer to internal constant
2735 representations independently of name spaces.
2737 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2738 instead of "FOO ". This allows multiple binder declarations to coexist
2739 in the same context. INCOMPATIBILITY.
2741 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2742 primitive that also works in a locale context (both for constants and
2743 fixed variables). Type declaration and internal syntactic representation
2744 of given constants retrieved from the context. Likewise, the
2745 'no_notation' command allows to remove given syntax annotations from the
2748 * Isar/locales: new derived specification elements 'axiomatization',
2749 'definition', 'abbreviation', which support type-inference, admit
2750 object-level specifications (equality, equivalence). See also the
2751 isar-ref manual. Examples:
2754 eq (infix "===" 50) where
2755 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2757 definition "f x y = x + y + 1"
2758 definition g where "g x = f x x"
2761 neq (infix "=!=" 50) where
2762 "x =!= y == ~ (x === y)"
2764 These specifications may be also used in a locale context. Then the
2765 constants being introduced depend on certain fixed parameters, and the
2766 constant name is qualified by the locale base name. An internal
2767 abbreviation takes care for convenient input and output, making the
2768 parameters implicit and using the original short name. See also
2769 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2770 entities from a monomorphic theory.
2772 Presently, abbreviations are only available 'in' a target locale, but
2773 not inherited by general import expressions. Also note that
2774 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2775 'translations' in common applications. The "no_abbrevs" print mode
2776 prevents folding of abbreviations in term output.
2778 Concrete syntax is attached to specified constants in internal form,
2779 independently of name spaces. The parse tree representation is
2780 slightly different -- use 'notation' instead of raw 'syntax', and
2781 'translations' with explicit "CONST" markup to accommodate this.
2783 * Pure/Isar: unified syntax for new-style specification mechanisms
2784 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2785 full type inference and dummy patterns ("_"). For example:
2787 definition "K x _ = x"
2789 inductive conj for A B
2790 where "A ==> B ==> conj A B"
2792 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2793 the current context. Print mode "no_abbrevs" prevents inversion of
2794 abbreviations on output.
2796 * Isar/locales: improved parameter handling: use of locales "var" and
2797 "struct" no longer necessary; - parameter renamings are no longer
2798 required to be injective. For example, this allows to define
2799 endomorphisms as locale endom = homom mult mult h.
2801 * Isar/locales: changed the way locales with predicates are defined.
2802 Instead of accumulating the specification, the imported expression is
2803 now an interpretation. INCOMPATIBILITY: different normal form of
2804 locale expressions. In particular, in interpretations of locales with
2805 predicates, goals repesenting already interpreted fragments are not
2806 removed automatically. Use methods `intro_locales' and
2807 `unfold_locales'; see below.
2809 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2810 provide backward reasoning on locales predicates. The methods are
2811 aware of interpretations and discharge corresponding goals.
2812 `intro_locales' is less aggressive then `unfold_locales' and does not
2813 unfold predicates to assumptions.
2815 * Isar/locales: the order in which locale fragments are accumulated
2816 has changed. This enables to override declarations from fragments due
2817 to interpretations -- for example, unwanted simp rules.
2819 * Isar/locales: interpretation in theories and proof contexts has been
2820 extended. One may now specify (and prove) equations, which are
2821 unfolded in interpreted theorems. This is useful for replacing
2822 defined concepts (constants depending on locale parameters) by
2823 concepts already existing in the target context. Example:
2825 interpretation partial_order ["op <= :: [int, int] => bool"]
2826 where "partial_order.less (op <=) (x::int) y = (x < y)"
2828 Typically, the constant `partial_order.less' is created by a
2829 definition specification element in the context of locale
2832 * Method "induct": improved internal context management to support
2833 local fixes and defines on-the-fly. Thus explicit meta-level
2834 connectives !! and ==> are rarely required anymore in inductive goals
2835 (using object-logic connectives for this purpose has been long
2836 obsolete anyway). Common proof patterns are explained in
2837 src/HOL/Induct/Common_Patterns.thy, see also
2838 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2841 * Method "induct": improved handling of simultaneous goals. Instead of
2842 introducing object-level conjunction, the statement is now split into
2843 several conclusions, while the corresponding symbolic cases are nested
2844 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2845 see src/HOL/Induct/Common_Patterns.thy, for example.
2847 * Method "induct": mutual induction rules are now specified as a list
2848 of rule sharing the same induction cases. HOL packages usually provide
2849 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2850 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2851 mutual induction rules differently, i.e. like this:
2853 (induct rule: foo_bar.inducts)
2854 (induct set: foo bar)
2855 (induct pred: foo bar)
2856 (induct type: foo bar)
2858 The ML function ProjectRule.projections turns old-style rules into the
2861 * Method "coinduct": dual of induction, see
2862 src/HOL/Library/Coinductive_List.thy for various examples.
2864 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2865 considered a legacy feature.
2867 * Attribute "symmetric" produces result with standardized schematic
2868 variables (index 0). Potential INCOMPATIBILITY.
2870 * Simplifier: by default the simplifier trace only shows top level
2871 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2872 default. Thus there is less danger of being flooded by the trace. The
2873 trace indicates where parts have been suppressed.
2875 * Provers/classical: removed obsolete classical version of elim_format
2876 attribute; classical elim/dest rules are now treated uniformly when
2877 manipulating the claset.
2879 * Provers/classical: stricter checks to ensure that supplied intro,
2880 dest and elim rules are well-formed; dest and elim rules must have at
2883 * Provers/classical: attributes dest/elim/intro take an optional
2884 weight argument for the rule (just as the Pure versions). Weights are
2885 ignored by automated tools, but determine the search order of single
2888 * Syntax: input syntax now supports dummy variable binding "%_. b",
2889 where the body does not mention the bound variable. Note that dummy
2890 patterns implicitly depend on their context of bounds, which makes
2891 "{_. _}" match any set comprehension as expected. Potential
2892 INCOMPATIBILITY -- parse translations need to cope with syntactic
2893 constant "_idtdummy" in the binding position.
2895 * Syntax: removed obsolete syntactic constant "_K" and its associated
2896 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2897 for example "A -> B" => "Pi A (%_. B)".
2899 * Pure: 'class_deps' command visualizes the subclass relation, using
2900 the graph browser tool.
2902 * Pure: 'print_theory' now suppresses certain internal declarations by
2903 default; use '!' option for full details.
2908 * Method "metis" proves goals by applying the Metis general-purpose
2909 resolution prover (see also http://gilith.com/software/metis/).
2910 Examples are in the directory MetisExamples. WARNING: the
2911 Isabelle/HOL-Metis integration does not yet work properly with
2914 * Command 'sledgehammer' invokes external automatic theorem provers as
2915 background processes. It generates calls to the "metis" method if
2916 successful. These can be pasted into the proof. Users do not have to
2917 wait for the automatic provers to return. WARNING: does not really
2918 work with multi-threading.
2920 * New "auto_quickcheck" feature tests outermost goal statements for
2921 potential counter-examples. Controlled by ML references
2922 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2923 5000 milliseconds). Fails silently if statements is outside of
2924 executable fragment, or any other codgenerator problem occurs.
2926 * New constant "undefined" with axiom "undefined x = undefined".
2928 * Added class "HOL.eq", allowing for code generation with polymorphic
2931 * Some renaming of class constants due to canonical name prefixing in
2932 the new 'class' package:
2934 HOL.abs ~> HOL.abs_class.abs
2935 HOL.divide ~> HOL.divide_class.divide
2936 0 ~> HOL.zero_class.zero
2937 1 ~> HOL.one_class.one
2938 op + ~> HOL.plus_class.plus
2939 op - ~> HOL.minus_class.minus
2940 uminus ~> HOL.minus_class.uminus
2941 op * ~> HOL.times_class.times
2942 op < ~> HOL.ord_class.less
2943 op <= > HOL.ord_class.less_eq
2944 Nat.power ~> Power.power_class.power
2945 Nat.size ~> Nat.size_class.size
2946 Numeral.number_of ~> Numeral.number_class.number_of
2947 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2948 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2949 Orderings.min ~> Orderings.ord_class.min
2950 Orderings.max ~> Orderings.ord_class.max
2951 Divides.op div ~> Divides.div_class.div
2952 Divides.op mod ~> Divides.div_class.mod
2953 Divides.op dvd ~> Divides.div_class.dvd
2955 INCOMPATIBILITY. Adaptions may be required in the following cases:
2957 a) User-defined constants using any of the names "plus", "minus",
2958 "times", "less" or "less_eq". The standard syntax translations for
2959 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2962 b) Variables named "plus", "minus", "times", "less", "less_eq"
2963 INCOMPATIBILITY: use more specific names.
2965 c) Permutative equations (e.g. "a + b = b + a")
2966 Since the change of names also changes the order of terms, permutative
2967 rewrite rules may get applied in a different order. Experience shows
2968 that this is rarely the case (only two adaptions in the whole Isabelle
2969 distribution). INCOMPATIBILITY: rewrite proofs
2971 d) ML code directly refering to constant names
2972 This in general only affects hand-written proof tactics, simprocs and
2973 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2974 Consider using @{const_name} antiquotation.
2976 * New class "default" with associated constant "default".
2978 * Function "sgn" is now overloaded and available on int, real, complex
2979 (and other numeric types), using class "sgn". Two possible defs of
2980 sgn are given as equational assumptions in the classes sgn_if and
2981 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2984 * Locale "partial_order" now unified with class "order" (cf. theory
2985 Orderings), added parameter "less". INCOMPATIBILITY.
2987 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2988 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2989 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2991 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2992 changed order of proof goals in instance proofs.
2994 * The transitivity reasoner for partial and linear orders is set up
2995 for classes "order" and "linorder". Instances of the reasoner are available
2996 in all contexts importing or interpreting the corresponding locales.
2997 Method "order" invokes the reasoner separately; the reasoner
2998 is also integrated with the Simplifier as a solver. Diagnostic
2999 command 'print_orders' shows the available instances of the reasoner
3000 in the current context.
3002 * Localized monotonicity predicate in theory "Orderings"; integrated
3003 lemmas max_of_mono and min_of_mono with this predicate.
3006 * Formulation of theorem "dense" changed slightly due to integration
3007 with new class dense_linear_order.
3009 * Uniform lattice theory development in HOL.
3011 constants "meet" and "join" now named "inf" and "sup"
3012 constant "Meet" now named "Inf"
3014 classes "meet_semilorder" and "join_semilorder" now named
3015 "lower_semilattice" and "upper_semilattice"
3016 class "lorder" now named "lattice"
3017 class "comp_lat" now named "complete_lattice"
3019 Instantiation of lattice classes allows explicit definitions
3020 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3022 INCOMPATIBILITY. Theorem renames:
3024 meet_left_le ~> inf_le1
3025 meet_right_le ~> inf_le2
3026 join_left_le ~> sup_ge1
3027 join_right_le ~> sup_ge2
3028 meet_join_le ~> inf_sup_ord
3031 le_meet ~> le_inf_iff
3032 le_join ~> ge_sup_conv
3033 meet_idempotent ~> inf_idem
3034 join_idempotent ~> sup_idem
3035 meet_comm ~> inf_commute
3036 join_comm ~> sup_commute
3037 meet_leI1 ~> le_infI1
3038 meet_leI2 ~> le_infI2
3039 le_joinI1 ~> le_supI1
3040 le_joinI2 ~> le_supI2
3041 meet_assoc ~> inf_assoc
3042 join_assoc ~> sup_assoc
3043 meet_left_comm ~> inf_left_commute
3044 meet_left_idempotent ~> inf_left_idem
3045 join_left_comm ~> sup_left_commute
3046 join_left_idempotent ~> sup_left_idem
3049 le_def_meet ~> le_iff_inf
3050 le_def_join ~> le_iff_sup
3051 join_absorp2 ~> sup_absorb2
3052 join_absorp1 ~> sup_absorb1
3053 meet_absorp1 ~> inf_absorb1
3054 meet_absorp2 ~> inf_absorb2
3055 meet_join_absorp ~> inf_sup_absorb
3056 join_meet_absorp ~> sup_inf_absorb
3057 distrib_join_le ~> distrib_sup_le
3058 distrib_meet_le ~> distrib_inf_le
3060 add_meet_distrib_left ~> add_inf_distrib_left
3061 add_join_distrib_left ~> add_sup_distrib_left
3062 is_join_neg_meet ~> is_join_neg_inf
3063 is_meet_neg_join ~> is_meet_neg_sup
3064 add_meet_distrib_right ~> add_inf_distrib_right
3065 add_join_distrib_right ~> add_sup_distrib_right
3066 add_meet_join_distribs ~> add_sup_inf_distribs
3067 join_eq_neg_meet ~> sup_eq_neg_inf
3068 meet_eq_neg_join ~> inf_eq_neg_sup
3069 add_eq_meet_join ~> add_eq_inf_sup
3070 meet_0_imp_0 ~> inf_0_imp_0
3071 join_0_imp_0 ~> sup_0_imp_0
3072 meet_0_eq_0 ~> inf_0_eq_0
3073 join_0_eq_0 ~> sup_0_eq_0
3074 neg_meet_eq_join ~> neg_inf_eq_sup
3075 neg_join_eq_meet ~> neg_sup_eq_inf
3076 join_eq_if ~> sup_eq_if
3078 mono_meet ~> mono_inf
3079 mono_join ~> mono_sup
3080 meet_bool_eq ~> inf_bool_eq
3081 join_bool_eq ~> sup_bool_eq
3082 meet_fun_eq ~> inf_fun_eq
3083 join_fun_eq ~> sup_fun_eq
3084 meet_set_eq ~> inf_set_eq
3085 join_set_eq ~> sup_set_eq
3086 meet1_iff ~> inf1_iff
3087 meet2_iff ~> inf2_iff
3096 join1_iff ~> sup1_iff
3097 join2_iff ~> sup2_iff
3107 is_meet_Meet ~> is_meet_Inf
3108 Meet_bool_def ~> Inf_bool_def
3109 Meet_fun_def ~> Inf_fun_def
3110 Meet_greatest ~> Inf_greatest
3111 Meet_lower ~> Inf_lower
3112 Meet_set_def ~> Inf_set_def
3115 Sup_bool_eq ~> Sup_bool_def
3116 Sup_fun_eq ~> Sup_fun_def
3117 Sup_set_eq ~> Sup_set_def
3119 listsp_meetI ~> listsp_infI
3120 listsp_meet_eq ~> listsp_inf_eq
3125 * Added syntactic class "size"; overloaded constant "size" now has
3126 type "'a::size ==> bool"
3128 * Internal reorganisation of `size' of datatypes: size theorems
3129 "foo.size" are no longer subsumed by "foo.simps" (but are still
3130 simplification rules by default!); theorems "prod.size" now named
3133 * Class "div" now inherits from class "times" rather than "type".
3136 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3137 Linorder etc. have disappeared; operations defined in terms of
3138 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3140 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3142 * HOL-Word: New extensive library and type for generic, fixed size
3143 machine words, with arithemtic, bit-wise, shifting and rotating
3144 operations, reflection into int, nat, and bool lists, automation for
3145 linear arithmetic (by automatic reflection into nat or int), including
3146 lemmas on overflow and monotonicity. Instantiated to all appropriate
3147 arithmetic type classes, supporting automatic simplification of
3148 numerals on all operations.
3150 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3152 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3154 * Code generator library theories:
3155 - Code_Integer represents HOL integers by big integer literals in target
3157 - Code_Char represents HOL characters by character literals in target
3159 - Code_Char_chr like Code_Char, but also offers treatment of character
3160 codes; includes Code_Integer.
3161 - Executable_Set allows to generate code for finite sets using lists.
3162 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3164 - Executable_Real implements a subset of real numbers, namly those
3165 representable by rational numbers.
3166 - Efficient_Nat implements natural numbers by integers, which in general will
3167 result in higher efficency; pattern matching with 0/Suc is eliminated;
3168 includes Code_Integer.
3169 - Code_Index provides an additional datatype index which is mapped to
3170 target-language built-in integers.
3171 - Code_Message provides an additional datatype message_string which is isomorphic to
3172 strings; messages are mapped to target-language strings.
3174 * New package for inductive predicates
3176 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3179 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3180 for z_1 :: U_1 and ... and z_n :: U_m
3182 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3185 with full support for type-inference, rather than
3187 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3189 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3190 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3192 inductive "s z_1 ... z_m"
3194 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3197 For backward compatibility, there is a wrapper allowing inductive
3198 sets to be defined with the new package via
3201 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3202 for z_1 :: U_1 and ... and z_n :: U_m
3204 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3210 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3211 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3212 for z_1 :: U_1 and ... and z_n :: U_m
3214 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3215 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3218 if the additional syntax "p ..." is required.
3220 Numerous examples can be found in the subdirectories src/HOL/Auth,
3221 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3225 - Since declaration and definition of inductive sets or predicates
3226 is no longer separated, abbreviations involving the newly
3227 introduced sets or predicates must be specified together with the
3228 introduction rules after the 'where' keyword (see above), rather
3229 than before the actual inductive definition.
3231 - The variables in induction and elimination rules are now
3232 quantified in the order of their occurrence in the introduction
3233 rules, rather than in alphabetical order. Since this may break
3234 some proofs, these proofs either have to be repaired, e.g. by
3235 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3236 statements of the form
3238 case (rule_i a_i_1 ... a_i_{k_i})
3240 or the old order of quantification has to be restored by explicitly adding
3241 meta-level quantifiers in the introduction rules, i.e.
3243 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3245 - The format of the elimination rules is now
3247 p z_1 ... z_m x_1 ... x_n ==>
3248 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3253 (x_1, ..., x_n) : s z_1 ... z_m ==>
3254 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3257 for sets rather than
3259 x : s z_1 ... z_m ==>
3260 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3263 This may require terms in goals to be expanded to n-tuples
3264 (e.g. using case_tac or simplification with the split_paired_all
3265 rule) before the above elimination rule is applicable.
3267 - The elimination or case analysis rules for (mutually) inductive
3268 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3269 list of rules "p_1_..._p_k.elims" is no longer available.
3271 * New package "function"/"fun" for general recursive functions,
3272 supporting mutual and nested recursion, definitions in local contexts,
3273 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3274 for small examples, and the separate tutorial on the function
3275 package. The old recdef "package" is still available as before, but
3276 users are encouraged to use the new package.
3278 * Method "lexicographic_order" automatically synthesizes termination
3279 relations as lexicographic combinations of size measures.
3281 * Case-expressions allow arbitrary constructor-patterns (including
3282 "_") and take their order into account, like in functional
3283 programming. Internally, this is translated into nested
3284 case-expressions; missing cases are added and mapped to the predefined
3285 constant "undefined". In complicated cases printing may no longer show
3286 the original input but the internal form. Lambda-abstractions allow
3287 the same form of pattern matching: "% pat1 => e1 | ..." is an
3288 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3291 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3292 is an abbreviation for "of_nat :: nat => int". The simplification
3293 rules for "of_nat" have been changed to work like "int" did
3294 previously. Potential INCOMPATIBILITY:
3295 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3296 - of_nat_diff and of_nat_mult are no longer default simp rules
3298 * Method "algebra" solves polynomial equations over (semi)rings using
3299 Groebner bases. The (semi)ring structure is defined by locales and the
3300 tool setup depends on that generic context. Installing the method for
3301 a specific type involves instantiating the locale and possibly adding
3302 declarations for computation on the coefficients. The method is
3303 already instantiated for natural numbers and for the axiomatic class
3304 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3305 CALCULEMUS 2007 for the general principles underlying this
3306 architecture of context-aware proof-tools.
3308 * Method "ferrack" implements quantifier elimination over
3309 special-purpose dense linear orders using locales (analogous to
3310 "algebra"). The method is already installed for class
3311 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3314 * Former constant "List.op @" now named "List.append". Use ML
3315 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3316 circumvent possible incompatibilities when working on ML level.
3318 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3320 * New function listsum :: 'a list => 'a for arbitrary monoids.
3321 Special syntax: "SUM x <- xs. f x" (and latex variants)
3323 * New syntax for Haskell-like list comprehension (input only), eg.
3324 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3326 * The special syntax for function "filter" has changed from [x :
3327 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3328 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3330 * [a..b] is now defined for arbitrary linear orders. It used to be
3331 defined on nat only, as an abbreviation for [a..<Suc b]
3334 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3336 * New functions "sorted" and "sort" in src/HOL/List.thy.
3338 * New lemma collection field_simps (an extension of ring_simps) for
3339 manipulating (in)equations involving division. Multiplies with all
3340 denominators that can be proved to be non-zero (in equations) or
3341 positive/negative (in inequations).
3343 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3344 have been improved and renamed to ring_simps, group_simps and
3345 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3346 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3348 * Theory Library/Commutative_Ring: switched from recdef to function
3349 package; constants add, mul, pow now curried. Infix syntax for
3350 algebraic operations.
3352 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3355 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3358 * HOL/records: generalised field-update to take a function on the
3359 field rather than the new value: r(|A := x|) is translated to A_update
3360 (K x) r The K-combinator that is internally used is called K_record.
3361 INCOMPATIBILITY: Usage of the plain update functions has to be
3364 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3365 * x = 0, which are required for a semiring. Richer structures do not
3366 inherit from semiring_0 anymore, because this property is a theorem
3367 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3368 there is more to prove, but this is mostly trivial.
3370 * Class "recpower" is generalized to arbitrary monoids, not just
3371 commutative semirings. INCOMPATIBILITY: may need to incorporate
3372 commutativity or semiring properties additionally.
3374 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3375 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3376 better use 'abbreviation'.
3378 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3380 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3381 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3382 significant changes for setting up numeral syntax for types:
3383 - New constants Numeral.pred and Numeral.succ instead
3384 of former Numeral.bin_pred and Numeral.bin_succ.
3385 - Use integer operations instead of bin_add, bin_mult and so on.
3386 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3387 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3389 See src/HOL/Integ/IntArith.thy for an example setup.
3391 * Command 'normal_form' computes the normal form of a term that may
3392 contain free variables. For example ``normal_form "rev [a, b, c]"''
3393 produces ``[b, c, a]'' (without proof). This command is suitable for
3394 heavy-duty computations because the functions are compiled to ML
3395 first. Correspondingly, a method "normalization" is provided. See
3396 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3398 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3399 25 like -->); output depends on the "iff" print_mode, the default is
3400 "A = B" (with priority 50).
3402 * Relations less (<) and less_eq (<=) are also available on type bool.
3403 Modified syntax to disallow nesting without explicit parentheses,
3404 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3407 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3409 * Relation composition operator "op O" now has precedence 75 and binds
3410 stronger than union and intersection. INCOMPATIBILITY.
3412 * The old set interval syntax "{m..n(}" (and relatives) has been
3413 removed. Use "{m..<n}" (and relatives) instead.
3415 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3416 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3417 ``declare [[simproc del: neq]]''.
3419 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3422 * Theorem Cons_eq_map_conv no longer declared as "simp".
3424 * Theorem setsum_mult renamed to setsum_right_distrib.
3426 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3429 * Reimplemented methods "sat" and "satx", with several improvements:
3430 goals no longer need to be stated as "<prems> ==> False", equivalences
3431 (i.e. "=" on type bool) are handled, variable names of the form
3432 "lit_<n>" are no longer reserved, significant speedup.
3434 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3435 zChaff is still supported as well.
3437 * 'inductive' and 'datatype': provide projections of mutual rules,
3438 bundled as foo_bar.inducts;
3440 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3443 * Library: moved theory Accessible_Part to main HOL.
3445 * Library: added theory Coinductive_List of potentially infinite lists
3446 as greatest fixed-point.
3448 * Library: added theory AssocList which implements (finite) maps as
3451 * Method "evaluation" solves goals (i.e. a boolean expression)
3452 efficiently by compiling it to ML. The goal is "proved" (via an
3453 oracle) if it evaluates to True.
3455 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3456 also when invoked by the simplifier. This results in the Simplifier
3457 being more powerful on arithmetic goals. INCOMPATIBILITY.
3458 Configuration option fast_arith_split_limit=0 recovers the old
3461 * Support for hex (0x20) and binary (0b1001) numerals.
3463 * New method: reify eqs (t), where eqs are equations for an
3464 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3465 parameter, computes a term s::'b and a list xs::'a list and proves the
3466 theorem I xs s = t. This is also known as reification or quoting. The
3467 resulting theorem is applied to the subgoal to substitute t with I xs
3468 s. If t is omitted, the subgoal itself is reified.
3470 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3471 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3472 where f is supposed to be a computable function (in the sense of code
3473 generattion). The method uses reify to compute s and xs as above then
3474 applies corr_thm and uses normalization by evaluation to "prove" f s =
3475 r and finally gets the theorem t = r, which is again applied to the
3476 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3478 * Reflection: Automatic reification now handels binding, an example is
3479 available in src/HOL/ex/ReflectionEx.thy
3481 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3482 command 'statespace' that is similar to 'record', but introduces an
3483 abstract specification based on the locale infrastructure instead of
3484 HOL types. This leads to extra flexibility in composing state spaces,
3485 in particular multiple inheritance and renaming of components.
3490 * Hyperreal: Functions root and sqrt are now defined on negative real
3491 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3492 Nonnegativity side conditions have been removed from many lemmas, so
3493 that more subgoals may now be solved by simplification; potential
3496 * Real: new type classes formalize real normed vector spaces and
3497 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3498 and norm :: 'a => real.
3500 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3501 reals into other types. The overloaded constant Reals :: 'a set is now
3502 defined as range of_real; potential INCOMPATIBILITY.
3504 * Real: proper support for ML code generation, including 'quickcheck'.
3505 Reals are implemented as arbitrary precision rationals.
3507 * Hyperreal: Several constants that previously worked only for the
3508 reals have been generalized, so they now work over arbitrary vector
3509 spaces. Type annotations may need to be added in some cases; potential
3512 Infinitesimal :: ('a::real_normed_vector) star set
3513 HFinite :: ('a::real_normed_vector) star set
3514 HInfinite :: ('a::real_normed_vector) star set
3515 approx :: ('a::real_normed_vector) star => 'a star => bool
3516 monad :: ('a::real_normed_vector) star => 'a star set
3517 galaxy :: ('a::real_normed_vector) star => 'a star set
3518 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3519 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3520 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3521 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3522 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3523 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3524 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3525 sgn :: 'a::real_normed_vector => 'a
3526 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3528 * Complex: Some complex-specific constants are now abbreviations for
3529 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3530 hnorm. Other constants have been entirely removed in favor of the
3531 polymorphic versions (INCOMPATIBILITY):
3535 HInfinite <-- CInfinite
3536 Infinitesimal <-- CInfinitesimal
3539 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3540 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3541 (ns)deriv <-- (ns)cderiv
3546 * Formalisation of ideals and the quotient construction over rings.
3548 * Order and lattice theory no longer based on records.
3551 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3552 greatest_closed. INCOMPATIBILITY.
3554 * Method algebra is now set up via an attribute. For examples see
3555 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3556 of algebraic structures.
3558 * Renamed theory CRing to Ring.
3563 * Substantial, yet incomplete support for nominal datatypes (binding
3564 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3565 src/HOL/Nominal/Examples. Prospective users should consult
3566 http://isabelle.in.tum.de/nominal/
3571 * ML basics: just one true type int, which coincides with IntInf.int
3574 * ML within Isar: antiquotations allow to embed statically-checked
3575 formal entities in the source, referring to the context available at
3576 compile-time. For example:
3578 ML {* @{sort "{zero,one}"} *}
3579 ML {* @{typ "'a => 'b"} *}
3580 ML {* @{term "%x. x"} *}
3581 ML {* @{prop "x == y"} *}
3582 ML {* @{ctyp "'a => 'b"} *}
3583 ML {* @{cterm "%x. x"} *}
3584 ML {* @{cprop "x == y"} *}
3585 ML {* @{thm asm_rl} *}
3586 ML {* @{thms asm_rl} *}
3587 ML {* @{type_name c} *}
3588 ML {* @{type_syntax c} *}
3589 ML {* @{const_name c} *}
3590 ML {* @{const_syntax c} *}
3593 ML {* @{theory Pure} *}
3594 ML {* @{theory_ref} *}
3595 ML {* @{theory_ref Pure} *}
3598 ML {* @{clasimpset} *}
3600 The same works for sources being ``used'' within an Isar context.
3602 * ML in Isar: improved error reporting; extra verbosity with
3603 ML_Context.trace enabled.
3605 * Pure/General/table.ML: the join operations now works via exceptions
3606 DUP/SAME instead of type option. This is simpler in simple cases, and
3607 admits slightly more efficient complex applications.
3609 * Pure: 'advanced' translation functions (parse_translation etc.) now
3610 use Context.generic instead of just theory.
3612 * Pure: datatype Context.generic joins theory/Proof.context and
3613 provides some facilities for code that works in either kind of
3614 context, notably GenericDataFun for uniform theory and proof data.
3616 * Pure: simplified internal attribute type, which is now always
3617 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3618 local (Proof.context) attributes have been discontinued, while
3619 minimizing code duplication. Thm.rule_attribute and
3620 Thm.declaration_attribute build canonical attributes; see also structure
3621 Context for further operations on Context.generic, notably
3622 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3623 declarations and definitions.
3625 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3626 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3627 init only required for impure data. INCOMPATIBILITY: empty really need
3628 to be empty (no dependencies on theory content!)
3630 * Pure/kernel: consts certification ignores sort constraints given in
3631 signature declarations. (This information is not relevant to the
3632 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3633 potential INCOMPATIBILITY.
3635 * Pure: axiomatic type classes are now purely definitional, with
3636 explicit proofs of class axioms and super class relations performed
3637 internally. See Pure/axclass.ML for the main internal interfaces --
3638 notably AxClass.define_class supercedes AxClass.add_axclass, and
3639 AxClass.axiomatize_class/classrel/arity supersede
3640 Sign.add_classes/classrel/arities.
3642 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3643 global/local versions on theory vs. Proof.context have been
3644 discontinued; Attrib.syntax and Method.syntax have been adapted
3645 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3646 attributes, methods, etc.
3648 * Pure: several functions of signature "... -> theory -> theory * ..."
3649 have been reoriented to "... -> theory -> ... * theory" in order to
3650 allow natural usage in combination with the ||>, ||>>, |-> and
3651 fold_map combinators.
3653 * Pure: official theorem names (closed derivations) and additional
3654 comments (tags) are now strictly separate. Name hints -- which are
3655 maintained as tags -- may be attached any time without affecting the
3658 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3659 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3660 achieve the old behaviour.
3662 * Pure: the "Goal" constant is now called "prop", supporting a
3663 slightly more general idea of ``protecting'' meta-level rule
3666 * Pure: Logic.(un)varify only works in a global context, which is now
3667 enforced instead of silently assumed. INCOMPATIBILITY, may use
3668 Logic.legacy_(un)varify as temporary workaround.
3670 * Pure: structure Name provides scalable operations for generating
3671 internal variable names, notably Name.variants etc. This replaces
3672 some popular functions from term.ML:
3674 Term.variant -> Name.variant
3675 Term.variantlist -> Name.variant_list
3676 Term.invent_names -> Name.invent_list
3678 Note that low-level renaming rarely occurs in new code -- operations
3679 from structure Variable are used instead (see below).
3681 * Pure: structure Variable provides fundamental operations for proper
3682 treatment of fixed/schematic variables in a context. For example,
3683 Variable.import introduces fixes for schematics of given facts and
3684 Variable.export reverses the effect (up to renaming) -- this replaces
3685 various freeze_thaw operations.
3687 * Pure: structure Goal provides simple interfaces for
3688 init/conclude/finish and tactical prove operations (replacing former
3689 Tactic.prove). Goal.prove is the canonical way to prove results
3690 within a given context; Goal.prove_global is a degraded version for
3691 theory level goals, including a global Drule.standard. Note that
3692 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3693 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3694 in a locale context).
3696 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3697 and type checking (Syntax.check_term etc.), with common combinations
3698 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3699 which are considered legacy and await removal.
3701 * Pure/Syntax: generic interfaces for type unchecking
3702 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3703 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3704 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3705 available for convenience, but refer to the very same operations using
3706 a mere theory instead of a full context.
3708 * Isar: simplified treatment of user-level errors, using exception
3709 ERROR of string uniformly. Function error now merely raises ERROR,
3710 without any side effect on output channels. The Isar toplevel takes
3711 care of proper display of ERROR exceptions. ML code may use plain
3712 handle/can/try; cat_error may be used to concatenate errors like this:
3714 ... handle ERROR msg => cat_error msg "..."
3716 Toplevel ML code (run directly or through the Isar toplevel) may be
3717 embedded into the Isar toplevel with exception display/debug like
3720 Isar.toplevel (fn () => ...)
3722 INCOMPATIBILITY, removed special transform_error facilities, removed
3723 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3724 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3725 -- use plain ERROR instead.
3727 * Isar: theory setup now has type (theory -> theory), instead of a
3728 list. INCOMPATIBILITY, may use #> to compose setup functions.
3730 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3731 ProofContext.debug/verbose flags.
3733 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3734 theory before entering a proof state. Transactions now always see a
3735 quasi-functional intermediate checkpoint, both in interactive and
3738 * Isar: simplified interfaces for outer syntax. Renamed
3739 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3740 OuterSyntax.add_parsers -- this functionality is now included in
3741 OuterSyntax.command etc. INCOMPATIBILITY.
3743 * Simplifier: the simpset of a running simplification process now
3744 contains a proof context (cf. Simplifier.the_context), which is the
3745 very context that the initial simpset has been retrieved from (by
3746 simpset_of/local_simpset_of). Consequently, all plug-in components
3747 (solver, looper etc.) may depend on arbitrary proof data.
3749 * Simplifier.inherit_context inherits the proof context (plus the
3750 local bounds) of the current simplification process; any simproc
3751 etc. that calls the Simplifier recursively should do this! Removed
3752 former Simplifier.inherit_bounds, which is already included here --
3753 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3754 specify an explicit context using Simplifier.context/theory_context.
3756 * Simplifier/Classical Reasoner: more abstract interfaces
3757 change_simpset/claset for modifying the simpset/claset reference of a
3758 theory; raw versions simpset/claset_ref etc. have been discontinued --
3761 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3767 * settings: the default heap location within ISABELLE_HOME_USER now
3768 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3769 Isabelle installations.
3771 * isabelle-process: option -S (secure mode) disables some critical
3772 operations, notably runtime compilation and evaluation of ML source
3775 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3777 * Support for parallel execution, using native multicore support of
3778 Poly/ML 5.1. The theory loader exploits parallelism when processing
3779 independent theories, according to the given theory header
3780 specifications. The maximum number of worker threads is specified via
3781 usedir option -M or the "max-threads" setting in Proof General. A
3782 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3783 to 6 on a 8-core machine. User-code needs to observe certain
3784 guidelines for thread-safe programming, see appendix A in the Isar
3785 Implementation manual.
3789 New in Isabelle2005 (October 2005)
3790 ----------------------------------
3794 * Theory headers: the new header syntax for Isar theories is
3797 imports <theory1> ... <theoryN>
3798 uses <file1> ... <fileM>
3801 where the 'uses' part is optional. The previous syntax
3803 theory <name> = <theory1> + ... + <theoryN>:
3805 will disappear in the next release. Use isatool fixheaders to convert
3806 existing theory files. Note that there is no change in ancient
3807 non-Isar theories now, but these will disappear soon.
3809 * Theory loader: parent theories can now also be referred to via
3810 relative and absolute paths.
3812 * Command 'find_theorems' searches for a list of criteria instead of a
3813 list of constants. Known criteria are: intro, elim, dest, name:string,
3814 simp:term, and any term. Criteria can be preceded by '-' to select
3815 theorems that do not match. Intro, elim, dest select theorems that
3816 match the current goal, name:s selects theorems whose fully qualified
3817 name contain s, and simp:term selects all simplification rules whose
3818 lhs match term. Any other term is interpreted as pattern and selects
3819 all theorems matching the pattern. Available in ProofGeneral under
3820 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3822 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3824 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3825 matching the current goal as introduction rule and not having "HOL."
3826 in their name (i.e. not being defined in theory HOL).
3828 * Command 'thms_containing' has been discontinued in favour of
3829 'find_theorems'; INCOMPATIBILITY.
3831 * Communication with Proof General is now 8bit clean, which means that
3832 Unicode text in UTF-8 encoding may be used within theory texts (both
3833 formal and informal parts). Cf. option -U of the Isabelle Proof
3834 General interface. Here are some simple examples (cf. src/HOL/ex):
3836 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3837 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3839 * Improved efficiency of the Simplifier and, to a lesser degree, the
3840 Classical Reasoner. Typical big applications run around 2 times
3844 *** Document preparation ***
3846 * Commands 'display_drafts' and 'print_drafts' perform simple output
3847 of raw sources. Only those symbols that do not require additional
3848 LaTeX packages (depending on comments in isabellesym.sty) are
3849 displayed properly, everything else is left verbatim. isatool display
3850 and isatool print are used as front ends (these are subject to the
3851 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3853 * Command tags control specific markup of certain regions of text,
3854 notably folding and hiding. Predefined tags include "theory" (for
3855 theory begin and end), "proof" for proof commands, and "ML" for
3856 commands involving ML code; the additional tags "visible" and
3857 "invisible" are unused by default. Users may give explicit tag
3858 specifications in the text, e.g. ''by %invisible (auto)''. The
3859 interpretation of tags is determined by the LaTeX job during document
3860 preparation: see option -V of isatool usedir, or options -n and -t of
3861 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3864 Several document versions may be produced at the same time via isatool
3865 usedir (the generated index.html will link all of them). Typical
3866 specifications include ''-V document=theory,proof,ML'' to present
3867 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3868 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3869 these parts without any formal replacement text. The Isabelle site
3870 default settings produce ''document'' and ''outline'' versions as
3873 * Several new antiquotations:
3875 @{term_type term} prints a term with its type annotated;
3877 @{typeof term} prints the type of a term;
3879 @{const const} is the same as @{term const}, but checks that the
3880 argument is a known logical constant;
3882 @{term_style style term} and @{thm_style style thm} print a term or
3883 theorem applying a "style" to it
3887 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3888 definitions, equations, inequations etc., 'concl' printing only the
3889 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3890 to print the specified premise. TermStyle.add_style provides an ML
3891 interface for introducing further styles. See also the "LaTeX Sugar"
3892 document practical applications. The ML antiquotation prints
3893 type-checked ML expressions verbatim.
3895 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3896 and 'text' support optional locale specification '(in loc)', which
3897 specifies the default context for interpreting antiquotations. For
3898 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3900 * Option 'locale=NAME' of antiquotations specifies an alternative
3901 context interpreting the subsequent argument. For example: @{thm
3902 [locale=lattice] inf_assoc}.
3904 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3907 * Proper output of antiquotations for theory commands involving a
3908 proof context (such as 'locale' or 'theorem (in loc) ...').
3910 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3911 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3913 * isatool usedir: new option -C (default true) controls whether option
3914 -D should include a copy of the original document directory; -C false
3915 prevents unwanted effects such as copying of administrative CVS data.
3920 * Considerably improved version of 'constdefs' command. Now performs
3921 automatic type-inference of declared constants; additional support for
3922 local structure declarations (cf. locales and HOL records), see also
3923 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3924 sequential dependencies of definitions within a single 'constdefs'
3925 section; moreover, the declared name needs to be an identifier. If
3926 all fails, consider to fall back on 'consts' and 'defs' separately.
3928 * Improved indexed syntax and implicit structures. First of all,
3929 indexed syntax provides a notational device for subscripted
3930 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3931 expressions. Secondly, in a local context with structure
3932 declarations, number indexes \<^sub>n or the empty index (default
3933 number 1) refer to a certain fixed variable implicitly; option
3934 show_structs controls printing of implicit structures. Typical
3935 applications of these concepts involve record types and locales.
3937 * New command 'no_syntax' removes grammar declarations (and
3938 translations) resulting from the given syntax specification, which is
3939 interpreted in the same manner as for the 'syntax' command.
3941 * 'Advanced' translation functions (parse_translation etc.) may depend
3942 on the signature of the theory context being presently used for
3943 parsing/printing, see also isar-ref manual.
3945 * Improved 'oracle' command provides a type-safe interface to turn an
3946 ML expression of type theory -> T -> term into a primitive rule of
3947 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3948 is already included here); see also FOL/ex/IffExample.thy;
3951 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3952 before); "cI" is no longer bound, use "c.intro" instead.
3953 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3954 axclasses vs. locales.
3956 * Improved internal renaming of symbolic identifiers -- attach primes
3957 instead of base 26 numbers.
3959 * New flag show_question_marks controls printing of leading question
3960 marks in schematic variable names.
3962 * In schematic variable names, *any* symbol following \<^isub> or
3963 \<^isup> is now treated as part of the base name. For example, the
3964 following works without printing of awkward ".0" indexes:
3966 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3969 * Inner syntax includes (*(*nested*) comments*).
3971 * Pretty printer now supports unbreakable blocks, specified in mixfix
3972 annotations as "(00...)".
3974 * Clear separation of logical types and nonterminals, where the latter
3975 may only occur in 'syntax' specifications or type abbreviations.
3976 Before that distinction was only partially implemented via type class
3977 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3978 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3979 exotic syntax specifications may require further adaption
3980 (e.g. Cube/Cube.thy).
3982 * Removed obsolete type class "logic", use the top sort {} instead.
3983 Note that non-logical types should be declared as 'nonterminals'
3984 rather than 'types'. INCOMPATIBILITY for new object-logic
3987 * Attributes 'induct' and 'cases': type or set names may now be
3988 locally fixed variables as well.
3990 * Simplifier: can now control the depth to which conditional rewriting
3991 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3994 * Simplifier: simplification procedures may now take the current
3995 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3996 interface), which is very useful for calling the Simplifier
3997 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3998 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3999 low-level mk_simproc no longer applies Logic.varify internally, to
4000 allow for use in a context of fixed variables.
4002 * thin_tac now works even if the assumption being deleted contains !!
4003 or ==>. More generally, erule now works even if the major premise of
4004 the elimination rule contains !! or ==>.
4006 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4008 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4009 from Pure, which contains all common declarations already. Both
4010 theories are defined via plain Isabelle/Isar .thy files.
4011 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4012 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4013 use isatool fixcpure to adapt your theory and ML sources.
4015 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4016 selections of theorems in named facts via index ranges.
4018 * 'print_theorems': in theory mode, really print the difference
4019 wrt. the last state (works for interactive theory development only),
4020 in proof mode print all local facts (cf. 'print_facts');
4022 * 'hide': option '(open)' hides only base names.
4024 * More efficient treatment of intermediate checkpoints in interactive
4027 * Code generator is now invoked via code_module (incremental code
4028 generation) and code_library (modular code generation, ML structures
4029 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4030 must be quoted when used as identifiers.
4032 * New 'value' command for reading, evaluating and printing terms using
4033 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4034 quoted when used as identifier.
4039 * New commands for the interpretation of locale expressions in
4040 theories (1), locales (2) and proof contexts (3). These generate
4041 proof obligations from the expression specification. After the
4042 obligations have been discharged, theorems of the expression are added
4043 to the theory, target locale or proof context. The synopsis of the
4044 commands is a follows:
4046 (1) interpretation expr inst
4047 (2) interpretation target < expr
4048 (3) interpret expr inst
4050 Interpretation in theories and proof contexts require a parameter
4051 instantiation of terms from the current context. This is applied to
4052 specifications and theorems of the interpreted expression.
4053 Interpretation in locales only permits parameter renaming through the
4054 locale expression. Interpretation is smart in that interpretations
4055 that are active already do not occur in proof obligations, neither are
4056 instantiated theorems stored in duplicate. Use 'print_interps' to
4057 inspect active interpretations of a particular locale. For details,
4058 see the Isar Reference manual. Examples can be found in
4059 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4061 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4062 'interpret' instead.
4064 * New context element 'constrains' for adding type constraints to
4067 * Context expressions: renaming of parameters with syntax
4070 * Locale declaration: 'includes' disallowed.
4072 * Proper static binding of attribute syntax -- i.e. types / terms /
4073 facts mentioned as arguments are always those of the locale definition
4074 context, independently of the context of later invocations. Moreover,
4075 locale operations (renaming and type / term instantiation) are applied
4076 to attribute arguments as expected.
4078 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4079 actual attributes; rare situations may require Attrib.attribute to
4080 embed those attributes into Attrib.src that lack concrete syntax.
4081 Attribute implementations need to cooperate properly with the static
4082 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4083 Attrib.XXX_thm etc. already do the right thing without further
4084 intervention. Only unusual applications -- such as "where" or "of"
4085 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4086 on the context and the facts involved -- may have to assign parsed
4087 values to argument tokens explicitly.
4089 * Changed parameter management in theorem generation for long goal
4090 statements with 'includes'. INCOMPATIBILITY: produces a different
4091 theorem statement in rare situations.
4093 * Locale inspection command 'print_locale' omits notes elements. Use
4094 'print_locale!' to have them included in the output.
4099 * Provers/hypsubst.ML: improved version of the subst method, for
4100 single-step rewriting: it now works in bound variable contexts. New is
4101 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4102 rewrite a different subterm than the original subst method, which is
4103 still available as 'simplesubst'.
4105 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4108 * Provers/trancl.ML: new transitivity reasoner for transitive and
4109 reflexive-transitive closure of relations.
4111 * Provers/blast.ML: new reference depth_limit to make blast's depth
4112 limit (previously hard-coded with a value of 20) user-definable.
4114 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4115 is peformed already. Object-logics merely need to finish their
4116 initial simpset configuration as before. INCOMPATIBILITY.
4121 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4124 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4126 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4127 and x-symbol; use option '-m epsilon' to get it actually printed.
4128 Moreover, the mathematically important symbolic identifier \<epsilon>
4129 becomes available as variable, constant etc. INCOMPATIBILITY,
4131 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4132 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4133 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4134 support corresponding Isar calculations.
4136 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4139 * theory SetInterval: changed the syntax for open intervals:
4148 The old syntax is still supported but will disappear in the next
4149 release. For conversion use the following Emacs search and replace
4150 patterns (these are not perfect but work quite well):
4152 {)\([^\.]*\)\.\. -> {\1<\.\.}
4153 \.\.\([^(}]*\)(} -> \.\.<\1}
4155 * Theory Commutative_Ring (in Library): method comm_ring for proving
4156 equalities in commutative rings; method 'algebra' provides a generic
4159 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4160 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4161 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4164 Some new syntax forms are available:
4166 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4167 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4168 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4169 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4171 The latter form "\<Sum>x < k. e" used to be based on a separate
4172 function "Summation", which has been discontinued.
4174 * theory Finite_Set: in structured induction proofs, the insert case
4175 is now 'case (insert x F)' instead of the old counterintuitive 'case
4178 * The 'refute' command has been extended to support a much larger
4179 fragment of HOL, including axiomatic type classes, constdefs and
4180 typedefs, inductive datatypes and recursion.
4182 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4183 Requires zChaff with proof generation to be installed. See
4184 HOL/ex/SAT_Examples.thy for examples.
4186 * Datatype induction via method 'induct' now preserves the name of the
4187 induction variable. For example, when proving P(xs::'a list) by
4188 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4189 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4190 in unstructured proof scripts.
4192 * Reworked implementation of records. Improved scalability for
4193 records with many fields, avoiding performance problems for type
4194 inference. Records are no longer composed of nested field types, but
4195 of nested extension types. Therefore the record type only grows linear
4196 in the number of extensions and not in the number of fields. The
4197 top-level (users) view on records is preserved. Potential
4198 INCOMPATIBILITY only in strange cases, where the theory depends on the
4199 old record representation. The type generated for a record is called
4200 <record_name>_ext_type.
4202 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4203 proofs triggered by a record definition or a simproc (if
4204 quick_and_dirty is enabled). Definitions of large records can take
4207 New simproc record_upd_simproc for simplification of multiple record
4208 updates enabled by default. Moreover, trivial updates are also
4209 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4210 occasionally, since simplification is more powerful by default.
4212 * typedef: proper support for polymorphic sets, which contain extra
4213 type-variables in the term.
4215 * Simplifier: automatically reasons about transitivity chains
4216 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4217 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4218 old proofs break occasionally as simplification may now solve more
4219 goals than previously.
4221 * Simplifier: converts x <= y into x = y if assumption y <= x is
4222 present. Works for all partial orders (class "order"), in particular
4223 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4226 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4227 bound variable or a constant then the let is unfolded. Otherwise
4228 first a is simplified to b, and then f b is simplified to g. If
4229 possible we abstract b from g arriving at "let x = b in h x",
4230 otherwise we unfold the let and arrive at g. The simproc can be
4231 enabled/disabled by the reference use_let_simproc. Potential
4232 INCOMPATIBILITY since simplification is more powerful by default.
4234 * Classical reasoning: the meson method now accepts theorems as arguments.
4236 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4237 jobs to provide advice on the provability of subgoals.
4239 * Theory OrderedGroup and Ring_and_Field: various additions and
4240 improvements to faciliate calculations involving equalities and
4243 The following theorems have been eliminated or modified
4246 abs_eq now named abs_of_nonneg
4247 abs_of_ge_0 now named abs_of_nonneg
4248 abs_minus_eq now named abs_of_nonpos
4249 imp_abs_id now named abs_of_nonneg
4250 imp_abs_neg_id now named abs_of_nonpos
4251 mult_pos now named mult_pos_pos
4252 mult_pos_le now named mult_nonneg_nonneg
4253 mult_pos_neg_le now named mult_nonneg_nonpos
4254 mult_pos_neg2_le now named mult_nonneg_nonpos2
4255 mult_neg now named mult_neg_neg
4256 mult_neg_le now named mult_nonpos_nonpos
4258 * The following lemmas in Ring_and_Field have been added to the simplifier:
4261 not_square_less_zero
4263 The following lemmas have been deleted from Real/RealPow:
4273 * Theory Parity: added rules for simplifying exponents.
4277 The following theorems have been eliminated or modified
4280 list_all_Nil now named list_all.simps(1)
4281 list_all_Cons now named list_all.simps(2)
4282 list_all_conv now named list_all_iff
4283 set_mem_eq now named mem_iff
4285 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4286 asymptotic "big O" calculations. See the notes in BigO.thy.
4291 * Theory RealDef: better support for embedding natural numbers and
4292 integers in the reals.
4294 The following theorems have been eliminated or modified
4297 exp_ge_add_one_self now requires no hypotheses
4298 real_of_int_add reversed direction of equality (use [symmetric])
4299 real_of_int_minus reversed direction of equality (use [symmetric])
4300 real_of_int_diff reversed direction of equality (use [symmetric])
4301 real_of_int_mult reversed direction of equality (use [symmetric])
4303 * Theory RComplete: expanded support for floor and ceiling functions.
4305 * Theory Ln is new, with properties of the natural logarithm
4307 * Hyperreal: There is a new type constructor "star" for making
4308 nonstandard types. The old type names are now type synonyms:
4312 hcomplex = complex star
4314 * Hyperreal: Many groups of similarly-defined constants have been
4315 replaced by polymorphic versions (INCOMPATIBILITY):
4317 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4319 starset <-- starsetNat, starsetC
4320 *s* <-- *sNat*, *sc*
4321 starset_n <-- starsetNat_n, starsetC_n
4322 *sn* <-- *sNatn*, *scn*
4323 InternalSets <-- InternalNatSets, InternalCSets
4325 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4326 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4327 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4328 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4329 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4331 * Hyperreal: Many type-specific theorems have been removed in favor of
4332 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4334 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4335 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4336 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4337 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4338 right_minus <-- hypreal_add_minus
4339 left_minus <-- {hypreal,hcomplex}_add_minus_left
4340 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4341 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4342 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4343 mult_1_right <-- hcomplex_mult_one_right
4344 mult_zero_left <-- hcomplex_mult_zero_left
4345 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4346 right_distrib <-- hypnat_add_mult_distrib2
4347 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4348 right_inverse <-- hypreal_mult_inverse
4349 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4350 order_refl <-- {hypreal,hypnat}_le_refl
4351 order_trans <-- {hypreal,hypnat}_le_trans
4352 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4353 order_less_le <-- {hypreal,hypnat}_less_le
4354 linorder_linear <-- {hypreal,hypnat}_le_linear
4355 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4356 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4357 add_nonneg_nonneg <-- hypreal_le_add_order
4359 * Hyperreal: Separate theorems having to do with type-specific
4360 versions of constants have been merged into theorems that apply to the
4361 new polymorphic constants (INCOMPATIBILITY):
4363 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4364 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4365 STAR_Un <-- {STAR,NatStar,STARC}_Un
4366 STAR_Int <-- {STAR,NatStar,STARC}_Int
4367 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4368 STAR_subset <-- {STAR,NatStar,STARC}_subset
4369 STAR_mem <-- {STAR,NatStar,STARC}_mem
4370 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4371 STAR_diff <-- {STAR,STARC}_diff
4372 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4373 STARC_hcomplex_of_complex}_image_subset
4374 starset_n_Un <-- starset{Nat,C}_n_Un
4375 starset_n_Int <-- starset{Nat,C}_n_Int
4376 starset_n_Compl <-- starset{Nat,C}_n_Compl
4377 starset_n_diff <-- starset{Nat,C}_n_diff
4378 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4379 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4380 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4381 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4382 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4383 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4384 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4385 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4386 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4387 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4388 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4389 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4390 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4391 starfun_diff <-- starfun{C,RC,CR}_diff
4392 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4393 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4394 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4395 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4396 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4397 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4398 starfun_Id <-- starfunC_Id
4399 starfun_approx <-- starfun{Nat,CR}_approx
4400 starfun_capprox <-- starfun{C,RC}_capprox
4401 starfun_abs <-- starfunNat_rabs
4402 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4403 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4404 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4405 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4406 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4407 starfun_add_approx <-- starfunCR_add_approx
4408 starfun_inverse_inverse <-- starfunC_inverse_inverse
4409 starfun_divide <-- starfun{C,CR,RC}_divide
4410 starfun_n <-- starfun{Nat,C}_n
4411 starfun_n_mult <-- starfun{Nat,C}_n_mult
4412 starfun_n_add <-- starfun{Nat,C}_n_add
4413 starfun_n_add_minus <-- starfunNat_n_add_minus
4414 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4415 starfun_n_minus <-- starfun{Nat,C}_n_minus
4416 starfun_n_eq <-- starfun{Nat,C}_n_eq
4418 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4419 star_n_minus <-- {hypreal,hcomplex}_minus
4420 star_n_diff <-- {hypreal,hcomplex}_diff
4421 star_n_mult <-- {hypreal,hcomplex}_mult
4422 star_n_inverse <-- {hypreal,hcomplex}_inverse
4423 star_n_le <-- {hypreal,hypnat}_le
4424 star_n_less <-- {hypreal,hypnat}_less
4425 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4426 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4427 star_n_abs <-- hypreal_hrabs
4428 star_n_divide <-- hcomplex_divide
4430 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4431 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4432 star_of_diff <-- hypreal_of_real_diff
4433 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4434 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4435 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4436 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4437 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4438 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4439 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4440 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4441 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4442 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4443 star_of_number_of <-- {hypreal,hcomplex}_number_of
4444 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4445 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4446 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4447 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4448 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4449 star_of_power <-- hypreal_of_real_power
4450 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4452 * Hyperreal: new method "transfer" that implements the transfer
4453 principle of nonstandard analysis. With a subgoal that mentions
4454 nonstandard types like "'a star", the command "apply transfer"
4455 replaces it with an equivalent one that mentions only standard types.
4456 To be successful, all free variables must have standard types; non-
4457 standard variables must have explicit universal quantifiers.
4459 * Hyperreal: A theory of Taylor series.
4464 * Discontinued special version of 'constdefs' (which used to support
4465 continuous functions) in favor of the general Pure one with full
4468 * New simplification procedure for solving continuity conditions; it
4469 is much faster on terms with many nested lambda abstractions (cubic
4470 instead of exponential time).
4472 * New syntax for domain package: selector names are now optional.
4473 Parentheses should be omitted unless argument is lazy, for example:
4475 domain 'a stream = cons "'a" (lazy "'a stream")
4477 * New command 'fixrec' for defining recursive functions with pattern
4478 matching; defining multiple functions with mutual recursion is also
4479 supported. Patterns may include the constants cpair, spair, up, sinl,
4480 sinr, or any data constructor defined by the domain package. The given
4481 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4482 syntax and examples.
4484 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4485 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4486 but the proof obligation additionally includes an admissibility
4487 requirement. The packages generate instances of class cpo or pcpo,
4488 with continuity and strictness theorems for Rep and Abs.
4490 * HOLCF: Many theorems have been renamed according to a more standard naming
4491 scheme (INCOMPATIBILITY):
4493 foo_inject: "foo$x = foo$y ==> x = y"
4494 foo_eq: "(foo$x = foo$y) = (x = y)"
4495 foo_less: "(foo$x << foo$y) = (x << y)"
4496 foo_strict: "foo$UU = UU"
4497 foo_defined: "... ==> foo$x ~= UU"
4498 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4503 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4504 including the First Isomorphism Theorem (on quotienting by the kernel
4507 * ZF/Simplifier: install second copy of type solver that actually
4508 makes use of TC rules declared to Isar proof contexts (or locales);
4509 the old version is still required for ML proof scripts.
4514 * Converted to Isar theory format; use locales instead of axiomatic
4520 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4523 * Pure/library.ML no longer defines its own option datatype, but uses
4524 that of the SML basis, which has constructors NONE and SOME instead of
4525 None and Some, as well as exception Option.Option instead of OPTION.
4526 The functions the, if_none, is_some, is_none have been adapted
4527 accordingly, while Option.map replaces apsome.
4529 * Pure/library.ML: the exception LIST has been given up in favour of
4530 the standard exceptions Empty and Subscript, as well as
4531 Library.UnequalLengths. Function like Library.hd and Library.tl are
4532 superceded by the standard hd and tl functions etc.
4534 A number of basic list functions are no longer exported to the ML
4535 toplevel, as they are variants of predefined functions. The following
4536 suggests how one can translate existing code:
4538 rev_append xs ys = List.revAppend (xs, ys)
4539 nth_elem (i, xs) = List.nth (xs, i)
4540 last_elem xs = List.last xs
4541 flat xss = List.concat xss
4542 seq fs = List.app fs
4543 partition P xs = List.partition P xs
4544 mapfilter f xs = List.mapPartial f xs
4546 * Pure/library.ML: several combinators for linear functional
4547 transformations, notably reverse application and composition:
4550 (x, y) |-> f f #-> g
4552 * Pure/library.ML: introduced/changed precedence of infix operators:
4554 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4556 infix 3 o oo ooo oooo;
4557 infix 4 ~~ upto downto;
4559 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4562 * Pure/library.ML: natural list combinators fold, fold_rev, and
4563 fold_map support linear functional transformations and nesting. For
4566 fold f [x1, ..., xN] y =
4567 y |> f x1 |> ... |> f xN
4569 (fold o fold) f [xs1, ..., xsN] y =
4570 y |> fold f xs1 |> ... |> fold f xsN
4572 fold f [x1, ..., xN] =
4575 (fold o fold) f [xs1, ..., xsN] =
4576 fold f xs1 #> ... #> fold f xsN
4578 * Pure/library.ML: the following selectors on type 'a option are
4581 the: 'a option -> 'a (*partial*)
4582 these: 'a option -> 'a where 'a = 'b list
4583 the_default: 'a -> 'a option -> 'a
4584 the_list: 'a option -> 'a list
4586 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4587 basic operations for association lists, following natural argument
4588 order; moreover the explicit equality predicate passed here avoids
4589 potentially expensive polymorphic runtime equality checks.
4590 The old functions may be expressed as follows:
4592 assoc = uncurry (AList.lookup (op =))
4593 assocs = these oo AList.lookup (op =)
4594 overwrite = uncurry (AList.update (op =)) o swap
4596 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4598 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4599 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4601 replacing make_keylist and keyfilter (occassionally used)
4604 make_keylist = AList.make
4605 keyfilter = AList.find (op =)
4607 * eq_fst and eq_snd now take explicit equality parameter, thus
4608 avoiding eqtypes. Naive rewrites:
4610 eq_fst = eq_fst (op =)
4611 eq_snd = eq_snd (op =)
4613 * Removed deprecated apl and apr (rarely used).
4616 apl (n, op) =>>= curry op n
4617 apr (op, m) =>>= fn n => op (n, m)
4619 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4620 provides a reasonably efficient light-weight implementation of sets as
4623 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4624 few new operations; existing lookup and update are now curried to
4625 follow natural argument order (for use with fold etc.);
4626 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4628 * Pure/General: output via the Isabelle channels of
4629 writeln/warning/error etc. is now passed through Output.output, with a
4630 hook for arbitrary transformations depending on the print_mode
4631 (cf. Output.add_mode -- the first active mode that provides a output
4632 function wins). Already formatted output may be embedded into further
4633 text via Output.raw; the result of Pretty.string_of/str_of and derived
4634 functions (string_of_term/cterm/thm etc.) is already marked raw to
4635 accommodate easy composition of diagnostic messages etc. Programmers
4636 rarely need to care about Output.output or Output.raw at all, with
4637 some notable exceptions: Output.output is required when bypassing the
4638 standard channels (writeln etc.), or in token translations to produce
4639 properly formatted results; Output.raw is required when capturing
4640 already output material that will eventually be presented to the user
4641 a second time. For the default print mode, both Output.output and
4642 Output.raw have no effect.
4644 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4645 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4646 cumulative results are displayed at the end of a batch session.
4648 * Pure/General: File.sysify_path and File.quote_sysify path have been
4649 replaced by File.platform_path and File.shell_path (with appropriate
4650 hooks). This provides a clean interface for unusual systems where the
4651 internal and external process view of file names are different.
4653 * Pure: more efficient orders for basic syntactic entities: added
4654 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4655 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4656 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4657 orders now -- potential INCOMPATIBILITY for code that depends on a
4658 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4659 Library.sort_strings on result).
4661 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4662 fold_types traverse types/terms from left to right, observing natural
4663 argument order. Supercedes previous foldl_XXX versions, add_frees,
4664 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4666 * Pure: name spaces have been refined, with significant changes of the
4667 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4668 to extern(_table). The plain name entry path is superceded by a
4669 general 'naming' context, which also includes the 'policy' to produce
4670 a fully qualified name and external accesses of a fully qualified
4671 name; NameSpace.extend is superceded by context dependent
4672 Sign.declare_name. Several theory and proof context operations modify
4673 the naming context. Especially note Theory.restore_naming and
4674 ProofContext.restore_naming to get back to a sane state; note that
4675 Theory.add_path is no longer sufficient to recover from
4676 Theory.absolute_path in particular.
4678 * Pure: new flags short_names (default false) and unique_names
4679 (default true) for controlling output of qualified names. If
4680 short_names is set, names are printed unqualified. If unique_names is
4681 reset, the name prefix is reduced to the minimum required to achieve
4682 the original result when interning again, even if there is an overlap
4683 with earlier declarations.
4685 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4686 now 'extend', and 'merge' gets an additional Pretty.pp argument
4687 (useful for printing error messages). INCOMPATIBILITY.
4689 * Pure: major reorganization of the theory context. Type Sign.sg and
4690 Theory.theory are now identified, referring to the universal
4691 Context.theory (see Pure/context.ML). Actual signature and theory
4692 content is managed as theory data. The old code and interfaces were
4693 spread over many files and structures; the new arrangement introduces
4694 considerable INCOMPATIBILITY to gain more clarity:
4696 Context -- theory management operations (name, identity, inclusion,
4697 parents, ancestors, merge, etc.), plus generic theory data;
4699 Sign -- logical signature and syntax operations (declaring consts,
4700 types, etc.), plus certify/read for common entities;
4702 Theory -- logical theory operations (stating axioms, definitions,
4703 oracles), plus a copy of logical signature operations (consts,
4704 types, etc.); also a few basic management operations (Theory.copy,
4707 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4708 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4709 for convenience -- they merely return the theory.
4711 * Pure: type Type.tsig is superceded by theory in most interfaces.
4713 * Pure: the Isar proof context type is already defined early in Pure
4714 as Context.proof (note that ProofContext.context and Proof.context are
4715 aliases, where the latter is the preferred name). This enables other
4716 Isabelle components to refer to that type even before Isar is present.
4718 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4719 typeK, constK, axiomK, oracleK), but provide explicit operations for
4720 any of these kinds. For example, Sign.intern typeK is now
4721 Sign.intern_type, Theory.hide_space Sign.typeK is now
4722 Theory.hide_types. Also note that former
4723 Theory.hide_classes/types/consts are now
4724 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4725 internalize their arguments! INCOMPATIBILITY.
4727 * Pure: get_thm interface (of PureThy and ProofContext) expects
4728 datatype thmref (with constructors Name and NameSelection) instead of
4729 plain string -- INCOMPATIBILITY;
4731 * Pure: cases produced by proof methods specify options, where NONE
4732 means to remove case bindings -- INCOMPATIBILITY in
4735 * Pure: the following operations retrieve axioms or theorems from a
4736 theory node or theory hierarchy, respectively:
4738 Theory.axioms_of: theory -> (string * term) list
4739 Theory.all_axioms_of: theory -> (string * term) list
4740 PureThy.thms_of: theory -> (string * thm) list
4741 PureThy.all_thms_of: theory -> (string * thm) list
4743 * Pure: print_tac now outputs the goal through the trace channel.
4745 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4746 Reference Toplevel.debug (default false) controls detailed printing
4747 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4748 controls execution profiling -- set to 1 for time and 2 for space
4749 (both increase the runtime).
4751 * Isar session: The initial use of ROOT.ML is now always timed,
4752 i.e. the log will show the actual process times, in contrast to the
4753 elapsed wall-clock time that the outer shell wrapper produces.
4755 * Simplifier: improved handling of bound variables (nameless
4756 representation, avoid allocating new strings). Simprocs that invoke
4757 the Simplifier recursively should use Simplifier.inherit_bounds to
4758 avoid local name clashes. Failure to do so produces warnings
4759 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4760 for further details.
4762 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4763 bindings for all theorems stored within a given theory; this may help
4764 in porting non-Isar theories to Isar ones, while keeping ML proof
4765 scripts for the time being.
4767 * ML operator HTML.with_charset specifies the charset begin used for
4768 generated HTML files. For example:
4770 HTML.with_charset "utf-8" use_thy "Hebrew";
4771 HTML.with_charset "utf-8" use_thy "Chinese";
4776 * Allow symlinks to all proper Isabelle executables (Isabelle,
4777 isabelle, isatool etc.).
4779 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4780 isatool doc, isatool mkdir, display_drafts etc.).
4782 * isatool usedir: option -f allows specification of the ML file to be
4783 used by Isabelle; default is ROOT.ML.
4785 * New isatool version outputs the version identifier of the Isabelle
4786 distribution being used.
4788 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4789 (containing Boolean satisfiability problems) into Isabelle/HOL
4794 New in Isabelle2004 (April 2004)
4795 --------------------------------
4799 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4800 Replaces linorder.ML.
4802 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4803 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4804 (\<a>...\<z>), are now considered normal letters, and can therefore
4805 be used anywhere where an ASCII letter (a...zA...Z) has until
4806 now. COMPATIBILITY: This obviously changes the parsing of some
4807 terms, especially where a symbol has been used as a binder, say
4808 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4809 as an identifier. Fix it by inserting a space around former
4810 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4811 existing theory and ML files.
4813 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4815 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4816 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4817 a normal (but invisible) letter. For multiple letter subscripts repeat
4818 \<^isub> like this: x\<^isub>1\<^isub>2.
4820 * Pure: There are now sub-/superscripts that can span more than one
4821 character. Text between \<^bsub> and \<^esub> is set in subscript in
4822 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4823 superscript. The new control characters are not identifier parts.
4825 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4826 content of "..." to the latex file instead of \isacntrl... . The "..."
4827 may consist of any printable characters excluding the end bracket >.
4829 * Pure: Using new Isar command "finalconsts" (or the ML functions
4830 Theory.add_finals or Theory.add_finals_i) it is now possible to
4831 declare constants "final", which prevents their being given a definition
4832 later. It is useful for constants whose behaviour is fixed axiomatically
4833 rather than definitionally, such as the meta-logic connectives.
4835 * Pure: 'instance' now handles general arities with general sorts
4836 (i.e. intersections of classes),
4838 * Presentation: generated HTML now uses a CSS style sheet to make layout
4839 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4840 It can be changed to alter the colors/layout of generated pages.
4845 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4846 cut_tac, subgoal_tac and thin_tac:
4847 - Now understand static (Isar) contexts. As a consequence, users of Isar
4848 locales are no longer forced to write Isar proof scripts.
4849 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4851 - INCOMPATIBILITY: names of variables to be instantiated may no
4852 longer be enclosed in quotes. Instead, precede variable name with `?'.
4853 This is consistent with the instantiation attribute "where".
4855 * Attributes "where" and "of":
4856 - Now take type variables of instantiated theorem into account when reading
4857 the instantiation string. This fixes a bug that caused instantiated
4858 theorems to have too special types in some circumstances.
4859 - "where" permits explicit instantiations of type variables.
4861 * Calculation commands "moreover" and "also" no longer interfere with
4862 current facts ("this"), admitting arbitrary combinations with "then"
4866 - Goal statements involving the context element "includes" no longer
4867 generate theorems with internal delta predicates (those ending on
4868 "_axioms") in the premise.
4869 Resolve particular premise with <locale>.intro to obtain old form.
4870 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4871 specification and "includes" elements in goal statement.
4872 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4873 [intro?] and [elim?] (respectively) by default.
4874 - Experimental command for instantiation of locales in proof contexts:
4875 instantiate <label>[<attrs>]: <loc>
4876 Instantiates locale <loc> and adds all its theorems to the current context
4877 taking into account their attributes. Label and attrs are optional
4878 modifiers, like in theorem declarations. If present, names of
4879 instantiated theorems are qualified with <label>, and the attributes
4880 <attrs> are applied after any attributes these theorems might have already.
4881 If the locale has assumptions, a chained fact of the form
4882 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4883 are derived. The command does not support old-style locales declared
4884 with "locale (open)".
4885 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4887 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4893 * Proof import: new image HOL4 contains the imported library from
4894 the HOL4 system with about 2500 theorems. It is imported by
4895 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4896 can be used like any other Isabelle image. See
4897 HOL/Import/HOL/README for more information.
4900 - Much improved handling of linear and partial orders.
4901 Reasoners for linear and partial orders are set up for type classes
4902 "linorder" and "order" respectively, and are added to the default simpset
4903 as solvers. This means that the simplifier can build transitivity chains
4904 to solve goals from the assumptions.
4905 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4906 of blast or auto after simplification become unnecessary because the goal
4907 is solved by simplification already.
4909 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4910 all proved in axiomatic type classes for semirings, rings and fields.
4913 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4914 now formalized using the Ring_and_Field theory mentioned above.
4915 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4916 than before, because now they are set up once in a generic manner.
4917 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4918 Look for the general versions in Ring_and_Field (and Power if they concern
4921 * Type "rat" of the rational numbers is now available in HOL-Complex.
4924 - Record types are now by default printed with their type abbreviation
4925 instead of the list of all field types. This can be configured via
4926 the reference "print_record_type_abbr".
4927 - Simproc "record_upd_simproc" for simplification of multiple updates added
4928 (not enabled by default).
4929 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4930 EX x. x = sel r to True (not enabled by default).
4931 - Tactic "record_split_simp_tac" to split and simplify records added.
4933 * 'specification' command added, allowing for definition by
4934 specification. There is also an 'ax_specification' command that
4935 introduces the new constants axiomatically.
4937 * arith(_tac) is now able to generate counterexamples for reals as well.
4939 * HOL-Algebra: new locale "ring" for non-commutative rings.
4941 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4942 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4944 * HOL-Matrix: a first theory for matrices in HOL with an application of
4945 matrix theory to linear programming.
4947 * Unions and Intersections:
4948 The latex output syntax of UN and INT has been changed
4949 from "\Union x \in A. B" to "\Union_{x \in A} B"
4950 i.e. the index formulae has become a subscript.
4951 Similarly for "\Union x. B", and for \Inter instead of \Union.
4953 * Unions and Intersections over Intervals:
4954 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4955 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4956 like in normal math, and corresponding versions for < and for intersection.
4958 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4959 lexicographic dictonary ordering has been added as "lexord".
4961 * ML: the legacy theory structures Int and List have been removed. They had
4962 conflicted with ML Basis Library structures having the same names.
4964 * 'refute' command added to search for (finite) countermodels. Only works
4965 for a fragment of HOL. The installation of an external SAT solver is
4966 highly recommended. See "HOL/Refute.thy" for details.
4968 * 'quickcheck' command: Allows to find counterexamples by evaluating
4969 formulae under an assignment of free variables to random values.
4970 In contrast to 'refute', it can deal with inductive datatypes,
4971 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4977 * Streams now come with concatenation and are part of the HOLCF image
4981 New in Isabelle2003 (May 2003)
4982 ------------------------------
4986 * Provers/simplifier:
4988 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4989 Assumptions are now subject to complete mutual simplification,
4990 not just from left to right. The simplifier now preserves
4991 the order of assumptions.
4993 Potential INCOMPATIBILITY:
4995 -- simp sometimes diverges where the old version did
4996 not, e.g. invoking simp on the goal
4998 [| P (f x); y = x; f x = f y |] ==> Q
5000 now gives rise to the infinite reduction sequence
5002 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5004 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5007 -- Tactics combining classical reasoner and simplification (such as auto)
5008 are also affected by this change, because many of them rely on
5009 simp. They may sometimes diverge as well or yield a different numbers
5010 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5011 in case of problems. Sometimes subsequent calls to the classical
5012 reasoner will fail because a preceeding call to the simplifier too
5013 eagerly simplified the goal, e.g. deleted redundant premises.
5015 - The simplifier trace now shows the names of the applied rewrite rules
5017 - You can limit the number of recursive invocations of the simplifier
5018 during conditional rewriting (where the simplifie tries to solve the
5019 conditions before applying the rewrite rule):
5020 ML "simp_depth_limit := n"
5021 where n is an integer. Thus you can force termination where previously
5022 the simplifier would diverge.
5024 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5026 - No longer aborts on failed congruence proof. Instead, the
5027 congruence is ignored.
5029 * Pure: New generic framework for extracting programs from constructive
5030 proofs. See HOL/Extraction.thy for an example instantiation, as well
5031 as HOL/Extraction for some case studies.
5033 * Pure: The main goal of the proof state is no longer shown by default, only
5034 the subgoals. This behaviour is controlled by a new flag.
5035 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5036 (ML: Proof.show_main_goal).
5038 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5039 rules whose conclusion matches subgoal 1:
5040 PG menu: Isabelle/Isar -> Show me -> matching rules
5041 The rules are ordered by how closely they match the subgoal.
5042 In particular, rules that solve a subgoal outright are displayed first
5043 (or rather last, the way they are printed).
5044 (ML: ProofGeneral.print_intros())
5046 * Pure: New flag trace_unify_fail causes unification to print
5047 diagnostic information (PG: in trace buffer) when it fails. This is
5048 useful for figuring out why single step proofs like rule, erule or
5051 * Pure: Locale specifications now produce predicate definitions
5052 according to the body of text (covering assumptions modulo local
5053 definitions); predicate "loc_axioms" covers newly introduced text,
5054 while "loc" is cumulative wrt. all included locale expressions; the
5055 latter view is presented only on export into the global theory
5056 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5057 on the old view without predicates;
5059 * Pure: predefined locales "var" and "struct" are useful for sharing
5060 parameters (as in CASL, for example); just specify something like
5061 ``var x + var y + struct M'' as import;
5063 * Pure: improved thms_containing: proper indexing of facts instead of
5064 raw theorems; check validity of results wrt. current name space;
5065 include local facts of proof configuration (also covers active
5066 locales), cover fixed variables in index; may use "_" in term
5067 specification; an optional limit for the number of printed facts may
5068 be given (the default is 40);
5070 * Pure: disallow duplicate fact bindings within new-style theory files
5073 * Provers: improved induct method: assumptions introduced by case
5074 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5075 the goal statement); "foo" still refers to all facts collectively;
5077 * Provers: the function blast.overloaded has been removed: all constants
5078 are regarded as potentially overloaded, which improves robustness in exchange
5079 for slight decrease in efficiency;
5081 * Provers/linorder: New generic prover for transitivity reasoning over
5082 linear orders. Note: this prover is not efficient!
5084 * Isar: preview of problems to finish 'show' now produce an error
5085 rather than just a warning (in interactive mode);
5092 - Produces a counter example if it cannot prove a goal.
5093 Note that the counter example may be spurious if the goal is not a formula
5094 of quantifier-free linear arithmetic.
5095 In ProofGeneral the counter example appears in the trace buffer.
5097 - Knows about div k and mod k where k is a numeral of type nat or int.
5099 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5100 linear arithmetic fails. This takes account of quantifiers and divisibility.
5101 Presburger arithmetic can also be called explicitly via presburger(_tac).
5103 * simp's arithmetic capabilities have been enhanced a bit: it now
5104 takes ~= in premises into account (by performing a case split);
5106 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5107 are distributed over a sum of terms;
5109 * New tactic "trans_tac" and method "trans" instantiate
5110 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5113 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5114 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5116 * 'typedef' command has new option "open" to suppress the set
5119 * functions Min and Max on finite sets have been introduced (theory
5122 * attribute [symmetric] now works for relations as well; it turns
5123 (x,y) : R^-1 into (y,x) : R, and vice versa;
5125 * induct over a !!-quantified statement (say !!x1..xn):
5126 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5128 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5129 %x. None. Warning: empty_def now refers to the previously hidden definition
5132 * Algebra: formalization of classical algebra. Intended as base for
5133 any algebraic development in Isabelle. Currently covers group theory
5134 (up to Sylow's theorem) and ring theory (Universal Property of
5135 Univariate Polynomials). Contributions welcome;
5137 * GroupTheory: deleted, since its material has been moved to Algebra;
5139 * Complex: new directory of the complex numbers with numeric constants,
5140 nonstandard complex numbers, and some complex analysis, standard and
5141 nonstandard (Jacques Fleuriot);
5143 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5145 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5148 * Real/HahnBanach: updated and adapted to locales;
5150 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5153 * UNITY: added the Meier-Sanders theory of progress sets;
5155 * MicroJava: bytecode verifier and lightweight bytecode verifier
5156 as abstract algorithms, instantiated to the JVM;
5158 * Bali: Java source language formalization. Type system, operational
5159 semantics, axiomatic semantics. Supported language features:
5160 classes, interfaces, objects,virtual methods, static methods,
5161 static/instance fields, arrays, access modifiers, definite
5162 assignment, exceptions.
5167 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5170 * Main ZF: virtually all theories converted to new-style format;
5175 * Pure: Tactic.prove provides sane interface for internal proofs;
5176 omits the infamous "standard" operation, so this is more appropriate
5177 than prove_goalw_cterm in many situations (e.g. in simprocs);
5179 * Pure: improved error reporting of simprocs;
5181 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5185 *** Document preparation ***
5187 * uses \par instead of \\ for line breaks in theory text. This may
5188 shift some page breaks in large documents. To get the old behaviour
5189 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5191 * minimized dependencies of isabelle.sty and isabellesym.sty on
5194 * \<euro> now needs package babel/greek instead of marvosym (which
5197 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5202 New in Isabelle2002 (March 2002)
5203 --------------------------------
5205 *** Document preparation ***
5207 * greatly simplified document preparation setup, including more
5208 graceful interpretation of isatool usedir -i/-d/-D options, and more
5209 instructive isatool mkdir; users should basically be able to get
5210 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5211 users may run a separate document processing stage manually like this:
5212 "isatool usedir -D output HOL Test && isatool document Test/output";
5214 * theory dependency graph may now be incorporated into documents;
5215 isatool usedir -g true will produce session_graph.eps/.pdf for use
5216 with \includegraphics of LaTeX;
5218 * proper spacing of consecutive markup elements, especially text
5219 blocks after section headings;
5221 * support bold style (for single symbols only), input syntax is like
5222 this: "\<^bold>\<alpha>" or "\<^bold>A";
5224 * \<bullet> is now output as bold \cdot by default, which looks much
5225 better in printed text;
5227 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5228 note that these symbols are currently unavailable in Proof General /
5229 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5231 * isatool latex no longer depends on changed TEXINPUTS, instead
5232 isatool document copies the Isabelle style files to the target
5238 * Pure/Provers: improved proof by cases and induction;
5239 - 'case' command admits impromptu naming of parameters (such as
5241 - 'induct' method divinates rule instantiation from the inductive
5242 claim; no longer requires excessive ?P bindings for proper
5243 instantiation of cases;
5244 - 'induct' method properly enumerates all possibilities of set/type
5245 rules; as a consequence facts may be also passed through *type*
5246 rules without further ado;
5247 - 'induct' method now derives symbolic cases from the *rulified*
5248 rule (before it used to rulify cases stemming from the internal
5249 atomized version); this means that the context of a non-atomic
5250 statement becomes is included in the hypothesis, avoiding the
5251 slightly cumbersome show "PROP ?case" form;
5252 - 'induct' may now use elim-style induction rules without chaining
5253 facts, using ``missing'' premises from the goal state; this allows
5254 rules stemming from inductive sets to be applied in unstructured
5255 scripts, while still benefitting from proper handling of non-atomic
5256 statements; NB: major inductive premises need to be put first, all
5257 the rest of the goal is passed through the induction;
5258 - 'induct' proper support for mutual induction involving non-atomic
5259 rule statements (uses the new concept of simultaneous goals, see
5261 - append all possible rule selections, but only use the first
5262 success (no backtracking);
5263 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5264 - undeclared rule case names default to numbers 1, 2, 3, ...;
5265 - added 'print_induct_rules' (covered by help item in recent Proof
5267 - moved induct/cases attributes to Pure, methods to Provers;
5268 - generic method setup instantiated for FOL and HOL;
5270 * Pure: support multiple simultaneous goal statements, for example
5271 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5272 meta-level mechanism, this acts as if several individual goals had
5273 been stated separately; in particular common proof methods need to be
5274 repeated in order to cover all claims; note that a single elimination
5275 step is *not* sufficient to establish the two conjunctions, so this
5278 assume "A & B" then have A and B .. (*".." fails*)
5280 better use "obtain" in situations as above; alternative refer to
5281 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5283 * Pure: proper integration with ``locales''; unlike the original
5284 version by Florian Kammller, Isar locales package high-level proof
5285 contexts rather than raw logical ones (e.g. we admit to include
5286 attributes everywhere); operations on locales include merge and
5287 rename; support for implicit arguments (``structures''); simultaneous
5288 type-inference over imports and text; see also HOL/ex/Locales.thy for
5291 * Pure: the following commands have been ``localized'', supporting a
5292 target locale specification "(in name)": 'lemma', 'theorem',
5293 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5294 stored both within the locale and at the theory level (exported and
5295 qualified by the locale name);
5297 * Pure: theory goals may now be specified in ``long'' form, with
5298 ad-hoc contexts consisting of arbitrary locale elements. for example
5299 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5300 definitions may be given, too); the result is a meta-level rule with
5301 the context elements being discharged in the obvious way;
5303 * Pure: new proof command 'using' allows to augment currently used
5304 facts after a goal statement ('using' is syntactically analogous to
5305 'apply', but acts on the goal's facts only); this allows chained facts
5306 to be separated into parts given before and after a claim, as in
5307 ``from a and b have C using d and e <proof>'';
5309 * Pure: renamed "antecedent" case to "rule_context";
5311 * Pure: new 'judgment' command records explicit information about the
5312 object-logic embedding (used by several tools internally); no longer
5313 use hard-wired "Trueprop";
5315 * Pure: added 'corollary' command;
5317 * Pure: fixed 'token_translation' command;
5319 * Pure: removed obsolete 'exported' attribute;
5321 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5322 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5323 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5325 * Pure: method 'atomize' presents local goal premises as object-level
5326 statements (atomic meta-level propositions); setup controlled via
5327 rewrite rules declarations of 'atomize' attribute; example
5328 application: 'induct' method with proper rule statements in improper
5331 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5332 now consider the syntactic context of assumptions, giving a better
5333 chance to get type-inference of the arguments right (this is
5334 especially important for locales);
5336 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5339 * Pure/obtain: the formal conclusion "thesis", being marked as
5340 ``internal'', may no longer be reference directly in the text;
5341 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5344 * Pure: generic 'sym' attribute which declares a rule both as pure
5345 'elim?' and for the 'symmetric' operation;
5347 * Pure: marginal comments ``--'' may now occur just anywhere in the
5348 text; the fixed correlation with particular command syntax has been
5351 * Pure: new method 'rules' is particularly well-suited for proof
5352 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5353 but often produces more compact proof terms with less detours;
5355 * Pure/Provers/classical: simplified integration with pure rule
5356 attributes and methods; the classical "intro?/elim?/dest?"
5357 declarations coincide with the pure ones; the "rule" method no longer
5358 includes classically swapped intros; "intro" and "elim" methods no
5359 longer pick rules from the context; also got rid of ML declarations
5360 AddXIs/AddXEs/AddXDs; all of this has some potential for
5363 * Provers/classical: attribute 'swapped' produces classical inversions
5364 of introduction rules;
5366 * Provers/simplifier: 'simplified' attribute may refer to explicit
5367 rules instead of full simplifier context; 'iff' attribute handles
5370 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5372 * HOL: 'recdef' now fails on unfinished automated proofs, use
5373 "(permissive)" option to recover old behavior;
5375 * HOL: 'inductive' no longer features separate (collective) attributes
5376 for 'intros' (was found too confusing);
5378 * HOL: properly declared induction rules less_induct and
5384 * HOL: moved over to sane numeral syntax; the new policy is as
5387 - 0 and 1 are polymorphic constants, which are defined on any
5388 numeric type (nat, int, real etc.);
5390 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5391 binary representation internally;
5393 - type nat has special constructor Suc, and generally prefers Suc 0
5394 over 1::nat and Suc (Suc 0) over 2::nat;
5396 This change may cause significant problems of INCOMPATIBILITY; here
5397 are some hints on converting existing sources:
5399 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5400 entities, so expressions involving "-" (unary or binary minus) need
5401 to be spaced properly;
5403 - existing occurrences of "1" may need to be constraint "1::nat" or
5404 even replaced by Suc 0; similar for old "2";
5406 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5408 - remove all special provisions on numerals in proofs;
5410 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5411 representation (depends on bin_arith_simps in the default context);
5413 * HOL: symbolic syntax for x^2 (numeral 2);
5415 * HOL: the class of all HOL types is now called "type" rather than
5416 "term"; INCOMPATIBILITY, need to adapt references to this type class
5417 in axclass/classes, instance/arities, and (usually rare) occurrences
5418 in typings (of consts etc.); internally the class is called
5419 "HOL.type", ML programs should refer to HOLogic.typeS;
5421 * HOL/record package improvements:
5422 - new derived operations "fields" to build a partial record section,
5423 "extend" to promote a fixed record to a record scheme, and
5424 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5425 declared as simp by default;
5426 - shared operations ("more", "fields", etc.) now need to be always
5427 qualified) --- potential INCOMPATIBILITY;
5428 - removed "make_scheme" operations (use "make" with "extend") --
5430 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5431 - provides cases/induct rules for use with corresponding Isar
5432 methods (for concrete records, record schemes, concrete more
5433 parts, and schematic more parts -- in that order);
5434 - internal definitions directly based on a light-weight abstract
5435 theory of product types over typedef rather than datatype;
5437 * HOL: generic code generator for generating executable ML code from
5438 specifications; specific support for HOL constructs such as inductive
5439 datatypes and sets, as well as recursive functions; can be invoked
5440 via 'generate_code' theory section;
5442 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5444 * HOL: consolidated and renamed several theories. In particular:
5445 Ord.thy has been absorbed into HOL.thy
5446 String.thy has been absorbed into List.thy
5448 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5449 (beware of argument permutation!);
5451 * HOL: linorder_less_split superseded by linorder_cases;
5453 * HOL/List: "nodups" renamed to "distinct";
5455 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5456 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5457 - Ex_def has changed, now need to use some_eq_ex
5459 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5460 in this (rare) case use:
5462 delSWrapper "split_all_tac"
5463 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5465 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5468 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5469 Isabelle's type classes, ^ on functions and relations has too general
5470 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5471 necessary to attach explicit type constraints;
5473 * HOL/Relation: the prefix name of the infix "O" has been changed from
5474 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5475 renamed accordingly (eg "compI" -> "rel_compI").
5477 * HOL: syntax translations now work properly with numerals and records
5480 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5481 of "lam" -- INCOMPATIBILITY;
5483 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5484 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5485 renamed "Product_Type.unit";
5487 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5489 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5490 the "cases" method);
5492 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5495 * HOL/IMP: updated and converted to new-style theory format; several
5496 parts turned into readable document, with proper Isar proof texts and
5497 some explanations (by Gerwin Klein);
5499 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5501 * HOL-Hyperreal is now a logic image;
5506 * Isar: consts/constdefs supports mixfix syntax for continuous
5509 * Isar: domain package adapted to new-style theory format, e.g. see
5512 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5513 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5514 lift.induct_tac, always use UU instead of Undef;
5516 * HOLCF/IMP: updated and converted to new-style theory;
5521 * Isar: proper integration of logic-specific tools and packages,
5522 including theory commands '(co)inductive', '(co)datatype',
5523 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5524 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5526 * theory Main no longer includes AC; for the Axiom of Choice, base
5527 your theory on Main_ZFC;
5529 * the integer library now covers quotients and remainders, with many
5530 laws relating division to addition, multiplication, etc.;
5532 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5533 typeless version of the formalism;
5535 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5538 * ZF/Induct: new directory for examples of inductive definitions,
5539 including theory Multiset for multiset orderings; converted to
5540 new-style theory format;
5542 * ZF: many new theorems about lists, ordinals, etc.;
5547 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5548 variable proof controls level of detail: 0 = no proofs (only oracle
5549 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5550 also ref manual for further ML interfaces;
5552 * Pure/axclass: removed obsolete ML interface
5553 goal_subclass/goal_arity;
5555 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5556 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5557 separate tokens, so expressions involving minus need to be spaced
5560 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5561 rather than "infixl" or "infixr";
5563 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5564 sort constraint specifications in type inference; e.g. "x::_::foo"
5565 ensures that the type of "x" is of sort "foo" (but not necessarily a
5568 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5569 control output of nested => (types); the default behavior is
5572 * Pure/syntax: builtin parse translation for "_constify" turns valued
5573 tokens into AST constants;
5575 * Pure/syntax: prefer later declarations of translations and print
5576 translation functions; potential INCOMPATIBILITY: need to reverse
5577 multiple declarations for same syntax element constant;
5579 * Pure/show_hyps reset by default (in accordance to existing Isar
5582 * Provers/classical: renamed addaltern to addafter, addSaltern to
5585 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5588 * system: tested support for MacOS X; should be able to get Isabelle +
5589 Proof General to work in a plain Terminal after installing Poly/ML
5590 (e.g. from the Isabelle distribution area) and GNU bash alone
5591 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5592 support requires further installations, e.g. from
5593 http://fink.sourceforge.net/);
5595 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5597 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5598 of 40 MB), cf. ML_OPTIONS;
5600 * system: Proof General keywords specification is now part of the
5601 Isabelle distribution (see etc/isar-keywords.el);
5603 * system: support for persistent Proof General sessions (refrain from
5604 outdating all loaded theories on startup); user may create writable
5605 logic images like this: ``isabelle -q HOL Test'';
5607 * system: smart selection of Isabelle process versus Isabelle
5608 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5609 run both "isabelle" and "Isabelle" even if file names are badly
5610 damaged (executable inspects the case of the first letter of its own
5611 name); added separate "isabelle-process" and "isabelle-interface";
5613 * system: refrain from any attempt at filtering input streams; no
5614 longer support ``8bit'' encoding of old isabelle font, instead proper
5615 iso-latin characters may now be used; the related isatools
5616 "symbolinput" and "nonascii" have disappeared as well;
5618 * system: removed old "xterm" interface (the print modes "xterm" and
5619 "xterm_color" are still available for direct use in a suitable
5624 New in Isabelle99-2 (February 2001)
5625 -----------------------------------
5627 *** Overview of INCOMPATIBILITIES ***
5629 * HOL: please note that theories in the Library and elsewhere often use the
5630 new-style (Isar) format; to refer to their theorems in an ML script you must
5631 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5633 * HOL: inductive package no longer splits induction rule aggressively,
5634 but only as far as specified by the introductions given; the old
5635 format may be recovered via ML function complete_split_rule or attribute
5636 'split_rule (complete)';
5638 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5639 gfp_Tarski to gfp_unfold;
5641 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5643 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5644 relation); infix "^^" has been renamed "``"; infix "``" has been
5645 renamed "`"; "univalent" has been renamed "single_valued";
5647 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5650 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5652 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5654 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5655 consequence, it is no longer monotonic wrt. the local goal context
5656 (which is now passed through the inductive cases);
5658 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5659 \<gg> to \<ggreater>;
5662 *** Document preparation ***
5664 * \isabellestyle{NAME} selects version of Isabelle output (currently
5665 available: are "it" for near math-mode best-style output, "sl" for
5666 slanted text style, and "tt" for plain type-writer; if no
5667 \isabellestyle command is given, output is according to slanted
5670 * support sub/super scripts (for single symbols only), input syntax is
5671 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5673 * some more standard symbols; see Appendix A of the system manual for
5674 the complete list of symbols defined in isabellesym.sty;
5676 * improved isabelle style files; more abstract symbol implementation
5677 (should now use \isamath{...} and \isatext{...} in custom symbol
5680 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5681 state; Note that presentation of goal states does not conform to
5682 actual human-readable proof documents. Please do not include goal
5683 states into document output unless you really know what you are doing!
5685 * proper indentation of antiquoted output with proportional LaTeX
5688 * no_document ML operator temporarily disables LaTeX document
5691 * isatool unsymbolize tunes sources for plain ASCII communication;
5696 * Pure: Isar now suffers initial goal statements to contain unbound
5697 schematic variables (this does not conform to actual readable proof
5698 documents, due to unpredictable outcome and non-compositional proof
5699 checking); users who know what they are doing may use schematic goals
5700 for Prolog-style synthesis of proven results;
5702 * Pure: assumption method (an implicit finishing) now handles actual
5705 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5706 initial goal, declare "that" only as Pure intro (only for single
5707 steps); the "that" rule assumption may now be involved in implicit
5708 finishing, thus ".." becomes a feasible for trivial obtains;
5710 * Pure: default proof step now includes 'intro_classes'; thus trivial
5711 instance proofs may be performed by "..";
5713 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5716 * Pure: more robust selection of calculational rules;
5718 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5719 rule (as well as the assumption rule);
5721 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5722 lemmas, using the graph browser tool;
5724 * Pure: predict failure of "show" in interactive mode;
5726 * Pure: 'thms_containing' now takes actual terms as arguments;
5728 * HOL: improved method 'induct' --- now handles non-atomic goals
5729 (potential INCOMPATIBILITY); tuned error handling;
5731 * HOL: cases and induct rules now provide explicit hints about the
5732 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5733 any remaining facts are inserted into the goal verbatim;
5735 * HOL: local contexts (aka cases) may now contain term bindings as
5736 well; the 'cases' and 'induct' methods new provide a ?case binding for
5737 the result to be shown in each case;
5739 * HOL: added 'recdef_tc' command;
5741 * isatool convert assists in eliminating legacy ML scripts;
5746 * HOL/Library: a collection of generic theories to be used together
5747 with main HOL; the theory loader path already includes this directory
5748 by default; the following existing theories have been moved here:
5749 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5750 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5752 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5753 modelling and verification task performed in Isabelle/HOL +
5754 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5756 * HOL/Algebra: special summation operator SUM no longer exists, it has
5757 been replaced by setsum; infix 'assoc' now has priority 50 (like
5758 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5759 'domain', this makes the theory consistent with mathematical
5762 * HOL basics: added overloaded operations "inverse" and "divide"
5763 (infix "/"), syntax for generic "abs" operation, generic summation
5766 * HOL/typedef: simplified package, provide more useful rules (see also
5769 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5770 now expressed as a proper nested rule (old-style tactic scripts may
5771 require atomize_strip_tac to cope with non-atomic premises);
5773 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5774 to "split_conv" (old name still available for compatibility);
5776 * HOL: improved concrete syntax for strings (e.g. allows translation
5777 rules with string literals);
5779 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5780 and Fleuriot's mechanization of analysis, including the transcendental
5781 functions for the reals;
5783 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5788 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5789 "lam" is displayed as TWO lambda-symbols
5791 * CTT: theory Main now available, containing everything (that is, Bool
5797 * Pure: the Simplifier has been implemented properly as a derived rule
5798 outside of the actual kernel (at last!); the overall performance
5799 penalty in practical applications is about 50%, while reliability of
5800 the Isabelle inference kernel has been greatly improved;
5802 * print modes "brackets" and "no_brackets" control output of nested =>
5803 (types) and ==> (props); the default behaviour is "brackets";
5805 * Provers: fast_tac (and friends) now handle actual object-logic rules
5806 as assumptions as well;
5808 * system: support Poly/ML 4.0;
5810 * system: isatool install handles KDE version 1 or 2;
5814 New in Isabelle99-1 (October 2000)
5815 ----------------------------------
5817 *** Overview of INCOMPATIBILITIES ***
5819 * HOL: simplification of natural numbers is much changed; to partly
5820 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5821 issue the following ML commands:
5823 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5824 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5826 * HOL: simplification no longer dives into case-expressions; this is
5827 controlled by "t.weak_case_cong" for each datatype t;
5829 * HOL: nat_less_induct renamed to less_induct;
5831 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5832 fixsome to patch .thy and .ML sources automatically;
5834 select_equality -> some_equality
5835 select_eq_Ex -> some_eq_ex
5836 selectI2EX -> someI2_ex
5839 select1_equality -> some1_equality
5840 Eps_sym_eq -> some_sym_eq_trivial
5841 Eps_eq -> some_eq_trivial
5843 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5845 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5848 * HOL: the recursion equations generated by 'recdef' are now called
5849 f.simps instead of f.rules;
5851 * HOL: qed_spec_mp now also handles bounded ALL as well;
5853 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5854 sometimes be needed;
5856 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5858 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5860 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5861 product is now "<*>" instead of "Times"; the lexicographic product is
5862 now "<*lex*>" instead of "**";
5864 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5865 of main HOL, but was unused); better use HOL's datatype package;
5867 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5868 the old syntax may be recovered as follows:
5871 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5872 (infixl "\\<oplus>" 100)
5874 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5876 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5877 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5880 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5881 changed from A/r to A//r;
5883 * ZF: new treatment of arithmetic (nat & int) may break some old
5886 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5887 rulify -> rule_format, elimify -> elim_format, ...);
5889 * Isar/Provers: intro/elim/dest attributes changed; renamed
5890 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5891 should have to change intro!! to intro? only); replaced "delrule" by
5894 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5896 * Provers: strengthened force_tac by using new first_best_tac;
5898 * LaTeX document preparation: several changes of isabelle.sty (see
5902 *** Document preparation ***
5904 * formal comments (text blocks etc.) in new-style theories may now
5905 contain antiquotations of thm/prop/term/typ/text to be presented
5906 according to latex print mode; concrete syntax is like this:
5907 @{term[show_types] "f(x) = a + x"};
5909 * isatool mkdir provides easy setup of Isabelle session directories,
5910 including proper document sources;
5912 * generated LaTeX sources are now deleted after successful run
5913 (isatool document -c); may retain a copy somewhere else via -D option
5916 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5917 style files, achieving self-contained LaTeX sources and simplifying
5920 * old-style theories now produce (crude) LaTeX output as well;
5922 * browser info session directories are now self-contained (may be put
5923 on WWW server seperately); improved graphs of nested sessions; removed
5924 graph for 'all sessions';
5926 * several improvements in isabelle style files; \isabellestyle{it}
5927 produces fake math mode output; \isamarkupheader is now \section by
5928 default; see lib/texinputs/isabelle.sty etc.;
5933 * Isar/Pure: local results and corresponding term bindings are now
5934 subject to Hindley-Milner polymorphism (similar to ML); this
5935 accommodates incremental type-inference very nicely;
5937 * Isar/Pure: new derived language element 'obtain' supports
5938 generalized existence reasoning;
5940 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5941 support accumulation of results, without applying any rules yet;
5942 useful to collect intermediate results without explicit name
5943 references, and for use with transitivity rules with more than 2
5946 * Isar/Pure: scalable support for case-analysis type proofs: new
5947 'case' language element refers to local contexts symbolically, as
5948 produced by certain proof methods; internally, case names are attached
5949 to theorems as "tags";
5951 * Isar/Pure: theory command 'hide' removes declarations from
5952 class/type/const name spaces;
5954 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5955 indicate potential overloading;
5957 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5959 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5960 "{a,b,c}" instead of {a,b,c};
5962 * Isar/Pure now provides its own version of intro/elim/dest
5963 attributes; useful for building new logics, but beware of confusion
5964 with the version in Provers/classical;
5966 * Isar/Pure: the local context of (non-atomic) goals is provided via
5967 case name 'antecedent';
5969 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5970 to the current context is now done automatically);
5972 * Isar/Pure: theory command 'method_setup' provides a simple interface
5973 for definining proof methods in ML;
5975 * Isar/Provers: intro/elim/dest attributes changed; renamed
5976 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5977 most cases, one should have to change intro!! to intro? only);
5978 replaced "delrule" by "rule del";
5980 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5981 'symmetric' attribute (the latter supercedes [RS sym]);
5983 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5984 method modifier); 'simp' method: 'only:' modifier removes loopers as
5985 well (including splits);
5987 * Isar/Provers: Simplifier and Classical methods now support all kind
5988 of modifiers used in the past, including 'cong', 'iff', etc.
5990 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5991 of Simplifier and Classical reasoner);
5993 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5994 now support named cases; major packages (inductive, datatype, primrec,
5995 recdef) support case names and properly name parameters;
5997 * Isar/HOL: new transitivity rules for substitution in inequalities --
5998 monotonicity conditions are extracted to be proven at end of
6001 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6004 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6005 split_if split_if_asm; datatype package provides theorems foo.splits =
6006 foo.split foo.split_asm for each datatype;
6008 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6009 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6010 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6011 use "(cases (simplified))" method in proper proof texts);
6013 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6015 * Isar: names of theorems etc. may be natural numbers as well;
6017 * Isar: 'pr' command: optional arguments for goals_limit and
6018 ProofContext.prems_limit; no longer prints theory contexts, but only
6021 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6022 additional print modes to be specified; e.g. "pr(latex)" will print
6023 proof state according to the Isabelle LaTeX style;
6025 * Isar: improved support for emulating tactic scripts, including proof
6026 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6027 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6028 (for HOL datatypes);
6030 * Isar: simplified (more robust) goal selection of proof methods: 1st
6031 goal, all goals, or explicit goal specifier (tactic emulation); thus
6032 'proof method scripts' have to be in depth-first order;
6034 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6036 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6037 should instead use individual commands for printing items
6038 (print_commands, print_methods etc.);
6040 * Isar: added 'nothing' --- the empty list of theorems;
6045 * HOL/MicroJava: formalization of a fragment of Java, together with a
6046 corresponding virtual machine and a specification of its bytecode
6047 verifier and a lightweight bytecode verifier, including proofs of
6048 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6049 Cornelia Pusch (see also the homepage of project Bali at
6050 http://isabelle.in.tum.de/Bali/);
6052 * HOL/Algebra: new theory of rings and univariate polynomials, by
6055 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6056 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6059 * HOL/Lattice: fundamental concepts of lattice theory and order
6060 structures, including duals, properties of bounds versus algebraic
6061 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6062 Theorem for complete lattices etc.; may also serve as a demonstration
6063 for abstract algebraic reasoning using axiomatic type classes, and
6064 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6066 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6069 * HOL/IMPP: extension of IMP with local variables and mutually
6070 recursive procedures, by David von Oheimb;
6072 * HOL/Lambda: converted into new-style theory and document;
6074 * HOL/ex/Multiquote: example of multiple nested quotations and
6075 anti-quotations -- basically a generalized version of de-Bruijn
6076 representation; very useful in avoiding lifting of operations;
6078 * HOL/record: added general record equality rule to simpset; fixed
6079 select-update simplification procedure to handle extended records as
6080 well; admit "r" as field name;
6082 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6083 other numeric types and also as the identity of groups, rings, etc.;
6085 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6086 Types nat and int belong to this axclass;
6088 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6089 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6090 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6091 two terms #m*u and #n*u are replaced by #(m+n)*u
6092 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6093 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6094 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6096 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6097 powerful prover for predicate logic but knows nothing of clasets; see
6098 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6100 * HOL: new version of "case_tac" subsumes both boolean case split and
6101 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6102 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6104 * HOL: simplification no longer dives into case-expressions: only the
6105 selector expression is simplified, but not the remaining arms; to
6106 enable full simplification of case-expressions for datatype t, you may
6107 remove t.weak_case_cong from the simpset, either globally (Delcongs
6108 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6110 * HOL/recdef: the recursion equations generated by 'recdef' for
6111 function 'f' are now called f.simps instead of f.rules; if all
6112 termination conditions are proved automatically, these simplification
6113 rules are added to the simpset, as in primrec; rules may be named
6114 individually as well, resulting in a separate list of theorems for
6117 * HOL/While is a new theory that provides a while-combinator. It
6118 permits the definition of tail-recursive functions without the
6119 provision of a termination measure. The latter is necessary once the
6120 invariant proof rule for while is applied.
6122 * HOL: new (overloaded) notation for the set of elements below/above
6123 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6125 * HOL: theorems impI, allI, ballI bound as "strip";
6127 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6128 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6129 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6131 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6133 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6134 main HOL, but was unused);
6136 * HOL: fewer consts declared as global (e.g. have to refer to
6137 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6139 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6140 in case of overlap with user translations (e.g. judgements over
6141 tuples); (note that the underlying logical represenation is still
6147 * ZF: simplification automatically cancels common terms in arithmetic
6148 expressions over nat and int;
6150 * ZF: new treatment of nat to minimize type-checking: all operators
6151 coerce their operands to a natural number using the function natify,
6152 making the algebraic laws unconditional;
6154 * ZF: as above, for int: operators coerce their operands to an integer
6155 using the function intify;
6157 * ZF: the integer library now contains many of the usual laws for the
6158 orderings, including $<=, and monotonicity laws for $+ and $*;
6160 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6163 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6164 to the simplifier and classical reasoner simultaneously;
6169 * Provers: blast_tac now handles actual object-logic rules as
6170 assumptions; note that auto_tac uses blast_tac internally as well;
6172 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6173 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6175 * Provers: delrules now handles destruct rules as well (no longer need
6176 explicit make_elim);
6178 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6179 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6180 use instead the strong form,
6181 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6182 in HOL, FOL and ZF the function cla_make_elim will create such rules
6183 from destruct-rules;
6185 * Provers: Simplifier.easy_setup provides a fast path to basic
6186 Simplifier setup for new object-logics;
6188 * Pure: AST translation rules no longer require constant head on LHS;
6190 * Pure: improved name spaces: ambiguous output is qualified; support
6191 for hiding of names;
6193 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6194 XSYMBOL_HOME; no longer need to do manual configuration in most
6197 * system: compression of ML heaps images may now be controlled via -c
6198 option of isabelle and isatool usedir (currently only observed by
6201 * system: isatool installfonts may handle X-Symbol fonts as well (very
6202 useful for remote X11);
6204 * system: provide TAGS file for Isabelle sources;
6206 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6209 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6210 timing flag supersedes proof_timing and Toplevel.trace;
6212 * ML: new combinators |>> and |>>> for incremental transformations
6213 with secondary results (e.g. certain theory extensions):
6215 * ML: PureThy.add_defs gets additional argument to indicate potential
6216 overloading (usually false);
6218 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6223 New in Isabelle99 (October 1999)
6224 --------------------------------
6226 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6228 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6229 are no longer simplified. (This allows the simplifier to unfold recursive
6230 functional programs.) To restore the old behaviour, declare
6232 Delcongs [if_weak_cong];
6234 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6237 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6239 * HOL/datatype: mutual_induct_tac no longer exists --
6240 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6242 * HOL/typedef: fixed type inference for representing set; type
6243 arguments now have to occur explicitly on the rhs as type constraints;
6245 * ZF: The con_defs part of an inductive definition may no longer refer
6246 to constants declared in the same theory;
6248 * HOL, ZF: the function mk_cases, generated by the inductive
6249 definition package, has lost an argument. To simplify its result, it
6250 uses the default simpset instead of a supplied list of theorems.
6252 * HOL/List: the constructors of type list are now Nil and Cons;
6254 * Simplifier: the type of the infix ML functions
6255 setSSolver addSSolver setSolver addSolver
6256 is now simpset * solver -> simpset where `solver' is a new abstract type
6257 for packaging solvers. A solver is created via
6258 mk_solver: string -> (thm list -> int -> tactic) -> solver
6259 where the string argument is only a comment.
6264 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6265 decision procedure for linear arithmetic. Currently it is used for
6266 types `nat', `int', and `real' in HOL (see below); it can, should and
6267 will be instantiated for other types and logics as well.
6269 * The simplifier now accepts rewrite rules with flexible heads, eg
6270 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6271 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6277 * New Isabelle/Isar subsystem provides an alternative to traditional
6278 tactical theorem proving; together with the ProofGeneral/isar user
6279 interface it offers an interactive environment for developing human
6280 readable proof documents (Isar == Intelligible semi-automated
6281 reasoning); for further information see isatool doc isar-ref,
6282 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6284 * improved and simplified presentation of theories: better HTML markup
6285 (including colors), graph views in several sizes; isatool usedir now
6286 provides a proper interface for user theories (via -P option); actual
6287 document preparation based on (PDF)LaTeX is available as well (for
6288 new-style theories only); see isatool doc system for more information;
6290 * native support for Proof General, both for classic Isabelle and
6293 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6294 using the graph browser tool;
6296 * Isabelle manuals now also available as PDF;
6298 * theory loader rewritten from scratch (may not be fully
6299 bug-compatible); old loadpath variable has been replaced by show_path,
6300 add_path, del_path, reset_path functions; new operations such as
6301 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6304 * improved isatool install: option -k creates KDE application icon,
6305 option -p DIR installs standalone binaries;
6307 * added ML_PLATFORM setting (useful for cross-platform installations);
6308 more robust handling of platform specific ML images for SML/NJ;
6310 * the settings environment is now statically scoped, i.e. it is never
6311 created again in sub-processes invoked from isabelle, isatool, or
6314 * path element specification '~~' refers to '$ISABELLE_HOME';
6316 * in locales, the "assumes" and "defines" parts may be omitted if
6319 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6322 * new print_mode "HTML";
6324 * new flag show_tags controls display of tags of theorems (which are
6325 basically just comments that may be attached by some tools);
6327 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6328 mode and goal output format:
6330 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6332 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6334 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6335 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6337 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6339 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6341 * function bind_thms stores lists of theorems (cf. bind_thm);
6343 * new shorthand tactics ftac, eatac, datac, fatac;
6345 * qed (and friends) now accept "" as result name; in that case the
6346 theorem is not stored, but proper checks and presentation of the
6349 * theorem database now also indexes constants "Trueprop", "all",
6350 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6355 ** HOL arithmetic **
6357 * There are now decision procedures for linear arithmetic over nat and
6360 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6361 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6362 are treated as atomic; subformulae not involving type `nat' or `int'
6363 are ignored; quantified subformulae are ignored unless they are
6364 positive universal or negative existential. The tactic has to be
6365 invoked by hand and can be a little bit slow. In particular, the
6366 running time is exponential in the number of occurrences of `min' and
6367 `max', and `-' on `nat'.
6369 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6370 (negated) (in)equalities among the premises and the conclusion into
6371 account (i.e. no compound formulae) and does not know about `min' and
6372 `max', and `-' on `nat'. It is fast and is used automatically by the
6375 NB: At the moment, these decision procedures do not cope with mixed
6376 nat/int formulae where the two parts interact, such as `m < n ==>
6379 * HOL/Numeral provides a generic theory of numerals (encoded
6380 efficiently as bit strings); setup for types nat/int/real is in place;
6381 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6382 int, existing theories and proof scripts may require a few additional
6385 * integer division and remainder can now be performed on constant
6388 * many properties of integer multiplication, division and remainder
6391 * An interface to the Stanford Validity Checker (SVC) is available through the
6392 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6393 are proved automatically. SVC must be installed separately, and its results
6394 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6395 invocation of the underlying oracle). For SVC see
6396 http://verify.stanford.edu/SVC
6398 * IsaMakefile: the HOL-Real target now builds an actual image;
6403 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6404 (in Isabelle/Isar) -- by Gertrud Bauer;
6406 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6407 analysis for assembly languages with subtypes;
6409 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6410 -- avoids syntactic ambiguities and treats state, transition, and
6411 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6412 changed syntax and (many) tactics;
6414 * HOL/inductive: Now also handles more general introduction rules such
6415 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6416 theorems are now maintained within the theory (maintained via the
6419 * HOL/datatype: Now also handles arbitrarily branching datatypes
6420 (using function types) such as
6422 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6424 * HOL/record: record_simproc (part of the default simpset) takes care
6425 of selectors applied to updated records; record_split_tac is no longer
6426 part of the default claset; update_defs may now be removed from the
6427 simpset in many cases; COMPATIBILITY: old behavior achieved by
6429 claset_ref () := claset() addSWrapper record_split_wrapper;
6430 Delsimprocs [record_simproc]
6432 * HOL/typedef: fixed type inference for representing set; type
6433 arguments now have to occur explicitly on the rhs as type constraints;
6435 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6436 names rather than an ML expression;
6438 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6439 supplied later. Program schemes can be defined, such as
6440 "While B C s = (if B s then While B C (C s) else s)"
6441 where the well-founded relation can be chosen after B and C have been given.
6443 * HOL/List: the constructors of type list are now Nil and Cons;
6444 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6445 course, ML tools referring to List.list.op # etc. have to be adapted;
6447 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6448 disabled by default; run isabelle with option -m HOL to get back to
6449 the original Gordon/HOL-style output;
6451 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6452 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6454 * HOL basic syntax simplified (more orthogonal): all variants of
6455 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6456 Eps operator is provided as well: "SOME x. P[x]";
6458 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6460 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6461 thus available for user theories;
6463 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6464 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6467 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6468 several times and then mp;
6473 * the notation <<...>> is now available as a notation for sequences of
6476 * the simplifier is now installed
6478 * the axiom system has been generalized (thanks to Soren Heilmann)
6480 * the classical reasoner now has a default rule database
6485 * new primrec section allows primitive recursive functions to be given
6486 directly (as in HOL) over datatypes and the natural numbers;
6488 * new tactics induct_tac and exhaust_tac for induction (or case
6489 analysis) over datatypes and the natural numbers;
6491 * the datatype declaration of type T now defines the recursor T_rec;
6493 * simplification automatically does freeness reasoning for datatype
6496 * automatic type-inference, with AddTCs command to insert new
6497 type-checking rules;
6499 * datatype introduction rules are now added as Safe Introduction rules
6502 * the syntax "if P then x else y" is now available in addition to
6506 *** Internal programming interfaces ***
6508 * tuned simplifier trace output; new flag debug_simp;
6510 * structures Vartab / Termtab (instances of TableFun) offer efficient
6511 tables indexed by indexname_ord / term_ord (compatible with aconv);
6513 * AxClass.axclass_tac lost the theory argument;
6515 * tuned current_goals_markers semantics: begin / end goal avoids
6516 printing empty lines;
6518 * removed prs and prs_fn hook, which was broken because it did not
6519 include \n in its semantics, forcing writeln to add one
6520 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6521 string -> unit if you really want to output text without newline;
6523 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6524 plain output, interface builders may have to enable 'isabelle_font'
6525 mode to get Isabelle font glyphs as before;
6527 * refined token_translation interface; INCOMPATIBILITY: output length
6528 now of type real instead of int;
6530 * theory loader actions may be traced via new ThyInfo.add_hook
6531 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6532 your own database of information attached to *whole* theories -- as
6533 opposed to intra-theory data slots offered via TheoryDataFun;
6535 * proper handling of dangling sort hypotheses (at last!);
6536 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6537 extra sort hypotheses that can be witnessed from the type signature;
6538 the force_strip_shyps flag is gone, any remaining shyps are simply
6539 left in the theorem (with a warning issued by strip_shyps_warning);
6543 New in Isabelle98-1 (October 1998)
6544 ----------------------------------
6546 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6548 * several changes of automated proof tools;
6550 * HOL: major changes to the inductive and datatype packages, including
6551 some minor incompatibilities of theory syntax;
6553 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6556 * HOL: removed duplicate thms in Arith:
6557 less_imp_add_less should be replaced by trans_less_add1
6558 le_imp_add_le should be replaced by trans_le_add1
6560 * HOL: unary minus is now overloaded (new type constraints may be
6563 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6564 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6565 now taken as an integer constant.
6567 * Pure: ML function 'theory_of' renamed to 'theory';
6573 1. Asm_full_simp_tac is now more aggressive.
6574 1. It will sometimes reorient premises if that increases their power to
6576 2. It does no longer proceed strictly from left to right but may also
6577 rotate premises to achieve further simplification.
6578 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6579 old Asm_full_simp_tac in that it does not rotate premises.
6580 2. The simplifier now knows a little bit about nat-arithmetic.
6582 * Classical reasoner: wrapper mechanism for the classical reasoner now
6583 allows for selected deletion of wrappers, by introduction of names for
6584 wrapper functionals. This implies that addbefore, addSbefore,
6585 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6586 and that adding two tactics with the same name overwrites the first
6587 one (emitting a warning).
6588 type wrapper = (int -> tactic) -> (int -> tactic)
6589 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6590 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6591 delWrapper, delSWrapper: claset * string -> claset
6592 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6594 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6595 semantics; addbefore now affects only the unsafe part of step_tac
6596 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6597 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6600 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6601 compWrapper; added safe wrapper (and access functions for it);
6603 * HOL/split_all_tac is now much faster and fails if there is nothing
6604 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6605 and the names of the automatically generated variables have changed.
6606 split_all_tac has moved within claset() from unsafe wrappers to safe
6607 wrappers, which means that !!-bound variables are split much more
6608 aggressively, and safe_tac and clarify_tac now split such variables.
6609 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6610 Note: the same holds for record_split_tac, which does the job of
6611 split_all_tac for record fields.
6613 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6614 permanently to the default simpset using Addsplits just like
6615 Addsimps. They can be removed via Delsplits just like
6616 Delsimps. Lower-case versions are also available.
6618 * HOL/Simplifier: The rule split_if is now part of the default
6619 simpset. This means that the simplifier will eliminate all occurrences
6620 of if-then-else in the conclusion of a goal. To prevent this, you can
6621 either remove split_if completely from the default simpset by
6622 `Delsplits [split_if]' or remove it in a specific call of the
6623 simplifier using `... delsplits [split_if]'. You can also add/delete
6624 other case splitting rules to/from the default simpset: every datatype
6625 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6626 t is the name of the datatype).
6628 * Classical reasoner / Simplifier combination: new force_tac (and
6629 derivatives Force_tac, force) combines rewriting and classical
6630 reasoning (and whatever other tools) similarly to auto_tac, but is
6631 aimed to solve the given subgoal completely.
6636 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6637 and `goalw': the theory is no longer needed as an explicit argument -
6638 the current theory context is used; assumptions are no longer returned
6639 at the ML-level unless one of them starts with ==> or !!; it is
6640 recommended to convert to these new commands using isatool fixgoal
6641 (backup your sources first!);
6643 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6644 the current theory context, and 'theory' to lookup stored theories;
6646 * new theory section 'locale' for declaring constants, assumptions and
6647 definitions that have local scope;
6649 * new theory section 'nonterminals' for purely syntactic types;
6651 * new theory section 'setup' for generic ML setup functions
6652 (e.g. package initialization);
6654 * the distribution now includes Isabelle icons: see
6655 lib/logo/isabelle-{small,tiny}.xpm;
6657 * isatool install - install binaries with absolute references to
6660 * isatool logo -- create instances of the Isabelle logo (as EPS);
6662 * print mode 'emacs' reserved for Isamode;
6664 * support multiple print (ast) translations per constant name;
6666 * theorems involving oracles are now printed with a suffixed [!];
6671 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6673 * HOL/inductive package reorganized and improved: now supports mutual
6679 oddI "n : EVEN ==> Suc n : ODD"
6680 evenI "n : ODD ==> Suc n : EVEN"
6682 new theorem list "elims" contains an elimination rule for each of the
6683 recursive sets; inductive definitions now handle disjunctive premises
6684 correctly (also ZF);
6686 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6687 "mutual_induct" no longer exists - the induction rule is always
6688 contained in "induct";
6691 * HOL/datatype package re-implemented and greatly improved: now
6692 supports mutually recursive datatypes such as
6695 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6696 | SUM ('a aexp) ('a aexp)
6697 | DIFF ('a aexp) ('a aexp)
6700 'a bexp = LESS ('a aexp) ('a aexp)
6701 | AND ('a bexp) ('a bexp)
6702 | OR ('a bexp) ('a bexp)
6704 as well as indirectly recursive datatypes such as
6707 ('a, 'b) term = Var 'a
6708 | App 'b ((('a, 'b) term) list)
6710 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6711 induction on mutually / indirectly recursive datatypes.
6713 Primrec equations are now stored in theory and can be accessed via
6714 <function_name>.simps.
6718 - Theories using datatypes must now have theory Datatype as an
6720 - The specific <typename>.induct_tac no longer exists - use the
6721 generic induct_tac instead.
6722 - natE has been renamed to nat.exhaust - use exhaust_tac
6723 instead of res_inst_tac ... natE. Note that the variable
6724 names in nat.exhaust differ from the names in natE, this
6725 may cause some "fragile" proofs to fail.
6726 - The theorems split_<typename>_case and split_<typename>_case_asm
6727 have been renamed to <typename>.split and <typename>.split_asm.
6728 - Since default sorts of type variables are now handled correctly,
6729 some datatype definitions may have to be annotated with explicit
6731 - Primrec definitions no longer require function name and type
6732 of recursive argument.
6734 Consider using isatool fixdatatype to adapt your theories and proof
6735 scripts to the new package (backup your sources first!).
6738 * HOL/record package: considerably improved implementation; now
6739 includes concrete syntax for record types, terms, updates; theorems
6740 for surjective pairing and splitting !!-bound record variables; proof
6741 support is as follows:
6743 1) standard conversions (selectors or updates applied to record
6744 constructor terms) are part of the standard simpset;
6746 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6747 made part of standard simpset and claset via addIffs;
6749 3) a tactic for record field splitting (record_split_tac) is part of
6750 the standard claset (addSWrapper);
6752 To get a better idea about these rules you may retrieve them via
6753 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6754 the name of your record type.
6756 The split tactic 3) conceptually simplifies by the following rule:
6758 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6760 Thus any record variable that is bound by meta-all will automatically
6761 blow up into some record constructor term, consequently the
6762 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6763 solve record problems automatically.
6766 * reorganized the main HOL image: HOL/Integ and String loaded by
6767 default; theory Main includes everything;
6769 * automatic simplification of integer sums and comparisons, using cancellation;
6771 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6773 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6775 * many new identities for unions, intersections, set difference, etc.;
6777 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6778 called split_if, split_split, split_sum_case and split_nat_case (to go
6779 with add/delsplits);
6781 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6782 (?x::unit) = (); this is made part of the default simpset, which COULD
6783 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6784 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6785 unit_abs_eta_conv is added in order to counter the effect of
6786 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6789 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6792 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6793 It and 'sym RS equals0D' are now in the default claset, giving automatic
6794 disjointness reasoning but breaking a few old proofs.
6796 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6797 to 'converse' from 'inverse' (for compatibility with ZF and some
6800 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6801 the well-founded relation;
6803 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6804 Compl A. The "Compl" syntax remains available as input syntax for this
6807 * HOL/Update: new theory of function updates:
6808 f(a:=b) == %x. if x=a then b else f x
6809 may also be iterated as in f(a:=b,c:=d,...);
6811 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6814 - new function list_update written xs[i:=v] that updates the i-th
6815 list position. May also be iterated as in xs[i:=a,j:=b,...].
6816 - new function `upt' written [i..j(] which generates the list
6817 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6818 bound write [i..j], which is a shorthand for [i..j+1(].
6819 - new lexicographic orderings and corresponding wellfoundedness theorems.
6822 - removed 'pred' (predecessor) function;
6823 - generalized some theorems about n-1;
6824 - many new laws about "div" and "mod";
6825 - new laws about greatest common divisors (see theory ex/Primes);
6827 * HOL/Relation: renamed the relational operator r^-1 "converse"
6828 instead of "inverse";
6830 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6831 of the multiset ordering;
6833 * directory HOL/Real: a construction of the reals using Dedekind cuts
6834 (not included by default);
6836 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6838 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6839 programs, i.e. different program variables may have different types.
6841 * calling (stac rew i) now fails if "rew" has no effect on the goal
6842 [previously, this check worked only if the rewrite rule was unconditional]
6843 Now rew can involve either definitions or equalities (either == or =).
6848 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6849 only the theorems proved on ZF.ML;
6851 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6852 It and 'sym RS equals0D' are now in the default claset, giving automatic
6853 disjointness reasoning but breaking a few old proofs.
6855 * ZF/Update: new theory of function updates
6856 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6857 may also be iterated as in f(a:=b,c:=d,...);
6859 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6861 * calling (stac rew i) now fails if "rew" has no effect on the goal
6862 [previously, this check worked only if the rewrite rule was unconditional]
6863 Now rew can involve either definitions or equalities (either == or =).
6865 * case_tac provided for compatibility with HOL
6866 (like the old excluded_middle_tac, but with subgoals swapped)
6869 *** Internal programming interfaces ***
6871 * Pure: several new basic modules made available for general use, see
6872 also src/Pure/README;
6874 * improved the theory data mechanism to support encapsulation (data
6875 kind name replaced by private Object.kind, acting as authorization
6876 key); new type-safe user interface via functor TheoryDataFun; generic
6877 print_data function becomes basically useless;
6879 * removed global_names compatibility flag -- all theory declarations
6880 are qualified by default;
6882 * module Pure/Syntax now offers quote / antiquote translation
6883 functions (useful for Hoare logic etc. with implicit dependencies);
6884 see HOL/ex/Antiquote for an example use;
6886 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6889 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6892 * Display.print_goals function moved to Locale.print_goals;
6894 * standard print function for goals supports current_goals_markers
6895 variable for marking begin of proof, end of proof, start of goal; the
6896 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6897 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6902 New in Isabelle98 (January 1998)
6903 --------------------------------
6905 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6907 * changed lexical syntax of terms / types: dots made part of long
6908 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6910 * simpset (and claset) reference variable replaced by functions
6911 simpset / simpset_ref;
6913 * no longer supports theory aliases (via merge) and non-trivial
6914 implicit merge of thms' signatures;
6916 * most internal names of constants changed due to qualified names;
6918 * changed Pure/Sequence interface (see Pure/seq.ML);
6921 *** General Changes ***
6923 * hierachically structured name spaces (for consts, types, axms, thms
6924 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6925 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6926 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6927 long_names for fully qualified output names; NOTE: ML programs
6928 (special tactics, packages etc.) referring to internal names may have
6929 to be adapted to cope with fully qualified names; in case of severe
6930 backward campatibility problems try setting 'global_names' at compile
6931 time to have enrything declared within a flat name space; one may also
6932 fine tune name declarations in theories via the 'global' and 'local'
6935 * reimplemented the implicit simpset and claset using the new anytype
6936 data filed in signatures; references simpset:simpset ref etc. are
6937 replaced by functions simpset:unit->simpset and
6938 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6939 to patch your ML files accordingly;
6941 * HTML output now includes theory graph data for display with Java
6942 applet or isatool browser; data generated automatically via isatool
6943 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6945 * defs may now be conditional; improved rewrite_goals_tac to handle
6946 conditional equations;
6948 * defs now admits additional type arguments, using TYPE('a) syntax;
6950 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6951 creates a new theory node; implicit merge of thms' signatures is
6952 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6953 transfer:theory->thm->thm in (rare) cases;
6955 * improved handling of draft signatures / theories; draft thms (and
6956 ctyps, cterms) are automatically promoted to real ones;
6958 * slightly changed interfaces for oracles: admit many per theory, named
6959 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6961 * print_goals: optional output of const types (set show_consts and
6964 * improved output of warnings (###) and errors (***);
6966 * subgoal_tac displays a warning if the new subgoal has type variables;
6968 * removed old README and Makefiles;
6970 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6972 * removed obsolete init_pps and init_database;
6974 * deleted the obsolete tactical STATE, which was declared by
6975 fun STATE tacfun st = tacfun st st;
6977 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6978 (which abbreviates $HOME);
6980 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6981 use isatool fixseq to adapt your ML programs (this works for fully
6982 qualified references to the Sequence structure only!);
6984 * use_thy no longer requires writable current directory; it always
6985 reloads .ML *and* .thy file, if either one is out of date;
6988 *** Classical Reasoner ***
6990 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6991 tactics that use classical reasoning to simplify a subgoal without
6992 splitting it into several subgoals;
6994 * Safe_tac: like safe_tac but uses the default claset;
6999 * added simplification meta rules:
7000 (asm_)(full_)simplify: simpset -> thm -> thm;
7002 * simplifier.ML no longer part of Pure -- has to be loaded by object
7005 * added prems argument to simplification procedures;
7007 * HOL, FOL, ZF: added infix function `addsplits':
7008 instead of `<simpset> setloop (split_tac <thms>)'
7009 you can simply write `<simpset> addsplits <thms>'
7014 * TYPE('a) syntax for type reflection terms;
7016 * no longer handles consts with name "" -- declare as 'syntax' instead;
7018 * pretty printer: changed order of mixfix annotation preference (again!);
7020 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7025 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7026 with `addloop' of the simplifier to faciliate case splitting in premises.
7028 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7030 * HOL/Auth: new protocol proofs including some for the Internet
7033 * HOL/Map: new theory of `maps' a la VDM;
7035 * HOL/simplifier: simplification procedures nat_cancel_sums for
7036 cancelling out common nat summands from =, <, <= (in)equalities, or
7037 differences; simplification procedures nat_cancel_factor for
7038 cancelling common factor from =, <, <= (in)equalities over natural
7039 sums; nat_cancel contains both kinds of procedures, it is installed by
7040 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7042 * HOL/simplifier: terms of the form
7043 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7045 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7046 and those of the form
7047 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7049 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7052 Each datatype `t' now comes with a theorem `split_t_case' of the form
7054 P(t_case f1 ... fn x) =
7055 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7057 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7060 and a theorem `split_t_case_asm' of the form
7062 P(t_case f1 ... fn x) =
7063 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7065 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7067 which can be added to a simpset via `addsplits'. The existing theorems
7068 expand_list_case and expand_option_case have been renamed to
7069 split_list_case and split_option_case.
7072 - `pred n' is automatically converted to `n-1'.
7073 Users are strongly encouraged not to use `pred' any longer,
7074 because it will disappear altogether at some point.
7075 - Users are strongly encouraged to write "0 < n" rather than
7076 "n ~= 0". Theorems and proof tools have been modified towards this
7080 the function "set_of_list" has been renamed "set" (and its theorems too);
7081 the function "nth" now takes its arguments in the reverse order and
7082 has acquired the infix notation "!" as in "xs!n".
7084 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7086 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7087 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7089 * HOL/record: extensible records with schematic structural subtyping
7090 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7091 still lacks various theorems and concrete record syntax;
7096 * removed "axioms" and "generated by" sections;
7098 * replaced "ops" section by extended "consts" section, which is capable of
7099 handling the continuous function space "->" directly;
7102 . proves theorems immediately and stores them in the theory,
7103 . creates hierachical name space,
7104 . now uses normal mixfix annotations (instead of cinfix...),
7105 . minor changes to some names and values (for consistency),
7106 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7107 . separator between mutual domain defs: changed "," to "and",
7108 . improved handling of sort constraints; now they have to
7109 appear on the left-hand side of the equations only;
7111 * fixed LAM <x,y,zs>.b syntax;
7113 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7114 adm (%x. P (t x)), where P is chainfinite and t continuous;
7119 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7120 with `addloop' of the simplifier to faciliate case splitting in premises.
7122 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7123 in HOL, they strip ALL and --> from proved theorems;
7127 New in Isabelle94-8 (May 1997)
7128 ------------------------------
7130 *** General Changes ***
7132 * new utilities to build / run / maintain Isabelle etc. (in parts
7133 still somewhat experimental); old Makefiles etc. still functional;
7135 * new 'Isabelle System Manual';
7137 * INSTALL text, together with ./configure and ./build scripts;
7139 * reimplemented type inference for greater efficiency, better error
7140 messages and clean internal interface;
7142 * prlim command for dealing with lots of subgoals (an easier way of
7143 setting goals_limit);
7148 * supports alternative (named) syntax tables (parser and pretty
7149 printer); internal interface is provided by add_modesyntax(_i);
7151 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7152 be used in conjunction with the Isabelle symbol font; uses the
7153 "symbols" syntax table;
7155 * added token_translation interface (may translate name tokens in
7156 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7157 the current print_mode); IMPORTANT: user print translation functions
7158 are responsible for marking newly introduced bounds
7159 (Syntax.mark_boundT);
7161 * token translations for modes "xterm" and "xterm_color" that display
7162 names in bold, underline etc. or colors (which requires a color
7165 * infixes may now be declared with names independent of their syntax;
7167 * added typed_print_translation (like print_translation, but may
7168 access type of constant);
7171 *** Classical Reasoner ***
7173 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7174 some limitations. Blast_tac...
7175 + ignores addss, addbefore, addafter; this restriction is intrinsic
7176 + ignores elimination rules that don't have the correct format
7177 (the conclusion MUST be a formula variable)
7178 + ignores types, which can make HOL proofs fail
7179 + rules must not require higher-order unification, e.g. apply_type in ZF
7180 [message "Function Var's argument not a bound variable" relates to this]
7181 + its proof strategy is more general but can actually be slower
7183 * substitution with equality assumptions no longer permutes other
7186 * minor changes in semantics of addafter (now called addaltern); renamed
7187 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7188 (and access functions for it);
7190 * improved combination of classical reasoner and simplifier:
7191 + functions for handling clasimpsets
7192 + improvement of addss: now the simplifier is called _after_ the
7194 + safe variant of addss called addSss: uses safe simplifications
7195 _during_ the safe steps. It is more complete as it allows multiple
7196 instantiations of unknowns (e.g. with slow_tac).
7200 * added interface for simplification procedures (functions that
7201 produce *proven* rewrite rules on the fly, depending on current
7204 * ordering on terms as parameter (used for ordered rewriting);
7206 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7208 * the solver is now split into a safe and an unsafe part.
7209 This should be invisible for the normal user, except that the
7210 functions setsolver and addsolver have been renamed to setSolver and
7211 addSolver; added safe_asm_full_simp_tac;
7216 * a generic induction tactic `induct_tac' which works for all datatypes and
7217 also for type `nat';
7219 * a generic case distinction tactic `exhaust_tac' which works for all
7220 datatypes and also for type `nat';
7222 * each datatype comes with a function `size';
7224 * patterns in case expressions allow tuple patterns as arguments to
7225 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7227 * primrec now also works with type nat;
7229 * recdef: a new declaration form, allows general recursive functions to be
7230 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7232 * the constant for negation has been renamed from "not" to "Not" to
7233 harmonize with FOL, ZF, LK, etc.;
7235 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7238 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7240 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7241 problems in commutative rings, using axiomatic type classes for + and *;
7243 * more examples in HOL/MiniML and HOL/Auth;
7245 * more default rewrite rules for quantifiers, union/intersection;
7247 * a new constant `arbitrary == @x.False';
7249 * HOLCF/IOA replaces old HOL/IOA;
7251 * HOLCF changes: derived all rules and arities
7252 + axiomatic type classes instead of classes
7253 + typedef instead of faking type definitions
7254 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7255 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7256 + eliminated the types void, one, tr
7257 + use unit lift and bool lift (with translations) instead of one and tr
7258 + eliminated blift from Lift3.thy (use Def instead of blift)
7259 all eliminated rules are derived as theorems --> no visible changes ;
7264 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7265 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7266 as ZF_cs addSIs [equalityI];
7270 New in Isabelle94-7 (November 96)
7271 ---------------------------------
7273 * allowing negative levels (as offsets) in prlev and choplev;
7275 * super-linear speedup for large simplifications;
7277 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7278 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7279 FAIL); can suppress it using the command Delsimps (ex_simps @
7280 all_simps); De Morgan laws are also now included, by default;
7282 * improved printing of ==> : ~:
7284 * new object-logic "Sequents" adds linear logic, while replacing LK
7285 and Modal (thanks to Sara Kalvala);
7287 * HOL/Auth: correctness proofs for authentication protocols;
7289 * HOL: new auto_tac combines rewriting and classical reasoning (many
7290 examples on HOL/Auth);
7292 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7293 the rewriter and classical reasoner simultaneously;
7295 * function uresult no longer returns theorems in "standard" format;
7296 regain previous version by: val uresult = standard o uresult;
7303 * oracles -- these establish an interface between Isabelle and trusted
7304 external reasoners, which may deliver results as theorems;
7306 * proof objects (in particular record all uses of oracles);
7308 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7310 * "constdefs" section in theory files;
7312 * "primrec" section (HOL) no longer requires names;
7314 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7321 * reduced space requirements;
7323 * automatic HTML generation from theories;
7325 * theory files no longer require "..." (quotes) around most types;
7327 * new examples, including two proofs of the Church-Rosser theorem;
7329 * non-curried (1994) version of HOL is no longer distributed;
7336 * greatly reduced space requirements;
7338 * theory files (.thy) no longer require \...\ escapes at line breaks;
7340 * searchable theorem database (see the section "Retrieving theorems" on
7341 page 8 of the Reference Manual);
7343 * new examples, including Grabczewski's monumental case study of the
7346 * The previous version of HOL renamed to Old_HOL;
7348 * The new version of HOL (previously called CHOL) uses a curried syntax
7349 for functions. Application looks like f a b instead of f(a,b);
7351 * Mutually recursive inductive definitions finally work in HOL;
7353 * In ZF, pattern-matching on tuples is now available in all abstractions and
7354 translates to the operator "split";
7361 * new infix operator, addss, allowing the classical reasoner to
7362 perform simplification at each step of its search. Example:
7363 fast_tac (cs addss ss)
7365 * a new logic, CHOL, the same as HOL, but with a curried syntax
7366 for functions. Application looks like f a b instead of f(a,b). Also pairs
7367 look like (a,b) instead of <a,b>;
7369 * PLEASE NOTE: CHOL will eventually replace HOL!
7371 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7372 It translates to the operator "split". A new theory of integers is available;
7374 * In ZF, integer numerals now denote two's-complement binary integers.
7375 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7377 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7378 of the Axiom of Choice;
7385 * Significantly faster resolution;
7387 * the different sections in a .thy file can now be mixed and repeated
7390 * Database of theorems for FOL, HOL and ZF. New
7391 commands including qed, qed_goal and bind_thm store theorems in the database.
7393 * Simple database queries: return a named theorem (get_thm) or all theorems of
7394 a given theory (thms_of), or find out what theory a theorem was proved in
7397 * Bugs fixed in the inductive definition and datatype packages;
7399 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7400 and HOL_dup_cs obsolete;
7402 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7405 * Simpler definition of function space in ZF;
7407 * new results about cardinal and ordinal arithmetic in ZF;
7409 * 'subtype' facility in HOL for introducing new types as subsets of existing
7412 :mode=text:wrap=hard:maxLineLen=72: