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.
20 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
21 respectively. INCOMPATIBILITY.
23 * Constant "split" has been merged with constant "prod_case"; names
24 of ML functions, facts etc. involving split have been retained so far,
25 though. INCOMPATIBILITY.
27 * Dropped old infix syntax "mem" for List.member; use "in set"
28 instead. INCOMPATIBILITY.
30 * Refactoring of code-generation specific operations in List.thy
37 null_empty ~> null_def
39 INCOMPATIBILITY. Note that these were not suppossed to be used
40 regularly unless for striking reasons; their main purpose was code
43 * Some previously unqualified names have been qualified:
52 Pair ~> Product_Type.Pair
53 fst ~> Product_Type.fst
54 snd ~> Product_Type.snd
55 curry ~> Product_Type.curry
57 Collect ~> Set.Collect
61 * Removed simplifier congruence rule of "prod_case", as has for long
62 been the case with "split".
64 * Datatype package: theorems generated for executable equality
65 (class eq) carry proper names and are treated as default code
68 * List.thy: use various operations from the Haskell prelude when
69 generating Haskell code.
71 * code_simp.ML: simplification with rules determined by
74 * code generator: do not print function definitions for case
75 combinators any longer.
77 * Multivariate Analysis: Introduced a type class for euclidean space. Most
78 theorems are now stated in terms of euclidean spaces instead of finite
82 real ^ 'n ~> 'a::real_vector
83 ~> 'a::euclidean_space
84 ~> 'a::ordered_euclidean_space
85 (depends on your needs)
89 \<chi> x. _ ~> \<chi>\<chi> x. _
92 Also note that the indices are now natural numbers and not from some finite
93 type. Finite cartesian products of euclidean spaces, products of euclidean
94 spaces the real and complex numbers are instantiated to be euclidean_spaces.
99 New in Isabelle2009-2 (June 2010)
100 ---------------------------------
104 * Authentic syntax for *all* logical entities (type classes, type
105 constructors, term constants): provides simple and robust
106 correspondence between formal entities and concrete syntax. Within
107 the parse tree / AST representations, "constants" are decorated by
108 their category (class, type, const) and spelled out explicitly with
109 their full internal name.
111 Substantial INCOMPATIBILITY concerning low-level syntax declarations
112 and translations (translation rules and translation functions in ML).
113 Some hints on upgrading:
115 - Many existing uses of 'syntax' and 'translations' can be replaced
116 by more modern 'type_notation', 'notation' and 'abbreviation',
117 which are independent of this issue.
119 - 'translations' require markup within the AST; the term syntax
120 provides the following special forms:
122 CONST c -- produces syntax version of constant c from context
123 XCONST c -- literally c, checked as constant from context
124 c -- literally c, if declared by 'syntax'
126 Plain identifiers are treated as AST variables -- occasionally the
127 system indicates accidental variables via the error "rhs contains
130 Type classes and type constructors are marked according to their
131 concrete syntax. Some old translations rules need to be written
132 for the "type" category, using type constructor application
133 instead of pseudo-term application of the default category
136 - 'parse_translation' etc. in ML may use the following
139 @{class_syntax c} -- type class c within parse tree / AST
140 @{term_syntax c} -- type constructor c within parse tree / AST
141 @{const_syntax c} -- ML version of "CONST c" above
142 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
144 - Literal types within 'typed_print_translations', i.e. those *not*
145 represented as pseudo-terms are represented verbatim. Use @{class
146 c} or @{type_name c} here instead of the above syntax
149 Note that old non-authentic syntax was based on unqualified base
150 names, so all of the above "constant" names would coincide. Recall
151 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
152 diagnose syntax problems.
154 * Type constructors admit general mixfix syntax, not just infix.
156 * Concrete syntax may be attached to local entities without a proof
157 body, too. This works via regular mixfix annotations for 'fix',
158 'def', 'obtain' etc. or via the explicit 'write' command, which is
159 similar to the 'notation' command in theory specifications.
161 * Discontinued unnamed infix syntax (legacy feature for many years) --
162 need to specify constant name and syntax separately. Internal ML
163 datatype constructors have been renamed from InfixName to Infix etc.
164 Minor INCOMPATIBILITY.
166 * Schematic theorem statements need to be explicitly markup as such,
167 via commands 'schematic_lemma', 'schematic_theorem',
168 'schematic_corollary'. Thus the relevance of the proof is made
169 syntactically clear, which impacts performance in a parallel or
170 asynchronous interactive environment. Minor INCOMPATIBILITY.
172 * Use of cumulative prems via "!" in some proof methods has been
173 discontinued (old legacy feature).
175 * References 'trace_simp' and 'debug_simp' have been replaced by
176 configuration options stored in the context. Enabling tracing (the
177 case of debugging is similar) in proofs works via
179 using [[trace_simp = true]]
181 Tracing is then active for all invocations of the simplifier in
182 subsequent goal refinement steps. Tracing may also still be enabled or
183 disabled via the ProofGeneral settings menu.
185 * Separate commands 'hide_class', 'hide_type', 'hide_const',
186 'hide_fact' replace the former 'hide' KIND command. Minor
189 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
190 more efficient than combinations with -q1 or -q2.
195 * Proofterms record type-class reasoning explicitly, using the
196 "unconstrain" operation internally. This eliminates all sort
197 constraints from a theorem and proof, introducing explicit
198 OFCLASS-premises. On the proof term level, this operation is
199 automatically applied at theorem boundaries, such that closed proofs
200 are always free of sort constraints. INCOMPATIBILITY for tools that
203 * Local theory specifications may depend on extra type variables that
204 are not present in the result type -- arguments TYPE('a) :: 'a itself
205 are added internally. For example:
207 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
209 * Predicates of locales introduced by classes carry a mandatory
210 "class" prefix. INCOMPATIBILITY.
212 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
214 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
217 * Command 'code_reflect' allows to incorporate generated ML code into
218 runtime environment; replaces immature code_datatype antiquotation.
221 * Code generator: simple concept for abstract datatypes obeying
224 * Code generator: details of internal data cache have no impact on the
225 user space functionality any longer.
227 * Methods "unfold_locales" and "intro_locales" ignore non-locale
228 subgoals. This is more appropriate for interpretations with 'where'.
231 * Command 'example_proof' opens an empty proof body. This allows to
232 experiment with Isar, without producing any persistent result.
234 * Commands 'type_notation' and 'no_type_notation' declare type syntax
235 within a local theory context, with explicit checking of the
236 constructors involved (in contrast to the raw 'syntax' versions).
238 * Commands 'types' and 'typedecl' now work within a local theory
239 context -- without introducing dependencies on parameters or
240 assumptions, which is not possible in Isabelle/Pure.
242 * Command 'defaultsort' has been renamed to 'default_sort', it works
243 within a local theory context. Minor INCOMPATIBILITY.
248 * Command 'typedef' now works within a local theory context -- without
249 introducing dependencies on parameters or assumptions, which is not
250 possible in Isabelle/Pure/HOL. Note that the logical environment may
251 contain multiple interpretations of local typedefs (with different
252 non-emptiness proofs), even in a global theory context.
254 * New package for quotient types. Commands 'quotient_type' and
255 'quotient_definition' may be used for defining types and constants by
256 quotient constructions. An example is the type of integers created by
257 quotienting pairs of natural numbers:
260 intrel :: "(nat * nat) => (nat * nat) => bool"
262 "intrel (x, y) (u, v) = (x + v = u + y)"
264 quotient_type int = "nat * nat" / intrel
265 by (auto simp add: equivp_def expand_fun_eq)
268 "0::int" is "(0::nat, 0::nat)"
270 The method "lifting" can be used to lift of theorems from the
271 underlying "raw" type to the quotient type. The example
272 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
273 construction and provides a reasoning infrastructure for finite sets.
275 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
276 clash with new theory Quotient in Main HOL.
278 * Moved the SMT binding into the main HOL session, eliminating
279 separate HOL-SMT session.
281 * List membership infix mem operation is only an input abbreviation.
284 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
285 for future developements; former Library/Word.thy is still present in
286 the AFP entry RSAPPS.
288 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
289 longer shadowed. INCOMPATIBILITY.
291 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
294 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
297 * Dropped normalizing_semiring etc; use the facts in semiring classes
298 instead. INCOMPATIBILITY.
300 * Dropped several real-specific versions of lemmas about floor and
301 ceiling; use the generic lemmas from theory "Archimedean_Field"
302 instead. INCOMPATIBILITY.
304 floor_number_of_eq ~> floor_number_of
305 le_floor_eq_number_of ~> number_of_le_floor
306 le_floor_eq_zero ~> zero_le_floor
307 le_floor_eq_one ~> one_le_floor
308 floor_less_eq_number_of ~> floor_less_number_of
309 floor_less_eq_zero ~> floor_less_zero
310 floor_less_eq_one ~> floor_less_one
311 less_floor_eq_number_of ~> number_of_less_floor
312 less_floor_eq_zero ~> zero_less_floor
313 less_floor_eq_one ~> one_less_floor
314 floor_le_eq_number_of ~> floor_le_number_of
315 floor_le_eq_zero ~> floor_le_zero
316 floor_le_eq_one ~> floor_le_one
317 floor_subtract_number_of ~> floor_diff_number_of
318 floor_subtract_one ~> floor_diff_one
319 ceiling_number_of_eq ~> ceiling_number_of
320 ceiling_le_eq_number_of ~> ceiling_le_number_of
321 ceiling_le_zero_eq ~> ceiling_le_zero
322 ceiling_le_eq_one ~> ceiling_le_one
323 less_ceiling_eq_number_of ~> number_of_less_ceiling
324 less_ceiling_eq_zero ~> zero_less_ceiling
325 less_ceiling_eq_one ~> one_less_ceiling
326 ceiling_less_eq_number_of ~> ceiling_less_number_of
327 ceiling_less_eq_zero ~> ceiling_less_zero
328 ceiling_less_eq_one ~> ceiling_less_one
329 le_ceiling_eq_number_of ~> number_of_le_ceiling
330 le_ceiling_eq_zero ~> zero_le_ceiling
331 le_ceiling_eq_one ~> one_le_ceiling
332 ceiling_subtract_number_of ~> ceiling_diff_number_of
333 ceiling_subtract_one ~> ceiling_diff_one
335 * Theory "Finite_Set": various folding_XXX locales facilitate the
336 application of the various fold combinators on finite sets.
338 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
339 provides abstract red-black tree type which is backed by "RBT_Impl" as
340 implementation. INCOMPATIBILTY.
342 * Theory Library/Coinductive_List has been removed -- superseded by
343 AFP/thys/Coinductive.
345 * Theory PReal, including the type "preal" and related operations, has
346 been removed. INCOMPATIBILITY.
348 * Real: new development using Cauchy Sequences.
350 * Split off theory "Big_Operators" containing setsum, setprod,
351 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
353 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
354 "Int" etc. INCOMPATIBILITY.
356 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
358 * New set of rules "ac_simps" provides combined assoc / commute
359 rewrites for all interpretations of the appropriate generic locales.
361 * Renamed theory "OrderedGroup" to "Groups" and split theory
362 "Ring_and_Field" into theories "Rings" and "Fields"; for more
363 appropriate and more consistent names suitable for name prefixes
364 within the HOL theories. INCOMPATIBILITY.
366 * Some generic constants have been put to appropriate theories:
367 - less_eq, less: Orderings
368 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
369 - inverse, divide: Rings
372 * More consistent naming of type classes involving orderings (and
375 lower_semilattice ~> semilattice_inf
376 upper_semilattice ~> semilattice_sup
378 dense_linear_order ~> dense_linorder
380 pordered_ab_group_add ~> ordered_ab_group_add
381 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
382 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
383 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
384 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
385 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
386 pordered_cancel_semiring ~> ordered_cancel_semiring
387 pordered_comm_monoid_add ~> ordered_comm_monoid_add
388 pordered_comm_ring ~> ordered_comm_ring
389 pordered_comm_semiring ~> ordered_comm_semiring
390 pordered_ring ~> ordered_ring
391 pordered_ring_abs ~> ordered_ring_abs
392 pordered_semiring ~> ordered_semiring
394 ordered_ab_group_add ~> linordered_ab_group_add
395 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
396 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
397 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
398 ordered_field ~> linordered_field
399 ordered_field_no_lb ~> linordered_field_no_lb
400 ordered_field_no_ub ~> linordered_field_no_ub
401 ordered_field_dense_linear_order ~> dense_linordered_field
402 ordered_idom ~> linordered_idom
403 ordered_ring ~> linordered_ring
404 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
405 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
406 ordered_ring_strict ~> linordered_ring_strict
407 ordered_semidom ~> linordered_semidom
408 ordered_semiring ~> linordered_semiring
409 ordered_semiring_1 ~> linordered_semiring_1
410 ordered_semiring_1_strict ~> linordered_semiring_1_strict
411 ordered_semiring_strict ~> linordered_semiring_strict
413 The following slightly odd type classes have been moved to a
414 separate theory Library/Lattice_Algebras:
416 lordered_ab_group_add ~> lattice_ab_group_add
417 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
418 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
419 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
420 lordered_ring ~> lattice_ring
424 * Refined field classes:
425 - classes division_ring_inverse_zero, field_inverse_zero,
426 linordered_field_inverse_zero include rule inverse 0 = 0 --
427 subsumes former division_by_zero class;
428 - numerous lemmas have been ported from field to division_ring.
431 * Refined algebra theorem collections:
432 - dropped theorem group group_simps, use algebra_simps instead;
433 - dropped theorem group ring_simps, use field_simps instead;
434 - proper theorem collection field_simps subsumes former theorem
435 groups field_eq_simps and field_simps;
436 - dropped lemma eq_minus_self_iff which is a duplicate for
440 * Theory Finite_Set and List: some lemmas have been generalized from
443 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
444 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
445 inter_Inter_fold_inter ~> inf_Inf_fold_inf
446 union_Union_fold_union ~> sup_Sup_fold_sup
447 Inter_fold_inter ~> Inf_fold_inf
448 Union_fold_union ~> Sup_fold_sup
449 inter_INTER_fold_inter ~> inf_INFI_fold_inf
450 union_UNION_fold_union ~> sup_SUPR_fold_sup
451 INTER_fold_inter ~> INFI_fold_inf
452 UNION_fold_union ~> SUPR_fold_sup
454 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
455 replaced by the more convenient lemmas Inf_empty and Sup_empty.
456 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
457 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
458 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
459 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
461 * Reorganized theory Multiset: swapped notation of pointwise and
464 - pointwise ordering is instance of class order with standard syntax
466 - multiset ordering has syntax <=# and <#; partial order properties
467 are provided by means of interpretation with prefix
469 - less duplication, less historical organization of sections,
470 conversion from associations lists to multisets, rudimentary code
472 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
477 multiset_eq_conv_count_eq ~> multiset_ext_iff
478 multi_count_ext ~> multiset_ext
479 diff_union_inverse2 ~> diff_union_cancelR
483 * Theory Permutation: replaced local "remove" by List.remove1.
485 * Code generation: ML and OCaml code is decorated with signatures.
487 * Theory List: added transpose.
489 * Library/Nat_Bijection.thy is a collection of bijective functions
490 between nat and other types, which supersedes the older libraries
491 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
494 Nat_Int_Bij.nat2_to_nat ~> prod_encode
495 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
496 Nat_Int_Bij.int_to_nat_bij ~> int_encode
497 Nat_Int_Bij.nat_to_int_bij ~> int_decode
498 Countable.pair_encode ~> prod_encode
499 NatIso.prod2nat ~> prod_encode
500 NatIso.nat2prod ~> prod_decode
501 NatIso.sum2nat ~> sum_encode
502 NatIso.nat2sum ~> sum_decode
503 NatIso.list2nat ~> list_encode
504 NatIso.nat2list ~> list_decode
505 NatIso.set2nat ~> set_encode
506 NatIso.nat2set ~> set_decode
509 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
510 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
511 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
512 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
513 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
514 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
515 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
516 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
517 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
518 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
519 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
520 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
521 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
524 - Renamed ATP commands:
525 atp_info ~> sledgehammer running_atps
526 atp_kill ~> sledgehammer kill_atps
527 atp_messages ~> sledgehammer messages
528 atp_minimize ~> sledgehammer minimize
529 print_atps ~> sledgehammer available_atps
531 - Added user's manual ("isabelle doc sledgehammer").
532 - Added option syntax and "sledgehammer_params" to customize
533 Sledgehammer's behavior. See the manual for details.
534 - Modified the Isar proof reconstruction code so that it produces
535 direct proofs rather than proofs by contradiction. (This feature
536 is still experimental.)
537 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
539 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
542 - Added and implemented "binary_ints" and "bits" options.
543 - Added "std" option and implemented support for nonstandard models.
544 - Added and implemented "finitize" option to improve the precision
545 of infinite datatypes based on a monotonicity analysis.
546 - Added support for quotient types.
547 - Added support for "specification" and "ax_specification"
549 - Added support for local definitions (for "function" and
550 "termination" proofs).
551 - Added support for term postprocessors.
552 - Optimized "Multiset.multiset" and "FinFun.finfun".
553 - Improved efficiency of "destroy_constrs" optimization.
554 - Fixed soundness bugs related to "destroy_constrs" optimization and
556 - Fixed soundness bug related to higher-order constructors.
557 - Fixed soundness bug when "full_descrs" is enabled.
558 - Improved precision of set constructs.
559 - Added "atoms" option.
560 - Added cache to speed up repeated Kodkod invocations on the same
562 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
563 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
564 "SAT4J_Light". INCOMPATIBILITY.
565 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
566 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
567 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
569 * Method "induct" now takes instantiations of the form t, where t is not
570 a variable, as a shorthand for "x == t", where x is a fresh variable.
571 If this is not intended, t has to be enclosed in parentheses.
572 By default, the equalities generated by definitional instantiations
573 are pre-simplified, which may cause parameters of inductive cases
574 to disappear, or may even delete some of the inductive cases.
575 Use "induct (no_simp)" instead of "induct" to restore the old
576 behaviour. The (no_simp) option is also understood by the "cases"
577 and "nominal_induct" methods, which now perform pre-simplification, too.
583 * Variable names in lemmas generated by the domain package have
584 changed; the naming scheme is now consistent with the HOL datatype
585 package. Some proof scripts may be affected, INCOMPATIBILITY.
587 * The domain package no longer defines the function "foo_copy" for
588 recursive domain "foo". The reach lemma is now stated directly in
589 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
590 be reformulated in terms of "foo_take", INCOMPATIBILITY.
592 * Most definedness lemmas generated by the domain package (previously
593 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
594 like "foo$x = UU <-> x = UU", which works better as a simp rule.
595 Proofs that used definedness lemmas as intro rules may break,
596 potential INCOMPATIBILITY.
598 * Induction and casedist rules generated by the domain package now
599 declare proper case_names (one called "bottom", and one named for each
600 constructor). INCOMPATIBILITY.
602 * For mutually-recursive domains, separate "reach" and "take_lemma"
603 rules are generated for each domain, INCOMPATIBILITY.
605 foo_bar.reach ~> foo.reach bar.reach
606 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
608 * Some lemmas generated by the domain package have been renamed for
609 consistency with the datatype package, INCOMPATIBILITY.
611 foo.ind ~> foo.induct
612 foo.finite_ind ~> foo.finite_induct
613 foo.coind ~> foo.coinduct
614 foo.casedist ~> foo.exhaust
615 foo.exhaust ~> foo.nchotomy
617 * For consistency with other definition packages, the fixrec package
618 now generates qualified theorem names, INCOMPATIBILITY.
620 foo_simps ~> foo.simps
621 foo_unfold ~> foo.unfold
622 foo_induct ~> foo.induct
624 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
625 method and internal fixrec proofs now use the default simpset instead.
628 * The "contlub" predicate has been removed. Proof scripts should use
629 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
631 * The "admw" predicate has been removed, INCOMPATIBILITY.
633 * The constants cpair, cfst, and csnd have been removed in favor of
634 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
639 * Antiquotations for basic formal entities:
641 @{class NAME} -- type class
642 @{class_syntax NAME} -- syntax representation of the above
644 @{type_name NAME} -- logical type
645 @{type_abbrev NAME} -- type abbreviation
646 @{nonterminal NAME} -- type of concrete syntactic category
647 @{type_syntax NAME} -- syntax representation of any of the above
649 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
650 @{const_abbrev NAME} -- abbreviated constant
651 @{const_syntax NAME} -- syntax representation of any of the above
653 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
654 syntax constant (cf. 'syntax' command).
656 * Antiquotation @{make_string} inlines a function to print arbitrary
657 values similar to the ML toplevel. The result is compiler dependent
658 and may fall back on "?" in certain situations.
660 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
661 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
662 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
663 not work with the asynchronous Isar document model.
665 * Configuration options now admit dynamic default values, depending on
666 the context or even global references.
668 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
669 uses an efficient external library if available (for Poly/ML).
671 * Renamed some important ML structures, while keeping the old names
672 for some time as aliases within the structure Legacy:
674 OuterKeyword ~> Keyword
677 OuterSyntax ~> Outer_Syntax
678 PrintMode ~> Print_Mode
679 SpecParse ~> Parse_Spec
682 ThyOutput ~> Thy_Output
683 TypeInfer ~> Type_Infer
685 Note that "open Legacy" simplifies porting of sources, but forgetting
686 to remove it again will complicate porting again in the future.
688 * Most operations that refer to a global context are named
689 accordingly, e.g. Simplifier.global_context or
690 ProofContext.init_global. There are some situations where a global
691 context actually works, but under normal circumstances one needs to
692 pass the proper local context through the code!
694 * Discontinued old TheoryDataFun with its copy/init operation -- data
695 needs to be pure. Functor Theory_Data_PP retains the traditional
696 Pretty.pp argument to merge, which is absent in the standard
699 * Sorts.certify_sort and derived "cert" operations for types and terms
700 no longer minimize sorts. Thus certification at the boundary of the
701 inference kernel becomes invariant under addition of class relations,
702 which is an important monotonicity principle. Sorts are now minimized
703 in the syntax layer only, at the boundary between the end-user and the
704 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
705 explicitly in rare situations.
707 * Renamed old-style Drule.standard to Drule.export_without_context, to
708 emphasize that this is in no way a standard operation.
711 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
712 usual for resolution. Rare INCOMPATIBILITY.
714 * Renamed varify/unvarify operations to varify_global/unvarify_global
715 to emphasize that these only work in a global situation (which is
718 * Curried take and drop in library.ML; negative length is interpreted
719 as infinity (as in chop). Subtle INCOMPATIBILITY.
721 * Proof terms: type substitutions on proof constants now use canonical
722 order of type variables. INCOMPATIBILITY for tools working with proof
725 * Raw axioms/defs may no longer carry sort constraints, and raw defs
726 may no longer carry premises. User-level specifications are
727 transformed accordingly by Thm.add_axiom/add_def.
732 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
733 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
734 proof terms are enabled unconditionally in the new HOL-Proofs image.
736 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
737 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
740 * Old lib/scripts/polyml-platform is superseded by the
741 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
742 variant, even on a 64 bit machine. The following example setting
743 prefers 64 bit if available:
745 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
747 * The preliminary Isabelle/jEdit application demonstrates the emerging
748 Isabelle/Scala layer for advanced prover interaction and integration.
749 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
752 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
753 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
754 similar to the default assignment of the document preparation system
755 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
756 provides some operations for direct access to the font without asking
757 the user for manual installation.
761 New in Isabelle2009-1 (December 2009)
762 -------------------------------------
766 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
767 one backslash should be used, even in ML sources.
772 * Locale interpretation propagates mixins along the locale hierarchy.
773 The currently only available mixins are the equations used to map
774 local definitions to terms of the target domain of an interpretation.
776 * Reactivated diagnostic command 'print_interps'. Use "print_interps
777 loc" to print all interpretations of locale "loc" in the theory.
778 Interpretations in proofs are not shown.
780 * Thoroughly revised locales tutorial. New section on conditional
783 * On instantiation of classes, remaining undefined class parameters
784 are formally declared. INCOMPATIBILITY.
787 *** Document preparation ***
789 * New generalized style concept for printing terms: @{foo (style) ...}
790 instead of @{foo_style style ...} (old form is still retained for
791 backward compatibility). Styles can be also applied for
792 antiquotations prop, term_type and typeof.
797 * New proof method "smt" for a combination of first-order logic with
798 equality, linear and nonlinear (natural/integer/real) arithmetic, and
799 fixed-size bitvectors; there is also basic support for higher-order
800 features (esp. lambda abstractions). It is an incomplete decision
801 procedure based on external SMT solvers using the oracle mechanism;
802 for the SMT solver Z3, this method is proof-producing. Certificates
803 are provided to avoid calling the external solvers solely for
804 re-checking proofs. Due to a remote SMT service there is no need for
805 installing SMT solvers locally. See src/HOL/SMT.
807 * New commands to load and prove verification conditions generated by
808 the Boogie program verifier or derived systems (e.g. the Verifying C
809 Compiler (VCC) or Spec#). See src/HOL/Boogie.
811 * New counterexample generator tool 'nitpick' based on the Kodkod
812 relational model finder. See src/HOL/Tools/Nitpick and
813 src/HOL/Nitpick_Examples.
815 * New commands 'code_pred' and 'values' to invoke the predicate
816 compiler and to enumerate values of inductive predicates.
818 * A tabled implementation of the reflexive transitive closure.
820 * New implementation of quickcheck uses generic code generator;
821 default generators are provided for all suitable HOL types, records
822 and datatypes. Old quickcheck can be re-activated importing theory
823 Library/SML_Quickcheck.
825 * New testing tool Mirabelle for automated proof tools. Applies
826 several tools and tactics like sledgehammer, metis, or quickcheck, to
827 every proof step in a theory. To be used in batch mode via the
830 * New proof method "sos" (sum of squares) for nonlinear real
831 arithmetic (originally due to John Harison). It requires theory
832 Library/Sum_Of_Squares. It is not a complete decision procedure but
833 works well in practice on quantifier-free real arithmetic with +, -,
834 *, ^, =, <= and <, i.e. boolean combinations of equalities and
835 inequalities between polynomials. It makes use of external
836 semidefinite programming solvers. Method "sos" generates a
837 certificate that can be pasted into the proof thus avoiding the need
838 to call an external tool every time the proof is checked. See
839 src/HOL/Library/Sum_Of_Squares.
841 * New method "linarith" invokes existing linear arithmetic decision
844 * New command 'atp_minimal' reduces result produced by Sledgehammer.
846 * New Sledgehammer option "Full Types" in Proof General settings menu.
847 Causes full type information to be output to the ATPs. This slows
848 ATPs down considerably but eliminates a source of unsound "proofs"
851 * New method "metisFT": A version of metis that uses full type
852 information in order to avoid failures of proof reconstruction.
854 * New evaluator "approximate" approximates an real valued term using
855 the same method as the approximation method.
857 * Method "approximate" now supports arithmetic expressions as
858 boundaries of intervals and implements interval splitting and Taylor
861 * ML antiquotation @{code_datatype} inserts definition of a datatype
862 generated by the code generator; e.g. see src/HOL/Predicate.thy.
864 * New theory SupInf of the supremum and infimum operators for sets of
867 * New theory Probability, which contains a development of measure
868 theory, eventually leading to Lebesgue integration and probability.
870 * Extended Multivariate Analysis to include derivation and Brouwer's
873 * Reorganization of number theory, INCOMPATIBILITY:
874 - new number theory development for nat and int, in theories Divides
875 and GCD as well as in new session Number_Theory
876 - some constants and facts now suffixed with _nat and _int
878 - former session NumberTheory now named Old_Number_Theory, including
879 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
880 - moved theory Pocklington from src/HOL/Library to
881 src/HOL/Old_Number_Theory
883 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
884 lcm of finite and infinite sets. It is shown that they form a complete
887 * Class semiring_div requires superclass no_zero_divisors and proof of
888 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
889 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
890 generalized to class semiring_div, subsuming former theorems
891 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
892 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
895 * Refinements to lattice classes and sets:
896 - less default intro/elim rules in locale variant, more default
897 intro/elim rules in class variant: more uniformity
898 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
900 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
902 - renamed ACI to inf_sup_aci
903 - new class "boolean_algebra"
904 - class "complete_lattice" moved to separate theory
905 "Complete_Lattice"; corresponding constants (and abbreviations)
906 renamed and with authentic syntax:
907 Set.Inf ~> Complete_Lattice.Inf
908 Set.Sup ~> Complete_Lattice.Sup
909 Set.INFI ~> Complete_Lattice.INFI
910 Set.SUPR ~> Complete_Lattice.SUPR
911 Set.Inter ~> Complete_Lattice.Inter
912 Set.Union ~> Complete_Lattice.Union
913 Set.INTER ~> Complete_Lattice.INTER
914 Set.UNION ~> Complete_Lattice.UNION
915 - authentic syntax for
918 - mere abbreviations:
921 Set.inter (for inf, formerly Set.Int)
922 Set.union (for sup, formerly Set.Un)
923 Complete_Lattice.Inter (for Inf)
924 Complete_Lattice.Union (for Sup)
925 Complete_Lattice.INTER (for INFI)
926 Complete_Lattice.UNION (for SUPR)
927 - object-logic definitions as far as appropriate
929 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
930 Un_subset_iff are explicitly deleted as default simp rules; then also
931 their lattice counterparts le_inf_iff and le_sup_iff have to be
932 deleted to achieve the desired effect.
934 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
935 rules by default any longer; the same applies to min_max.inf_absorb1
936 etc. INCOMPATIBILITY.
938 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
939 pred_set_conv by default. INCOMPATIBILITY.
941 * Power operations on relations and functions are now one dedicated
942 constant "compow" with infix syntax "^^". Power operation on
943 multiplicative monoids retains syntax "^" and is now defined generic
944 in class power. INCOMPATIBILITY.
946 * Relation composition "R O S" now has a more standard argument order:
947 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
948 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
949 break, since the O_assoc rule was not rewritten like this. Fix using
950 O_assoc[symmetric]. The same applies to the curried version "R OO S".
952 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
953 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
956 * Most rules produced by inductive and datatype package have mandatory
957 prefixes. INCOMPATIBILITY.
959 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
960 the attribute of the same name. Each of the theorems in the list
961 DERIV_intros assumes composition with an additional function and
962 matches a variable to the derivative, which has to be solved by the
963 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
964 of most elementary terms. Former Maclauren.DERIV_tac and
965 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
968 * Code generator attributes follow the usual underscore convention:
969 code_unfold replaces code unfold
970 code_post replaces code post
975 sizechange -> size_change
976 induct_scheme -> induction_schema
979 * Discontinued abbreviation "arbitrary" of constant "undefined".
980 INCOMPATIBILITY, use "undefined" directly.
983 Suc_eq_add_numeral_1 -> Suc_eq_plus1
984 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
985 Suc_plus1 -> Suc_eq_plus1
986 *anti_sym -> *antisym*
987 vector_less_eq_def -> vector_le_def
990 * Added theorem List.map_map as [simp]. Removed List.map_compose.
993 * Removed predicate "M hassize n" (<--> card M = n & finite M).
999 * Theory Representable defines a class "rep" of domains that are
1000 representable (via an ep-pair) in the universal domain type "udom".
1001 Instances are provided for all type constructors defined in HOLCF.
1003 * The 'new_domain' command is a purely definitional version of the
1004 domain package, for representable domains. Syntax is identical to the
1005 old domain package. The 'new_domain' package also supports indirect
1006 recursion using previously-defined type constructors. See
1007 src/HOLCF/ex/New_Domain.thy for examples.
1009 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1010 on the left-hand side of an equation, and then performs
1011 simplification. Rewriting is done using rules declared with the
1012 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1013 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1015 * The pattern-match compiler in 'fixrec' can now handle constructors
1016 with HOL function types. Pattern-match combinators for the Pair
1017 constructor are pre-configured.
1019 * The 'fixrec' package now produces better fixed-point induction rules
1020 for mutually-recursive definitions: Induction rules have conclusions
1021 of the form "P foo bar" instead of "P <foo, bar>".
1023 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1024 been renamed to "below". The name "below" now replaces "less" in many
1025 theorem names. (Legacy theorem names using "less" are still supported
1028 * The 'fixrec' package now supports "bottom patterns". Bottom
1029 patterns can be used to generate strictness rules, or to make
1030 functions more strict (much like the bang-patterns supported by the
1031 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1037 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1038 errors and run-time exceptions, including detailed source positions.
1040 * Structure Name_Space (formerly NameSpace) now manages uniquely
1041 identified entries, with some additional information such as source
1042 position, logical grouping etc.
1044 * Theory and context data is now introduced by the simplified and
1045 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1046 to be pure, but the old TheoryDataFun for mutable data (with explicit
1047 copy operation) is still available for some time.
1049 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1050 provides a high-level programming interface to synchronized state
1051 variables with atomic update. This works via pure function
1052 application within a critical section -- its runtime should be as
1053 short as possible; beware of deadlocks if critical code is nested,
1054 either directly or indirectly via other synchronized variables!
1056 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1057 wraps raw ML references, explicitly indicating their non-thread-safe
1058 behaviour. The Isar toplevel keeps this structure open, to
1059 accommodate Proof General as well as quick and dirty interactive
1060 experiments with references.
1062 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1063 parallel tactical reasoning.
1065 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1066 are similar to SUBPROOF, but are slightly more flexible: only the
1067 specified parts of the subgoal are imported into the context, and the
1068 body tactic may introduce new subgoals and schematic variables.
1070 * Old tactical METAHYPS, which does not observe the proof context, has
1071 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1072 or Subgoal.FOCUS etc.
1074 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1075 functors have their own ML name space there is no point to mark them
1076 separately.) Minor INCOMPATIBILITY.
1078 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1080 * Renamed several structures FooBar to Foo_Bar. Occasional,
1083 * Operations of structure Skip_Proof no longer require quick_and_dirty
1084 mode, which avoids critical setmp.
1086 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1087 combinators for "args". INCOMPATIBILITY, need to use simplified
1088 Attrib/Method.setup introduced in Isabelle2009.
1090 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1091 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1092 last resort. INCOMPATIBILITY.
1094 * Display.pretty_thm now requires a proper context (cf. former
1095 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1096 or even Display.pretty_thm_without_context as last resort.
1099 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1100 Syntax.pretty_typ/term directly, preferably with proper context
1101 instead of global theory.
1106 * Further fine tuning of parallel proof checking, scales up to 8 cores
1107 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1110 * Support for additional "Isabelle components" via etc/components, see
1111 also the system manual.
1113 * The isabelle makeall tool now operates on all components with
1114 IsaMakefile, not just hardwired "logics".
1116 * Removed "compress" option from isabelle-process and isabelle usedir;
1117 this is always enabled.
1119 * Discontinued support for Poly/ML 4.x versions.
1121 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1122 on a given logic image. This requires the lighttpd webserver and is
1123 currently supported on Linux only.
1127 New in Isabelle2009 (April 2009)
1128 --------------------------------
1132 * Simplified main Isabelle executables, with less surprises on
1133 case-insensitive file-systems (such as Mac OS).
1135 - The main Isabelle tool wrapper is now called "isabelle" instead of
1138 - The former "isabelle" alias for "isabelle-process" has been
1139 removed (should rarely occur to regular users).
1141 - The former "isabelle-interface" and its alias "Isabelle" have been
1142 removed (interfaces are now regular Isabelle tools).
1144 Within scripts and make files, the Isabelle environment variables
1145 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1146 respectively. (The latter are still available as legacy feature.)
1148 The old isabelle-interface wrapper could react in confusing ways if
1149 the interface was uninstalled or changed otherwise. Individual
1150 interface tool configuration is now more explicit, see also the
1151 Isabelle system manual. In particular, Proof General is now available
1152 via "isabelle emacs".
1154 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1155 purge installed copies of Isabelle executables and re-run "isabelle
1156 install -p ...", or use symlinks.
1158 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1159 old ~/isabelle, which was slightly non-standard and apt to cause
1160 surprises on case-insensitive file-systems (such as Mac OS).
1162 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1163 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1164 care is required when using older releases of Isabelle. Note that
1165 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1166 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1168 * Proofs of fully specified statements are run in parallel on
1169 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1170 a regular 4-core machine, if the initial heap space is made reasonably
1171 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1173 * The main reference manuals ("isar-ref", "implementation", and
1174 "system") have been updated and extended. Formally checked references
1175 as hyperlinks are now available uniformly.
1180 * Complete re-implementation of locales. INCOMPATIBILITY in several
1181 respects. The most important changes are listed below. See the
1182 Tutorial on Locales ("locales" manual) for details.
1184 - In locale expressions, instantiation replaces renaming. Parameters
1185 must be declared in a for clause. To aid compatibility with previous
1186 parameter inheritance, in locale declarations, parameters that are not
1187 'touched' (instantiation position "_" or omitted) are implicitly added
1188 with their syntax at the beginning of the for clause.
1190 - Syntax from abbreviations and definitions in locales is available in
1191 locale expressions and context elements. The latter is particularly
1192 useful in locale declarations.
1194 - More flexible mechanisms to qualify names generated by locale
1195 expressions. Qualifiers (prefixes) may be specified in locale
1196 expressions, and can be marked as mandatory (syntax: "name!:") or
1197 optional (syntax "name?:"). The default depends for plain "name:"
1198 depends on the situation where a locale expression is used: in
1199 commands 'locale' and 'sublocale' prefixes are optional, in
1200 'interpretation' and 'interpret' prefixes are mandatory. The old
1201 implicit qualifiers derived from the parameter names of a locale are
1202 no longer generated.
1204 - Command "sublocale l < e" replaces "interpretation l < e". The
1205 instantiation clause in "interpretation" and "interpret" (square
1206 brackets) is no longer available. Use locale expressions.
1208 - When converting proof scripts, mandatory qualifiers in
1209 'interpretation' and 'interpret' should be retained by default, even
1210 if this is an INCOMPATIBILITY compared to former behavior. In the
1211 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1212 in locale expressions range over a single locale instance only.
1214 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1215 In existing theorem specifications replace the includes element by the
1216 respective context elements of the included locale, omitting those
1217 that are already present in the theorem specification. Multiple
1218 assume elements of a locale should be replaced by a single one
1219 involving the locale predicate. In the proof body, declarations (most
1220 notably theorems) may be regained by interpreting the respective
1221 locales in the proof context as required (command "interpret").
1223 If using "includes" in replacement of a target solely because the
1224 parameter types in the theorem are not as general as in the target,
1225 consider declaring a new locale with additional type constraints on
1226 the parameters (context element "constrains").
1228 - Discontinued "locale (open)". INCOMPATIBILITY.
1230 - Locale interpretation commands no longer attempt to simplify goal.
1231 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1232 methods intro_locales and unfold_locales to clarify.
1234 - Locale interpretation commands no longer accept interpretation
1235 attributes. INCOMPATIBILITY.
1237 * Class declaration: so-called "base sort" must not be given in import
1238 list any longer, but is inferred from the specification. Particularly
1245 class foo = type + ...
1247 * Class target: global versions of theorems stemming do not carry a
1248 parameter prefix any longer. INCOMPATIBILITY.
1250 * Class 'instance' command no longer accepts attached definitions.
1251 INCOMPATIBILITY, use proper 'instantiation' target instead.
1253 * Recovered hiding of consts, which was accidentally broken in
1254 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1255 makes c inaccessible; consider using ``hide (open) const c'' instead.
1257 * Slightly more coherent Pure syntax, with updated documentation in
1258 isar-ref manual. Removed locales meta_term_syntax and
1259 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1260 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1261 directly in regular applications.
1263 * There is a new syntactic category "float_const" for signed decimal
1264 fractions (e.g. 123.45 or -123.45).
1266 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1267 interface with 'setup' command instead.
1269 * Command 'local_setup' is similar to 'setup', but operates on a local
1272 * The 'axiomatization' command now only works within a global theory
1273 context. INCOMPATIBILITY.
1275 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1276 hypotheses. Sorts required in the course of reasoning need to be
1277 covered by the constraints in the initial statement, completed by the
1278 type instance information of the background theory. Non-trivial sort
1279 hypotheses, which rarely occur in practice, may be specified via
1280 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1282 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1284 The result contains an implicit sort hypotheses as before --
1285 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1288 * Generalized Isar history, with support for linear undo, direct state
1291 * Changed defaults for unify configuration options:
1293 unify_trace_bound = 50 (formerly 25)
1294 unify_search_bound = 60 (formerly 30)
1296 * Different bookkeeping for code equations (INCOMPATIBILITY):
1298 a) On theory merge, the last set of code equations for a particular
1299 constant is taken (in accordance with the policy applied by other
1300 parts of the code generator framework).
1302 b) Code equations stemming from explicit declarations (e.g. code
1303 attribute) gain priority over default code equations stemming
1304 from definition, primrec, fun etc.
1306 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1308 * Unified theorem tables for both code generators. Thus [code
1309 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1311 * Command 'find_consts' searches for constants based on type and name
1314 find_consts "_ => bool"
1316 By default, matching is against subtypes, but it may be restricted to
1317 the whole type. Searching by name is possible. Multiple queries are
1318 conjunctive and queries may be negated by prefixing them with a
1321 find_consts strict: "_ => bool" name: "Int" -"int => int"
1323 * New 'find_theorems' criterion "solves" matches theorems that
1324 directly solve the current goal (modulo higher-order unification).
1326 * Auto solve feature for main theorem statements: whenever a new goal
1327 is stated, "find_theorems solves" is called; any theorems that could
1328 solve the lemma directly are listed as part of the goal state.
1329 Cf. associated options in Proof General Isabelle settings menu,
1330 enabled by default, with reasonable timeout for pathological cases of
1331 higher-order unification.
1334 *** Document preparation ***
1336 * Antiquotation @{lemma} now imitates a regular terminal proof,
1337 demanding keyword 'by' and supporting the full method expression
1338 syntax just like the Isar command 'by'.
1343 * Integrated main parts of former image HOL-Complex with HOL. Entry
1344 points Main and Complex_Main remain as before.
1346 * Logic image HOL-Plain provides a minimal HOL with the most important
1347 tools available (inductive, datatype, primrec, ...). This facilitates
1348 experimentation and tool development. Note that user applications
1349 (and library theories) should never refer to anything below theory
1352 * Logic image HOL-Main stops at theory Main, and thus facilitates
1353 experimentation due to shorter build times.
1355 * Logic image HOL-NSA contains theories of nonstandard analysis which
1356 were previously part of former HOL-Complex. Entry point Hyperreal
1357 remains valid, but theories formerly using Complex_Main should now use
1358 new entry point Hypercomplex.
1360 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1361 Posix processes. Avoids potentially expensive forking of the ML
1362 process. New thread-based implementation also works on non-Unix
1363 platforms (Cygwin). Provers are no longer hardwired, but defined
1364 within the theory via plain ML wrapper functions. Basic Sledgehammer
1365 commands are covered in the isar-ref manual.
1367 * Wrapper scripts for remote SystemOnTPTP service allows to use
1368 sledgehammer without local ATP installation (Vampire etc.). Other
1369 provers may be included via suitable ML wrappers, see also
1370 src/HOL/ATP_Linkup.thy.
1372 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1375 * The metis method no longer fails because the theorem is too trivial
1376 (contains the empty clause).
1378 * The metis method now fails in the usual manner, rather than raising
1379 an exception, if it determines that it cannot prove the theorem.
1381 * Method "coherent" implements a prover for coherent logic (see also
1382 src/Tools/coherent.ML).
1384 * Constants "undefined" and "default" replace "arbitrary". Usually
1385 "undefined" is the right choice to replace "arbitrary", though
1386 logically there is no difference. INCOMPATIBILITY.
1388 * Command "value" now integrates different evaluation mechanisms. The
1389 result of the first successful evaluation mechanism is printed. In
1390 square brackets a particular named evaluation mechanisms may be
1391 specified (currently, [SML], [code] or [nbe]). See further
1392 src/HOL/ex/Eval_Examples.thy.
1394 * Normalization by evaluation now allows non-leftlinear equations.
1395 Declare with attribute [code nbe].
1397 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1398 as the structured Isar versions "cases" and "induct", cf. the
1399 corresponding "cases" and "induct" attributes. Mutual induction rules
1400 are now presented as a list of individual projections
1401 (e.g. foo_bar.inducts for types foo and bar); the old format with
1402 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1403 rare situations a different rule is selected --- notably nested tuple
1404 elimination instead of former prod.exhaust: use explicit (case_tac t
1405 rule: prod.exhaust) here.
1407 * Attributes "cases", "induct", "coinduct" support "del" option.
1409 * Removed fact "case_split_thm", which duplicates "case_split".
1411 * The option datatype has been moved to a new theory Option. Renamed
1412 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1414 * New predicate "strict_mono" classifies strict functions on partial
1415 orders. With strict functions on linear orders, reasoning about
1416 (in)equalities is facilitated by theorems "strict_mono_eq",
1417 "strict_mono_less_eq" and "strict_mono_less".
1419 * Some set operations are now proper qualified constants with
1420 authentic syntax. INCOMPATIBILITY:
1431 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1434 * Auxiliary class "itself" has disappeared -- classes without any
1435 parameter are treated as expected by the 'class' command.
1437 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1439 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1440 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1442 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1443 method "approximation". It proves formulas on real values by using
1444 interval arithmetic. In the formulas are also the transcendental
1445 functions sin, cos, tan, atan, ln, exp and the constant pi are
1446 allowed. For examples see
1447 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1449 * Theory "Reflection" now resides in HOL/Library.
1451 * Entry point to Word library now simply named "Word".
1454 * Made source layout more coherent with logical distribution
1457 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1458 src/HOL/Library/Code_Message.thy ~> src/HOL/
1459 src/HOL/Library/GCD.thy ~> src/HOL/
1460 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1461 src/HOL/Library/Parity.thy ~> src/HOL/
1462 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1463 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1464 src/HOL/Real/Lubs.thy ~> src/HOL/
1465 src/HOL/Real/PReal.thy ~> src/HOL/
1466 src/HOL/Real/Rational.thy ~> src/HOL/
1467 src/HOL/Real/RComplete.thy ~> src/HOL/
1468 src/HOL/Real/RealDef.thy ~> src/HOL/
1469 src/HOL/Real/RealPow.thy ~> src/HOL/
1470 src/HOL/Real/Real.thy ~> src/HOL/
1471 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1472 src/HOL/Complex/Complex.thy ~> src/HOL/
1473 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1474 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1475 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1476 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1477 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1478 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1479 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1480 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1481 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1482 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1483 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1484 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1485 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1486 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1487 src/HOL/Real/Float ~> src/HOL/Library/
1488 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1489 src/HOL/Real/RealVector.thy ~> src/HOL/
1491 src/HOL/arith_data.ML ~> src/HOL/Tools
1492 src/HOL/hologic.ML ~> src/HOL/Tools
1493 src/HOL/simpdata.ML ~> src/HOL/Tools
1494 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1495 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1496 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1497 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1498 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1499 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1500 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1502 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1503 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1504 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1505 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1506 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1507 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1509 * If methods "eval" and "evaluation" encounter a structured proof
1510 state with !!/==>, only the conclusion is evaluated to True (if
1511 possible), avoiding strange error messages.
1513 * Method "sizechange" automates termination proofs using (a
1514 modification of) the size-change principle. Requires SAT solver. See
1515 src/HOL/ex/Termination.thy for examples.
1517 * Simplifier: simproc for let expressions now unfolds if bound
1518 variable occurs at most once in let expression body. INCOMPATIBILITY.
1520 * Method "arith": Linear arithmetic now ignores all inequalities when
1521 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1523 * New attribute "arith" for facts that should always be used
1524 automatically by arithmetic. It is intended to be used locally in
1527 assumes [arith]: "x > 0"
1529 Global usage is discouraged because of possible performance impact.
1531 * New classes "top" and "bot" with corresponding operations "top" and
1532 "bot" in theory Orderings; instantiation of class "complete_lattice"
1533 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1535 * Changed definition lemma "less_fun_def" in order to provide an
1536 instance for preorders on functions; use lemma "less_le" instead.
1539 * Theory Orderings: class "wellorder" moved here, with explicit
1540 induction rule "less_induct" as assumption. For instantiation of
1541 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1544 * Theory Orderings: added class "preorder" as superclass of "order".
1545 INCOMPATIBILITY: Instantiation proofs for order, linorder
1546 etc. slightly changed. Some theorems named order_class.* now named
1549 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1552 * Theory Finite_Set: added a new fold combinator of type
1554 ('a => 'b => 'b) => 'b => 'a set => 'b
1556 Occasionally this is more convenient than the old fold combinator
1557 which is now defined in terms of the new one and renamed to
1560 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1561 and "ring_simps" have been replaced by "algebra_simps" (which can be
1562 extended with further lemmas!). At the moment both still exist but
1563 the former will disappear at some point.
1565 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1566 class recpower. Type-specific simp rules for various recpower types
1567 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1569 rat_power_0 -> power_0
1570 rat_power_Suc -> power_Suc
1571 realpow_0 -> power_0
1572 realpow_Suc -> power_Suc
1573 complexpow_0 -> power_0
1574 complexpow_Suc -> power_Suc
1575 power_poly_0 -> power_0
1576 power_poly_Suc -> power_Suc
1578 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1579 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1580 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1581 of lemmas from Divides has been generalized from nat to class
1582 semiring_div. INCOMPATIBILITY. This involves the following theorem
1583 renames resulting from duplicate elimination:
1585 dvd_def_mod ~> dvd_eq_mod_eq_0
1586 zero_dvd_iff ~> dvd_0_left_iff
1587 dvd_0 ~> dvd_0_right
1588 DIVISION_BY_ZERO_DIV ~> div_by_0
1589 DIVISION_BY_ZERO_MOD ~> mod_by_0
1590 mult_div ~> div_mult_self2_is_id
1591 mult_mod ~> mod_mult_self2_is_0
1593 * Theory IntDiv: removed many lemmas that are instances of class-based
1594 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1595 rename old lemmas as follows:
1597 dvd_diff -> nat_dvd_diff
1598 dvd_zminus_iff -> dvd_minus_iff
1599 mod_add1_eq -> mod_add_eq
1600 mod_mult1_eq -> mod_mult_right_eq
1601 mod_mult1_eq' -> mod_mult_left_eq
1602 mod_mult_distrib_mod -> mod_mult_eq
1603 nat_mod_add_left_eq -> mod_add_left_eq
1604 nat_mod_add_right_eq -> mod_add_right_eq
1605 nat_mod_div_trivial -> mod_div_trivial
1606 nat_mod_mod_trivial -> mod_mod_trivial
1607 zdiv_zadd_self1 -> div_add_self1
1608 zdiv_zadd_self2 -> div_add_self2
1609 zdiv_zmult_self1 -> div_mult_self2_is_id
1610 zdiv_zmult_self2 -> div_mult_self1_is_id
1611 zdvd_triv_left -> dvd_triv_left
1612 zdvd_triv_right -> dvd_triv_right
1613 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1614 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1615 zmod_zadd_left_eq -> mod_add_left_eq
1616 zmod_zadd_right_eq -> mod_add_right_eq
1617 zmod_zadd_self1 -> mod_add_self1
1618 zmod_zadd_self2 -> mod_add_self2
1619 zmod_zadd1_eq -> mod_add_eq
1620 zmod_zdiff1_eq -> mod_diff_eq
1621 zmod_zdvd_zmod -> mod_mod_cancel
1622 zmod_zmod_cancel -> mod_mod_cancel
1623 zmod_zmult_self1 -> mod_mult_self2_is_0
1624 zmod_zmult_self2 -> mod_mult_self1_is_0
1627 zdvd_abs1 -> abs_dvd_iff
1628 zdvd_abs2 -> dvd_abs_iff
1629 zdvd_refl -> dvd_refl
1630 zdvd_trans -> dvd_trans
1631 zdvd_zadd -> dvd_add
1632 zdvd_zdiff -> dvd_diff
1633 zdvd_zminus_iff -> dvd_minus_iff
1634 zdvd_zminus2_iff -> minus_dvd_iff
1635 zdvd_zmultD -> dvd_mult_right
1636 zdvd_zmultD2 -> dvd_mult_left
1637 zdvd_zmult_mono -> mult_dvd_mono
1638 zdvd_0_right -> dvd_0_right
1639 zdvd_0_left -> dvd_0_left_iff
1640 zdvd_1_left -> one_dvd
1641 zminus_dvd_iff -> minus_dvd_iff
1643 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1645 * The real numbers offer decimal input syntax: 12.34 is translated
1646 into 1234/10^2. This translation is not reversed upon output.
1648 * Theory Library/Polynomial defines an abstract type 'a poly of
1649 univariate polynomials with coefficients of type 'a. In addition to
1650 the standard ring operations, it also supports div and mod. Code
1651 generation is also supported, using list-style constructors.
1653 * Theory Library/Inner_Product defines a class of real_inner for real
1654 inner product spaces, with an overloaded operation inner :: 'a => 'a
1655 => real. Class real_inner is a subclass of real_normed_vector from
1658 * Theory Library/Product_Vector provides instances for the product
1659 type 'a * 'b of several classes from RealVector and Inner_Product.
1660 Definitions of addition, subtraction, scalar multiplication, norms,
1661 and inner products are included.
1663 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1664 addition to the field operations, numerals and case syntax are also
1667 * Theory Library/Diagonalize provides constructive version of Cantor's
1668 first diagonalization argument.
1670 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1671 zlcm (for int); carried together from various gcd/lcm developements in
1672 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1673 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1674 may recover tupled syntax as follows:
1676 hide (open) const gcd
1677 abbreviation gcd where
1678 "gcd == (%(a, b). GCD.gcd a b)"
1680 GCD.gcd ("gcd '(_, _')")
1682 The same works for lcm, zgcd, zlcm.
1684 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1685 instantiations for algebraic structures. Removed some duplicate
1686 theorems. Changes in simp rules. INCOMPATIBILITY.
1688 * ML antiquotation @{code} takes a constant as argument and generates
1689 corresponding code in background and inserts name of the corresponding
1690 resulting ML value/function/datatype constructor binding in place.
1691 All occurrences of @{code} with a single ML block are generated
1692 simultaneously. Provides a generic and safe interface for
1693 instrumentalizing code generation. See
1694 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1695 In future you ought to refrain from ad-hoc compiling generated SML
1696 code on the ML toplevel. Note that (for technical reasons) @{code}
1697 cannot refer to constants for which user-defined serializations are
1698 set. Refer to the corresponding ML counterpart directly in that
1701 * Command 'rep_datatype': instead of theorem names the command now
1702 takes a list of terms denoting the constructors of the type to be
1703 represented as datatype. The characteristic theorems have to be
1704 proven. INCOMPATIBILITY. Also observe that the following theorems
1705 have disappeared in favour of existing ones:
1707 unit_induct ~> unit.induct
1708 prod_induct ~> prod.induct
1709 sum_induct ~> sum.induct
1710 Suc_Suc_eq ~> nat.inject
1711 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1716 * New locales for orders and lattices where the equivalence relation
1717 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1718 locales use a record structure with field eq for the equivalence.
1720 * New theory of factorial domains.
1722 * Units_l_inv and Units_r_inv are now simp rules by default.
1723 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1724 and/or r_inv will now also require deletion of these lemmas.
1726 * Renamed the following theorems, INCOMPATIBILITY:
1728 UpperD ~> Upper_memD
1729 LowerD ~> Lower_memD
1730 least_carrier ~> least_closed
1731 greatest_carrier ~> greatest_closed
1732 greatest_Lower_above ~> greatest_Lower_below
1733 one_zero ~> carrier_one_zero
1734 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1739 * Nominal datatypes can now contain type-variables.
1741 * Commands 'nominal_inductive' and 'equivariance' work with local
1744 * Nominal primrec can now works with local theory targets and its
1745 specification syntax now conforms to the general format as seen in
1748 * Method "perm_simp" honours the standard simplifier attributes
1749 (no_asm), (no_asm_use) etc.
1751 * The new predicate #* is defined like freshness, except that on the
1752 left hand side can be a set or list of atoms.
1754 * Experimental command 'nominal_inductive2' derives strong induction
1755 principles for inductive definitions. In contrast to
1756 'nominal_inductive', which can only deal with a fixed number of
1757 binders, it can deal with arbitrary expressions standing for sets of
1758 atoms to be avoided. The only inductive definition we have at the
1759 moment that needs this generalisation is the typing rule for Lets in
1762 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1763 -----------------------------------------------------------------
1764 Gamma |- Let x be t1 in t2 : T2
1766 In this rule one wants to avoid all the binders that are introduced by
1767 "close Gamma T1". We are looking for other examples where this
1768 feature might be useful. Please let us know.
1773 * Reimplemented the simplification procedure for proving continuity
1774 subgoals. The new simproc is extensible; users can declare additional
1775 continuity introduction rules with the attribute [cont2cont].
1777 * The continuity simproc now uses a different introduction rule for
1778 solving continuity subgoals on terms with lambda abstractions. In
1779 some rare cases the new simproc may fail to solve subgoals that the
1780 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1781 Potential INCOMPATIBILITY.
1783 * Command 'fixrec': specification syntax now conforms to the general
1784 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1785 examples. INCOMPATIBILITY.
1790 * Proof of Zorn's Lemma for partial orders.
1795 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1796 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1797 depends on multithreading, so timouts will not work before Poly/ML
1800 * High-level support for concurrent ML programming, see
1801 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1802 particularly convenient to organize independent functional
1803 computations. The concept of "synchronized variables" provides a
1804 higher-order interface for components with shared state, avoiding the
1805 delicate details of mutexes and condition variables. (Requires
1806 Poly/ML 5.2.1 or later.)
1808 * ML bindings produced via Isar commands are stored within the Isar
1809 context (theory or proof). Consequently, commands like 'use' and 'ML'
1810 become thread-safe and work with undo as expected (concerning
1811 top-level bindings, not side-effects on global references).
1812 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1813 compiler at runtime; really global bindings need to be given outside a
1814 theory. (Requires Poly/ML 5.2 or later.)
1816 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1817 context. Top-level ML bindings are stored within the proof context in
1818 a purely sequential fashion, disregarding the nested proof structure.
1819 ML bindings introduced by 'ML_prf' are discarded at the end of the
1820 proof. (Requires Poly/ML 5.2 or later.)
1822 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1823 and Method.setup, as well as Isar commands 'attribute_setup' and
1824 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1825 existing code accordingly, or use plain 'setup' together with old
1828 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1829 to 'a -> thm, while results are always tagged with an authentic oracle
1830 name. The Isar command 'oracle' is now polymorphic, no argument type
1831 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1832 accordingly. Note that extra performance may be gained by producing
1833 the cterm carefully, avoiding slow Thm.cterm_of.
1835 * Simplified interface for defining document antiquotations via
1836 ThyOutput.antiquotation, ThyOutput.output, and optionally
1837 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1838 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1841 * More systematic treatment of long names, abstract name bindings, and
1842 name space operations. Basic operations on qualified names have been
1843 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1844 Long_Name.append. Old type bstring has been mostly replaced by
1845 abstract type binding (see structure Binding), which supports precise
1846 qualification by packages and local theory targets, as well as proper
1847 tracking of source positions. INCOMPATIBILITY, need to wrap old
1848 bstring values into Binding.name, or better pass through abstract
1849 bindings everywhere. See further src/Pure/General/long_name.ML,
1850 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1852 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1853 LocalTheory.note etc.) now refer to the *full* internal name, not the
1854 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1856 * Disposed old type and term read functions (Sign.read_def_typ,
1857 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1858 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1859 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1860 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1861 resort for legacy applications.
1863 * Disposed old declarations, tactics, tactic combinators that refer to
1864 the simpset or claset of an implicit theory (such as Addsimps,
1865 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1866 embedded ML text, or local_simpset_of with a proper context passed as
1867 explicit runtime argument.
1869 * Rules and tactics that read instantiations (read_instantiate,
1870 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1871 context, which is required for parsing and type-checking. Moreover,
1872 the variables are specified as plain indexnames, not string encodings
1873 thereof. INCOMPATIBILITY.
1875 * Generic Toplevel.add_hook interface allows to analyze the result of
1876 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1877 for theorem dependency output of transactions resulting in a new
1880 * ML antiquotations: block-structured compilation context indicated by
1881 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1883 @{binding name} - basic name binding
1884 @{let ?pat = term} - term abbreviation (HO matching)
1885 @{note name = fact} - fact abbreviation
1886 @{thm fact} - singleton fact (with attributes)
1887 @{thms fact} - general fact (with attributes)
1888 @{lemma prop by method} - singleton goal
1889 @{lemma prop by meth1 meth2} - singleton goal
1890 @{lemma prop1 ... propN by method} - general goal
1891 @{lemma prop1 ... propN by meth1 meth2} - general goal
1892 @{lemma (open) ...} - open derivation
1897 * The Isabelle "emacs" tool provides a specific interface to invoke
1898 Proof General / Emacs, with more explicit failure if that is not
1899 installed (the old isabelle-interface script silently falls back on
1900 isabelle-process). The PROOFGENERAL_HOME setting determines the
1901 installation location of the Proof General distribution.
1903 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1904 the Isabelle process into a JVM/Scala application. See
1905 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1906 process wrapper has been discontinued.)
1908 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1910 * Various status messages (with exact source position information) are
1911 emitted, if proper markup print mode is enabled. This allows
1912 user-interface components to provide detailed feedback on internal
1917 New in Isabelle2008 (June 2008)
1918 -------------------------------
1922 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1923 and updated, with formally checked references as hyperlinks.
1925 * Theory loader: use_thy (and similar operations) no longer set the
1926 implicit ML context, which was occasionally hard to predict and in
1927 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1928 provides a proper context already.
1930 * Theory loader: old-style ML proof scripts being *attached* to a thy
1931 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1932 'use' within a theory file will do the job.
1934 * Name space merge now observes canonical order, i.e. the second space
1935 is inserted into the first one, while existing entries in the first
1936 space take precedence. INCOMPATIBILITY in rare situations, may try to
1937 swap theory imports.
1939 * Syntax: symbol \<chi> is now considered a letter. Potential
1940 INCOMPATIBILITY in identifier syntax etc.
1942 * Outer syntax: string tokens no longer admit escaped white space,
1943 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1944 white space without escapes.
1946 * Outer syntax: string tokens may contain arbitrary character codes
1947 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1953 * Context-dependent token translations. Default setup reverts locally
1954 fixed variables, and adds hilite markup for undeclared frees.
1956 * Unused theorems can be found using the new command 'unused_thms'.
1957 There are three ways of invoking it:
1960 Only finds unused theorems in the current theory.
1962 (2) unused_thms thy_1 ... thy_n -
1963 Finds unused theorems in the current theory and all of its ancestors,
1964 excluding the theories thy_1 ... thy_n and all of their ancestors.
1966 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1967 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1968 their ancestors, excluding the theories thy_1 ... thy_n and all of
1971 In order to increase the readability of the list produced by
1972 unused_thms, theorems that have been created by a particular instance
1973 of a theory command such as 'inductive' or 'function' are considered
1974 to belong to the same "group", meaning that if at least one theorem in
1975 this group is used, the other theorems in the same group are no longer
1976 reported as unused. Moreover, if all theorems in the group are
1977 unused, only one theorem in the group is displayed.
1979 Note that proof objects have to be switched on in order for
1980 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1981 usually the case when using Proof General with the default settings).
1983 * Authentic naming of facts disallows ad-hoc overwriting of previous
1984 theorems within the same name space. INCOMPATIBILITY, need to remove
1985 duplicate fact bindings, or even accidental fact duplications. Note
1986 that tools may maintain dynamically scoped facts systematically, using
1987 PureThy.add_thms_dynamic.
1989 * Command 'hide' now allows to hide from "fact" name space as well.
1991 * Eliminated destructive theorem database, simpset, claset, and
1992 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1993 update of theories within ML code.
1995 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1996 INCOMPATIBILITY, object-logics depending on former Pure require
1997 additional setup PureThy.old_appl_syntax_setup; object-logics
1998 depending on former CPure need to refer to Pure.
2000 * Commands 'use' and 'ML' are now purely functional, operating on
2001 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2002 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2005 * Command 'setup': discontinued implicit version with ML reference.
2007 * Instantiation target allows for simultaneous specification of class
2008 instance operations together with an instantiation proof.
2009 Type-checking phase allows to refer to class operations uniformly.
2010 See src/HOL/Complex/Complex.thy for an Isar example and
2011 src/HOL/Library/Eval.thy for an ML example.
2013 * Indexing of literal facts: be more serious about including only
2014 facts from the visible specification/proof context, but not the
2015 background context (locale etc.). Affects `prop` notation and method
2016 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2019 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2020 "(open)" option, which used to expose internal bound variables to the
2023 * Isar statements: removed obsolete case "rule_context".
2024 INCOMPATIBILITY, better use explicit fixes/assumes.
2026 * Locale proofs: default proof step now includes 'unfold_locales';
2027 hence 'proof' without argument may be used to unfold locale
2031 *** Document preparation ***
2033 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2034 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2035 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2036 spot); renamed link color from "darkblue" to "linkcolor" (default
2037 value unchanged, can be redefined via \definecolor); no longer sets
2038 "a4paper" option (unnecessary or even intrusive).
2040 * Antiquotation @{lemma A method} proves proposition A by the given
2041 method (either a method name or a method name plus (optional) method
2042 arguments in parentheses) and prints A just like @{prop A}.
2047 * New primrec package. Specification syntax conforms in style to
2048 definition/function/.... No separate induction rule is provided. The
2049 "primrec" command distinguishes old-style and new-style specifications
2050 by syntax. The former primrec package is now named OldPrimrecPackage.
2051 When adjusting theories, beware: constants stemming from new-style
2052 primrec specifications have authentic syntax.
2054 * Metis prover is now an order of magnitude faster, and also works
2055 with multithreading.
2057 * Metis: the maximum number of clauses that can be produced from a
2058 theorem is now given by the attribute max_clauses. Theorems that
2059 exceed this number are ignored, with a warning printed.
2061 * Sledgehammer no longer produces structured proofs by default. To
2062 enable, declare [[sledgehammer_full = true]]. Attributes
2063 reconstruction_modulus, reconstruction_sorts renamed
2064 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2066 * Method "induct_scheme" derives user-specified induction rules
2067 from well-founded induction and completeness of patterns. This factors
2068 out some operations that are done internally by the function package
2069 and makes them available separately. See
2070 src/HOL/ex/Induction_Scheme.thy for examples.
2072 * More flexible generation of measure functions for termination
2073 proofs: Measure functions can be declared by proving a rule of the
2074 form "is_measure f" and giving it the [measure_function] attribute.
2075 The "is_measure" predicate is logically meaningless (always true), and
2076 just guides the heuristic. To find suitable measure functions, the
2077 termination prover sets up the goal "is_measure ?f" of the appropriate
2078 type and generates all solutions by prolog-style backwards proof using
2081 This setup also deals with rules like
2083 "is_measure f ==> is_measure (list_size f)"
2085 which accommodates nested datatypes that recurse through lists.
2086 Similar rules are predeclared for products and option types.
2088 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2092 - Definitions of overloaded constants on sets have to be replaced by
2093 definitions on => and bool.
2095 - Some definitions of overloaded operators on sets can now be proved
2096 using the definitions of the operators on => and bool. Therefore,
2097 the following theorems have been renamed:
2099 subset_def -> subset_eq
2100 psubset_def -> psubset_eq
2101 set_diff_def -> set_diff_eq
2102 Compl_def -> Compl_eq
2103 Sup_set_def -> Sup_set_eq
2104 Inf_set_def -> Inf_set_eq
2105 sup_set_def -> sup_set_eq
2106 inf_set_def -> inf_set_eq
2108 - Due to the incompleteness of the HO unification algorithm, some
2109 rules such as subst may require manual instantiation, if some of
2110 the unknowns in the rule is a set.
2112 - Higher order unification and forward proofs:
2115 have "P (S::'a set)" <...>
2116 then have "EX S. P S" ..
2118 no longer works (due to the incompleteness of the HO unification
2119 algorithm) and must be replaced by the pattern
2126 - Calculational reasoning with subst (or similar rules):
2129 have "P (S::'a set)" <...>
2130 also have "S = T" <...>
2131 finally have "P T" .
2133 no longer works (for similar reasons as the previous example) and
2134 must be replaced by something like
2136 have "P (S::'a set)" <...>
2137 moreover have "S = T" <...>
2138 ultimately have "P T" by simp
2140 - Tactics or packages written in ML code:
2141 Code performing pattern matching on types via
2143 Type ("set", [T]) => ...
2145 must be rewritten. Moreover, functions like strip_type or
2146 binder_types no longer return the right value when applied to a
2149 T1 => ... => Tn => U => bool
2153 T1 => ... => Tn => U set
2155 * Merged theories Wellfounded_Recursion, Accessible_Part and
2156 Wellfounded_Relations to theory Wellfounded.
2158 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2160 * Class finite no longer treats UNIV as class parameter. Use class
2161 enum from theory Library/Enum instead to achieve a similar effect.
2164 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2165 and "Cons". INCOMPATIBILITY.
2167 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2168 Potential INCOMPATIBILITY.
2170 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2171 injective_fst_snd removed, use split_eta and prod_eqI instead.
2172 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2174 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2175 the same name in theory Orderings:
2185 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2186 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2187 and different variable names.
2189 * Library/Option_ord.thy: Canonical order on option type.
2191 * Library/RBT.thy: Red-black trees, an efficient implementation of
2194 * Library/Countable.thy: Type class for countable types.
2196 * Theory Int: The representation of numerals has changed. The infix
2197 operator BIT and the bit datatype with constructors B0 and B1 have
2198 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2199 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2200 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2203 * Theory Nat: definition of <= and < on natural numbers no longer
2204 depend on well-founded relations. INCOMPATIBILITY. Definitions
2205 le_def and less_def have disappeared. Consider lemmas not_less
2206 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2208 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2209 (whose purpose mainly is for various fold_set functionals) have been
2210 abandoned in favor of the existing algebraic classes
2211 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2212 lower_semilattice (resp. upper_semilattice) and linorder.
2215 * Theory Transitive_Closure: induct and cases rules now declare proper
2216 case_names ("base" and "step"). INCOMPATIBILITY.
2218 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2219 lattices. The form set-specific version is available as
2220 Inductive.lfp_ordinal_induct_set.
2222 * Renamed theorems "power.simps" to "power_int.simps".
2225 * Class semiring_div provides basic abstract properties of semirings
2226 with division and modulo operations. Subsumes former class dvd_mod.
2228 * Merged theories IntDef, Numeral and IntArith into unified theory
2229 Int. INCOMPATIBILITY.
2231 * Theory Library/Code_Index: type "index" now represents natural
2232 numbers rather than integers. INCOMPATIBILITY.
2234 * New class "uminus" with operation "uminus" (split of from class
2235 "minus" which now only has operation "minus", binary).
2238 * Constants "card", "internal_split", "option_map" now with authentic
2239 syntax. INCOMPATIBILITY.
2241 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2242 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2243 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2244 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2245 Sup_set_def, le_def, less_def, option_map_def now with object
2246 equality. INCOMPATIBILITY.
2248 * Records. Removed K_record, and replaced it by pure lambda term
2249 %x. c. The simplifier setup is now more robust against eta expansion.
2250 INCOMPATIBILITY: in cases explicitly referring to K_record.
2252 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2254 * Library/ListVector: new theory of arithmetic vector operations.
2256 * Library/Order_Relation: new theory of various orderings as sets of
2257 pairs. Defines preorders, partial orders, linear orders and
2258 well-orders on sets and on types.
2263 * Renamed some theories to allow to loading both ZF and HOL in the
2266 Datatype -> Datatype_ZF
2267 Inductive -> Inductive_ZF
2274 INCOMPATIBILITY: ZF theories that import individual theories below
2275 Main might need to be adapted. Regular theory Main is still
2276 available, as trivial extension of Main_ZF.
2281 * ML within Isar: antiquotation @{const name} or @{const
2282 name(typargs)} produces statically-checked Const term.
2284 * Functor NamedThmsFun: data is available to the user as dynamic fact
2285 (of the same name). Removed obsolete print command.
2287 * Removed obsolete "use_legacy_bindings" function.
2289 * The ``print mode'' is now a thread-local value derived from a global
2290 template (the former print_mode reference), thus access becomes
2291 non-critical. The global print_mode reference is for session
2292 management only; user-code should use print_mode_value,
2293 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2295 * Functions system/system_out provide a robust way to invoke external
2296 shell commands, with propagation of interrupts (requires Poly/ML
2297 5.2.1). Do not use OS.Process.system etc. from the basis library!
2302 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2303 in accordance with Proof General 3.7, which prefers GNU emacs.
2305 * isatool tty runs Isabelle process with plain tty interaction;
2306 optional line editor may be specified via ISABELLE_LINE_EDITOR
2307 setting, the default settings attempt to locate "ledit" and "rlwrap".
2309 * isatool browser now works with Cygwin as well, using general
2310 "javapath" function defined in Isabelle process environment.
2312 * YXML notation provides a simple and efficient alternative to
2313 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2314 isatool yxml as described in the Isabelle system manual.
2316 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2317 provides general wrapper for managing an Isabelle process in a robust
2318 fashion, with ``cooked'' output from stdin/stderr.
2320 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2321 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2323 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2324 way of changing the user's settings is via
2325 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2328 * Multithreading.max_threads := 0 refers to the number of actual CPU
2329 cores of the underlying machine, which is a good starting point for
2330 optimal performance tuning. The corresponding usedir option -M allows
2331 "max" as an alias for "0". WARNING: does not work on certain versions
2332 of Mac OS (with Poly/ML 5.1).
2334 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2335 adverse effect of Isabelle flooding interactive front-ends (notably
2336 ProofGeneral / XEmacs).
2340 New in Isabelle2007 (November 2007)
2341 -----------------------------------
2345 * More uniform information about legacy features, notably a
2346 warning/error of "Legacy feature: ...", depending on the state of the
2347 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2348 legacy features will disappear eventually.
2350 * Theory syntax: the header format ``theory A = B + C:'' has been
2351 discontinued in favour of ``theory A imports B C begin''. Use isatool
2352 fixheaders to convert existing theory files. INCOMPATIBILITY.
2354 * Theory syntax: the old non-Isar theory file format has been
2355 discontinued altogether. Note that ML proof scripts may still be used
2356 with Isar theories; migration is usually quite simple with the ML
2357 function use_legacy_bindings. INCOMPATIBILITY.
2359 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2360 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2363 * Theory loader: be more serious about observing the static theory
2364 header specifications (including optional directories), but not the
2365 accidental file locations of previously successful loads. The strict
2366 update policy of former update_thy is now already performed by
2367 use_thy, so the former has been removed; use_thys updates several
2368 theories simultaneously, just as 'imports' within a theory header
2369 specification, but without merging the results. Potential
2370 INCOMPATIBILITY: may need to refine theory headers and commands
2371 ROOT.ML which depend on load order.
2373 * Theory loader: optional support for content-based file
2374 identification, instead of the traditional scheme of full physical
2375 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2376 (cf. the system manual). The new scheme allows to work with
2377 non-finished theories in persistent session images, such that source
2378 files may be moved later on without requiring reloads.
2380 * Theory loader: old-style ML proof scripts being *attached* to a thy
2381 file (with the same base name as the theory) are considered a legacy
2382 feature, which will disappear eventually. Even now, the theory loader
2383 no longer maintains dependencies on such files.
2385 * Syntax: the scope for resolving ambiguities via type-inference is
2386 now limited to individual terms, instead of whole simultaneous
2387 specifications as before. This greatly reduces the complexity of the
2388 syntax module and improves flexibility by separating parsing and
2389 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2390 'fixes' etc.) are required in rare situations.
2392 * Syntax: constants introduced by new-style packages ('definition',
2393 'abbreviation' etc.) are passed through the syntax module in
2394 ``authentic mode''. This means that associated mixfix annotations
2395 really stick to such constants, independently of potential name space
2396 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2397 trees are represented slightly differently, may need to adapt syntax
2398 translations accordingly. Use CONST marker in 'translations' and
2399 @{const_syntax} antiquotation in 'parse_translation' etc.
2401 * Legacy goal package: reduced interface to the bare minimum required
2402 to keep existing proof scripts running. Most other user-level
2403 functions are now part of the OldGoals structure, which is *not* open
2404 by default (consider isatool expandshort before open OldGoals).
2405 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2406 these tend to cause confusion about the actual goal (!) context being
2407 used here, which is not necessarily the same as the_context().
2409 * Command 'find_theorems': supports "*" wild-card in "name:"
2410 criterion; "with_dups" option. Certain ProofGeneral versions might
2411 support a specific search form (see ProofGeneral/CHANGES).
2413 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2414 by default, which means that "prems" (and also "fixed variables") are
2415 suppressed from proof state output. Note that the ProofGeneral
2416 settings mechanism allows to change and save options persistently, but
2417 older versions of Isabelle will fail to start up if a negative prems
2420 * Local theory targets may be specified by non-nested blocks of
2421 ``context/locale/class ... begin'' followed by ``end''. The body may
2422 contain definitions, theorems etc., including any derived mechanism
2423 that has been implemented on top of these primitives. This concept
2424 generalizes the existing ``theorem (in ...)'' towards more versatility
2427 * Proof General interface: proper undo of final 'end' command;
2428 discontinued Isabelle/classic mode (ML proof scripts).
2431 *** Document preparation ***
2433 * Added antiquotation @{theory name} which prints the given name,
2434 after checking that it refers to a valid ancestor theory in the
2437 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2438 check the given source text as ML type/structure, printing verbatim.
2440 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2441 "c args == rhs" given in the current context. (Any number of
2442 arguments may be given on the LHS.)
2447 * The 'class' package offers a combination of axclass and locale to
2448 achieve Haskell-like type classes in Isabelle. Definitions and
2449 theorems within a class context produce both relative results (with
2450 implicit parameters according to the locale context), and polymorphic
2451 constants with qualified polymorphism (according to the class
2452 context). Within the body context of a 'class' target, a separate
2453 syntax layer ("user space type system") takes care of converting
2454 between global polymorphic consts and internal locale representation.
2455 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2456 "isatool doc classes" provides a tutorial.
2458 * Generic code generator framework allows to generate executable
2459 code for ML and Haskell (including Isabelle classes). A short usage
2462 internal compilation:
2463 export_code <list of constants (term syntax)> in SML
2464 writing SML code to a file:
2465 export_code <list of constants (term syntax)> in SML <filename>
2466 writing OCaml code to a file:
2467 export_code <list of constants (term syntax)> in OCaml <filename>
2468 writing Haskell code to a bunch of files:
2469 export_code <list of constants (term syntax)> in Haskell <filename>
2471 evaluating closed propositions to True/False using code generation:
2474 Reasonable default setup of framework in HOL.
2476 Theorem attributs for selecting and transforming function equations theorems:
2478 [code fun]: select a theorem as function equation for a specific constant
2479 [code fun del]: deselect a theorem as function equation for a specific constant
2480 [code inline]: select an equation theorem for unfolding (inlining) in place
2481 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2483 User-defined serializations (target in {SML, OCaml, Haskell}):
2485 code_const <and-list of constants (term syntax)>
2486 {(target) <and-list of const target syntax>}+
2488 code_type <and-list of type constructors>
2489 {(target) <and-list of type target syntax>}+
2491 code_instance <and-list of instances>
2493 where instance ::= <type constructor> :: <class>
2495 code_class <and_list of classes>
2496 {(target) <and-list of class target syntax>}+
2497 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2499 code_instance and code_class only are effective to target Haskell.
2501 For example usage see src/HOL/ex/Codegenerator.thy and
2502 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2503 generation from Isabelle/HOL theories is available via "isatool doc
2506 * Code generator: consts in 'consts_code' Isar commands are now
2507 referred to by usual term syntax (including optional type
2510 * Command 'no_translations' removes translation rules from theory
2513 * Overloaded definitions are now actually checked for acyclic
2514 dependencies. The overloading scheme is slightly more general than
2515 that of Haskell98, although Isabelle does not demand an exact
2516 correspondence to type class and instance declarations.
2517 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2518 exotic versions of overloading -- at the discretion of the user!
2520 Polymorphic constants are represented via type arguments, i.e. the
2521 instantiation that matches an instance against the most general
2522 declaration given in the signature. For example, with the declaration
2523 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2524 as c(nat). Overloading is essentially simultaneous structural
2525 recursion over such type arguments. Incomplete specification patterns
2526 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2527 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2528 Command 'print_theory' outputs the normalized system of recursive
2529 equations, see section "definitions".
2531 * Configuration options are maintained within the theory or proof
2532 context (with name and type bool/int/string), providing a very simple
2533 interface to a poor-man's version of general context data. Tools may
2534 declare options in ML (e.g. using Attrib.config_int) and then refer to
2535 these values using Config.get etc. Users may change options via an
2536 associated attribute of the same name. This form of context
2537 declaration works particularly well with commands 'declare' or
2538 'using', for example ``declare [[foo = 42]]''. Thus it has become
2539 very easy to avoid global references, which would not observe Isar
2540 toplevel undo/redo and fail to work with multithreading.
2542 Various global ML references of Pure and HOL have been turned into
2543 configuration options:
2545 Unify.search_bound unify_search_bound
2546 Unify.trace_bound unify_trace_bound
2547 Unify.trace_simp unify_trace_simp
2548 Unify.trace_types unify_trace_types
2549 Simplifier.simp_depth_limit simp_depth_limit
2550 Blast.depth_limit blast_depth_limit
2551 DatatypeProp.dtK datatype_distinctness_limit
2552 fast_arith_neq_limit fast_arith_neq_limit
2553 fast_arith_split_limit fast_arith_split_limit
2555 * Named collections of theorems may be easily installed as context
2556 data using the functor NamedThmsFun (see also
2557 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2558 attributes; there is also a toplevel print command. This facility is
2559 just a common case of general context data, which is the preferred way
2560 for anything more complex than just a list of facts in canonical
2563 * Isar: command 'declaration' augments a local theory by generic
2564 declaration functions written in ML. This enables arbitrary content
2565 being added to the context, depending on a morphism that tells the
2566 difference of the original declaration context wrt. the application
2567 context encountered later on.
2569 * Isar: proper interfaces for simplification procedures. Command
2570 'simproc_setup' declares named simprocs (with match patterns, and body
2571 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2572 context. ML antiquotation @{simproc name} retrieves named simprocs.
2574 * Isar: an extra pair of brackets around attribute declarations
2575 abbreviates a theorem reference involving an internal dummy fact,
2576 which will be ignored later --- only the effect of the attribute on
2577 the background context will persist. This form of in-place
2578 declarations is particularly useful with commands like 'declare' and
2579 'using', for example ``have A using [[simproc a]] by simp''.
2581 * Isar: method "assumption" (and implicit closing of subproofs) now
2582 takes simple non-atomic goal assumptions into account: after applying
2583 an assumption as a rule the resulting subgoals are solved by atomic
2584 assumption steps. This is particularly useful to finish 'obtain'
2585 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2586 without referring to the original premise "!!x. P x ==> thesis" in the
2587 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2590 * Isar: implicit use of prems from the Isar proof context is
2591 considered a legacy feature. Common applications like ``have A .''
2592 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2593 referencing facts explicitly here improves readability and
2594 maintainability of proof texts.
2596 * Isar: improper proof element 'guess' is like 'obtain', but derives
2597 the obtained context from the course of reasoning! For example:
2599 assume "EX x y. A x & B y" -- "any previous fact"
2600 then guess x and y by clarify
2602 This technique is potentially adventurous, depending on the facts and
2603 proof tools being involved here.
2605 * Isar: known facts from the proof context may be specified as literal
2606 propositions, using ASCII back-quote syntax. This works wherever
2607 named facts used to be allowed so far, in proof commands, proof
2608 methods, attributes etc. Literal facts are retrieved from the context
2609 according to unification of type and term parameters. For example,
2610 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2611 theorems in the current context, then these are valid literal facts:
2612 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2614 There is also a proof method "fact" which does the same composition
2615 for explicit goal states, e.g. the following proof texts coincide with
2616 certain special cases of literal facts:
2618 have "A" by fact == note `A`
2619 have "A ==> B" by fact == note `A ==> B`
2620 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2621 have "P a ==> Q a" by fact == note `P a ==> Q a`
2623 * Isar: ":" (colon) is no longer a symbolic identifier character in
2624 outer syntax. Thus symbolic identifiers may be used without
2625 additional white space in declarations like this: ``assume *: A''.
2627 * Isar: 'print_facts' prints all local facts of the current context,
2628 both named and unnamed ones.
2630 * Isar: 'def' now admits simultaneous definitions, e.g.:
2632 def x == "t" and y == "u"
2634 * Isar: added command 'unfolding', which is structurally similar to
2635 'using', but affects both the goal state and facts by unfolding given
2636 rewrite rules. Thus many occurrences of the 'unfold' method or
2637 'unfolded' attribute may be replaced by first-class proof text.
2639 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2640 and command 'unfolding' now all support object-level equalities
2641 (potentially conditional). The underlying notion of rewrite rule is
2642 analogous to the 'rule_format' attribute, but *not* that of the
2643 Simplifier (which is usually more generous).
2645 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2646 premises of a theorem by n. Useful in conjunction with drule.
2648 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2649 method expression within a sandbox consisting of the first N
2650 sub-goals, which need to exist. For example, ``simp_all [3]''
2651 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2652 simplifies all new goals that emerge from applying rule foo to the
2653 originally first one.
2655 * Isar: schematic goals are no longer restricted to higher-order
2656 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2659 * Isar: the conclusion of a long theorem statement is now either
2660 'shows' (a simultaneous conjunction, as before), or 'obtains'
2661 (essentially a disjunction of cases with local parameters and
2662 assumptions). The latter allows to express general elimination rules
2663 adequately; in this notation common elimination rules look like this:
2665 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2667 obtains x where "P x"
2669 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2673 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2679 The subsequent classical rules even refer to the formal "thesis"
2682 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2685 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2686 obtains "thesis ==> something"
2688 The actual proof of an 'obtains' statement is analogous to that of the
2689 Isar proof element 'obtain', only that there may be several cases.
2690 Optional case names may be specified in parentheses; these will be
2691 available both in the present proof and as annotations in the
2692 resulting rule, for later use with the 'cases' method (cf. attribute
2695 * Isar: the assumptions of a long theorem statement are available as
2696 "assms" fact in the proof context. This is more appropriate than the
2697 (historical) "prems", which refers to all assumptions of the current
2698 context, including those from the target locale, proof body etc.
2700 * Isar: 'print_statement' prints theorems from the current theory or
2701 proof context in long statement form, according to the syntax of a
2704 * Isar: 'obtain' takes an optional case name for the local context
2705 introduction rule (default "that").
2707 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2708 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2711 * Pure: syntax "CONST name" produces a fully internalized constant
2712 according to the current context. This is particularly useful for
2713 syntax translations that should refer to internal constant
2714 representations independently of name spaces.
2716 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2717 instead of "FOO ". This allows multiple binder declarations to coexist
2718 in the same context. INCOMPATIBILITY.
2720 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2721 primitive that also works in a locale context (both for constants and
2722 fixed variables). Type declaration and internal syntactic representation
2723 of given constants retrieved from the context. Likewise, the
2724 'no_notation' command allows to remove given syntax annotations from the
2727 * Isar/locales: new derived specification elements 'axiomatization',
2728 'definition', 'abbreviation', which support type-inference, admit
2729 object-level specifications (equality, equivalence). See also the
2730 isar-ref manual. Examples:
2733 eq (infix "===" 50) where
2734 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2736 definition "f x y = x + y + 1"
2737 definition g where "g x = f x x"
2740 neq (infix "=!=" 50) where
2741 "x =!= y == ~ (x === y)"
2743 These specifications may be also used in a locale context. Then the
2744 constants being introduced depend on certain fixed parameters, and the
2745 constant name is qualified by the locale base name. An internal
2746 abbreviation takes care for convenient input and output, making the
2747 parameters implicit and using the original short name. See also
2748 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2749 entities from a monomorphic theory.
2751 Presently, abbreviations are only available 'in' a target locale, but
2752 not inherited by general import expressions. Also note that
2753 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2754 'translations' in common applications. The "no_abbrevs" print mode
2755 prevents folding of abbreviations in term output.
2757 Concrete syntax is attached to specified constants in internal form,
2758 independently of name spaces. The parse tree representation is
2759 slightly different -- use 'notation' instead of raw 'syntax', and
2760 'translations' with explicit "CONST" markup to accommodate this.
2762 * Pure/Isar: unified syntax for new-style specification mechanisms
2763 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2764 full type inference and dummy patterns ("_"). For example:
2766 definition "K x _ = x"
2768 inductive conj for A B
2769 where "A ==> B ==> conj A B"
2771 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2772 the current context. Print mode "no_abbrevs" prevents inversion of
2773 abbreviations on output.
2775 * Isar/locales: improved parameter handling: use of locales "var" and
2776 "struct" no longer necessary; - parameter renamings are no longer
2777 required to be injective. For example, this allows to define
2778 endomorphisms as locale endom = homom mult mult h.
2780 * Isar/locales: changed the way locales with predicates are defined.
2781 Instead of accumulating the specification, the imported expression is
2782 now an interpretation. INCOMPATIBILITY: different normal form of
2783 locale expressions. In particular, in interpretations of locales with
2784 predicates, goals repesenting already interpreted fragments are not
2785 removed automatically. Use methods `intro_locales' and
2786 `unfold_locales'; see below.
2788 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2789 provide backward reasoning on locales predicates. The methods are
2790 aware of interpretations and discharge corresponding goals.
2791 `intro_locales' is less aggressive then `unfold_locales' and does not
2792 unfold predicates to assumptions.
2794 * Isar/locales: the order in which locale fragments are accumulated
2795 has changed. This enables to override declarations from fragments due
2796 to interpretations -- for example, unwanted simp rules.
2798 * Isar/locales: interpretation in theories and proof contexts has been
2799 extended. One may now specify (and prove) equations, which are
2800 unfolded in interpreted theorems. This is useful for replacing
2801 defined concepts (constants depending on locale parameters) by
2802 concepts already existing in the target context. Example:
2804 interpretation partial_order ["op <= :: [int, int] => bool"]
2805 where "partial_order.less (op <=) (x::int) y = (x < y)"
2807 Typically, the constant `partial_order.less' is created by a
2808 definition specification element in the context of locale
2811 * Method "induct": improved internal context management to support
2812 local fixes and defines on-the-fly. Thus explicit meta-level
2813 connectives !! and ==> are rarely required anymore in inductive goals
2814 (using object-logic connectives for this purpose has been long
2815 obsolete anyway). Common proof patterns are explained in
2816 src/HOL/Induct/Common_Patterns.thy, see also
2817 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2820 * Method "induct": improved handling of simultaneous goals. Instead of
2821 introducing object-level conjunction, the statement is now split into
2822 several conclusions, while the corresponding symbolic cases are nested
2823 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2824 see src/HOL/Induct/Common_Patterns.thy, for example.
2826 * Method "induct": mutual induction rules are now specified as a list
2827 of rule sharing the same induction cases. HOL packages usually provide
2828 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2829 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2830 mutual induction rules differently, i.e. like this:
2832 (induct rule: foo_bar.inducts)
2833 (induct set: foo bar)
2834 (induct pred: foo bar)
2835 (induct type: foo bar)
2837 The ML function ProjectRule.projections turns old-style rules into the
2840 * Method "coinduct": dual of induction, see
2841 src/HOL/Library/Coinductive_List.thy for various examples.
2843 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2844 considered a legacy feature.
2846 * Attribute "symmetric" produces result with standardized schematic
2847 variables (index 0). Potential INCOMPATIBILITY.
2849 * Simplifier: by default the simplifier trace only shows top level
2850 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2851 default. Thus there is less danger of being flooded by the trace. The
2852 trace indicates where parts have been suppressed.
2854 * Provers/classical: removed obsolete classical version of elim_format
2855 attribute; classical elim/dest rules are now treated uniformly when
2856 manipulating the claset.
2858 * Provers/classical: stricter checks to ensure that supplied intro,
2859 dest and elim rules are well-formed; dest and elim rules must have at
2862 * Provers/classical: attributes dest/elim/intro take an optional
2863 weight argument for the rule (just as the Pure versions). Weights are
2864 ignored by automated tools, but determine the search order of single
2867 * Syntax: input syntax now supports dummy variable binding "%_. b",
2868 where the body does not mention the bound variable. Note that dummy
2869 patterns implicitly depend on their context of bounds, which makes
2870 "{_. _}" match any set comprehension as expected. Potential
2871 INCOMPATIBILITY -- parse translations need to cope with syntactic
2872 constant "_idtdummy" in the binding position.
2874 * Syntax: removed obsolete syntactic constant "_K" and its associated
2875 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2876 for example "A -> B" => "Pi A (%_. B)".
2878 * Pure: 'class_deps' command visualizes the subclass relation, using
2879 the graph browser tool.
2881 * Pure: 'print_theory' now suppresses certain internal declarations by
2882 default; use '!' option for full details.
2887 * Method "metis" proves goals by applying the Metis general-purpose
2888 resolution prover (see also http://gilith.com/software/metis/).
2889 Examples are in the directory MetisExamples. WARNING: the
2890 Isabelle/HOL-Metis integration does not yet work properly with
2893 * Command 'sledgehammer' invokes external automatic theorem provers as
2894 background processes. It generates calls to the "metis" method if
2895 successful. These can be pasted into the proof. Users do not have to
2896 wait for the automatic provers to return. WARNING: does not really
2897 work with multi-threading.
2899 * New "auto_quickcheck" feature tests outermost goal statements for
2900 potential counter-examples. Controlled by ML references
2901 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2902 5000 milliseconds). Fails silently if statements is outside of
2903 executable fragment, or any other codgenerator problem occurs.
2905 * New constant "undefined" with axiom "undefined x = undefined".
2907 * Added class "HOL.eq", allowing for code generation with polymorphic
2910 * Some renaming of class constants due to canonical name prefixing in
2911 the new 'class' package:
2913 HOL.abs ~> HOL.abs_class.abs
2914 HOL.divide ~> HOL.divide_class.divide
2915 0 ~> HOL.zero_class.zero
2916 1 ~> HOL.one_class.one
2917 op + ~> HOL.plus_class.plus
2918 op - ~> HOL.minus_class.minus
2919 uminus ~> HOL.minus_class.uminus
2920 op * ~> HOL.times_class.times
2921 op < ~> HOL.ord_class.less
2922 op <= > HOL.ord_class.less_eq
2923 Nat.power ~> Power.power_class.power
2924 Nat.size ~> Nat.size_class.size
2925 Numeral.number_of ~> Numeral.number_class.number_of
2926 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2927 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2928 Orderings.min ~> Orderings.ord_class.min
2929 Orderings.max ~> Orderings.ord_class.max
2930 Divides.op div ~> Divides.div_class.div
2931 Divides.op mod ~> Divides.div_class.mod
2932 Divides.op dvd ~> Divides.div_class.dvd
2934 INCOMPATIBILITY. Adaptions may be required in the following cases:
2936 a) User-defined constants using any of the names "plus", "minus",
2937 "times", "less" or "less_eq". The standard syntax translations for
2938 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2941 b) Variables named "plus", "minus", "times", "less", "less_eq"
2942 INCOMPATIBILITY: use more specific names.
2944 c) Permutative equations (e.g. "a + b = b + a")
2945 Since the change of names also changes the order of terms, permutative
2946 rewrite rules may get applied in a different order. Experience shows
2947 that this is rarely the case (only two adaptions in the whole Isabelle
2948 distribution). INCOMPATIBILITY: rewrite proofs
2950 d) ML code directly refering to constant names
2951 This in general only affects hand-written proof tactics, simprocs and
2952 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2953 Consider using @{const_name} antiquotation.
2955 * New class "default" with associated constant "default".
2957 * Function "sgn" is now overloaded and available on int, real, complex
2958 (and other numeric types), using class "sgn". Two possible defs of
2959 sgn are given as equational assumptions in the classes sgn_if and
2960 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2963 * Locale "partial_order" now unified with class "order" (cf. theory
2964 Orderings), added parameter "less". INCOMPATIBILITY.
2966 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2967 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2968 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2970 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2971 changed order of proof goals in instance proofs.
2973 * The transitivity reasoner for partial and linear orders is set up
2974 for classes "order" and "linorder". Instances of the reasoner are available
2975 in all contexts importing or interpreting the corresponding locales.
2976 Method "order" invokes the reasoner separately; the reasoner
2977 is also integrated with the Simplifier as a solver. Diagnostic
2978 command 'print_orders' shows the available instances of the reasoner
2979 in the current context.
2981 * Localized monotonicity predicate in theory "Orderings"; integrated
2982 lemmas max_of_mono and min_of_mono with this predicate.
2985 * Formulation of theorem "dense" changed slightly due to integration
2986 with new class dense_linear_order.
2988 * Uniform lattice theory development in HOL.
2990 constants "meet" and "join" now named "inf" and "sup"
2991 constant "Meet" now named "Inf"
2993 classes "meet_semilorder" and "join_semilorder" now named
2994 "lower_semilattice" and "upper_semilattice"
2995 class "lorder" now named "lattice"
2996 class "comp_lat" now named "complete_lattice"
2998 Instantiation of lattice classes allows explicit definitions
2999 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3001 INCOMPATIBILITY. Theorem renames:
3003 meet_left_le ~> inf_le1
3004 meet_right_le ~> inf_le2
3005 join_left_le ~> sup_ge1
3006 join_right_le ~> sup_ge2
3007 meet_join_le ~> inf_sup_ord
3010 le_meet ~> le_inf_iff
3011 le_join ~> ge_sup_conv
3012 meet_idempotent ~> inf_idem
3013 join_idempotent ~> sup_idem
3014 meet_comm ~> inf_commute
3015 join_comm ~> sup_commute
3016 meet_leI1 ~> le_infI1
3017 meet_leI2 ~> le_infI2
3018 le_joinI1 ~> le_supI1
3019 le_joinI2 ~> le_supI2
3020 meet_assoc ~> inf_assoc
3021 join_assoc ~> sup_assoc
3022 meet_left_comm ~> inf_left_commute
3023 meet_left_idempotent ~> inf_left_idem
3024 join_left_comm ~> sup_left_commute
3025 join_left_idempotent ~> sup_left_idem
3028 le_def_meet ~> le_iff_inf
3029 le_def_join ~> le_iff_sup
3030 join_absorp2 ~> sup_absorb2
3031 join_absorp1 ~> sup_absorb1
3032 meet_absorp1 ~> inf_absorb1
3033 meet_absorp2 ~> inf_absorb2
3034 meet_join_absorp ~> inf_sup_absorb
3035 join_meet_absorp ~> sup_inf_absorb
3036 distrib_join_le ~> distrib_sup_le
3037 distrib_meet_le ~> distrib_inf_le
3039 add_meet_distrib_left ~> add_inf_distrib_left
3040 add_join_distrib_left ~> add_sup_distrib_left
3041 is_join_neg_meet ~> is_join_neg_inf
3042 is_meet_neg_join ~> is_meet_neg_sup
3043 add_meet_distrib_right ~> add_inf_distrib_right
3044 add_join_distrib_right ~> add_sup_distrib_right
3045 add_meet_join_distribs ~> add_sup_inf_distribs
3046 join_eq_neg_meet ~> sup_eq_neg_inf
3047 meet_eq_neg_join ~> inf_eq_neg_sup
3048 add_eq_meet_join ~> add_eq_inf_sup
3049 meet_0_imp_0 ~> inf_0_imp_0
3050 join_0_imp_0 ~> sup_0_imp_0
3051 meet_0_eq_0 ~> inf_0_eq_0
3052 join_0_eq_0 ~> sup_0_eq_0
3053 neg_meet_eq_join ~> neg_inf_eq_sup
3054 neg_join_eq_meet ~> neg_sup_eq_inf
3055 join_eq_if ~> sup_eq_if
3057 mono_meet ~> mono_inf
3058 mono_join ~> mono_sup
3059 meet_bool_eq ~> inf_bool_eq
3060 join_bool_eq ~> sup_bool_eq
3061 meet_fun_eq ~> inf_fun_eq
3062 join_fun_eq ~> sup_fun_eq
3063 meet_set_eq ~> inf_set_eq
3064 join_set_eq ~> sup_set_eq
3065 meet1_iff ~> inf1_iff
3066 meet2_iff ~> inf2_iff
3075 join1_iff ~> sup1_iff
3076 join2_iff ~> sup2_iff
3086 is_meet_Meet ~> is_meet_Inf
3087 Meet_bool_def ~> Inf_bool_def
3088 Meet_fun_def ~> Inf_fun_def
3089 Meet_greatest ~> Inf_greatest
3090 Meet_lower ~> Inf_lower
3091 Meet_set_def ~> Inf_set_def
3094 Sup_bool_eq ~> Sup_bool_def
3095 Sup_fun_eq ~> Sup_fun_def
3096 Sup_set_eq ~> Sup_set_def
3098 listsp_meetI ~> listsp_infI
3099 listsp_meet_eq ~> listsp_inf_eq
3104 * Added syntactic class "size"; overloaded constant "size" now has
3105 type "'a::size ==> bool"
3107 * Internal reorganisation of `size' of datatypes: size theorems
3108 "foo.size" are no longer subsumed by "foo.simps" (but are still
3109 simplification rules by default!); theorems "prod.size" now named
3112 * Class "div" now inherits from class "times" rather than "type".
3115 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3116 Linorder etc. have disappeared; operations defined in terms of
3117 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3119 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3121 * HOL-Word: New extensive library and type for generic, fixed size
3122 machine words, with arithemtic, bit-wise, shifting and rotating
3123 operations, reflection into int, nat, and bool lists, automation for
3124 linear arithmetic (by automatic reflection into nat or int), including
3125 lemmas on overflow and monotonicity. Instantiated to all appropriate
3126 arithmetic type classes, supporting automatic simplification of
3127 numerals on all operations.
3129 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3131 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3133 * Code generator library theories:
3134 - Code_Integer represents HOL integers by big integer literals in target
3136 - Code_Char represents HOL characters by character literals in target
3138 - Code_Char_chr like Code_Char, but also offers treatment of character
3139 codes; includes Code_Integer.
3140 - Executable_Set allows to generate code for finite sets using lists.
3141 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3143 - Executable_Real implements a subset of real numbers, namly those
3144 representable by rational numbers.
3145 - Efficient_Nat implements natural numbers by integers, which in general will
3146 result in higher efficency; pattern matching with 0/Suc is eliminated;
3147 includes Code_Integer.
3148 - Code_Index provides an additional datatype index which is mapped to
3149 target-language built-in integers.
3150 - Code_Message provides an additional datatype message_string which is isomorphic to
3151 strings; messages are mapped to target-language strings.
3153 * New package for inductive predicates
3155 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3158 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3159 for z_1 :: U_1 and ... and z_n :: U_m
3161 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3164 with full support for type-inference, rather than
3166 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3168 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3169 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3171 inductive "s z_1 ... z_m"
3173 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3176 For backward compatibility, there is a wrapper allowing inductive
3177 sets to be defined with the new package via
3180 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3181 for z_1 :: U_1 and ... and z_n :: U_m
3183 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3189 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3190 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3191 for z_1 :: U_1 and ... and z_n :: U_m
3193 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3194 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3197 if the additional syntax "p ..." is required.
3199 Numerous examples can be found in the subdirectories src/HOL/Auth,
3200 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3204 - Since declaration and definition of inductive sets or predicates
3205 is no longer separated, abbreviations involving the newly
3206 introduced sets or predicates must be specified together with the
3207 introduction rules after the 'where' keyword (see above), rather
3208 than before the actual inductive definition.
3210 - The variables in induction and elimination rules are now
3211 quantified in the order of their occurrence in the introduction
3212 rules, rather than in alphabetical order. Since this may break
3213 some proofs, these proofs either have to be repaired, e.g. by
3214 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3215 statements of the form
3217 case (rule_i a_i_1 ... a_i_{k_i})
3219 or the old order of quantification has to be restored by explicitly adding
3220 meta-level quantifiers in the introduction rules, i.e.
3222 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3224 - The format of the elimination rules is now
3226 p z_1 ... z_m x_1 ... x_n ==>
3227 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3232 (x_1, ..., x_n) : s z_1 ... z_m ==>
3233 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3236 for sets rather than
3238 x : s z_1 ... z_m ==>
3239 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3242 This may require terms in goals to be expanded to n-tuples
3243 (e.g. using case_tac or simplification with the split_paired_all
3244 rule) before the above elimination rule is applicable.
3246 - The elimination or case analysis rules for (mutually) inductive
3247 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3248 list of rules "p_1_..._p_k.elims" is no longer available.
3250 * New package "function"/"fun" for general recursive functions,
3251 supporting mutual and nested recursion, definitions in local contexts,
3252 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3253 for small examples, and the separate tutorial on the function
3254 package. The old recdef "package" is still available as before, but
3255 users are encouraged to use the new package.
3257 * Method "lexicographic_order" automatically synthesizes termination
3258 relations as lexicographic combinations of size measures.
3260 * Case-expressions allow arbitrary constructor-patterns (including
3261 "_") and take their order into account, like in functional
3262 programming. Internally, this is translated into nested
3263 case-expressions; missing cases are added and mapped to the predefined
3264 constant "undefined". In complicated cases printing may no longer show
3265 the original input but the internal form. Lambda-abstractions allow
3266 the same form of pattern matching: "% pat1 => e1 | ..." is an
3267 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3270 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3271 is an abbreviation for "of_nat :: nat => int". The simplification
3272 rules for "of_nat" have been changed to work like "int" did
3273 previously. Potential INCOMPATIBILITY:
3274 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3275 - of_nat_diff and of_nat_mult are no longer default simp rules
3277 * Method "algebra" solves polynomial equations over (semi)rings using
3278 Groebner bases. The (semi)ring structure is defined by locales and the
3279 tool setup depends on that generic context. Installing the method for
3280 a specific type involves instantiating the locale and possibly adding
3281 declarations for computation on the coefficients. The method is
3282 already instantiated for natural numbers and for the axiomatic class
3283 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3284 CALCULEMUS 2007 for the general principles underlying this
3285 architecture of context-aware proof-tools.
3287 * Method "ferrack" implements quantifier elimination over
3288 special-purpose dense linear orders using locales (analogous to
3289 "algebra"). The method is already installed for class
3290 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3293 * Former constant "List.op @" now named "List.append". Use ML
3294 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3295 circumvent possible incompatibilities when working on ML level.
3297 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3299 * New function listsum :: 'a list => 'a for arbitrary monoids.
3300 Special syntax: "SUM x <- xs. f x" (and latex variants)
3302 * New syntax for Haskell-like list comprehension (input only), eg.
3303 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3305 * The special syntax for function "filter" has changed from [x :
3306 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3307 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3309 * [a..b] is now defined for arbitrary linear orders. It used to be
3310 defined on nat only, as an abbreviation for [a..<Suc b]
3313 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3315 * New functions "sorted" and "sort" in src/HOL/List.thy.
3317 * New lemma collection field_simps (an extension of ring_simps) for
3318 manipulating (in)equations involving division. Multiplies with all
3319 denominators that can be proved to be non-zero (in equations) or
3320 positive/negative (in inequations).
3322 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3323 have been improved and renamed to ring_simps, group_simps and
3324 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3325 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3327 * Theory Library/Commutative_Ring: switched from recdef to function
3328 package; constants add, mul, pow now curried. Infix syntax for
3329 algebraic operations.
3331 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3334 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3337 * HOL/records: generalised field-update to take a function on the
3338 field rather than the new value: r(|A := x|) is translated to A_update
3339 (K x) r The K-combinator that is internally used is called K_record.
3340 INCOMPATIBILITY: Usage of the plain update functions has to be
3343 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3344 * x = 0, which are required for a semiring. Richer structures do not
3345 inherit from semiring_0 anymore, because this property is a theorem
3346 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3347 there is more to prove, but this is mostly trivial.
3349 * Class "recpower" is generalized to arbitrary monoids, not just
3350 commutative semirings. INCOMPATIBILITY: may need to incorporate
3351 commutativity or semiring properties additionally.
3353 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3354 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3355 better use 'abbreviation'.
3357 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3359 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3360 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3361 significant changes for setting up numeral syntax for types:
3362 - New constants Numeral.pred and Numeral.succ instead
3363 of former Numeral.bin_pred and Numeral.bin_succ.
3364 - Use integer operations instead of bin_add, bin_mult and so on.
3365 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3366 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3368 See src/HOL/Integ/IntArith.thy for an example setup.
3370 * Command 'normal_form' computes the normal form of a term that may
3371 contain free variables. For example ``normal_form "rev [a, b, c]"''
3372 produces ``[b, c, a]'' (without proof). This command is suitable for
3373 heavy-duty computations because the functions are compiled to ML
3374 first. Correspondingly, a method "normalization" is provided. See
3375 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3377 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3378 25 like -->); output depends on the "iff" print_mode, the default is
3379 "A = B" (with priority 50).
3381 * Relations less (<) and less_eq (<=) are also available on type bool.
3382 Modified syntax to disallow nesting without explicit parentheses,
3383 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3386 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3388 * Relation composition operator "op O" now has precedence 75 and binds
3389 stronger than union and intersection. INCOMPATIBILITY.
3391 * The old set interval syntax "{m..n(}" (and relatives) has been
3392 removed. Use "{m..<n}" (and relatives) instead.
3394 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3395 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3396 ``declare [[simproc del: neq]]''.
3398 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3401 * Theorem Cons_eq_map_conv no longer declared as "simp".
3403 * Theorem setsum_mult renamed to setsum_right_distrib.
3405 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3408 * Reimplemented methods "sat" and "satx", with several improvements:
3409 goals no longer need to be stated as "<prems> ==> False", equivalences
3410 (i.e. "=" on type bool) are handled, variable names of the form
3411 "lit_<n>" are no longer reserved, significant speedup.
3413 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3414 zChaff is still supported as well.
3416 * 'inductive' and 'datatype': provide projections of mutual rules,
3417 bundled as foo_bar.inducts;
3419 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3422 * Library: moved theory Accessible_Part to main HOL.
3424 * Library: added theory Coinductive_List of potentially infinite lists
3425 as greatest fixed-point.
3427 * Library: added theory AssocList which implements (finite) maps as
3430 * Method "evaluation" solves goals (i.e. a boolean expression)
3431 efficiently by compiling it to ML. The goal is "proved" (via an
3432 oracle) if it evaluates to True.
3434 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3435 also when invoked by the simplifier. This results in the Simplifier
3436 being more powerful on arithmetic goals. INCOMPATIBILITY.
3437 Configuration option fast_arith_split_limit=0 recovers the old
3440 * Support for hex (0x20) and binary (0b1001) numerals.
3442 * New method: reify eqs (t), where eqs are equations for an
3443 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3444 parameter, computes a term s::'b and a list xs::'a list and proves the
3445 theorem I xs s = t. This is also known as reification or quoting. The
3446 resulting theorem is applied to the subgoal to substitute t with I xs
3447 s. If t is omitted, the subgoal itself is reified.
3449 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3450 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3451 where f is supposed to be a computable function (in the sense of code
3452 generattion). The method uses reify to compute s and xs as above then
3453 applies corr_thm and uses normalization by evaluation to "prove" f s =
3454 r and finally gets the theorem t = r, which is again applied to the
3455 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3457 * Reflection: Automatic reification now handels binding, an example is
3458 available in src/HOL/ex/ReflectionEx.thy
3460 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3461 command 'statespace' that is similar to 'record', but introduces an
3462 abstract specification based on the locale infrastructure instead of
3463 HOL types. This leads to extra flexibility in composing state spaces,
3464 in particular multiple inheritance and renaming of components.
3469 * Hyperreal: Functions root and sqrt are now defined on negative real
3470 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3471 Nonnegativity side conditions have been removed from many lemmas, so
3472 that more subgoals may now be solved by simplification; potential
3475 * Real: new type classes formalize real normed vector spaces and
3476 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3477 and norm :: 'a => real.
3479 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3480 reals into other types. The overloaded constant Reals :: 'a set is now
3481 defined as range of_real; potential INCOMPATIBILITY.
3483 * Real: proper support for ML code generation, including 'quickcheck'.
3484 Reals are implemented as arbitrary precision rationals.
3486 * Hyperreal: Several constants that previously worked only for the
3487 reals have been generalized, so they now work over arbitrary vector
3488 spaces. Type annotations may need to be added in some cases; potential
3491 Infinitesimal :: ('a::real_normed_vector) star set
3492 HFinite :: ('a::real_normed_vector) star set
3493 HInfinite :: ('a::real_normed_vector) star set
3494 approx :: ('a::real_normed_vector) star => 'a star => bool
3495 monad :: ('a::real_normed_vector) star => 'a star set
3496 galaxy :: ('a::real_normed_vector) star => 'a star set
3497 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3498 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3499 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3500 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3501 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3502 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3503 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3504 sgn :: 'a::real_normed_vector => 'a
3505 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3507 * Complex: Some complex-specific constants are now abbreviations for
3508 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3509 hnorm. Other constants have been entirely removed in favor of the
3510 polymorphic versions (INCOMPATIBILITY):
3514 HInfinite <-- CInfinite
3515 Infinitesimal <-- CInfinitesimal
3518 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3519 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3520 (ns)deriv <-- (ns)cderiv
3525 * Formalisation of ideals and the quotient construction over rings.
3527 * Order and lattice theory no longer based on records.
3530 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3531 greatest_closed. INCOMPATIBILITY.
3533 * Method algebra is now set up via an attribute. For examples see
3534 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3535 of algebraic structures.
3537 * Renamed theory CRing to Ring.
3542 * Substantial, yet incomplete support for nominal datatypes (binding
3543 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3544 src/HOL/Nominal/Examples. Prospective users should consult
3545 http://isabelle.in.tum.de/nominal/
3550 * ML basics: just one true type int, which coincides with IntInf.int
3553 * ML within Isar: antiquotations allow to embed statically-checked
3554 formal entities in the source, referring to the context available at
3555 compile-time. For example:
3557 ML {* @{sort "{zero,one}"} *}
3558 ML {* @{typ "'a => 'b"} *}
3559 ML {* @{term "%x. x"} *}
3560 ML {* @{prop "x == y"} *}
3561 ML {* @{ctyp "'a => 'b"} *}
3562 ML {* @{cterm "%x. x"} *}
3563 ML {* @{cprop "x == y"} *}
3564 ML {* @{thm asm_rl} *}
3565 ML {* @{thms asm_rl} *}
3566 ML {* @{type_name c} *}
3567 ML {* @{type_syntax c} *}
3568 ML {* @{const_name c} *}
3569 ML {* @{const_syntax c} *}
3572 ML {* @{theory Pure} *}
3573 ML {* @{theory_ref} *}
3574 ML {* @{theory_ref Pure} *}
3577 ML {* @{clasimpset} *}
3579 The same works for sources being ``used'' within an Isar context.
3581 * ML in Isar: improved error reporting; extra verbosity with
3582 ML_Context.trace enabled.
3584 * Pure/General/table.ML: the join operations now works via exceptions
3585 DUP/SAME instead of type option. This is simpler in simple cases, and
3586 admits slightly more efficient complex applications.
3588 * Pure: 'advanced' translation functions (parse_translation etc.) now
3589 use Context.generic instead of just theory.
3591 * Pure: datatype Context.generic joins theory/Proof.context and
3592 provides some facilities for code that works in either kind of
3593 context, notably GenericDataFun for uniform theory and proof data.
3595 * Pure: simplified internal attribute type, which is now always
3596 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3597 local (Proof.context) attributes have been discontinued, while
3598 minimizing code duplication. Thm.rule_attribute and
3599 Thm.declaration_attribute build canonical attributes; see also structure
3600 Context for further operations on Context.generic, notably
3601 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3602 declarations and definitions.
3604 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3605 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3606 init only required for impure data. INCOMPATIBILITY: empty really need
3607 to be empty (no dependencies on theory content!)
3609 * Pure/kernel: consts certification ignores sort constraints given in
3610 signature declarations. (This information is not relevant to the
3611 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3612 potential INCOMPATIBILITY.
3614 * Pure: axiomatic type classes are now purely definitional, with
3615 explicit proofs of class axioms and super class relations performed
3616 internally. See Pure/axclass.ML for the main internal interfaces --
3617 notably AxClass.define_class supercedes AxClass.add_axclass, and
3618 AxClass.axiomatize_class/classrel/arity supersede
3619 Sign.add_classes/classrel/arities.
3621 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3622 global/local versions on theory vs. Proof.context have been
3623 discontinued; Attrib.syntax and Method.syntax have been adapted
3624 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3625 attributes, methods, etc.
3627 * Pure: several functions of signature "... -> theory -> theory * ..."
3628 have been reoriented to "... -> theory -> ... * theory" in order to
3629 allow natural usage in combination with the ||>, ||>>, |-> and
3630 fold_map combinators.
3632 * Pure: official theorem names (closed derivations) and additional
3633 comments (tags) are now strictly separate. Name hints -- which are
3634 maintained as tags -- may be attached any time without affecting the
3637 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3638 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3639 achieve the old behaviour.
3641 * Pure: the "Goal" constant is now called "prop", supporting a
3642 slightly more general idea of ``protecting'' meta-level rule
3645 * Pure: Logic.(un)varify only works in a global context, which is now
3646 enforced instead of silently assumed. INCOMPATIBILITY, may use
3647 Logic.legacy_(un)varify as temporary workaround.
3649 * Pure: structure Name provides scalable operations for generating
3650 internal variable names, notably Name.variants etc. This replaces
3651 some popular functions from term.ML:
3653 Term.variant -> Name.variant
3654 Term.variantlist -> Name.variant_list
3655 Term.invent_names -> Name.invent_list
3657 Note that low-level renaming rarely occurs in new code -- operations
3658 from structure Variable are used instead (see below).
3660 * Pure: structure Variable provides fundamental operations for proper
3661 treatment of fixed/schematic variables in a context. For example,
3662 Variable.import introduces fixes for schematics of given facts and
3663 Variable.export reverses the effect (up to renaming) -- this replaces
3664 various freeze_thaw operations.
3666 * Pure: structure Goal provides simple interfaces for
3667 init/conclude/finish and tactical prove operations (replacing former
3668 Tactic.prove). Goal.prove is the canonical way to prove results
3669 within a given context; Goal.prove_global is a degraded version for
3670 theory level goals, including a global Drule.standard. Note that
3671 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3672 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3673 in a locale context).
3675 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3676 and type checking (Syntax.check_term etc.), with common combinations
3677 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3678 which are considered legacy and await removal.
3680 * Pure/Syntax: generic interfaces for type unchecking
3681 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3682 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3683 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3684 available for convenience, but refer to the very same operations using
3685 a mere theory instead of a full context.
3687 * Isar: simplified treatment of user-level errors, using exception
3688 ERROR of string uniformly. Function error now merely raises ERROR,
3689 without any side effect on output channels. The Isar toplevel takes
3690 care of proper display of ERROR exceptions. ML code may use plain
3691 handle/can/try; cat_error may be used to concatenate errors like this:
3693 ... handle ERROR msg => cat_error msg "..."
3695 Toplevel ML code (run directly or through the Isar toplevel) may be
3696 embedded into the Isar toplevel with exception display/debug like
3699 Isar.toplevel (fn () => ...)
3701 INCOMPATIBILITY, removed special transform_error facilities, removed
3702 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3703 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3704 -- use plain ERROR instead.
3706 * Isar: theory setup now has type (theory -> theory), instead of a
3707 list. INCOMPATIBILITY, may use #> to compose setup functions.
3709 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3710 ProofContext.debug/verbose flags.
3712 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3713 theory before entering a proof state. Transactions now always see a
3714 quasi-functional intermediate checkpoint, both in interactive and
3717 * Isar: simplified interfaces for outer syntax. Renamed
3718 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3719 OuterSyntax.add_parsers -- this functionality is now included in
3720 OuterSyntax.command etc. INCOMPATIBILITY.
3722 * Simplifier: the simpset of a running simplification process now
3723 contains a proof context (cf. Simplifier.the_context), which is the
3724 very context that the initial simpset has been retrieved from (by
3725 simpset_of/local_simpset_of). Consequently, all plug-in components
3726 (solver, looper etc.) may depend on arbitrary proof data.
3728 * Simplifier.inherit_context inherits the proof context (plus the
3729 local bounds) of the current simplification process; any simproc
3730 etc. that calls the Simplifier recursively should do this! Removed
3731 former Simplifier.inherit_bounds, which is already included here --
3732 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3733 specify an explicit context using Simplifier.context/theory_context.
3735 * Simplifier/Classical Reasoner: more abstract interfaces
3736 change_simpset/claset for modifying the simpset/claset reference of a
3737 theory; raw versions simpset/claset_ref etc. have been discontinued --
3740 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3746 * settings: the default heap location within ISABELLE_HOME_USER now
3747 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3748 Isabelle installations.
3750 * isabelle-process: option -S (secure mode) disables some critical
3751 operations, notably runtime compilation and evaluation of ML source
3754 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3756 * Support for parallel execution, using native multicore support of
3757 Poly/ML 5.1. The theory loader exploits parallelism when processing
3758 independent theories, according to the given theory header
3759 specifications. The maximum number of worker threads is specified via
3760 usedir option -M or the "max-threads" setting in Proof General. A
3761 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3762 to 6 on a 8-core machine. User-code needs to observe certain
3763 guidelines for thread-safe programming, see appendix A in the Isar
3764 Implementation manual.
3768 New in Isabelle2005 (October 2005)
3769 ----------------------------------
3773 * Theory headers: the new header syntax for Isar theories is
3776 imports <theory1> ... <theoryN>
3777 uses <file1> ... <fileM>
3780 where the 'uses' part is optional. The previous syntax
3782 theory <name> = <theory1> + ... + <theoryN>:
3784 will disappear in the next release. Use isatool fixheaders to convert
3785 existing theory files. Note that there is no change in ancient
3786 non-Isar theories now, but these will disappear soon.
3788 * Theory loader: parent theories can now also be referred to via
3789 relative and absolute paths.
3791 * Command 'find_theorems' searches for a list of criteria instead of a
3792 list of constants. Known criteria are: intro, elim, dest, name:string,
3793 simp:term, and any term. Criteria can be preceded by '-' to select
3794 theorems that do not match. Intro, elim, dest select theorems that
3795 match the current goal, name:s selects theorems whose fully qualified
3796 name contain s, and simp:term selects all simplification rules whose
3797 lhs match term. Any other term is interpreted as pattern and selects
3798 all theorems matching the pattern. Available in ProofGeneral under
3799 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3801 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3803 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3804 matching the current goal as introduction rule and not having "HOL."
3805 in their name (i.e. not being defined in theory HOL).
3807 * Command 'thms_containing' has been discontinued in favour of
3808 'find_theorems'; INCOMPATIBILITY.
3810 * Communication with Proof General is now 8bit clean, which means that
3811 Unicode text in UTF-8 encoding may be used within theory texts (both
3812 formal and informal parts). Cf. option -U of the Isabelle Proof
3813 General interface. Here are some simple examples (cf. src/HOL/ex):
3815 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3816 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3818 * Improved efficiency of the Simplifier and, to a lesser degree, the
3819 Classical Reasoner. Typical big applications run around 2 times
3823 *** Document preparation ***
3825 * Commands 'display_drafts' and 'print_drafts' perform simple output
3826 of raw sources. Only those symbols that do not require additional
3827 LaTeX packages (depending on comments in isabellesym.sty) are
3828 displayed properly, everything else is left verbatim. isatool display
3829 and isatool print are used as front ends (these are subject to the
3830 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3832 * Command tags control specific markup of certain regions of text,
3833 notably folding and hiding. Predefined tags include "theory" (for
3834 theory begin and end), "proof" for proof commands, and "ML" for
3835 commands involving ML code; the additional tags "visible" and
3836 "invisible" are unused by default. Users may give explicit tag
3837 specifications in the text, e.g. ''by %invisible (auto)''. The
3838 interpretation of tags is determined by the LaTeX job during document
3839 preparation: see option -V of isatool usedir, or options -n and -t of
3840 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3843 Several document versions may be produced at the same time via isatool
3844 usedir (the generated index.html will link all of them). Typical
3845 specifications include ''-V document=theory,proof,ML'' to present
3846 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3847 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3848 these parts without any formal replacement text. The Isabelle site
3849 default settings produce ''document'' and ''outline'' versions as
3852 * Several new antiquotations:
3854 @{term_type term} prints a term with its type annotated;
3856 @{typeof term} prints the type of a term;
3858 @{const const} is the same as @{term const}, but checks that the
3859 argument is a known logical constant;
3861 @{term_style style term} and @{thm_style style thm} print a term or
3862 theorem applying a "style" to it
3866 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3867 definitions, equations, inequations etc., 'concl' printing only the
3868 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3869 to print the specified premise. TermStyle.add_style provides an ML
3870 interface for introducing further styles. See also the "LaTeX Sugar"
3871 document practical applications. The ML antiquotation prints
3872 type-checked ML expressions verbatim.
3874 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3875 and 'text' support optional locale specification '(in loc)', which
3876 specifies the default context for interpreting antiquotations. For
3877 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3879 * Option 'locale=NAME' of antiquotations specifies an alternative
3880 context interpreting the subsequent argument. For example: @{thm
3881 [locale=lattice] inf_assoc}.
3883 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3886 * Proper output of antiquotations for theory commands involving a
3887 proof context (such as 'locale' or 'theorem (in loc) ...').
3889 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3890 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3892 * isatool usedir: new option -C (default true) controls whether option
3893 -D should include a copy of the original document directory; -C false
3894 prevents unwanted effects such as copying of administrative CVS data.
3899 * Considerably improved version of 'constdefs' command. Now performs
3900 automatic type-inference of declared constants; additional support for
3901 local structure declarations (cf. locales and HOL records), see also
3902 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3903 sequential dependencies of definitions within a single 'constdefs'
3904 section; moreover, the declared name needs to be an identifier. If
3905 all fails, consider to fall back on 'consts' and 'defs' separately.
3907 * Improved indexed syntax and implicit structures. First of all,
3908 indexed syntax provides a notational device for subscripted
3909 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3910 expressions. Secondly, in a local context with structure
3911 declarations, number indexes \<^sub>n or the empty index (default
3912 number 1) refer to a certain fixed variable implicitly; option
3913 show_structs controls printing of implicit structures. Typical
3914 applications of these concepts involve record types and locales.
3916 * New command 'no_syntax' removes grammar declarations (and
3917 translations) resulting from the given syntax specification, which is
3918 interpreted in the same manner as for the 'syntax' command.
3920 * 'Advanced' translation functions (parse_translation etc.) may depend
3921 on the signature of the theory context being presently used for
3922 parsing/printing, see also isar-ref manual.
3924 * Improved 'oracle' command provides a type-safe interface to turn an
3925 ML expression of type theory -> T -> term into a primitive rule of
3926 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3927 is already included here); see also FOL/ex/IffExample.thy;
3930 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3931 before); "cI" is no longer bound, use "c.intro" instead.
3932 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3933 axclasses vs. locales.
3935 * Improved internal renaming of symbolic identifiers -- attach primes
3936 instead of base 26 numbers.
3938 * New flag show_question_marks controls printing of leading question
3939 marks in schematic variable names.
3941 * In schematic variable names, *any* symbol following \<^isub> or
3942 \<^isup> is now treated as part of the base name. For example, the
3943 following works without printing of awkward ".0" indexes:
3945 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3948 * Inner syntax includes (*(*nested*) comments*).
3950 * Pretty printer now supports unbreakable blocks, specified in mixfix
3951 annotations as "(00...)".
3953 * Clear separation of logical types and nonterminals, where the latter
3954 may only occur in 'syntax' specifications or type abbreviations.
3955 Before that distinction was only partially implemented via type class
3956 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3957 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3958 exotic syntax specifications may require further adaption
3959 (e.g. Cube/Cube.thy).
3961 * Removed obsolete type class "logic", use the top sort {} instead.
3962 Note that non-logical types should be declared as 'nonterminals'
3963 rather than 'types'. INCOMPATIBILITY for new object-logic
3966 * Attributes 'induct' and 'cases': type or set names may now be
3967 locally fixed variables as well.
3969 * Simplifier: can now control the depth to which conditional rewriting
3970 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3973 * Simplifier: simplification procedures may now take the current
3974 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3975 interface), which is very useful for calling the Simplifier
3976 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3977 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3978 low-level mk_simproc no longer applies Logic.varify internally, to
3979 allow for use in a context of fixed variables.
3981 * thin_tac now works even if the assumption being deleted contains !!
3982 or ==>. More generally, erule now works even if the major premise of
3983 the elimination rule contains !! or ==>.
3985 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3987 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3988 from Pure, which contains all common declarations already. Both
3989 theories are defined via plain Isabelle/Isar .thy files.
3990 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3991 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3992 use isatool fixcpure to adapt your theory and ML sources.
3994 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3995 selections of theorems in named facts via index ranges.
3997 * 'print_theorems': in theory mode, really print the difference
3998 wrt. the last state (works for interactive theory development only),
3999 in proof mode print all local facts (cf. 'print_facts');
4001 * 'hide': option '(open)' hides only base names.
4003 * More efficient treatment of intermediate checkpoints in interactive
4006 * Code generator is now invoked via code_module (incremental code
4007 generation) and code_library (modular code generation, ML structures
4008 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4009 must be quoted when used as identifiers.
4011 * New 'value' command for reading, evaluating and printing terms using
4012 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4013 quoted when used as identifier.
4018 * New commands for the interpretation of locale expressions in
4019 theories (1), locales (2) and proof contexts (3). These generate
4020 proof obligations from the expression specification. After the
4021 obligations have been discharged, theorems of the expression are added
4022 to the theory, target locale or proof context. The synopsis of the
4023 commands is a follows:
4025 (1) interpretation expr inst
4026 (2) interpretation target < expr
4027 (3) interpret expr inst
4029 Interpretation in theories and proof contexts require a parameter
4030 instantiation of terms from the current context. This is applied to
4031 specifications and theorems of the interpreted expression.
4032 Interpretation in locales only permits parameter renaming through the
4033 locale expression. Interpretation is smart in that interpretations
4034 that are active already do not occur in proof obligations, neither are
4035 instantiated theorems stored in duplicate. Use 'print_interps' to
4036 inspect active interpretations of a particular locale. For details,
4037 see the Isar Reference manual. Examples can be found in
4038 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4040 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4041 'interpret' instead.
4043 * New context element 'constrains' for adding type constraints to
4046 * Context expressions: renaming of parameters with syntax
4049 * Locale declaration: 'includes' disallowed.
4051 * Proper static binding of attribute syntax -- i.e. types / terms /
4052 facts mentioned as arguments are always those of the locale definition
4053 context, independently of the context of later invocations. Moreover,
4054 locale operations (renaming and type / term instantiation) are applied
4055 to attribute arguments as expected.
4057 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4058 actual attributes; rare situations may require Attrib.attribute to
4059 embed those attributes into Attrib.src that lack concrete syntax.
4060 Attribute implementations need to cooperate properly with the static
4061 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4062 Attrib.XXX_thm etc. already do the right thing without further
4063 intervention. Only unusual applications -- such as "where" or "of"
4064 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4065 on the context and the facts involved -- may have to assign parsed
4066 values to argument tokens explicitly.
4068 * Changed parameter management in theorem generation for long goal
4069 statements with 'includes'. INCOMPATIBILITY: produces a different
4070 theorem statement in rare situations.
4072 * Locale inspection command 'print_locale' omits notes elements. Use
4073 'print_locale!' to have them included in the output.
4078 * Provers/hypsubst.ML: improved version of the subst method, for
4079 single-step rewriting: it now works in bound variable contexts. New is
4080 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4081 rewrite a different subterm than the original subst method, which is
4082 still available as 'simplesubst'.
4084 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4087 * Provers/trancl.ML: new transitivity reasoner for transitive and
4088 reflexive-transitive closure of relations.
4090 * Provers/blast.ML: new reference depth_limit to make blast's depth
4091 limit (previously hard-coded with a value of 20) user-definable.
4093 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4094 is peformed already. Object-logics merely need to finish their
4095 initial simpset configuration as before. INCOMPATIBILITY.
4100 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4103 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4105 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4106 and x-symbol; use option '-m epsilon' to get it actually printed.
4107 Moreover, the mathematically important symbolic identifier \<epsilon>
4108 becomes available as variable, constant etc. INCOMPATIBILITY,
4110 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4111 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4112 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4113 support corresponding Isar calculations.
4115 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4118 * theory SetInterval: changed the syntax for open intervals:
4127 The old syntax is still supported but will disappear in the next
4128 release. For conversion use the following Emacs search and replace
4129 patterns (these are not perfect but work quite well):
4131 {)\([^\.]*\)\.\. -> {\1<\.\.}
4132 \.\.\([^(}]*\)(} -> \.\.<\1}
4134 * Theory Commutative_Ring (in Library): method comm_ring for proving
4135 equalities in commutative rings; method 'algebra' provides a generic
4138 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4139 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4140 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4143 Some new syntax forms are available:
4145 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4146 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4147 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4148 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4150 The latter form "\<Sum>x < k. e" used to be based on a separate
4151 function "Summation", which has been discontinued.
4153 * theory Finite_Set: in structured induction proofs, the insert case
4154 is now 'case (insert x F)' instead of the old counterintuitive 'case
4157 * The 'refute' command has been extended to support a much larger
4158 fragment of HOL, including axiomatic type classes, constdefs and
4159 typedefs, inductive datatypes and recursion.
4161 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4162 Requires zChaff with proof generation to be installed. See
4163 HOL/ex/SAT_Examples.thy for examples.
4165 * Datatype induction via method 'induct' now preserves the name of the
4166 induction variable. For example, when proving P(xs::'a list) by
4167 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4168 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4169 in unstructured proof scripts.
4171 * Reworked implementation of records. Improved scalability for
4172 records with many fields, avoiding performance problems for type
4173 inference. Records are no longer composed of nested field types, but
4174 of nested extension types. Therefore the record type only grows linear
4175 in the number of extensions and not in the number of fields. The
4176 top-level (users) view on records is preserved. Potential
4177 INCOMPATIBILITY only in strange cases, where the theory depends on the
4178 old record representation. The type generated for a record is called
4179 <record_name>_ext_type.
4181 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4182 proofs triggered by a record definition or a simproc (if
4183 quick_and_dirty is enabled). Definitions of large records can take
4186 New simproc record_upd_simproc for simplification of multiple record
4187 updates enabled by default. Moreover, trivial updates are also
4188 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4189 occasionally, since simplification is more powerful by default.
4191 * typedef: proper support for polymorphic sets, which contain extra
4192 type-variables in the term.
4194 * Simplifier: automatically reasons about transitivity chains
4195 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4196 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4197 old proofs break occasionally as simplification may now solve more
4198 goals than previously.
4200 * Simplifier: converts x <= y into x = y if assumption y <= x is
4201 present. Works for all partial orders (class "order"), in particular
4202 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4205 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4206 bound variable or a constant then the let is unfolded. Otherwise
4207 first a is simplified to b, and then f b is simplified to g. If
4208 possible we abstract b from g arriving at "let x = b in h x",
4209 otherwise we unfold the let and arrive at g. The simproc can be
4210 enabled/disabled by the reference use_let_simproc. Potential
4211 INCOMPATIBILITY since simplification is more powerful by default.
4213 * Classical reasoning: the meson method now accepts theorems as arguments.
4215 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4216 jobs to provide advice on the provability of subgoals.
4218 * Theory OrderedGroup and Ring_and_Field: various additions and
4219 improvements to faciliate calculations involving equalities and
4222 The following theorems have been eliminated or modified
4225 abs_eq now named abs_of_nonneg
4226 abs_of_ge_0 now named abs_of_nonneg
4227 abs_minus_eq now named abs_of_nonpos
4228 imp_abs_id now named abs_of_nonneg
4229 imp_abs_neg_id now named abs_of_nonpos
4230 mult_pos now named mult_pos_pos
4231 mult_pos_le now named mult_nonneg_nonneg
4232 mult_pos_neg_le now named mult_nonneg_nonpos
4233 mult_pos_neg2_le now named mult_nonneg_nonpos2
4234 mult_neg now named mult_neg_neg
4235 mult_neg_le now named mult_nonpos_nonpos
4237 * The following lemmas in Ring_and_Field have been added to the simplifier:
4240 not_square_less_zero
4242 The following lemmas have been deleted from Real/RealPow:
4252 * Theory Parity: added rules for simplifying exponents.
4256 The following theorems have been eliminated or modified
4259 list_all_Nil now named list_all.simps(1)
4260 list_all_Cons now named list_all.simps(2)
4261 list_all_conv now named list_all_iff
4262 set_mem_eq now named mem_iff
4264 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4265 asymptotic "big O" calculations. See the notes in BigO.thy.
4270 * Theory RealDef: better support for embedding natural numbers and
4271 integers in the reals.
4273 The following theorems have been eliminated or modified
4276 exp_ge_add_one_self now requires no hypotheses
4277 real_of_int_add reversed direction of equality (use [symmetric])
4278 real_of_int_minus reversed direction of equality (use [symmetric])
4279 real_of_int_diff reversed direction of equality (use [symmetric])
4280 real_of_int_mult reversed direction of equality (use [symmetric])
4282 * Theory RComplete: expanded support for floor and ceiling functions.
4284 * Theory Ln is new, with properties of the natural logarithm
4286 * Hyperreal: There is a new type constructor "star" for making
4287 nonstandard types. The old type names are now type synonyms:
4291 hcomplex = complex star
4293 * Hyperreal: Many groups of similarly-defined constants have been
4294 replaced by polymorphic versions (INCOMPATIBILITY):
4296 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4298 starset <-- starsetNat, starsetC
4299 *s* <-- *sNat*, *sc*
4300 starset_n <-- starsetNat_n, starsetC_n
4301 *sn* <-- *sNatn*, *scn*
4302 InternalSets <-- InternalNatSets, InternalCSets
4304 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4305 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4306 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4307 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4308 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4310 * Hyperreal: Many type-specific theorems have been removed in favor of
4311 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4313 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4314 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4315 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4316 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4317 right_minus <-- hypreal_add_minus
4318 left_minus <-- {hypreal,hcomplex}_add_minus_left
4319 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4320 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4321 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4322 mult_1_right <-- hcomplex_mult_one_right
4323 mult_zero_left <-- hcomplex_mult_zero_left
4324 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4325 right_distrib <-- hypnat_add_mult_distrib2
4326 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4327 right_inverse <-- hypreal_mult_inverse
4328 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4329 order_refl <-- {hypreal,hypnat}_le_refl
4330 order_trans <-- {hypreal,hypnat}_le_trans
4331 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4332 order_less_le <-- {hypreal,hypnat}_less_le
4333 linorder_linear <-- {hypreal,hypnat}_le_linear
4334 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4335 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4336 add_nonneg_nonneg <-- hypreal_le_add_order
4338 * Hyperreal: Separate theorems having to do with type-specific
4339 versions of constants have been merged into theorems that apply to the
4340 new polymorphic constants (INCOMPATIBILITY):
4342 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4343 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4344 STAR_Un <-- {STAR,NatStar,STARC}_Un
4345 STAR_Int <-- {STAR,NatStar,STARC}_Int
4346 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4347 STAR_subset <-- {STAR,NatStar,STARC}_subset
4348 STAR_mem <-- {STAR,NatStar,STARC}_mem
4349 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4350 STAR_diff <-- {STAR,STARC}_diff
4351 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4352 STARC_hcomplex_of_complex}_image_subset
4353 starset_n_Un <-- starset{Nat,C}_n_Un
4354 starset_n_Int <-- starset{Nat,C}_n_Int
4355 starset_n_Compl <-- starset{Nat,C}_n_Compl
4356 starset_n_diff <-- starset{Nat,C}_n_diff
4357 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4358 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4359 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4360 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4361 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4362 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4363 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4364 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4365 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4366 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4367 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4368 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4369 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4370 starfun_diff <-- starfun{C,RC,CR}_diff
4371 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4372 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4373 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4374 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4375 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4376 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4377 starfun_Id <-- starfunC_Id
4378 starfun_approx <-- starfun{Nat,CR}_approx
4379 starfun_capprox <-- starfun{C,RC}_capprox
4380 starfun_abs <-- starfunNat_rabs
4381 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4382 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4383 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4384 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4385 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4386 starfun_add_approx <-- starfunCR_add_approx
4387 starfun_inverse_inverse <-- starfunC_inverse_inverse
4388 starfun_divide <-- starfun{C,CR,RC}_divide
4389 starfun_n <-- starfun{Nat,C}_n
4390 starfun_n_mult <-- starfun{Nat,C}_n_mult
4391 starfun_n_add <-- starfun{Nat,C}_n_add
4392 starfun_n_add_minus <-- starfunNat_n_add_minus
4393 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4394 starfun_n_minus <-- starfun{Nat,C}_n_minus
4395 starfun_n_eq <-- starfun{Nat,C}_n_eq
4397 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4398 star_n_minus <-- {hypreal,hcomplex}_minus
4399 star_n_diff <-- {hypreal,hcomplex}_diff
4400 star_n_mult <-- {hypreal,hcomplex}_mult
4401 star_n_inverse <-- {hypreal,hcomplex}_inverse
4402 star_n_le <-- {hypreal,hypnat}_le
4403 star_n_less <-- {hypreal,hypnat}_less
4404 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4405 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4406 star_n_abs <-- hypreal_hrabs
4407 star_n_divide <-- hcomplex_divide
4409 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4410 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4411 star_of_diff <-- hypreal_of_real_diff
4412 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4413 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4414 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4415 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4416 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4417 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4418 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4419 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4420 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4421 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4422 star_of_number_of <-- {hypreal,hcomplex}_number_of
4423 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4424 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4425 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4426 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4427 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4428 star_of_power <-- hypreal_of_real_power
4429 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4431 * Hyperreal: new method "transfer" that implements the transfer
4432 principle of nonstandard analysis. With a subgoal that mentions
4433 nonstandard types like "'a star", the command "apply transfer"
4434 replaces it with an equivalent one that mentions only standard types.
4435 To be successful, all free variables must have standard types; non-
4436 standard variables must have explicit universal quantifiers.
4438 * Hyperreal: A theory of Taylor series.
4443 * Discontinued special version of 'constdefs' (which used to support
4444 continuous functions) in favor of the general Pure one with full
4447 * New simplification procedure for solving continuity conditions; it
4448 is much faster on terms with many nested lambda abstractions (cubic
4449 instead of exponential time).
4451 * New syntax for domain package: selector names are now optional.
4452 Parentheses should be omitted unless argument is lazy, for example:
4454 domain 'a stream = cons "'a" (lazy "'a stream")
4456 * New command 'fixrec' for defining recursive functions with pattern
4457 matching; defining multiple functions with mutual recursion is also
4458 supported. Patterns may include the constants cpair, spair, up, sinl,
4459 sinr, or any data constructor defined by the domain package. The given
4460 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4461 syntax and examples.
4463 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4464 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4465 but the proof obligation additionally includes an admissibility
4466 requirement. The packages generate instances of class cpo or pcpo,
4467 with continuity and strictness theorems for Rep and Abs.
4469 * HOLCF: Many theorems have been renamed according to a more standard naming
4470 scheme (INCOMPATIBILITY):
4472 foo_inject: "foo$x = foo$y ==> x = y"
4473 foo_eq: "(foo$x = foo$y) = (x = y)"
4474 foo_less: "(foo$x << foo$y) = (x << y)"
4475 foo_strict: "foo$UU = UU"
4476 foo_defined: "... ==> foo$x ~= UU"
4477 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4482 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4483 including the First Isomorphism Theorem (on quotienting by the kernel
4486 * ZF/Simplifier: install second copy of type solver that actually
4487 makes use of TC rules declared to Isar proof contexts (or locales);
4488 the old version is still required for ML proof scripts.
4493 * Converted to Isar theory format; use locales instead of axiomatic
4499 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4502 * Pure/library.ML no longer defines its own option datatype, but uses
4503 that of the SML basis, which has constructors NONE and SOME instead of
4504 None and Some, as well as exception Option.Option instead of OPTION.
4505 The functions the, if_none, is_some, is_none have been adapted
4506 accordingly, while Option.map replaces apsome.
4508 * Pure/library.ML: the exception LIST has been given up in favour of
4509 the standard exceptions Empty and Subscript, as well as
4510 Library.UnequalLengths. Function like Library.hd and Library.tl are
4511 superceded by the standard hd and tl functions etc.
4513 A number of basic list functions are no longer exported to the ML
4514 toplevel, as they are variants of predefined functions. The following
4515 suggests how one can translate existing code:
4517 rev_append xs ys = List.revAppend (xs, ys)
4518 nth_elem (i, xs) = List.nth (xs, i)
4519 last_elem xs = List.last xs
4520 flat xss = List.concat xss
4521 seq fs = List.app fs
4522 partition P xs = List.partition P xs
4523 mapfilter f xs = List.mapPartial f xs
4525 * Pure/library.ML: several combinators for linear functional
4526 transformations, notably reverse application and composition:
4529 (x, y) |-> f f #-> g
4531 * Pure/library.ML: introduced/changed precedence of infix operators:
4533 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4535 infix 3 o oo ooo oooo;
4536 infix 4 ~~ upto downto;
4538 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4541 * Pure/library.ML: natural list combinators fold, fold_rev, and
4542 fold_map support linear functional transformations and nesting. For
4545 fold f [x1, ..., xN] y =
4546 y |> f x1 |> ... |> f xN
4548 (fold o fold) f [xs1, ..., xsN] y =
4549 y |> fold f xs1 |> ... |> fold f xsN
4551 fold f [x1, ..., xN] =
4554 (fold o fold) f [xs1, ..., xsN] =
4555 fold f xs1 #> ... #> fold f xsN
4557 * Pure/library.ML: the following selectors on type 'a option are
4560 the: 'a option -> 'a (*partial*)
4561 these: 'a option -> 'a where 'a = 'b list
4562 the_default: 'a -> 'a option -> 'a
4563 the_list: 'a option -> 'a list
4565 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4566 basic operations for association lists, following natural argument
4567 order; moreover the explicit equality predicate passed here avoids
4568 potentially expensive polymorphic runtime equality checks.
4569 The old functions may be expressed as follows:
4571 assoc = uncurry (AList.lookup (op =))
4572 assocs = these oo AList.lookup (op =)
4573 overwrite = uncurry (AList.update (op =)) o swap
4575 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4577 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4578 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4580 replacing make_keylist and keyfilter (occassionally used)
4583 make_keylist = AList.make
4584 keyfilter = AList.find (op =)
4586 * eq_fst and eq_snd now take explicit equality parameter, thus
4587 avoiding eqtypes. Naive rewrites:
4589 eq_fst = eq_fst (op =)
4590 eq_snd = eq_snd (op =)
4592 * Removed deprecated apl and apr (rarely used).
4595 apl (n, op) =>>= curry op n
4596 apr (op, m) =>>= fn n => op (n, m)
4598 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4599 provides a reasonably efficient light-weight implementation of sets as
4602 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4603 few new operations; existing lookup and update are now curried to
4604 follow natural argument order (for use with fold etc.);
4605 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4607 * Pure/General: output via the Isabelle channels of
4608 writeln/warning/error etc. is now passed through Output.output, with a
4609 hook for arbitrary transformations depending on the print_mode
4610 (cf. Output.add_mode -- the first active mode that provides a output
4611 function wins). Already formatted output may be embedded into further
4612 text via Output.raw; the result of Pretty.string_of/str_of and derived
4613 functions (string_of_term/cterm/thm etc.) is already marked raw to
4614 accommodate easy composition of diagnostic messages etc. Programmers
4615 rarely need to care about Output.output or Output.raw at all, with
4616 some notable exceptions: Output.output is required when bypassing the
4617 standard channels (writeln etc.), or in token translations to produce
4618 properly formatted results; Output.raw is required when capturing
4619 already output material that will eventually be presented to the user
4620 a second time. For the default print mode, both Output.output and
4621 Output.raw have no effect.
4623 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4624 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4625 cumulative results are displayed at the end of a batch session.
4627 * Pure/General: File.sysify_path and File.quote_sysify path have been
4628 replaced by File.platform_path and File.shell_path (with appropriate
4629 hooks). This provides a clean interface for unusual systems where the
4630 internal and external process view of file names are different.
4632 * Pure: more efficient orders for basic syntactic entities: added
4633 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4634 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4635 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4636 orders now -- potential INCOMPATIBILITY for code that depends on a
4637 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4638 Library.sort_strings on result).
4640 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4641 fold_types traverse types/terms from left to right, observing natural
4642 argument order. Supercedes previous foldl_XXX versions, add_frees,
4643 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4645 * Pure: name spaces have been refined, with significant changes of the
4646 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4647 to extern(_table). The plain name entry path is superceded by a
4648 general 'naming' context, which also includes the 'policy' to produce
4649 a fully qualified name and external accesses of a fully qualified
4650 name; NameSpace.extend is superceded by context dependent
4651 Sign.declare_name. Several theory and proof context operations modify
4652 the naming context. Especially note Theory.restore_naming and
4653 ProofContext.restore_naming to get back to a sane state; note that
4654 Theory.add_path is no longer sufficient to recover from
4655 Theory.absolute_path in particular.
4657 * Pure: new flags short_names (default false) and unique_names
4658 (default true) for controlling output of qualified names. If
4659 short_names is set, names are printed unqualified. If unique_names is
4660 reset, the name prefix is reduced to the minimum required to achieve
4661 the original result when interning again, even if there is an overlap
4662 with earlier declarations.
4664 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4665 now 'extend', and 'merge' gets an additional Pretty.pp argument
4666 (useful for printing error messages). INCOMPATIBILITY.
4668 * Pure: major reorganization of the theory context. Type Sign.sg and
4669 Theory.theory are now identified, referring to the universal
4670 Context.theory (see Pure/context.ML). Actual signature and theory
4671 content is managed as theory data. The old code and interfaces were
4672 spread over many files and structures; the new arrangement introduces
4673 considerable INCOMPATIBILITY to gain more clarity:
4675 Context -- theory management operations (name, identity, inclusion,
4676 parents, ancestors, merge, etc.), plus generic theory data;
4678 Sign -- logical signature and syntax operations (declaring consts,
4679 types, etc.), plus certify/read for common entities;
4681 Theory -- logical theory operations (stating axioms, definitions,
4682 oracles), plus a copy of logical signature operations (consts,
4683 types, etc.); also a few basic management operations (Theory.copy,
4686 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4687 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4688 for convenience -- they merely return the theory.
4690 * Pure: type Type.tsig is superceded by theory in most interfaces.
4692 * Pure: the Isar proof context type is already defined early in Pure
4693 as Context.proof (note that ProofContext.context and Proof.context are
4694 aliases, where the latter is the preferred name). This enables other
4695 Isabelle components to refer to that type even before Isar is present.
4697 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4698 typeK, constK, axiomK, oracleK), but provide explicit operations for
4699 any of these kinds. For example, Sign.intern typeK is now
4700 Sign.intern_type, Theory.hide_space Sign.typeK is now
4701 Theory.hide_types. Also note that former
4702 Theory.hide_classes/types/consts are now
4703 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4704 internalize their arguments! INCOMPATIBILITY.
4706 * Pure: get_thm interface (of PureThy and ProofContext) expects
4707 datatype thmref (with constructors Name and NameSelection) instead of
4708 plain string -- INCOMPATIBILITY;
4710 * Pure: cases produced by proof methods specify options, where NONE
4711 means to remove case bindings -- INCOMPATIBILITY in
4714 * Pure: the following operations retrieve axioms or theorems from a
4715 theory node or theory hierarchy, respectively:
4717 Theory.axioms_of: theory -> (string * term) list
4718 Theory.all_axioms_of: theory -> (string * term) list
4719 PureThy.thms_of: theory -> (string * thm) list
4720 PureThy.all_thms_of: theory -> (string * thm) list
4722 * Pure: print_tac now outputs the goal through the trace channel.
4724 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4725 Reference Toplevel.debug (default false) controls detailed printing
4726 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4727 controls execution profiling -- set to 1 for time and 2 for space
4728 (both increase the runtime).
4730 * Isar session: The initial use of ROOT.ML is now always timed,
4731 i.e. the log will show the actual process times, in contrast to the
4732 elapsed wall-clock time that the outer shell wrapper produces.
4734 * Simplifier: improved handling of bound variables (nameless
4735 representation, avoid allocating new strings). Simprocs that invoke
4736 the Simplifier recursively should use Simplifier.inherit_bounds to
4737 avoid local name clashes. Failure to do so produces warnings
4738 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4739 for further details.
4741 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4742 bindings for all theorems stored within a given theory; this may help
4743 in porting non-Isar theories to Isar ones, while keeping ML proof
4744 scripts for the time being.
4746 * ML operator HTML.with_charset specifies the charset begin used for
4747 generated HTML files. For example:
4749 HTML.with_charset "utf-8" use_thy "Hebrew";
4750 HTML.with_charset "utf-8" use_thy "Chinese";
4755 * Allow symlinks to all proper Isabelle executables (Isabelle,
4756 isabelle, isatool etc.).
4758 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4759 isatool doc, isatool mkdir, display_drafts etc.).
4761 * isatool usedir: option -f allows specification of the ML file to be
4762 used by Isabelle; default is ROOT.ML.
4764 * New isatool version outputs the version identifier of the Isabelle
4765 distribution being used.
4767 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4768 (containing Boolean satisfiability problems) into Isabelle/HOL
4773 New in Isabelle2004 (April 2004)
4774 --------------------------------
4778 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4779 Replaces linorder.ML.
4781 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4782 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4783 (\<a>...\<z>), are now considered normal letters, and can therefore
4784 be used anywhere where an ASCII letter (a...zA...Z) has until
4785 now. COMPATIBILITY: This obviously changes the parsing of some
4786 terms, especially where a symbol has been used as a binder, say
4787 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4788 as an identifier. Fix it by inserting a space around former
4789 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4790 existing theory and ML files.
4792 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4794 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4795 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4796 a normal (but invisible) letter. For multiple letter subscripts repeat
4797 \<^isub> like this: x\<^isub>1\<^isub>2.
4799 * Pure: There are now sub-/superscripts that can span more than one
4800 character. Text between \<^bsub> and \<^esub> is set in subscript in
4801 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4802 superscript. The new control characters are not identifier parts.
4804 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4805 content of "..." to the latex file instead of \isacntrl... . The "..."
4806 may consist of any printable characters excluding the end bracket >.
4808 * Pure: Using new Isar command "finalconsts" (or the ML functions
4809 Theory.add_finals or Theory.add_finals_i) it is now possible to
4810 declare constants "final", which prevents their being given a definition
4811 later. It is useful for constants whose behaviour is fixed axiomatically
4812 rather than definitionally, such as the meta-logic connectives.
4814 * Pure: 'instance' now handles general arities with general sorts
4815 (i.e. intersections of classes),
4817 * Presentation: generated HTML now uses a CSS style sheet to make layout
4818 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4819 It can be changed to alter the colors/layout of generated pages.
4824 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4825 cut_tac, subgoal_tac and thin_tac:
4826 - Now understand static (Isar) contexts. As a consequence, users of Isar
4827 locales are no longer forced to write Isar proof scripts.
4828 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4830 - INCOMPATIBILITY: names of variables to be instantiated may no
4831 longer be enclosed in quotes. Instead, precede variable name with `?'.
4832 This is consistent with the instantiation attribute "where".
4834 * Attributes "where" and "of":
4835 - Now take type variables of instantiated theorem into account when reading
4836 the instantiation string. This fixes a bug that caused instantiated
4837 theorems to have too special types in some circumstances.
4838 - "where" permits explicit instantiations of type variables.
4840 * Calculation commands "moreover" and "also" no longer interfere with
4841 current facts ("this"), admitting arbitrary combinations with "then"
4845 - Goal statements involving the context element "includes" no longer
4846 generate theorems with internal delta predicates (those ending on
4847 "_axioms") in the premise.
4848 Resolve particular premise with <locale>.intro to obtain old form.
4849 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4850 specification and "includes" elements in goal statement.
4851 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4852 [intro?] and [elim?] (respectively) by default.
4853 - Experimental command for instantiation of locales in proof contexts:
4854 instantiate <label>[<attrs>]: <loc>
4855 Instantiates locale <loc> and adds all its theorems to the current context
4856 taking into account their attributes. Label and attrs are optional
4857 modifiers, like in theorem declarations. If present, names of
4858 instantiated theorems are qualified with <label>, and the attributes
4859 <attrs> are applied after any attributes these theorems might have already.
4860 If the locale has assumptions, a chained fact of the form
4861 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4862 are derived. The command does not support old-style locales declared
4863 with "locale (open)".
4864 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4866 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4872 * Proof import: new image HOL4 contains the imported library from
4873 the HOL4 system with about 2500 theorems. It is imported by
4874 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4875 can be used like any other Isabelle image. See
4876 HOL/Import/HOL/README for more information.
4879 - Much improved handling of linear and partial orders.
4880 Reasoners for linear and partial orders are set up for type classes
4881 "linorder" and "order" respectively, and are added to the default simpset
4882 as solvers. This means that the simplifier can build transitivity chains
4883 to solve goals from the assumptions.
4884 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4885 of blast or auto after simplification become unnecessary because the goal
4886 is solved by simplification already.
4888 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4889 all proved in axiomatic type classes for semirings, rings and fields.
4892 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4893 now formalized using the Ring_and_Field theory mentioned above.
4894 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4895 than before, because now they are set up once in a generic manner.
4896 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4897 Look for the general versions in Ring_and_Field (and Power if they concern
4900 * Type "rat" of the rational numbers is now available in HOL-Complex.
4903 - Record types are now by default printed with their type abbreviation
4904 instead of the list of all field types. This can be configured via
4905 the reference "print_record_type_abbr".
4906 - Simproc "record_upd_simproc" for simplification of multiple updates added
4907 (not enabled by default).
4908 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4909 EX x. x = sel r to True (not enabled by default).
4910 - Tactic "record_split_simp_tac" to split and simplify records added.
4912 * 'specification' command added, allowing for definition by
4913 specification. There is also an 'ax_specification' command that
4914 introduces the new constants axiomatically.
4916 * arith(_tac) is now able to generate counterexamples for reals as well.
4918 * HOL-Algebra: new locale "ring" for non-commutative rings.
4920 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4921 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4923 * HOL-Matrix: a first theory for matrices in HOL with an application of
4924 matrix theory to linear programming.
4926 * Unions and Intersections:
4927 The latex output syntax of UN and INT has been changed
4928 from "\Union x \in A. B" to "\Union_{x \in A} B"
4929 i.e. the index formulae has become a subscript.
4930 Similarly for "\Union x. B", and for \Inter instead of \Union.
4932 * Unions and Intersections over Intervals:
4933 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4934 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4935 like in normal math, and corresponding versions for < and for intersection.
4937 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4938 lexicographic dictonary ordering has been added as "lexord".
4940 * ML: the legacy theory structures Int and List have been removed. They had
4941 conflicted with ML Basis Library structures having the same names.
4943 * 'refute' command added to search for (finite) countermodels. Only works
4944 for a fragment of HOL. The installation of an external SAT solver is
4945 highly recommended. See "HOL/Refute.thy" for details.
4947 * 'quickcheck' command: Allows to find counterexamples by evaluating
4948 formulae under an assignment of free variables to random values.
4949 In contrast to 'refute', it can deal with inductive datatypes,
4950 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4956 * Streams now come with concatenation and are part of the HOLCF image
4960 New in Isabelle2003 (May 2003)
4961 ------------------------------
4965 * Provers/simplifier:
4967 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4968 Assumptions are now subject to complete mutual simplification,
4969 not just from left to right. The simplifier now preserves
4970 the order of assumptions.
4972 Potential INCOMPATIBILITY:
4974 -- simp sometimes diverges where the old version did
4975 not, e.g. invoking simp on the goal
4977 [| P (f x); y = x; f x = f y |] ==> Q
4979 now gives rise to the infinite reduction sequence
4981 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4983 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4986 -- Tactics combining classical reasoner and simplification (such as auto)
4987 are also affected by this change, because many of them rely on
4988 simp. They may sometimes diverge as well or yield a different numbers
4989 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4990 in case of problems. Sometimes subsequent calls to the classical
4991 reasoner will fail because a preceeding call to the simplifier too
4992 eagerly simplified the goal, e.g. deleted redundant premises.
4994 - The simplifier trace now shows the names of the applied rewrite rules
4996 - You can limit the number of recursive invocations of the simplifier
4997 during conditional rewriting (where the simplifie tries to solve the
4998 conditions before applying the rewrite rule):
4999 ML "simp_depth_limit := n"
5000 where n is an integer. Thus you can force termination where previously
5001 the simplifier would diverge.
5003 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5005 - No longer aborts on failed congruence proof. Instead, the
5006 congruence is ignored.
5008 * Pure: New generic framework for extracting programs from constructive
5009 proofs. See HOL/Extraction.thy for an example instantiation, as well
5010 as HOL/Extraction for some case studies.
5012 * Pure: The main goal of the proof state is no longer shown by default, only
5013 the subgoals. This behaviour is controlled by a new flag.
5014 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5015 (ML: Proof.show_main_goal).
5017 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5018 rules whose conclusion matches subgoal 1:
5019 PG menu: Isabelle/Isar -> Show me -> matching rules
5020 The rules are ordered by how closely they match the subgoal.
5021 In particular, rules that solve a subgoal outright are displayed first
5022 (or rather last, the way they are printed).
5023 (ML: ProofGeneral.print_intros())
5025 * Pure: New flag trace_unify_fail causes unification to print
5026 diagnostic information (PG: in trace buffer) when it fails. This is
5027 useful for figuring out why single step proofs like rule, erule or
5030 * Pure: Locale specifications now produce predicate definitions
5031 according to the body of text (covering assumptions modulo local
5032 definitions); predicate "loc_axioms" covers newly introduced text,
5033 while "loc" is cumulative wrt. all included locale expressions; the
5034 latter view is presented only on export into the global theory
5035 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5036 on the old view without predicates;
5038 * Pure: predefined locales "var" and "struct" are useful for sharing
5039 parameters (as in CASL, for example); just specify something like
5040 ``var x + var y + struct M'' as import;
5042 * Pure: improved thms_containing: proper indexing of facts instead of
5043 raw theorems; check validity of results wrt. current name space;
5044 include local facts of proof configuration (also covers active
5045 locales), cover fixed variables in index; may use "_" in term
5046 specification; an optional limit for the number of printed facts may
5047 be given (the default is 40);
5049 * Pure: disallow duplicate fact bindings within new-style theory files
5052 * Provers: improved induct method: assumptions introduced by case
5053 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5054 the goal statement); "foo" still refers to all facts collectively;
5056 * Provers: the function blast.overloaded has been removed: all constants
5057 are regarded as potentially overloaded, which improves robustness in exchange
5058 for slight decrease in efficiency;
5060 * Provers/linorder: New generic prover for transitivity reasoning over
5061 linear orders. Note: this prover is not efficient!
5063 * Isar: preview of problems to finish 'show' now produce an error
5064 rather than just a warning (in interactive mode);
5071 - Produces a counter example if it cannot prove a goal.
5072 Note that the counter example may be spurious if the goal is not a formula
5073 of quantifier-free linear arithmetic.
5074 In ProofGeneral the counter example appears in the trace buffer.
5076 - Knows about div k and mod k where k is a numeral of type nat or int.
5078 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5079 linear arithmetic fails. This takes account of quantifiers and divisibility.
5080 Presburger arithmetic can also be called explicitly via presburger(_tac).
5082 * simp's arithmetic capabilities have been enhanced a bit: it now
5083 takes ~= in premises into account (by performing a case split);
5085 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5086 are distributed over a sum of terms;
5088 * New tactic "trans_tac" and method "trans" instantiate
5089 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5092 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5093 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5095 * 'typedef' command has new option "open" to suppress the set
5098 * functions Min and Max on finite sets have been introduced (theory
5101 * attribute [symmetric] now works for relations as well; it turns
5102 (x,y) : R^-1 into (y,x) : R, and vice versa;
5104 * induct over a !!-quantified statement (say !!x1..xn):
5105 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5107 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5108 %x. None. Warning: empty_def now refers to the previously hidden definition
5111 * Algebra: formalization of classical algebra. Intended as base for
5112 any algebraic development in Isabelle. Currently covers group theory
5113 (up to Sylow's theorem) and ring theory (Universal Property of
5114 Univariate Polynomials). Contributions welcome;
5116 * GroupTheory: deleted, since its material has been moved to Algebra;
5118 * Complex: new directory of the complex numbers with numeric constants,
5119 nonstandard complex numbers, and some complex analysis, standard and
5120 nonstandard (Jacques Fleuriot);
5122 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5124 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5127 * Real/HahnBanach: updated and adapted to locales;
5129 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5132 * UNITY: added the Meier-Sanders theory of progress sets;
5134 * MicroJava: bytecode verifier and lightweight bytecode verifier
5135 as abstract algorithms, instantiated to the JVM;
5137 * Bali: Java source language formalization. Type system, operational
5138 semantics, axiomatic semantics. Supported language features:
5139 classes, interfaces, objects,virtual methods, static methods,
5140 static/instance fields, arrays, access modifiers, definite
5141 assignment, exceptions.
5146 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5149 * Main ZF: virtually all theories converted to new-style format;
5154 * Pure: Tactic.prove provides sane interface for internal proofs;
5155 omits the infamous "standard" operation, so this is more appropriate
5156 than prove_goalw_cterm in many situations (e.g. in simprocs);
5158 * Pure: improved error reporting of simprocs;
5160 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5164 *** Document preparation ***
5166 * uses \par instead of \\ for line breaks in theory text. This may
5167 shift some page breaks in large documents. To get the old behaviour
5168 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5170 * minimized dependencies of isabelle.sty and isabellesym.sty on
5173 * \<euro> now needs package babel/greek instead of marvosym (which
5176 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5181 New in Isabelle2002 (March 2002)
5182 --------------------------------
5184 *** Document preparation ***
5186 * greatly simplified document preparation setup, including more
5187 graceful interpretation of isatool usedir -i/-d/-D options, and more
5188 instructive isatool mkdir; users should basically be able to get
5189 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5190 users may run a separate document processing stage manually like this:
5191 "isatool usedir -D output HOL Test && isatool document Test/output";
5193 * theory dependency graph may now be incorporated into documents;
5194 isatool usedir -g true will produce session_graph.eps/.pdf for use
5195 with \includegraphics of LaTeX;
5197 * proper spacing of consecutive markup elements, especially text
5198 blocks after section headings;
5200 * support bold style (for single symbols only), input syntax is like
5201 this: "\<^bold>\<alpha>" or "\<^bold>A";
5203 * \<bullet> is now output as bold \cdot by default, which looks much
5204 better in printed text;
5206 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5207 note that these symbols are currently unavailable in Proof General /
5208 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5210 * isatool latex no longer depends on changed TEXINPUTS, instead
5211 isatool document copies the Isabelle style files to the target
5217 * Pure/Provers: improved proof by cases and induction;
5218 - 'case' command admits impromptu naming of parameters (such as
5220 - 'induct' method divinates rule instantiation from the inductive
5221 claim; no longer requires excessive ?P bindings for proper
5222 instantiation of cases;
5223 - 'induct' method properly enumerates all possibilities of set/type
5224 rules; as a consequence facts may be also passed through *type*
5225 rules without further ado;
5226 - 'induct' method now derives symbolic cases from the *rulified*
5227 rule (before it used to rulify cases stemming from the internal
5228 atomized version); this means that the context of a non-atomic
5229 statement becomes is included in the hypothesis, avoiding the
5230 slightly cumbersome show "PROP ?case" form;
5231 - 'induct' may now use elim-style induction rules without chaining
5232 facts, using ``missing'' premises from the goal state; this allows
5233 rules stemming from inductive sets to be applied in unstructured
5234 scripts, while still benefitting from proper handling of non-atomic
5235 statements; NB: major inductive premises need to be put first, all
5236 the rest of the goal is passed through the induction;
5237 - 'induct' proper support for mutual induction involving non-atomic
5238 rule statements (uses the new concept of simultaneous goals, see
5240 - append all possible rule selections, but only use the first
5241 success (no backtracking);
5242 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5243 - undeclared rule case names default to numbers 1, 2, 3, ...;
5244 - added 'print_induct_rules' (covered by help item in recent Proof
5246 - moved induct/cases attributes to Pure, methods to Provers;
5247 - generic method setup instantiated for FOL and HOL;
5249 * Pure: support multiple simultaneous goal statements, for example
5250 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5251 meta-level mechanism, this acts as if several individual goals had
5252 been stated separately; in particular common proof methods need to be
5253 repeated in order to cover all claims; note that a single elimination
5254 step is *not* sufficient to establish the two conjunctions, so this
5257 assume "A & B" then have A and B .. (*".." fails*)
5259 better use "obtain" in situations as above; alternative refer to
5260 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5262 * Pure: proper integration with ``locales''; unlike the original
5263 version by Florian Kammller, Isar locales package high-level proof
5264 contexts rather than raw logical ones (e.g. we admit to include
5265 attributes everywhere); operations on locales include merge and
5266 rename; support for implicit arguments (``structures''); simultaneous
5267 type-inference over imports and text; see also HOL/ex/Locales.thy for
5270 * Pure: the following commands have been ``localized'', supporting a
5271 target locale specification "(in name)": 'lemma', 'theorem',
5272 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5273 stored both within the locale and at the theory level (exported and
5274 qualified by the locale name);
5276 * Pure: theory goals may now be specified in ``long'' form, with
5277 ad-hoc contexts consisting of arbitrary locale elements. for example
5278 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5279 definitions may be given, too); the result is a meta-level rule with
5280 the context elements being discharged in the obvious way;
5282 * Pure: new proof command 'using' allows to augment currently used
5283 facts after a goal statement ('using' is syntactically analogous to
5284 'apply', but acts on the goal's facts only); this allows chained facts
5285 to be separated into parts given before and after a claim, as in
5286 ``from a and b have C using d and e <proof>'';
5288 * Pure: renamed "antecedent" case to "rule_context";
5290 * Pure: new 'judgment' command records explicit information about the
5291 object-logic embedding (used by several tools internally); no longer
5292 use hard-wired "Trueprop";
5294 * Pure: added 'corollary' command;
5296 * Pure: fixed 'token_translation' command;
5298 * Pure: removed obsolete 'exported' attribute;
5300 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5301 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5302 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5304 * Pure: method 'atomize' presents local goal premises as object-level
5305 statements (atomic meta-level propositions); setup controlled via
5306 rewrite rules declarations of 'atomize' attribute; example
5307 application: 'induct' method with proper rule statements in improper
5310 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5311 now consider the syntactic context of assumptions, giving a better
5312 chance to get type-inference of the arguments right (this is
5313 especially important for locales);
5315 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5318 * Pure/obtain: the formal conclusion "thesis", being marked as
5319 ``internal'', may no longer be reference directly in the text;
5320 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5323 * Pure: generic 'sym' attribute which declares a rule both as pure
5324 'elim?' and for the 'symmetric' operation;
5326 * Pure: marginal comments ``--'' may now occur just anywhere in the
5327 text; the fixed correlation with particular command syntax has been
5330 * Pure: new method 'rules' is particularly well-suited for proof
5331 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5332 but often produces more compact proof terms with less detours;
5334 * Pure/Provers/classical: simplified integration with pure rule
5335 attributes and methods; the classical "intro?/elim?/dest?"
5336 declarations coincide with the pure ones; the "rule" method no longer
5337 includes classically swapped intros; "intro" and "elim" methods no
5338 longer pick rules from the context; also got rid of ML declarations
5339 AddXIs/AddXEs/AddXDs; all of this has some potential for
5342 * Provers/classical: attribute 'swapped' produces classical inversions
5343 of introduction rules;
5345 * Provers/simplifier: 'simplified' attribute may refer to explicit
5346 rules instead of full simplifier context; 'iff' attribute handles
5349 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5351 * HOL: 'recdef' now fails on unfinished automated proofs, use
5352 "(permissive)" option to recover old behavior;
5354 * HOL: 'inductive' no longer features separate (collective) attributes
5355 for 'intros' (was found too confusing);
5357 * HOL: properly declared induction rules less_induct and
5363 * HOL: moved over to sane numeral syntax; the new policy is as
5366 - 0 and 1 are polymorphic constants, which are defined on any
5367 numeric type (nat, int, real etc.);
5369 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5370 binary representation internally;
5372 - type nat has special constructor Suc, and generally prefers Suc 0
5373 over 1::nat and Suc (Suc 0) over 2::nat;
5375 This change may cause significant problems of INCOMPATIBILITY; here
5376 are some hints on converting existing sources:
5378 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5379 entities, so expressions involving "-" (unary or binary minus) need
5380 to be spaced properly;
5382 - existing occurrences of "1" may need to be constraint "1::nat" or
5383 even replaced by Suc 0; similar for old "2";
5385 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5387 - remove all special provisions on numerals in proofs;
5389 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5390 representation (depends on bin_arith_simps in the default context);
5392 * HOL: symbolic syntax for x^2 (numeral 2);
5394 * HOL: the class of all HOL types is now called "type" rather than
5395 "term"; INCOMPATIBILITY, need to adapt references to this type class
5396 in axclass/classes, instance/arities, and (usually rare) occurrences
5397 in typings (of consts etc.); internally the class is called
5398 "HOL.type", ML programs should refer to HOLogic.typeS;
5400 * HOL/record package improvements:
5401 - new derived operations "fields" to build a partial record section,
5402 "extend" to promote a fixed record to a record scheme, and
5403 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5404 declared as simp by default;
5405 - shared operations ("more", "fields", etc.) now need to be always
5406 qualified) --- potential INCOMPATIBILITY;
5407 - removed "make_scheme" operations (use "make" with "extend") --
5409 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5410 - provides cases/induct rules for use with corresponding Isar
5411 methods (for concrete records, record schemes, concrete more
5412 parts, and schematic more parts -- in that order);
5413 - internal definitions directly based on a light-weight abstract
5414 theory of product types over typedef rather than datatype;
5416 * HOL: generic code generator for generating executable ML code from
5417 specifications; specific support for HOL constructs such as inductive
5418 datatypes and sets, as well as recursive functions; can be invoked
5419 via 'generate_code' theory section;
5421 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5423 * HOL: consolidated and renamed several theories. In particular:
5424 Ord.thy has been absorbed into HOL.thy
5425 String.thy has been absorbed into List.thy
5427 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5428 (beware of argument permutation!);
5430 * HOL: linorder_less_split superseded by linorder_cases;
5432 * HOL/List: "nodups" renamed to "distinct";
5434 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5435 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5436 - Ex_def has changed, now need to use some_eq_ex
5438 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5439 in this (rare) case use:
5441 delSWrapper "split_all_tac"
5442 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5444 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5447 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5448 Isabelle's type classes, ^ on functions and relations has too general
5449 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5450 necessary to attach explicit type constraints;
5452 * HOL/Relation: the prefix name of the infix "O" has been changed from
5453 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5454 renamed accordingly (eg "compI" -> "rel_compI").
5456 * HOL: syntax translations now work properly with numerals and records
5459 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5460 of "lam" -- INCOMPATIBILITY;
5462 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5463 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5464 renamed "Product_Type.unit";
5466 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5468 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5469 the "cases" method);
5471 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5474 * HOL/IMP: updated and converted to new-style theory format; several
5475 parts turned into readable document, with proper Isar proof texts and
5476 some explanations (by Gerwin Klein);
5478 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5480 * HOL-Hyperreal is now a logic image;
5485 * Isar: consts/constdefs supports mixfix syntax for continuous
5488 * Isar: domain package adapted to new-style theory format, e.g. see
5491 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5492 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5493 lift.induct_tac, always use UU instead of Undef;
5495 * HOLCF/IMP: updated and converted to new-style theory;
5500 * Isar: proper integration of logic-specific tools and packages,
5501 including theory commands '(co)inductive', '(co)datatype',
5502 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5503 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5505 * theory Main no longer includes AC; for the Axiom of Choice, base
5506 your theory on Main_ZFC;
5508 * the integer library now covers quotients and remainders, with many
5509 laws relating division to addition, multiplication, etc.;
5511 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5512 typeless version of the formalism;
5514 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5517 * ZF/Induct: new directory for examples of inductive definitions,
5518 including theory Multiset for multiset orderings; converted to
5519 new-style theory format;
5521 * ZF: many new theorems about lists, ordinals, etc.;
5526 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5527 variable proof controls level of detail: 0 = no proofs (only oracle
5528 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5529 also ref manual for further ML interfaces;
5531 * Pure/axclass: removed obsolete ML interface
5532 goal_subclass/goal_arity;
5534 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5535 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5536 separate tokens, so expressions involving minus need to be spaced
5539 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5540 rather than "infixl" or "infixr";
5542 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5543 sort constraint specifications in type inference; e.g. "x::_::foo"
5544 ensures that the type of "x" is of sort "foo" (but not necessarily a
5547 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5548 control output of nested => (types); the default behavior is
5551 * Pure/syntax: builtin parse translation for "_constify" turns valued
5552 tokens into AST constants;
5554 * Pure/syntax: prefer later declarations of translations and print
5555 translation functions; potential INCOMPATIBILITY: need to reverse
5556 multiple declarations for same syntax element constant;
5558 * Pure/show_hyps reset by default (in accordance to existing Isar
5561 * Provers/classical: renamed addaltern to addafter, addSaltern to
5564 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5567 * system: tested support for MacOS X; should be able to get Isabelle +
5568 Proof General to work in a plain Terminal after installing Poly/ML
5569 (e.g. from the Isabelle distribution area) and GNU bash alone
5570 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5571 support requires further installations, e.g. from
5572 http://fink.sourceforge.net/);
5574 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5576 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5577 of 40 MB), cf. ML_OPTIONS;
5579 * system: Proof General keywords specification is now part of the
5580 Isabelle distribution (see etc/isar-keywords.el);
5582 * system: support for persistent Proof General sessions (refrain from
5583 outdating all loaded theories on startup); user may create writable
5584 logic images like this: ``isabelle -q HOL Test'';
5586 * system: smart selection of Isabelle process versus Isabelle
5587 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5588 run both "isabelle" and "Isabelle" even if file names are badly
5589 damaged (executable inspects the case of the first letter of its own
5590 name); added separate "isabelle-process" and "isabelle-interface";
5592 * system: refrain from any attempt at filtering input streams; no
5593 longer support ``8bit'' encoding of old isabelle font, instead proper
5594 iso-latin characters may now be used; the related isatools
5595 "symbolinput" and "nonascii" have disappeared as well;
5597 * system: removed old "xterm" interface (the print modes "xterm" and
5598 "xterm_color" are still available for direct use in a suitable
5603 New in Isabelle99-2 (February 2001)
5604 -----------------------------------
5606 *** Overview of INCOMPATIBILITIES ***
5608 * HOL: please note that theories in the Library and elsewhere often use the
5609 new-style (Isar) format; to refer to their theorems in an ML script you must
5610 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5612 * HOL: inductive package no longer splits induction rule aggressively,
5613 but only as far as specified by the introductions given; the old
5614 format may be recovered via ML function complete_split_rule or attribute
5615 'split_rule (complete)';
5617 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5618 gfp_Tarski to gfp_unfold;
5620 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5622 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5623 relation); infix "^^" has been renamed "``"; infix "``" has been
5624 renamed "`"; "univalent" has been renamed "single_valued";
5626 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5629 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5631 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5633 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5634 consequence, it is no longer monotonic wrt. the local goal context
5635 (which is now passed through the inductive cases);
5637 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5638 \<gg> to \<ggreater>;
5641 *** Document preparation ***
5643 * \isabellestyle{NAME} selects version of Isabelle output (currently
5644 available: are "it" for near math-mode best-style output, "sl" for
5645 slanted text style, and "tt" for plain type-writer; if no
5646 \isabellestyle command is given, output is according to slanted
5649 * support sub/super scripts (for single symbols only), input syntax is
5650 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5652 * some more standard symbols; see Appendix A of the system manual for
5653 the complete list of symbols defined in isabellesym.sty;
5655 * improved isabelle style files; more abstract symbol implementation
5656 (should now use \isamath{...} and \isatext{...} in custom symbol
5659 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5660 state; Note that presentation of goal states does not conform to
5661 actual human-readable proof documents. Please do not include goal
5662 states into document output unless you really know what you are doing!
5664 * proper indentation of antiquoted output with proportional LaTeX
5667 * no_document ML operator temporarily disables LaTeX document
5670 * isatool unsymbolize tunes sources for plain ASCII communication;
5675 * Pure: Isar now suffers initial goal statements to contain unbound
5676 schematic variables (this does not conform to actual readable proof
5677 documents, due to unpredictable outcome and non-compositional proof
5678 checking); users who know what they are doing may use schematic goals
5679 for Prolog-style synthesis of proven results;
5681 * Pure: assumption method (an implicit finishing) now handles actual
5684 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5685 initial goal, declare "that" only as Pure intro (only for single
5686 steps); the "that" rule assumption may now be involved in implicit
5687 finishing, thus ".." becomes a feasible for trivial obtains;
5689 * Pure: default proof step now includes 'intro_classes'; thus trivial
5690 instance proofs may be performed by "..";
5692 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5695 * Pure: more robust selection of calculational rules;
5697 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5698 rule (as well as the assumption rule);
5700 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5701 lemmas, using the graph browser tool;
5703 * Pure: predict failure of "show" in interactive mode;
5705 * Pure: 'thms_containing' now takes actual terms as arguments;
5707 * HOL: improved method 'induct' --- now handles non-atomic goals
5708 (potential INCOMPATIBILITY); tuned error handling;
5710 * HOL: cases and induct rules now provide explicit hints about the
5711 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5712 any remaining facts are inserted into the goal verbatim;
5714 * HOL: local contexts (aka cases) may now contain term bindings as
5715 well; the 'cases' and 'induct' methods new provide a ?case binding for
5716 the result to be shown in each case;
5718 * HOL: added 'recdef_tc' command;
5720 * isatool convert assists in eliminating legacy ML scripts;
5725 * HOL/Library: a collection of generic theories to be used together
5726 with main HOL; the theory loader path already includes this directory
5727 by default; the following existing theories have been moved here:
5728 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5729 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5731 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5732 modelling and verification task performed in Isabelle/HOL +
5733 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5735 * HOL/Algebra: special summation operator SUM no longer exists, it has
5736 been replaced by setsum; infix 'assoc' now has priority 50 (like
5737 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5738 'domain', this makes the theory consistent with mathematical
5741 * HOL basics: added overloaded operations "inverse" and "divide"
5742 (infix "/"), syntax for generic "abs" operation, generic summation
5745 * HOL/typedef: simplified package, provide more useful rules (see also
5748 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5749 now expressed as a proper nested rule (old-style tactic scripts may
5750 require atomize_strip_tac to cope with non-atomic premises);
5752 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5753 to "split_conv" (old name still available for compatibility);
5755 * HOL: improved concrete syntax for strings (e.g. allows translation
5756 rules with string literals);
5758 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5759 and Fleuriot's mechanization of analysis, including the transcendental
5760 functions for the reals;
5762 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5767 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5768 "lam" is displayed as TWO lambda-symbols
5770 * CTT: theory Main now available, containing everything (that is, Bool
5776 * Pure: the Simplifier has been implemented properly as a derived rule
5777 outside of the actual kernel (at last!); the overall performance
5778 penalty in practical applications is about 50%, while reliability of
5779 the Isabelle inference kernel has been greatly improved;
5781 * print modes "brackets" and "no_brackets" control output of nested =>
5782 (types) and ==> (props); the default behaviour is "brackets";
5784 * Provers: fast_tac (and friends) now handle actual object-logic rules
5785 as assumptions as well;
5787 * system: support Poly/ML 4.0;
5789 * system: isatool install handles KDE version 1 or 2;
5793 New in Isabelle99-1 (October 2000)
5794 ----------------------------------
5796 *** Overview of INCOMPATIBILITIES ***
5798 * HOL: simplification of natural numbers is much changed; to partly
5799 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5800 issue the following ML commands:
5802 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5803 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5805 * HOL: simplification no longer dives into case-expressions; this is
5806 controlled by "t.weak_case_cong" for each datatype t;
5808 * HOL: nat_less_induct renamed to less_induct;
5810 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5811 fixsome to patch .thy and .ML sources automatically;
5813 select_equality -> some_equality
5814 select_eq_Ex -> some_eq_ex
5815 selectI2EX -> someI2_ex
5818 select1_equality -> some1_equality
5819 Eps_sym_eq -> some_sym_eq_trivial
5820 Eps_eq -> some_eq_trivial
5822 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5824 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5827 * HOL: the recursion equations generated by 'recdef' are now called
5828 f.simps instead of f.rules;
5830 * HOL: qed_spec_mp now also handles bounded ALL as well;
5832 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5833 sometimes be needed;
5835 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5837 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5839 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5840 product is now "<*>" instead of "Times"; the lexicographic product is
5841 now "<*lex*>" instead of "**";
5843 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5844 of main HOL, but was unused); better use HOL's datatype package;
5846 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5847 the old syntax may be recovered as follows:
5850 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5851 (infixl "\\<oplus>" 100)
5853 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5855 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5856 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5859 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5860 changed from A/r to A//r;
5862 * ZF: new treatment of arithmetic (nat & int) may break some old
5865 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5866 rulify -> rule_format, elimify -> elim_format, ...);
5868 * Isar/Provers: intro/elim/dest attributes changed; renamed
5869 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5870 should have to change intro!! to intro? only); replaced "delrule" by
5873 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5875 * Provers: strengthened force_tac by using new first_best_tac;
5877 * LaTeX document preparation: several changes of isabelle.sty (see
5881 *** Document preparation ***
5883 * formal comments (text blocks etc.) in new-style theories may now
5884 contain antiquotations of thm/prop/term/typ/text to be presented
5885 according to latex print mode; concrete syntax is like this:
5886 @{term[show_types] "f(x) = a + x"};
5888 * isatool mkdir provides easy setup of Isabelle session directories,
5889 including proper document sources;
5891 * generated LaTeX sources are now deleted after successful run
5892 (isatool document -c); may retain a copy somewhere else via -D option
5895 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5896 style files, achieving self-contained LaTeX sources and simplifying
5899 * old-style theories now produce (crude) LaTeX output as well;
5901 * browser info session directories are now self-contained (may be put
5902 on WWW server seperately); improved graphs of nested sessions; removed
5903 graph for 'all sessions';
5905 * several improvements in isabelle style files; \isabellestyle{it}
5906 produces fake math mode output; \isamarkupheader is now \section by
5907 default; see lib/texinputs/isabelle.sty etc.;
5912 * Isar/Pure: local results and corresponding term bindings are now
5913 subject to Hindley-Milner polymorphism (similar to ML); this
5914 accommodates incremental type-inference very nicely;
5916 * Isar/Pure: new derived language element 'obtain' supports
5917 generalized existence reasoning;
5919 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5920 support accumulation of results, without applying any rules yet;
5921 useful to collect intermediate results without explicit name
5922 references, and for use with transitivity rules with more than 2
5925 * Isar/Pure: scalable support for case-analysis type proofs: new
5926 'case' language element refers to local contexts symbolically, as
5927 produced by certain proof methods; internally, case names are attached
5928 to theorems as "tags";
5930 * Isar/Pure: theory command 'hide' removes declarations from
5931 class/type/const name spaces;
5933 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5934 indicate potential overloading;
5936 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5938 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5939 "{a,b,c}" instead of {a,b,c};
5941 * Isar/Pure now provides its own version of intro/elim/dest
5942 attributes; useful for building new logics, but beware of confusion
5943 with the version in Provers/classical;
5945 * Isar/Pure: the local context of (non-atomic) goals is provided via
5946 case name 'antecedent';
5948 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5949 to the current context is now done automatically);
5951 * Isar/Pure: theory command 'method_setup' provides a simple interface
5952 for definining proof methods in ML;
5954 * Isar/Provers: intro/elim/dest attributes changed; renamed
5955 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5956 most cases, one should have to change intro!! to intro? only);
5957 replaced "delrule" by "rule del";
5959 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5960 'symmetric' attribute (the latter supercedes [RS sym]);
5962 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5963 method modifier); 'simp' method: 'only:' modifier removes loopers as
5964 well (including splits);
5966 * Isar/Provers: Simplifier and Classical methods now support all kind
5967 of modifiers used in the past, including 'cong', 'iff', etc.
5969 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5970 of Simplifier and Classical reasoner);
5972 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5973 now support named cases; major packages (inductive, datatype, primrec,
5974 recdef) support case names and properly name parameters;
5976 * Isar/HOL: new transitivity rules for substitution in inequalities --
5977 monotonicity conditions are extracted to be proven at end of
5980 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5983 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5984 split_if split_if_asm; datatype package provides theorems foo.splits =
5985 foo.split foo.split_asm for each datatype;
5987 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5988 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5989 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5990 use "(cases (simplified))" method in proper proof texts);
5992 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5994 * Isar: names of theorems etc. may be natural numbers as well;
5996 * Isar: 'pr' command: optional arguments for goals_limit and
5997 ProofContext.prems_limit; no longer prints theory contexts, but only
6000 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6001 additional print modes to be specified; e.g. "pr(latex)" will print
6002 proof state according to the Isabelle LaTeX style;
6004 * Isar: improved support for emulating tactic scripts, including proof
6005 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6006 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6007 (for HOL datatypes);
6009 * Isar: simplified (more robust) goal selection of proof methods: 1st
6010 goal, all goals, or explicit goal specifier (tactic emulation); thus
6011 'proof method scripts' have to be in depth-first order;
6013 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6015 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6016 should instead use individual commands for printing items
6017 (print_commands, print_methods etc.);
6019 * Isar: added 'nothing' --- the empty list of theorems;
6024 * HOL/MicroJava: formalization of a fragment of Java, together with a
6025 corresponding virtual machine and a specification of its bytecode
6026 verifier and a lightweight bytecode verifier, including proofs of
6027 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6028 Cornelia Pusch (see also the homepage of project Bali at
6029 http://isabelle.in.tum.de/Bali/);
6031 * HOL/Algebra: new theory of rings and univariate polynomials, by
6034 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6035 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6038 * HOL/Lattice: fundamental concepts of lattice theory and order
6039 structures, including duals, properties of bounds versus algebraic
6040 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6041 Theorem for complete lattices etc.; may also serve as a demonstration
6042 for abstract algebraic reasoning using axiomatic type classes, and
6043 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6045 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6048 * HOL/IMPP: extension of IMP with local variables and mutually
6049 recursive procedures, by David von Oheimb;
6051 * HOL/Lambda: converted into new-style theory and document;
6053 * HOL/ex/Multiquote: example of multiple nested quotations and
6054 anti-quotations -- basically a generalized version of de-Bruijn
6055 representation; very useful in avoiding lifting of operations;
6057 * HOL/record: added general record equality rule to simpset; fixed
6058 select-update simplification procedure to handle extended records as
6059 well; admit "r" as field name;
6061 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6062 other numeric types and also as the identity of groups, rings, etc.;
6064 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6065 Types nat and int belong to this axclass;
6067 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6068 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6069 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6070 two terms #m*u and #n*u are replaced by #(m+n)*u
6071 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6072 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6073 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6075 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6076 powerful prover for predicate logic but knows nothing of clasets; see
6077 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6079 * HOL: new version of "case_tac" subsumes both boolean case split and
6080 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6081 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6083 * HOL: simplification no longer dives into case-expressions: only the
6084 selector expression is simplified, but not the remaining arms; to
6085 enable full simplification of case-expressions for datatype t, you may
6086 remove t.weak_case_cong from the simpset, either globally (Delcongs
6087 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6089 * HOL/recdef: the recursion equations generated by 'recdef' for
6090 function 'f' are now called f.simps instead of f.rules; if all
6091 termination conditions are proved automatically, these simplification
6092 rules are added to the simpset, as in primrec; rules may be named
6093 individually as well, resulting in a separate list of theorems for
6096 * HOL/While is a new theory that provides a while-combinator. It
6097 permits the definition of tail-recursive functions without the
6098 provision of a termination measure. The latter is necessary once the
6099 invariant proof rule for while is applied.
6101 * HOL: new (overloaded) notation for the set of elements below/above
6102 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6104 * HOL: theorems impI, allI, ballI bound as "strip";
6106 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6107 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6108 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6110 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6112 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6113 main HOL, but was unused);
6115 * HOL: fewer consts declared as global (e.g. have to refer to
6116 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6118 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6119 in case of overlap with user translations (e.g. judgements over
6120 tuples); (note that the underlying logical represenation is still
6126 * ZF: simplification automatically cancels common terms in arithmetic
6127 expressions over nat and int;
6129 * ZF: new treatment of nat to minimize type-checking: all operators
6130 coerce their operands to a natural number using the function natify,
6131 making the algebraic laws unconditional;
6133 * ZF: as above, for int: operators coerce their operands to an integer
6134 using the function intify;
6136 * ZF: the integer library now contains many of the usual laws for the
6137 orderings, including $<=, and monotonicity laws for $+ and $*;
6139 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6142 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6143 to the simplifier and classical reasoner simultaneously;
6148 * Provers: blast_tac now handles actual object-logic rules as
6149 assumptions; note that auto_tac uses blast_tac internally as well;
6151 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6152 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6154 * Provers: delrules now handles destruct rules as well (no longer need
6155 explicit make_elim);
6157 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6158 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6159 use instead the strong form,
6160 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6161 in HOL, FOL and ZF the function cla_make_elim will create such rules
6162 from destruct-rules;
6164 * Provers: Simplifier.easy_setup provides a fast path to basic
6165 Simplifier setup for new object-logics;
6167 * Pure: AST translation rules no longer require constant head on LHS;
6169 * Pure: improved name spaces: ambiguous output is qualified; support
6170 for hiding of names;
6172 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6173 XSYMBOL_HOME; no longer need to do manual configuration in most
6176 * system: compression of ML heaps images may now be controlled via -c
6177 option of isabelle and isatool usedir (currently only observed by
6180 * system: isatool installfonts may handle X-Symbol fonts as well (very
6181 useful for remote X11);
6183 * system: provide TAGS file for Isabelle sources;
6185 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6188 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6189 timing flag supersedes proof_timing and Toplevel.trace;
6191 * ML: new combinators |>> and |>>> for incremental transformations
6192 with secondary results (e.g. certain theory extensions):
6194 * ML: PureThy.add_defs gets additional argument to indicate potential
6195 overloading (usually false);
6197 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6202 New in Isabelle99 (October 1999)
6203 --------------------------------
6205 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6207 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6208 are no longer simplified. (This allows the simplifier to unfold recursive
6209 functional programs.) To restore the old behaviour, declare
6211 Delcongs [if_weak_cong];
6213 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6216 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6218 * HOL/datatype: mutual_induct_tac no longer exists --
6219 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6221 * HOL/typedef: fixed type inference for representing set; type
6222 arguments now have to occur explicitly on the rhs as type constraints;
6224 * ZF: The con_defs part of an inductive definition may no longer refer
6225 to constants declared in the same theory;
6227 * HOL, ZF: the function mk_cases, generated by the inductive
6228 definition package, has lost an argument. To simplify its result, it
6229 uses the default simpset instead of a supplied list of theorems.
6231 * HOL/List: the constructors of type list are now Nil and Cons;
6233 * Simplifier: the type of the infix ML functions
6234 setSSolver addSSolver setSolver addSolver
6235 is now simpset * solver -> simpset where `solver' is a new abstract type
6236 for packaging solvers. A solver is created via
6237 mk_solver: string -> (thm list -> int -> tactic) -> solver
6238 where the string argument is only a comment.
6243 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6244 decision procedure for linear arithmetic. Currently it is used for
6245 types `nat', `int', and `real' in HOL (see below); it can, should and
6246 will be instantiated for other types and logics as well.
6248 * The simplifier now accepts rewrite rules with flexible heads, eg
6249 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6250 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6256 * New Isabelle/Isar subsystem provides an alternative to traditional
6257 tactical theorem proving; together with the ProofGeneral/isar user
6258 interface it offers an interactive environment for developing human
6259 readable proof documents (Isar == Intelligible semi-automated
6260 reasoning); for further information see isatool doc isar-ref,
6261 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6263 * improved and simplified presentation of theories: better HTML markup
6264 (including colors), graph views in several sizes; isatool usedir now
6265 provides a proper interface for user theories (via -P option); actual
6266 document preparation based on (PDF)LaTeX is available as well (for
6267 new-style theories only); see isatool doc system for more information;
6269 * native support for Proof General, both for classic Isabelle and
6272 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6273 using the graph browser tool;
6275 * Isabelle manuals now also available as PDF;
6277 * theory loader rewritten from scratch (may not be fully
6278 bug-compatible); old loadpath variable has been replaced by show_path,
6279 add_path, del_path, reset_path functions; new operations such as
6280 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6283 * improved isatool install: option -k creates KDE application icon,
6284 option -p DIR installs standalone binaries;
6286 * added ML_PLATFORM setting (useful for cross-platform installations);
6287 more robust handling of platform specific ML images for SML/NJ;
6289 * the settings environment is now statically scoped, i.e. it is never
6290 created again in sub-processes invoked from isabelle, isatool, or
6293 * path element specification '~~' refers to '$ISABELLE_HOME';
6295 * in locales, the "assumes" and "defines" parts may be omitted if
6298 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6301 * new print_mode "HTML";
6303 * new flag show_tags controls display of tags of theorems (which are
6304 basically just comments that may be attached by some tools);
6306 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6307 mode and goal output format:
6309 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6311 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6313 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6314 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6316 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6318 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6320 * function bind_thms stores lists of theorems (cf. bind_thm);
6322 * new shorthand tactics ftac, eatac, datac, fatac;
6324 * qed (and friends) now accept "" as result name; in that case the
6325 theorem is not stored, but proper checks and presentation of the
6328 * theorem database now also indexes constants "Trueprop", "all",
6329 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6334 ** HOL arithmetic **
6336 * There are now decision procedures for linear arithmetic over nat and
6339 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6340 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6341 are treated as atomic; subformulae not involving type `nat' or `int'
6342 are ignored; quantified subformulae are ignored unless they are
6343 positive universal or negative existential. The tactic has to be
6344 invoked by hand and can be a little bit slow. In particular, the
6345 running time is exponential in the number of occurrences of `min' and
6346 `max', and `-' on `nat'.
6348 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6349 (negated) (in)equalities among the premises and the conclusion into
6350 account (i.e. no compound formulae) and does not know about `min' and
6351 `max', and `-' on `nat'. It is fast and is used automatically by the
6354 NB: At the moment, these decision procedures do not cope with mixed
6355 nat/int formulae where the two parts interact, such as `m < n ==>
6358 * HOL/Numeral provides a generic theory of numerals (encoded
6359 efficiently as bit strings); setup for types nat/int/real is in place;
6360 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6361 int, existing theories and proof scripts may require a few additional
6364 * integer division and remainder can now be performed on constant
6367 * many properties of integer multiplication, division and remainder
6370 * An interface to the Stanford Validity Checker (SVC) is available through the
6371 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6372 are proved automatically. SVC must be installed separately, and its results
6373 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6374 invocation of the underlying oracle). For SVC see
6375 http://verify.stanford.edu/SVC
6377 * IsaMakefile: the HOL-Real target now builds an actual image;
6382 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6383 (in Isabelle/Isar) -- by Gertrud Bauer;
6385 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6386 analysis for assembly languages with subtypes;
6388 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6389 -- avoids syntactic ambiguities and treats state, transition, and
6390 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6391 changed syntax and (many) tactics;
6393 * HOL/inductive: Now also handles more general introduction rules such
6394 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6395 theorems are now maintained within the theory (maintained via the
6398 * HOL/datatype: Now also handles arbitrarily branching datatypes
6399 (using function types) such as
6401 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6403 * HOL/record: record_simproc (part of the default simpset) takes care
6404 of selectors applied to updated records; record_split_tac is no longer
6405 part of the default claset; update_defs may now be removed from the
6406 simpset in many cases; COMPATIBILITY: old behavior achieved by
6408 claset_ref () := claset() addSWrapper record_split_wrapper;
6409 Delsimprocs [record_simproc]
6411 * HOL/typedef: fixed type inference for representing set; type
6412 arguments now have to occur explicitly on the rhs as type constraints;
6414 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6415 names rather than an ML expression;
6417 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6418 supplied later. Program schemes can be defined, such as
6419 "While B C s = (if B s then While B C (C s) else s)"
6420 where the well-founded relation can be chosen after B and C have been given.
6422 * HOL/List: the constructors of type list are now Nil and Cons;
6423 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6424 course, ML tools referring to List.list.op # etc. have to be adapted;
6426 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6427 disabled by default; run isabelle with option -m HOL to get back to
6428 the original Gordon/HOL-style output;
6430 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6431 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6433 * HOL basic syntax simplified (more orthogonal): all variants of
6434 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6435 Eps operator is provided as well: "SOME x. P[x]";
6437 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6439 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6440 thus available for user theories;
6442 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6443 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6446 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6447 several times and then mp;
6452 * the notation <<...>> is now available as a notation for sequences of
6455 * the simplifier is now installed
6457 * the axiom system has been generalized (thanks to Soren Heilmann)
6459 * the classical reasoner now has a default rule database
6464 * new primrec section allows primitive recursive functions to be given
6465 directly (as in HOL) over datatypes and the natural numbers;
6467 * new tactics induct_tac and exhaust_tac for induction (or case
6468 analysis) over datatypes and the natural numbers;
6470 * the datatype declaration of type T now defines the recursor T_rec;
6472 * simplification automatically does freeness reasoning for datatype
6475 * automatic type-inference, with AddTCs command to insert new
6476 type-checking rules;
6478 * datatype introduction rules are now added as Safe Introduction rules
6481 * the syntax "if P then x else y" is now available in addition to
6485 *** Internal programming interfaces ***
6487 * tuned simplifier trace output; new flag debug_simp;
6489 * structures Vartab / Termtab (instances of TableFun) offer efficient
6490 tables indexed by indexname_ord / term_ord (compatible with aconv);
6492 * AxClass.axclass_tac lost the theory argument;
6494 * tuned current_goals_markers semantics: begin / end goal avoids
6495 printing empty lines;
6497 * removed prs and prs_fn hook, which was broken because it did not
6498 include \n in its semantics, forcing writeln to add one
6499 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6500 string -> unit if you really want to output text without newline;
6502 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6503 plain output, interface builders may have to enable 'isabelle_font'
6504 mode to get Isabelle font glyphs as before;
6506 * refined token_translation interface; INCOMPATIBILITY: output length
6507 now of type real instead of int;
6509 * theory loader actions may be traced via new ThyInfo.add_hook
6510 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6511 your own database of information attached to *whole* theories -- as
6512 opposed to intra-theory data slots offered via TheoryDataFun;
6514 * proper handling of dangling sort hypotheses (at last!);
6515 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6516 extra sort hypotheses that can be witnessed from the type signature;
6517 the force_strip_shyps flag is gone, any remaining shyps are simply
6518 left in the theorem (with a warning issued by strip_shyps_warning);
6522 New in Isabelle98-1 (October 1998)
6523 ----------------------------------
6525 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6527 * several changes of automated proof tools;
6529 * HOL: major changes to the inductive and datatype packages, including
6530 some minor incompatibilities of theory syntax;
6532 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6535 * HOL: removed duplicate thms in Arith:
6536 less_imp_add_less should be replaced by trans_less_add1
6537 le_imp_add_le should be replaced by trans_le_add1
6539 * HOL: unary minus is now overloaded (new type constraints may be
6542 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6543 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6544 now taken as an integer constant.
6546 * Pure: ML function 'theory_of' renamed to 'theory';
6552 1. Asm_full_simp_tac is now more aggressive.
6553 1. It will sometimes reorient premises if that increases their power to
6555 2. It does no longer proceed strictly from left to right but may also
6556 rotate premises to achieve further simplification.
6557 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6558 old Asm_full_simp_tac in that it does not rotate premises.
6559 2. The simplifier now knows a little bit about nat-arithmetic.
6561 * Classical reasoner: wrapper mechanism for the classical reasoner now
6562 allows for selected deletion of wrappers, by introduction of names for
6563 wrapper functionals. This implies that addbefore, addSbefore,
6564 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6565 and that adding two tactics with the same name overwrites the first
6566 one (emitting a warning).
6567 type wrapper = (int -> tactic) -> (int -> tactic)
6568 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6569 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6570 delWrapper, delSWrapper: claset * string -> claset
6571 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6573 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6574 semantics; addbefore now affects only the unsafe part of step_tac
6575 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6576 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6579 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6580 compWrapper; added safe wrapper (and access functions for it);
6582 * HOL/split_all_tac is now much faster and fails if there is nothing
6583 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6584 and the names of the automatically generated variables have changed.
6585 split_all_tac has moved within claset() from unsafe wrappers to safe
6586 wrappers, which means that !!-bound variables are split much more
6587 aggressively, and safe_tac and clarify_tac now split such variables.
6588 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6589 Note: the same holds for record_split_tac, which does the job of
6590 split_all_tac for record fields.
6592 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6593 permanently to the default simpset using Addsplits just like
6594 Addsimps. They can be removed via Delsplits just like
6595 Delsimps. Lower-case versions are also available.
6597 * HOL/Simplifier: The rule split_if is now part of the default
6598 simpset. This means that the simplifier will eliminate all occurrences
6599 of if-then-else in the conclusion of a goal. To prevent this, you can
6600 either remove split_if completely from the default simpset by
6601 `Delsplits [split_if]' or remove it in a specific call of the
6602 simplifier using `... delsplits [split_if]'. You can also add/delete
6603 other case splitting rules to/from the default simpset: every datatype
6604 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6605 t is the name of the datatype).
6607 * Classical reasoner / Simplifier combination: new force_tac (and
6608 derivatives Force_tac, force) combines rewriting and classical
6609 reasoning (and whatever other tools) similarly to auto_tac, but is
6610 aimed to solve the given subgoal completely.
6615 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6616 and `goalw': the theory is no longer needed as an explicit argument -
6617 the current theory context is used; assumptions are no longer returned
6618 at the ML-level unless one of them starts with ==> or !!; it is
6619 recommended to convert to these new commands using isatool fixgoal
6620 (backup your sources first!);
6622 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6623 the current theory context, and 'theory' to lookup stored theories;
6625 * new theory section 'locale' for declaring constants, assumptions and
6626 definitions that have local scope;
6628 * new theory section 'nonterminals' for purely syntactic types;
6630 * new theory section 'setup' for generic ML setup functions
6631 (e.g. package initialization);
6633 * the distribution now includes Isabelle icons: see
6634 lib/logo/isabelle-{small,tiny}.xpm;
6636 * isatool install - install binaries with absolute references to
6639 * isatool logo -- create instances of the Isabelle logo (as EPS);
6641 * print mode 'emacs' reserved for Isamode;
6643 * support multiple print (ast) translations per constant name;
6645 * theorems involving oracles are now printed with a suffixed [!];
6650 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6652 * HOL/inductive package reorganized and improved: now supports mutual
6658 oddI "n : EVEN ==> Suc n : ODD"
6659 evenI "n : ODD ==> Suc n : EVEN"
6661 new theorem list "elims" contains an elimination rule for each of the
6662 recursive sets; inductive definitions now handle disjunctive premises
6663 correctly (also ZF);
6665 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6666 "mutual_induct" no longer exists - the induction rule is always
6667 contained in "induct";
6670 * HOL/datatype package re-implemented and greatly improved: now
6671 supports mutually recursive datatypes such as
6674 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6675 | SUM ('a aexp) ('a aexp)
6676 | DIFF ('a aexp) ('a aexp)
6679 'a bexp = LESS ('a aexp) ('a aexp)
6680 | AND ('a bexp) ('a bexp)
6681 | OR ('a bexp) ('a bexp)
6683 as well as indirectly recursive datatypes such as
6686 ('a, 'b) term = Var 'a
6687 | App 'b ((('a, 'b) term) list)
6689 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6690 induction on mutually / indirectly recursive datatypes.
6692 Primrec equations are now stored in theory and can be accessed via
6693 <function_name>.simps.
6697 - Theories using datatypes must now have theory Datatype as an
6699 - The specific <typename>.induct_tac no longer exists - use the
6700 generic induct_tac instead.
6701 - natE has been renamed to nat.exhaust - use exhaust_tac
6702 instead of res_inst_tac ... natE. Note that the variable
6703 names in nat.exhaust differ from the names in natE, this
6704 may cause some "fragile" proofs to fail.
6705 - The theorems split_<typename>_case and split_<typename>_case_asm
6706 have been renamed to <typename>.split and <typename>.split_asm.
6707 - Since default sorts of type variables are now handled correctly,
6708 some datatype definitions may have to be annotated with explicit
6710 - Primrec definitions no longer require function name and type
6711 of recursive argument.
6713 Consider using isatool fixdatatype to adapt your theories and proof
6714 scripts to the new package (backup your sources first!).
6717 * HOL/record package: considerably improved implementation; now
6718 includes concrete syntax for record types, terms, updates; theorems
6719 for surjective pairing and splitting !!-bound record variables; proof
6720 support is as follows:
6722 1) standard conversions (selectors or updates applied to record
6723 constructor terms) are part of the standard simpset;
6725 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6726 made part of standard simpset and claset via addIffs;
6728 3) a tactic for record field splitting (record_split_tac) is part of
6729 the standard claset (addSWrapper);
6731 To get a better idea about these rules you may retrieve them via
6732 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6733 the name of your record type.
6735 The split tactic 3) conceptually simplifies by the following rule:
6737 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6739 Thus any record variable that is bound by meta-all will automatically
6740 blow up into some record constructor term, consequently the
6741 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6742 solve record problems automatically.
6745 * reorganized the main HOL image: HOL/Integ and String loaded by
6746 default; theory Main includes everything;
6748 * automatic simplification of integer sums and comparisons, using cancellation;
6750 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6752 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6754 * many new identities for unions, intersections, set difference, etc.;
6756 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6757 called split_if, split_split, split_sum_case and split_nat_case (to go
6758 with add/delsplits);
6760 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6761 (?x::unit) = (); this is made part of the default simpset, which COULD
6762 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6763 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6764 unit_abs_eta_conv is added in order to counter the effect of
6765 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6768 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6771 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6772 It and 'sym RS equals0D' are now in the default claset, giving automatic
6773 disjointness reasoning but breaking a few old proofs.
6775 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6776 to 'converse' from 'inverse' (for compatibility with ZF and some
6779 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6780 the well-founded relation;
6782 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6783 Compl A. The "Compl" syntax remains available as input syntax for this
6786 * HOL/Update: new theory of function updates:
6787 f(a:=b) == %x. if x=a then b else f x
6788 may also be iterated as in f(a:=b,c:=d,...);
6790 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6793 - new function list_update written xs[i:=v] that updates the i-th
6794 list position. May also be iterated as in xs[i:=a,j:=b,...].
6795 - new function `upt' written [i..j(] which generates the list
6796 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6797 bound write [i..j], which is a shorthand for [i..j+1(].
6798 - new lexicographic orderings and corresponding wellfoundedness theorems.
6801 - removed 'pred' (predecessor) function;
6802 - generalized some theorems about n-1;
6803 - many new laws about "div" and "mod";
6804 - new laws about greatest common divisors (see theory ex/Primes);
6806 * HOL/Relation: renamed the relational operator r^-1 "converse"
6807 instead of "inverse";
6809 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6810 of the multiset ordering;
6812 * directory HOL/Real: a construction of the reals using Dedekind cuts
6813 (not included by default);
6815 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6817 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6818 programs, i.e. different program variables may have different types.
6820 * calling (stac rew i) now fails if "rew" has no effect on the goal
6821 [previously, this check worked only if the rewrite rule was unconditional]
6822 Now rew can involve either definitions or equalities (either == or =).
6827 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6828 only the theorems proved on ZF.ML;
6830 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6831 It and 'sym RS equals0D' are now in the default claset, giving automatic
6832 disjointness reasoning but breaking a few old proofs.
6834 * ZF/Update: new theory of function updates
6835 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6836 may also be iterated as in f(a:=b,c:=d,...);
6838 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6840 * calling (stac rew i) now fails if "rew" has no effect on the goal
6841 [previously, this check worked only if the rewrite rule was unconditional]
6842 Now rew can involve either definitions or equalities (either == or =).
6844 * case_tac provided for compatibility with HOL
6845 (like the old excluded_middle_tac, but with subgoals swapped)
6848 *** Internal programming interfaces ***
6850 * Pure: several new basic modules made available for general use, see
6851 also src/Pure/README;
6853 * improved the theory data mechanism to support encapsulation (data
6854 kind name replaced by private Object.kind, acting as authorization
6855 key); new type-safe user interface via functor TheoryDataFun; generic
6856 print_data function becomes basically useless;
6858 * removed global_names compatibility flag -- all theory declarations
6859 are qualified by default;
6861 * module Pure/Syntax now offers quote / antiquote translation
6862 functions (useful for Hoare logic etc. with implicit dependencies);
6863 see HOL/ex/Antiquote for an example use;
6865 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6868 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6871 * Display.print_goals function moved to Locale.print_goals;
6873 * standard print function for goals supports current_goals_markers
6874 variable for marking begin of proof, end of proof, start of goal; the
6875 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6876 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6881 New in Isabelle98 (January 1998)
6882 --------------------------------
6884 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6886 * changed lexical syntax of terms / types: dots made part of long
6887 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6889 * simpset (and claset) reference variable replaced by functions
6890 simpset / simpset_ref;
6892 * no longer supports theory aliases (via merge) and non-trivial
6893 implicit merge of thms' signatures;
6895 * most internal names of constants changed due to qualified names;
6897 * changed Pure/Sequence interface (see Pure/seq.ML);
6900 *** General Changes ***
6902 * hierachically structured name spaces (for consts, types, axms, thms
6903 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6904 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6905 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6906 long_names for fully qualified output names; NOTE: ML programs
6907 (special tactics, packages etc.) referring to internal names may have
6908 to be adapted to cope with fully qualified names; in case of severe
6909 backward campatibility problems try setting 'global_names' at compile
6910 time to have enrything declared within a flat name space; one may also
6911 fine tune name declarations in theories via the 'global' and 'local'
6914 * reimplemented the implicit simpset and claset using the new anytype
6915 data filed in signatures; references simpset:simpset ref etc. are
6916 replaced by functions simpset:unit->simpset and
6917 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6918 to patch your ML files accordingly;
6920 * HTML output now includes theory graph data for display with Java
6921 applet or isatool browser; data generated automatically via isatool
6922 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6924 * defs may now be conditional; improved rewrite_goals_tac to handle
6925 conditional equations;
6927 * defs now admits additional type arguments, using TYPE('a) syntax;
6929 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6930 creates a new theory node; implicit merge of thms' signatures is
6931 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6932 transfer:theory->thm->thm in (rare) cases;
6934 * improved handling of draft signatures / theories; draft thms (and
6935 ctyps, cterms) are automatically promoted to real ones;
6937 * slightly changed interfaces for oracles: admit many per theory, named
6938 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6940 * print_goals: optional output of const types (set show_consts and
6943 * improved output of warnings (###) and errors (***);
6945 * subgoal_tac displays a warning if the new subgoal has type variables;
6947 * removed old README and Makefiles;
6949 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6951 * removed obsolete init_pps and init_database;
6953 * deleted the obsolete tactical STATE, which was declared by
6954 fun STATE tacfun st = tacfun st st;
6956 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6957 (which abbreviates $HOME);
6959 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6960 use isatool fixseq to adapt your ML programs (this works for fully
6961 qualified references to the Sequence structure only!);
6963 * use_thy no longer requires writable current directory; it always
6964 reloads .ML *and* .thy file, if either one is out of date;
6967 *** Classical Reasoner ***
6969 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6970 tactics that use classical reasoning to simplify a subgoal without
6971 splitting it into several subgoals;
6973 * Safe_tac: like safe_tac but uses the default claset;
6978 * added simplification meta rules:
6979 (asm_)(full_)simplify: simpset -> thm -> thm;
6981 * simplifier.ML no longer part of Pure -- has to be loaded by object
6984 * added prems argument to simplification procedures;
6986 * HOL, FOL, ZF: added infix function `addsplits':
6987 instead of `<simpset> setloop (split_tac <thms>)'
6988 you can simply write `<simpset> addsplits <thms>'
6993 * TYPE('a) syntax for type reflection terms;
6995 * no longer handles consts with name "" -- declare as 'syntax' instead;
6997 * pretty printer: changed order of mixfix annotation preference (again!);
6999 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7004 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7005 with `addloop' of the simplifier to faciliate case splitting in premises.
7007 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7009 * HOL/Auth: new protocol proofs including some for the Internet
7012 * HOL/Map: new theory of `maps' a la VDM;
7014 * HOL/simplifier: simplification procedures nat_cancel_sums for
7015 cancelling out common nat summands from =, <, <= (in)equalities, or
7016 differences; simplification procedures nat_cancel_factor for
7017 cancelling common factor from =, <, <= (in)equalities over natural
7018 sums; nat_cancel contains both kinds of procedures, it is installed by
7019 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7021 * HOL/simplifier: terms of the form
7022 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7024 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7025 and those of the form
7026 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7028 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7031 Each datatype `t' now comes with a theorem `split_t_case' of the form
7033 P(t_case f1 ... fn x) =
7034 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7036 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7039 and a theorem `split_t_case_asm' of the form
7041 P(t_case f1 ... fn x) =
7042 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7044 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7046 which can be added to a simpset via `addsplits'. The existing theorems
7047 expand_list_case and expand_option_case have been renamed to
7048 split_list_case and split_option_case.
7051 - `pred n' is automatically converted to `n-1'.
7052 Users are strongly encouraged not to use `pred' any longer,
7053 because it will disappear altogether at some point.
7054 - Users are strongly encouraged to write "0 < n" rather than
7055 "n ~= 0". Theorems and proof tools have been modified towards this
7059 the function "set_of_list" has been renamed "set" (and its theorems too);
7060 the function "nth" now takes its arguments in the reverse order and
7061 has acquired the infix notation "!" as in "xs!n".
7063 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7065 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7066 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7068 * HOL/record: extensible records with schematic structural subtyping
7069 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7070 still lacks various theorems and concrete record syntax;
7075 * removed "axioms" and "generated by" sections;
7077 * replaced "ops" section by extended "consts" section, which is capable of
7078 handling the continuous function space "->" directly;
7081 . proves theorems immediately and stores them in the theory,
7082 . creates hierachical name space,
7083 . now uses normal mixfix annotations (instead of cinfix...),
7084 . minor changes to some names and values (for consistency),
7085 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7086 . separator between mutual domain defs: changed "," to "and",
7087 . improved handling of sort constraints; now they have to
7088 appear on the left-hand side of the equations only;
7090 * fixed LAM <x,y,zs>.b syntax;
7092 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7093 adm (%x. P (t x)), where P is chainfinite and t continuous;
7098 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7099 with `addloop' of the simplifier to faciliate case splitting in premises.
7101 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7102 in HOL, they strip ALL and --> from proved theorems;
7106 New in Isabelle94-8 (May 1997)
7107 ------------------------------
7109 *** General Changes ***
7111 * new utilities to build / run / maintain Isabelle etc. (in parts
7112 still somewhat experimental); old Makefiles etc. still functional;
7114 * new 'Isabelle System Manual';
7116 * INSTALL text, together with ./configure and ./build scripts;
7118 * reimplemented type inference for greater efficiency, better error
7119 messages and clean internal interface;
7121 * prlim command for dealing with lots of subgoals (an easier way of
7122 setting goals_limit);
7127 * supports alternative (named) syntax tables (parser and pretty
7128 printer); internal interface is provided by add_modesyntax(_i);
7130 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7131 be used in conjunction with the Isabelle symbol font; uses the
7132 "symbols" syntax table;
7134 * added token_translation interface (may translate name tokens in
7135 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7136 the current print_mode); IMPORTANT: user print translation functions
7137 are responsible for marking newly introduced bounds
7138 (Syntax.mark_boundT);
7140 * token translations for modes "xterm" and "xterm_color" that display
7141 names in bold, underline etc. or colors (which requires a color
7144 * infixes may now be declared with names independent of their syntax;
7146 * added typed_print_translation (like print_translation, but may
7147 access type of constant);
7150 *** Classical Reasoner ***
7152 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7153 some limitations. Blast_tac...
7154 + ignores addss, addbefore, addafter; this restriction is intrinsic
7155 + ignores elimination rules that don't have the correct format
7156 (the conclusion MUST be a formula variable)
7157 + ignores types, which can make HOL proofs fail
7158 + rules must not require higher-order unification, e.g. apply_type in ZF
7159 [message "Function Var's argument not a bound variable" relates to this]
7160 + its proof strategy is more general but can actually be slower
7162 * substitution with equality assumptions no longer permutes other
7165 * minor changes in semantics of addafter (now called addaltern); renamed
7166 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7167 (and access functions for it);
7169 * improved combination of classical reasoner and simplifier:
7170 + functions for handling clasimpsets
7171 + improvement of addss: now the simplifier is called _after_ the
7173 + safe variant of addss called addSss: uses safe simplifications
7174 _during_ the safe steps. It is more complete as it allows multiple
7175 instantiations of unknowns (e.g. with slow_tac).
7179 * added interface for simplification procedures (functions that
7180 produce *proven* rewrite rules on the fly, depending on current
7183 * ordering on terms as parameter (used for ordered rewriting);
7185 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7187 * the solver is now split into a safe and an unsafe part.
7188 This should be invisible for the normal user, except that the
7189 functions setsolver and addsolver have been renamed to setSolver and
7190 addSolver; added safe_asm_full_simp_tac;
7195 * a generic induction tactic `induct_tac' which works for all datatypes and
7196 also for type `nat';
7198 * a generic case distinction tactic `exhaust_tac' which works for all
7199 datatypes and also for type `nat';
7201 * each datatype comes with a function `size';
7203 * patterns in case expressions allow tuple patterns as arguments to
7204 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7206 * primrec now also works with type nat;
7208 * recdef: a new declaration form, allows general recursive functions to be
7209 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7211 * the constant for negation has been renamed from "not" to "Not" to
7212 harmonize with FOL, ZF, LK, etc.;
7214 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7217 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7219 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7220 problems in commutative rings, using axiomatic type classes for + and *;
7222 * more examples in HOL/MiniML and HOL/Auth;
7224 * more default rewrite rules for quantifiers, union/intersection;
7226 * a new constant `arbitrary == @x.False';
7228 * HOLCF/IOA replaces old HOL/IOA;
7230 * HOLCF changes: derived all rules and arities
7231 + axiomatic type classes instead of classes
7232 + typedef instead of faking type definitions
7233 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7234 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7235 + eliminated the types void, one, tr
7236 + use unit lift and bool lift (with translations) instead of one and tr
7237 + eliminated blift from Lift3.thy (use Def instead of blift)
7238 all eliminated rules are derived as theorems --> no visible changes ;
7243 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7244 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7245 as ZF_cs addSIs [equalityI];
7249 New in Isabelle94-7 (November 96)
7250 ---------------------------------
7252 * allowing negative levels (as offsets) in prlev and choplev;
7254 * super-linear speedup for large simplifications;
7256 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7257 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7258 FAIL); can suppress it using the command Delsimps (ex_simps @
7259 all_simps); De Morgan laws are also now included, by default;
7261 * improved printing of ==> : ~:
7263 * new object-logic "Sequents" adds linear logic, while replacing LK
7264 and Modal (thanks to Sara Kalvala);
7266 * HOL/Auth: correctness proofs for authentication protocols;
7268 * HOL: new auto_tac combines rewriting and classical reasoning (many
7269 examples on HOL/Auth);
7271 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7272 the rewriter and classical reasoner simultaneously;
7274 * function uresult no longer returns theorems in "standard" format;
7275 regain previous version by: val uresult = standard o uresult;
7282 * oracles -- these establish an interface between Isabelle and trusted
7283 external reasoners, which may deliver results as theorems;
7285 * proof objects (in particular record all uses of oracles);
7287 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7289 * "constdefs" section in theory files;
7291 * "primrec" section (HOL) no longer requires names;
7293 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7300 * reduced space requirements;
7302 * automatic HTML generation from theories;
7304 * theory files no longer require "..." (quotes) around most types;
7306 * new examples, including two proofs of the Church-Rosser theorem;
7308 * non-curried (1994) version of HOL is no longer distributed;
7315 * greatly reduced space requirements;
7317 * theory files (.thy) no longer require \...\ escapes at line breaks;
7319 * searchable theorem database (see the section "Retrieving theorems" on
7320 page 8 of the Reference Manual);
7322 * new examples, including Grabczewski's monumental case study of the
7325 * The previous version of HOL renamed to Old_HOL;
7327 * The new version of HOL (previously called CHOL) uses a curried syntax
7328 for functions. Application looks like f a b instead of f(a,b);
7330 * Mutually recursive inductive definitions finally work in HOL;
7332 * In ZF, pattern-matching on tuples is now available in all abstractions and
7333 translates to the operator "split";
7340 * new infix operator, addss, allowing the classical reasoner to
7341 perform simplification at each step of its search. Example:
7342 fast_tac (cs addss ss)
7344 * a new logic, CHOL, the same as HOL, but with a curried syntax
7345 for functions. Application looks like f a b instead of f(a,b). Also pairs
7346 look like (a,b) instead of <a,b>;
7348 * PLEASE NOTE: CHOL will eventually replace HOL!
7350 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7351 It translates to the operator "split". A new theory of integers is available;
7353 * In ZF, integer numerals now denote two's-complement binary integers.
7354 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7356 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7357 of the Axiom of Choice;
7364 * Significantly faster resolution;
7366 * the different sections in a .thy file can now be mixed and repeated
7369 * Database of theorems for FOL, HOL and ZF. New
7370 commands including qed, qed_goal and bind_thm store theorems in the database.
7372 * Simple database queries: return a named theorem (get_thm) or all theorems of
7373 a given theory (thms_of), or find out what theory a theorem was proved in
7376 * Bugs fixed in the inductive definition and datatype packages;
7378 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7379 and HOL_dup_cs obsolete;
7381 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7384 * Simpler definition of function space in ZF;
7386 * new results about cardinal and ordinal arithmetic in ZF;
7388 * 'subtype' facility in HOL for introducing new types as subsets of existing
7391 :mode=text:wrap=hard:maxLineLen=72: