1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Explicit treatment of UTF8 sequences as Isabelle symbols, such that
10 a Unicode character is treated as a single symbol, not a sequence of
11 non-ASCII bytes as before. Since Isabelle/ML string literals may
12 contain symbols without further backslash escapes, Unicode can now be
13 used here as well. Recall that Symbol.explode in ML provides a
14 consistent view on symbols, while raw explode (or String.explode)
15 merely give a byte-oriented representation.
17 * Theory loading: only the master source file is looked-up in the
18 implicit load path, all other files are addressed relatively to its
19 directory. Minor INCOMPATIBILITY, subtle change in semantics.
21 * Special treatment of ML file names has been discontinued.
22 Historically, optional extensions .ML or .sml were added on demand --
23 at the cost of clarity of file dependencies. Recall that Isabelle/ML
24 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
29 * Interpretation command 'interpret' accepts a list of equations like
30 'interpretation' does.
32 * Diagnostic command 'print_interps' prints interpretations in proofs
33 in addition to interpretations in theories.
38 * Records: logical foundation type for records do not carry a '_type' suffix
39 any longer. INCOMPATIBILITY.
41 * Code generation for records: more idiomatic representation of record types.
42 Warning: records are not covered by ancient SML code generation any longer.
43 INCOMPATIBILITY. In cases of need, a suitable rep_datatype declaration
44 helps to succeed then:
48 rep_datatype foo_ext ...
50 * Session Imperative_HOL: revamped, corrected dozens of inadequacies.
53 * Quickcheck in locales considers interpretations of that locale for
54 counter example search.
56 * Theory Library/Monad_Syntax provides do-syntax for monad types. Syntax
57 in Library/State_Monad has been changed to avoid ambiguities.
60 * Code generator: export_code without explicit file declaration prints
61 to standard output. INCOMPATIBILITY.
63 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
64 respectively. INCOMPATIBILITY.
66 * Constant "split" has been merged with constant "prod_case"; names
67 of ML functions, facts etc. involving split have been retained so far,
68 though. INCOMPATIBILITY.
70 * Dropped old infix syntax "mem" for List.member; use "in set"
71 instead. INCOMPATIBILITY.
73 * Refactoring of code-generation specific operations in List.thy
80 null_empty ~> null_def
82 INCOMPATIBILITY. Note that these were not suppossed to be used
83 regularly unless for striking reasons; their main purpose was code
86 * Some previously unqualified names have been qualified:
95 Pair ~> Product_Type.Pair
96 fst ~> Product_Type.fst
97 snd ~> Product_Type.snd
98 curry ~> Product_Type.curry
100 Collect ~> Set.Collect
104 * Removed simplifier congruence rule of "prod_case", as has for long
105 been the case with "split".
107 * Datatype package: theorems generated for executable equality
108 (class eq) carry proper names and are treated as default code
111 * List.thy: use various operations from the Haskell prelude when
112 generating Haskell code.
114 * code_simp.ML: simplification with rules determined by
117 * code generator: do not print function definitions for case
118 combinators any longer.
120 * Multivariate Analysis: Introduced a type class for euclidean space. Most
121 theorems are now stated in terms of euclidean spaces instead of finite
125 real ^ 'n ~> 'a::real_vector
126 ~> 'a::euclidean_space
127 ~> 'a::ordered_euclidean_space
128 (depends on your needs)
132 \<chi> x. _ ~> \<chi>\<chi> x. _
135 Also note that the indices are now natural numbers and not from some finite
136 type. Finite cartesian products of euclidean spaces, products of euclidean
137 spaces the real and complex numbers are instantiated to be euclidean_spaces.
141 * Inductive package: offers new command "inductive_simps" to automatically
142 derive instantiated and simplified equations for inductive predicates,
143 similar to inductive_cases.
148 * ML antiquotations @{theory} and @{theory_ref} refer to named
149 theories from the ancestry of the current context, not any accidental
150 theory loader state as before. Potential INCOMPATIBILITY, subtle
155 New in Isabelle2009-2 (June 2010)
156 ---------------------------------
160 * Authentic syntax for *all* logical entities (type classes, type
161 constructors, term constants): provides simple and robust
162 correspondence between formal entities and concrete syntax. Within
163 the parse tree / AST representations, "constants" are decorated by
164 their category (class, type, const) and spelled out explicitly with
165 their full internal name.
167 Substantial INCOMPATIBILITY concerning low-level syntax declarations
168 and translations (translation rules and translation functions in ML).
169 Some hints on upgrading:
171 - Many existing uses of 'syntax' and 'translations' can be replaced
172 by more modern 'type_notation', 'notation' and 'abbreviation',
173 which are independent of this issue.
175 - 'translations' require markup within the AST; the term syntax
176 provides the following special forms:
178 CONST c -- produces syntax version of constant c from context
179 XCONST c -- literally c, checked as constant from context
180 c -- literally c, if declared by 'syntax'
182 Plain identifiers are treated as AST variables -- occasionally the
183 system indicates accidental variables via the error "rhs contains
186 Type classes and type constructors are marked according to their
187 concrete syntax. Some old translations rules need to be written
188 for the "type" category, using type constructor application
189 instead of pseudo-term application of the default category
192 - 'parse_translation' etc. in ML may use the following
195 @{class_syntax c} -- type class c within parse tree / AST
196 @{term_syntax c} -- type constructor c within parse tree / AST
197 @{const_syntax c} -- ML version of "CONST c" above
198 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
200 - Literal types within 'typed_print_translations', i.e. those *not*
201 represented as pseudo-terms are represented verbatim. Use @{class
202 c} or @{type_name c} here instead of the above syntax
205 Note that old non-authentic syntax was based on unqualified base
206 names, so all of the above "constant" names would coincide. Recall
207 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
208 diagnose syntax problems.
210 * Type constructors admit general mixfix syntax, not just infix.
212 * Concrete syntax may be attached to local entities without a proof
213 body, too. This works via regular mixfix annotations for 'fix',
214 'def', 'obtain' etc. or via the explicit 'write' command, which is
215 similar to the 'notation' command in theory specifications.
217 * Discontinued unnamed infix syntax (legacy feature for many years) --
218 need to specify constant name and syntax separately. Internal ML
219 datatype constructors have been renamed from InfixName to Infix etc.
220 Minor INCOMPATIBILITY.
222 * Schematic theorem statements need to be explicitly markup as such,
223 via commands 'schematic_lemma', 'schematic_theorem',
224 'schematic_corollary'. Thus the relevance of the proof is made
225 syntactically clear, which impacts performance in a parallel or
226 asynchronous interactive environment. Minor INCOMPATIBILITY.
228 * Use of cumulative prems via "!" in some proof methods has been
229 discontinued (old legacy feature).
231 * References 'trace_simp' and 'debug_simp' have been replaced by
232 configuration options stored in the context. Enabling tracing (the
233 case of debugging is similar) in proofs works via
235 using [[trace_simp = true]]
237 Tracing is then active for all invocations of the simplifier in
238 subsequent goal refinement steps. Tracing may also still be enabled or
239 disabled via the ProofGeneral settings menu.
241 * Separate commands 'hide_class', 'hide_type', 'hide_const',
242 'hide_fact' replace the former 'hide' KIND command. Minor
245 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
246 more efficient than combinations with -q1 or -q2.
251 * Proofterms record type-class reasoning explicitly, using the
252 "unconstrain" operation internally. This eliminates all sort
253 constraints from a theorem and proof, introducing explicit
254 OFCLASS-premises. On the proof term level, this operation is
255 automatically applied at theorem boundaries, such that closed proofs
256 are always free of sort constraints. INCOMPATIBILITY for tools that
259 * Local theory specifications may depend on extra type variables that
260 are not present in the result type -- arguments TYPE('a) :: 'a itself
261 are added internally. For example:
263 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
265 * Predicates of locales introduced by classes carry a mandatory
266 "class" prefix. INCOMPATIBILITY.
268 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
270 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
273 * Command 'code_reflect' allows to incorporate generated ML code into
274 runtime environment; replaces immature code_datatype antiquotation.
277 * Code generator: simple concept for abstract datatypes obeying
280 * Code generator: details of internal data cache have no impact on the
281 user space functionality any longer.
283 * Methods "unfold_locales" and "intro_locales" ignore non-locale
284 subgoals. This is more appropriate for interpretations with 'where'.
287 * Command 'example_proof' opens an empty proof body. This allows to
288 experiment with Isar, without producing any persistent result.
290 * Commands 'type_notation' and 'no_type_notation' declare type syntax
291 within a local theory context, with explicit checking of the
292 constructors involved (in contrast to the raw 'syntax' versions).
294 * Commands 'types' and 'typedecl' now work within a local theory
295 context -- without introducing dependencies on parameters or
296 assumptions, which is not possible in Isabelle/Pure.
298 * Command 'defaultsort' has been renamed to 'default_sort', it works
299 within a local theory context. Minor INCOMPATIBILITY.
304 * Command 'typedef' now works within a local theory context -- without
305 introducing dependencies on parameters or assumptions, which is not
306 possible in Isabelle/Pure/HOL. Note that the logical environment may
307 contain multiple interpretations of local typedefs (with different
308 non-emptiness proofs), even in a global theory context.
310 * New package for quotient types. Commands 'quotient_type' and
311 'quotient_definition' may be used for defining types and constants by
312 quotient constructions. An example is the type of integers created by
313 quotienting pairs of natural numbers:
316 intrel :: "(nat * nat) => (nat * nat) => bool"
318 "intrel (x, y) (u, v) = (x + v = u + y)"
320 quotient_type int = "nat * nat" / intrel
321 by (auto simp add: equivp_def expand_fun_eq)
324 "0::int" is "(0::nat, 0::nat)"
326 The method "lifting" can be used to lift of theorems from the
327 underlying "raw" type to the quotient type. The example
328 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
329 construction and provides a reasoning infrastructure for finite sets.
331 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
332 clash with new theory Quotient in Main HOL.
334 * Moved the SMT binding into the main HOL session, eliminating
335 separate HOL-SMT session.
337 * List membership infix mem operation is only an input abbreviation.
340 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
341 for future developements; former Library/Word.thy is still present in
342 the AFP entry RSAPPS.
344 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
345 longer shadowed. INCOMPATIBILITY.
347 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
350 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
353 * Dropped normalizing_semiring etc; use the facts in semiring classes
354 instead. INCOMPATIBILITY.
356 * Dropped several real-specific versions of lemmas about floor and
357 ceiling; use the generic lemmas from theory "Archimedean_Field"
358 instead. INCOMPATIBILITY.
360 floor_number_of_eq ~> floor_number_of
361 le_floor_eq_number_of ~> number_of_le_floor
362 le_floor_eq_zero ~> zero_le_floor
363 le_floor_eq_one ~> one_le_floor
364 floor_less_eq_number_of ~> floor_less_number_of
365 floor_less_eq_zero ~> floor_less_zero
366 floor_less_eq_one ~> floor_less_one
367 less_floor_eq_number_of ~> number_of_less_floor
368 less_floor_eq_zero ~> zero_less_floor
369 less_floor_eq_one ~> one_less_floor
370 floor_le_eq_number_of ~> floor_le_number_of
371 floor_le_eq_zero ~> floor_le_zero
372 floor_le_eq_one ~> floor_le_one
373 floor_subtract_number_of ~> floor_diff_number_of
374 floor_subtract_one ~> floor_diff_one
375 ceiling_number_of_eq ~> ceiling_number_of
376 ceiling_le_eq_number_of ~> ceiling_le_number_of
377 ceiling_le_zero_eq ~> ceiling_le_zero
378 ceiling_le_eq_one ~> ceiling_le_one
379 less_ceiling_eq_number_of ~> number_of_less_ceiling
380 less_ceiling_eq_zero ~> zero_less_ceiling
381 less_ceiling_eq_one ~> one_less_ceiling
382 ceiling_less_eq_number_of ~> ceiling_less_number_of
383 ceiling_less_eq_zero ~> ceiling_less_zero
384 ceiling_less_eq_one ~> ceiling_less_one
385 le_ceiling_eq_number_of ~> number_of_le_ceiling
386 le_ceiling_eq_zero ~> zero_le_ceiling
387 le_ceiling_eq_one ~> one_le_ceiling
388 ceiling_subtract_number_of ~> ceiling_diff_number_of
389 ceiling_subtract_one ~> ceiling_diff_one
391 * Theory "Finite_Set": various folding_XXX locales facilitate the
392 application of the various fold combinators on finite sets.
394 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
395 provides abstract red-black tree type which is backed by "RBT_Impl" as
396 implementation. INCOMPATIBILTY.
398 * Theory Library/Coinductive_List has been removed -- superseded by
399 AFP/thys/Coinductive.
401 * Theory PReal, including the type "preal" and related operations, has
402 been removed. INCOMPATIBILITY.
404 * Real: new development using Cauchy Sequences.
406 * Split off theory "Big_Operators" containing setsum, setprod,
407 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
409 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
410 "Int" etc. INCOMPATIBILITY.
412 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
414 * New set of rules "ac_simps" provides combined assoc / commute
415 rewrites for all interpretations of the appropriate generic locales.
417 * Renamed theory "OrderedGroup" to "Groups" and split theory
418 "Ring_and_Field" into theories "Rings" and "Fields"; for more
419 appropriate and more consistent names suitable for name prefixes
420 within the HOL theories. INCOMPATIBILITY.
422 * Some generic constants have been put to appropriate theories:
423 - less_eq, less: Orderings
424 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
425 - inverse, divide: Rings
428 * More consistent naming of type classes involving orderings (and
431 lower_semilattice ~> semilattice_inf
432 upper_semilattice ~> semilattice_sup
434 dense_linear_order ~> dense_linorder
436 pordered_ab_group_add ~> ordered_ab_group_add
437 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
438 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
439 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
440 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
441 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
442 pordered_cancel_semiring ~> ordered_cancel_semiring
443 pordered_comm_monoid_add ~> ordered_comm_monoid_add
444 pordered_comm_ring ~> ordered_comm_ring
445 pordered_comm_semiring ~> ordered_comm_semiring
446 pordered_ring ~> ordered_ring
447 pordered_ring_abs ~> ordered_ring_abs
448 pordered_semiring ~> ordered_semiring
450 ordered_ab_group_add ~> linordered_ab_group_add
451 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
452 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
453 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
454 ordered_field ~> linordered_field
455 ordered_field_no_lb ~> linordered_field_no_lb
456 ordered_field_no_ub ~> linordered_field_no_ub
457 ordered_field_dense_linear_order ~> dense_linordered_field
458 ordered_idom ~> linordered_idom
459 ordered_ring ~> linordered_ring
460 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
461 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
462 ordered_ring_strict ~> linordered_ring_strict
463 ordered_semidom ~> linordered_semidom
464 ordered_semiring ~> linordered_semiring
465 ordered_semiring_1 ~> linordered_semiring_1
466 ordered_semiring_1_strict ~> linordered_semiring_1_strict
467 ordered_semiring_strict ~> linordered_semiring_strict
469 The following slightly odd type classes have been moved to a
470 separate theory Library/Lattice_Algebras:
472 lordered_ab_group_add ~> lattice_ab_group_add
473 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
474 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
475 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
476 lordered_ring ~> lattice_ring
480 * Refined field classes:
481 - classes division_ring_inverse_zero, field_inverse_zero,
482 linordered_field_inverse_zero include rule inverse 0 = 0 --
483 subsumes former division_by_zero class;
484 - numerous lemmas have been ported from field to division_ring.
487 * Refined algebra theorem collections:
488 - dropped theorem group group_simps, use algebra_simps instead;
489 - dropped theorem group ring_simps, use field_simps instead;
490 - proper theorem collection field_simps subsumes former theorem
491 groups field_eq_simps and field_simps;
492 - dropped lemma eq_minus_self_iff which is a duplicate for
496 * Theory Finite_Set and List: some lemmas have been generalized from
499 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
500 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
501 inter_Inter_fold_inter ~> inf_Inf_fold_inf
502 union_Union_fold_union ~> sup_Sup_fold_sup
503 Inter_fold_inter ~> Inf_fold_inf
504 Union_fold_union ~> Sup_fold_sup
505 inter_INTER_fold_inter ~> inf_INFI_fold_inf
506 union_UNION_fold_union ~> sup_SUPR_fold_sup
507 INTER_fold_inter ~> INFI_fold_inf
508 UNION_fold_union ~> SUPR_fold_sup
510 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
511 replaced by the more convenient lemmas Inf_empty and Sup_empty.
512 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
513 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
514 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
515 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
517 * Reorganized theory Multiset: swapped notation of pointwise and
520 - pointwise ordering is instance of class order with standard syntax
522 - multiset ordering has syntax <=# and <#; partial order properties
523 are provided by means of interpretation with prefix
525 - less duplication, less historical organization of sections,
526 conversion from associations lists to multisets, rudimentary code
528 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
533 multiset_eq_conv_count_eq ~> multiset_ext_iff
534 multi_count_ext ~> multiset_ext
535 diff_union_inverse2 ~> diff_union_cancelR
539 * Theory Permutation: replaced local "remove" by List.remove1.
541 * Code generation: ML and OCaml code is decorated with signatures.
543 * Theory List: added transpose.
545 * Library/Nat_Bijection.thy is a collection of bijective functions
546 between nat and other types, which supersedes the older libraries
547 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
550 Nat_Int_Bij.nat2_to_nat ~> prod_encode
551 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
552 Nat_Int_Bij.int_to_nat_bij ~> int_encode
553 Nat_Int_Bij.nat_to_int_bij ~> int_decode
554 Countable.pair_encode ~> prod_encode
555 NatIso.prod2nat ~> prod_encode
556 NatIso.nat2prod ~> prod_decode
557 NatIso.sum2nat ~> sum_encode
558 NatIso.nat2sum ~> sum_decode
559 NatIso.list2nat ~> list_encode
560 NatIso.nat2list ~> list_decode
561 NatIso.set2nat ~> set_encode
562 NatIso.nat2set ~> set_decode
565 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
566 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
567 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
568 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
569 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
570 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
571 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
572 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
573 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
574 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
575 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
576 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
577 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
580 - Renamed ATP commands:
581 atp_info ~> sledgehammer running_atps
582 atp_kill ~> sledgehammer kill_atps
583 atp_messages ~> sledgehammer messages
584 atp_minimize ~> sledgehammer minimize
585 print_atps ~> sledgehammer available_atps
587 - Added user's manual ("isabelle doc sledgehammer").
588 - Added option syntax and "sledgehammer_params" to customize
589 Sledgehammer's behavior. See the manual for details.
590 - Modified the Isar proof reconstruction code so that it produces
591 direct proofs rather than proofs by contradiction. (This feature
592 is still experimental.)
593 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
595 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
598 - Added and implemented "binary_ints" and "bits" options.
599 - Added "std" option and implemented support for nonstandard models.
600 - Added and implemented "finitize" option to improve the precision
601 of infinite datatypes based on a monotonicity analysis.
602 - Added support for quotient types.
603 - Added support for "specification" and "ax_specification"
605 - Added support for local definitions (for "function" and
606 "termination" proofs).
607 - Added support for term postprocessors.
608 - Optimized "Multiset.multiset" and "FinFun.finfun".
609 - Improved efficiency of "destroy_constrs" optimization.
610 - Fixed soundness bugs related to "destroy_constrs" optimization and
612 - Fixed soundness bug related to higher-order constructors.
613 - Fixed soundness bug when "full_descrs" is enabled.
614 - Improved precision of set constructs.
615 - Added "atoms" option.
616 - Added cache to speed up repeated Kodkod invocations on the same
618 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
619 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
620 "SAT4J_Light". INCOMPATIBILITY.
621 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
622 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
623 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
625 * Method "induct" now takes instantiations of the form t, where t is not
626 a variable, as a shorthand for "x == t", where x is a fresh variable.
627 If this is not intended, t has to be enclosed in parentheses.
628 By default, the equalities generated by definitional instantiations
629 are pre-simplified, which may cause parameters of inductive cases
630 to disappear, or may even delete some of the inductive cases.
631 Use "induct (no_simp)" instead of "induct" to restore the old
632 behaviour. The (no_simp) option is also understood by the "cases"
633 and "nominal_induct" methods, which now perform pre-simplification, too.
639 * Variable names in lemmas generated by the domain package have
640 changed; the naming scheme is now consistent with the HOL datatype
641 package. Some proof scripts may be affected, INCOMPATIBILITY.
643 * The domain package no longer defines the function "foo_copy" for
644 recursive domain "foo". The reach lemma is now stated directly in
645 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
646 be reformulated in terms of "foo_take", INCOMPATIBILITY.
648 * Most definedness lemmas generated by the domain package (previously
649 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
650 like "foo$x = UU <-> x = UU", which works better as a simp rule.
651 Proofs that used definedness lemmas as intro rules may break,
652 potential INCOMPATIBILITY.
654 * Induction and casedist rules generated by the domain package now
655 declare proper case_names (one called "bottom", and one named for each
656 constructor). INCOMPATIBILITY.
658 * For mutually-recursive domains, separate "reach" and "take_lemma"
659 rules are generated for each domain, INCOMPATIBILITY.
661 foo_bar.reach ~> foo.reach bar.reach
662 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
664 * Some lemmas generated by the domain package have been renamed for
665 consistency with the datatype package, INCOMPATIBILITY.
667 foo.ind ~> foo.induct
668 foo.finite_ind ~> foo.finite_induct
669 foo.coind ~> foo.coinduct
670 foo.casedist ~> foo.exhaust
671 foo.exhaust ~> foo.nchotomy
673 * For consistency with other definition packages, the fixrec package
674 now generates qualified theorem names, INCOMPATIBILITY.
676 foo_simps ~> foo.simps
677 foo_unfold ~> foo.unfold
678 foo_induct ~> foo.induct
680 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
681 method and internal fixrec proofs now use the default simpset instead.
684 * The "contlub" predicate has been removed. Proof scripts should use
685 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
687 * The "admw" predicate has been removed, INCOMPATIBILITY.
689 * The constants cpair, cfst, and csnd have been removed in favor of
690 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
695 * Antiquotations for basic formal entities:
697 @{class NAME} -- type class
698 @{class_syntax NAME} -- syntax representation of the above
700 @{type_name NAME} -- logical type
701 @{type_abbrev NAME} -- type abbreviation
702 @{nonterminal NAME} -- type of concrete syntactic category
703 @{type_syntax NAME} -- syntax representation of any of the above
705 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
706 @{const_abbrev NAME} -- abbreviated constant
707 @{const_syntax NAME} -- syntax representation of any of the above
709 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
710 syntax constant (cf. 'syntax' command).
712 * Antiquotation @{make_string} inlines a function to print arbitrary
713 values similar to the ML toplevel. The result is compiler dependent
714 and may fall back on "?" in certain situations.
716 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
717 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
718 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
719 not work with the asynchronous Isar document model.
721 * Configuration options now admit dynamic default values, depending on
722 the context or even global references.
724 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
725 uses an efficient external library if available (for Poly/ML).
727 * Renamed some important ML structures, while keeping the old names
728 for some time as aliases within the structure Legacy:
730 OuterKeyword ~> Keyword
733 OuterSyntax ~> Outer_Syntax
734 PrintMode ~> Print_Mode
735 SpecParse ~> Parse_Spec
738 ThyOutput ~> Thy_Output
739 TypeInfer ~> Type_Infer
741 Note that "open Legacy" simplifies porting of sources, but forgetting
742 to remove it again will complicate porting again in the future.
744 * Most operations that refer to a global context are named
745 accordingly, e.g. Simplifier.global_context or
746 ProofContext.init_global. There are some situations where a global
747 context actually works, but under normal circumstances one needs to
748 pass the proper local context through the code!
750 * Discontinued old TheoryDataFun with its copy/init operation -- data
751 needs to be pure. Functor Theory_Data_PP retains the traditional
752 Pretty.pp argument to merge, which is absent in the standard
755 * Sorts.certify_sort and derived "cert" operations for types and terms
756 no longer minimize sorts. Thus certification at the boundary of the
757 inference kernel becomes invariant under addition of class relations,
758 which is an important monotonicity principle. Sorts are now minimized
759 in the syntax layer only, at the boundary between the end-user and the
760 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
761 explicitly in rare situations.
763 * Renamed old-style Drule.standard to Drule.export_without_context, to
764 emphasize that this is in no way a standard operation.
767 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
768 usual for resolution. Rare INCOMPATIBILITY.
770 * Renamed varify/unvarify operations to varify_global/unvarify_global
771 to emphasize that these only work in a global situation (which is
774 * Curried take and drop in library.ML; negative length is interpreted
775 as infinity (as in chop). Subtle INCOMPATIBILITY.
777 * Proof terms: type substitutions on proof constants now use canonical
778 order of type variables. INCOMPATIBILITY for tools working with proof
781 * Raw axioms/defs may no longer carry sort constraints, and raw defs
782 may no longer carry premises. User-level specifications are
783 transformed accordingly by Thm.add_axiom/add_def.
788 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
789 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
790 proof terms are enabled unconditionally in the new HOL-Proofs image.
792 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
793 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
796 * Old lib/scripts/polyml-platform is superseded by the
797 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
798 variant, even on a 64 bit machine. The following example setting
799 prefers 64 bit if available:
801 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
803 * The preliminary Isabelle/jEdit application demonstrates the emerging
804 Isabelle/Scala layer for advanced prover interaction and integration.
805 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
808 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
809 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
810 similar to the default assignment of the document preparation system
811 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
812 provides some operations for direct access to the font without asking
813 the user for manual installation.
817 New in Isabelle2009-1 (December 2009)
818 -------------------------------------
822 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
823 one backslash should be used, even in ML sources.
828 * Locale interpretation propagates mixins along the locale hierarchy.
829 The currently only available mixins are the equations used to map
830 local definitions to terms of the target domain of an interpretation.
832 * Reactivated diagnostic command 'print_interps'. Use "print_interps
833 loc" to print all interpretations of locale "loc" in the theory.
834 Interpretations in proofs are not shown.
836 * Thoroughly revised locales tutorial. New section on conditional
839 * On instantiation of classes, remaining undefined class parameters
840 are formally declared. INCOMPATIBILITY.
843 *** Document preparation ***
845 * New generalized style concept for printing terms: @{foo (style) ...}
846 instead of @{foo_style style ...} (old form is still retained for
847 backward compatibility). Styles can be also applied for
848 antiquotations prop, term_type and typeof.
853 * New proof method "smt" for a combination of first-order logic with
854 equality, linear and nonlinear (natural/integer/real) arithmetic, and
855 fixed-size bitvectors; there is also basic support for higher-order
856 features (esp. lambda abstractions). It is an incomplete decision
857 procedure based on external SMT solvers using the oracle mechanism;
858 for the SMT solver Z3, this method is proof-producing. Certificates
859 are provided to avoid calling the external solvers solely for
860 re-checking proofs. Due to a remote SMT service there is no need for
861 installing SMT solvers locally. See src/HOL/SMT.
863 * New commands to load and prove verification conditions generated by
864 the Boogie program verifier or derived systems (e.g. the Verifying C
865 Compiler (VCC) or Spec#). See src/HOL/Boogie.
867 * New counterexample generator tool 'nitpick' based on the Kodkod
868 relational model finder. See src/HOL/Tools/Nitpick and
869 src/HOL/Nitpick_Examples.
871 * New commands 'code_pred' and 'values' to invoke the predicate
872 compiler and to enumerate values of inductive predicates.
874 * A tabled implementation of the reflexive transitive closure.
876 * New implementation of quickcheck uses generic code generator;
877 default generators are provided for all suitable HOL types, records
878 and datatypes. Old quickcheck can be re-activated importing theory
879 Library/SML_Quickcheck.
881 * New testing tool Mirabelle for automated proof tools. Applies
882 several tools and tactics like sledgehammer, metis, or quickcheck, to
883 every proof step in a theory. To be used in batch mode via the
886 * New proof method "sos" (sum of squares) for nonlinear real
887 arithmetic (originally due to John Harison). It requires theory
888 Library/Sum_Of_Squares. It is not a complete decision procedure but
889 works well in practice on quantifier-free real arithmetic with +, -,
890 *, ^, =, <= and <, i.e. boolean combinations of equalities and
891 inequalities between polynomials. It makes use of external
892 semidefinite programming solvers. Method "sos" generates a
893 certificate that can be pasted into the proof thus avoiding the need
894 to call an external tool every time the proof is checked. See
895 src/HOL/Library/Sum_Of_Squares.
897 * New method "linarith" invokes existing linear arithmetic decision
900 * New command 'atp_minimal' reduces result produced by Sledgehammer.
902 * New Sledgehammer option "Full Types" in Proof General settings menu.
903 Causes full type information to be output to the ATPs. This slows
904 ATPs down considerably but eliminates a source of unsound "proofs"
907 * New method "metisFT": A version of metis that uses full type
908 information in order to avoid failures of proof reconstruction.
910 * New evaluator "approximate" approximates an real valued term using
911 the same method as the approximation method.
913 * Method "approximate" now supports arithmetic expressions as
914 boundaries of intervals and implements interval splitting and Taylor
917 * ML antiquotation @{code_datatype} inserts definition of a datatype
918 generated by the code generator; e.g. see src/HOL/Predicate.thy.
920 * New theory SupInf of the supremum and infimum operators for sets of
923 * New theory Probability, which contains a development of measure
924 theory, eventually leading to Lebesgue integration and probability.
926 * Extended Multivariate Analysis to include derivation and Brouwer's
929 * Reorganization of number theory, INCOMPATIBILITY:
930 - new number theory development for nat and int, in theories Divides
931 and GCD as well as in new session Number_Theory
932 - some constants and facts now suffixed with _nat and _int
934 - former session NumberTheory now named Old_Number_Theory, including
935 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
936 - moved theory Pocklington from src/HOL/Library to
937 src/HOL/Old_Number_Theory
939 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
940 lcm of finite and infinite sets. It is shown that they form a complete
943 * Class semiring_div requires superclass no_zero_divisors and proof of
944 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
945 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
946 generalized to class semiring_div, subsuming former theorems
947 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
948 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
951 * Refinements to lattice classes and sets:
952 - less default intro/elim rules in locale variant, more default
953 intro/elim rules in class variant: more uniformity
954 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
956 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
958 - renamed ACI to inf_sup_aci
959 - new class "boolean_algebra"
960 - class "complete_lattice" moved to separate theory
961 "Complete_Lattice"; corresponding constants (and abbreviations)
962 renamed and with authentic syntax:
963 Set.Inf ~> Complete_Lattice.Inf
964 Set.Sup ~> Complete_Lattice.Sup
965 Set.INFI ~> Complete_Lattice.INFI
966 Set.SUPR ~> Complete_Lattice.SUPR
967 Set.Inter ~> Complete_Lattice.Inter
968 Set.Union ~> Complete_Lattice.Union
969 Set.INTER ~> Complete_Lattice.INTER
970 Set.UNION ~> Complete_Lattice.UNION
971 - authentic syntax for
974 - mere abbreviations:
977 Set.inter (for inf, formerly Set.Int)
978 Set.union (for sup, formerly Set.Un)
979 Complete_Lattice.Inter (for Inf)
980 Complete_Lattice.Union (for Sup)
981 Complete_Lattice.INTER (for INFI)
982 Complete_Lattice.UNION (for SUPR)
983 - object-logic definitions as far as appropriate
985 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
986 Un_subset_iff are explicitly deleted as default simp rules; then also
987 their lattice counterparts le_inf_iff and le_sup_iff have to be
988 deleted to achieve the desired effect.
990 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
991 rules by default any longer; the same applies to min_max.inf_absorb1
992 etc. INCOMPATIBILITY.
994 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
995 pred_set_conv by default. INCOMPATIBILITY.
997 * Power operations on relations and functions are now one dedicated
998 constant "compow" with infix syntax "^^". Power operation on
999 multiplicative monoids retains syntax "^" and is now defined generic
1000 in class power. INCOMPATIBILITY.
1002 * Relation composition "R O S" now has a more standard argument order:
1003 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
1004 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
1005 break, since the O_assoc rule was not rewritten like this. Fix using
1006 O_assoc[symmetric]. The same applies to the curried version "R OO S".
1008 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
1009 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
1012 * Most rules produced by inductive and datatype package have mandatory
1013 prefixes. INCOMPATIBILITY.
1015 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
1016 the attribute of the same name. Each of the theorems in the list
1017 DERIV_intros assumes composition with an additional function and
1018 matches a variable to the derivative, which has to be solved by the
1019 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
1020 of most elementary terms. Former Maclauren.DERIV_tac and
1021 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
1024 * Code generator attributes follow the usual underscore convention:
1025 code_unfold replaces code unfold
1026 code_post replaces code post
1031 sizechange -> size_change
1032 induct_scheme -> induction_schema
1035 * Discontinued abbreviation "arbitrary" of constant "undefined".
1036 INCOMPATIBILITY, use "undefined" directly.
1039 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1040 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1041 Suc_plus1 -> Suc_eq_plus1
1042 *anti_sym -> *antisym*
1043 vector_less_eq_def -> vector_le_def
1046 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1049 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1055 * Theory Representable defines a class "rep" of domains that are
1056 representable (via an ep-pair) in the universal domain type "udom".
1057 Instances are provided for all type constructors defined in HOLCF.
1059 * The 'new_domain' command is a purely definitional version of the
1060 domain package, for representable domains. Syntax is identical to the
1061 old domain package. The 'new_domain' package also supports indirect
1062 recursion using previously-defined type constructors. See
1063 src/HOLCF/ex/New_Domain.thy for examples.
1065 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1066 on the left-hand side of an equation, and then performs
1067 simplification. Rewriting is done using rules declared with the
1068 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1069 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1071 * The pattern-match compiler in 'fixrec' can now handle constructors
1072 with HOL function types. Pattern-match combinators for the Pair
1073 constructor are pre-configured.
1075 * The 'fixrec' package now produces better fixed-point induction rules
1076 for mutually-recursive definitions: Induction rules have conclusions
1077 of the form "P foo bar" instead of "P <foo, bar>".
1079 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1080 been renamed to "below". The name "below" now replaces "less" in many
1081 theorem names. (Legacy theorem names using "less" are still supported
1084 * The 'fixrec' package now supports "bottom patterns". Bottom
1085 patterns can be used to generate strictness rules, or to make
1086 functions more strict (much like the bang-patterns supported by the
1087 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1093 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1094 errors and run-time exceptions, including detailed source positions.
1096 * Structure Name_Space (formerly NameSpace) now manages uniquely
1097 identified entries, with some additional information such as source
1098 position, logical grouping etc.
1100 * Theory and context data is now introduced by the simplified and
1101 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1102 to be pure, but the old TheoryDataFun for mutable data (with explicit
1103 copy operation) is still available for some time.
1105 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1106 provides a high-level programming interface to synchronized state
1107 variables with atomic update. This works via pure function
1108 application within a critical section -- its runtime should be as
1109 short as possible; beware of deadlocks if critical code is nested,
1110 either directly or indirectly via other synchronized variables!
1112 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1113 wraps raw ML references, explicitly indicating their non-thread-safe
1114 behaviour. The Isar toplevel keeps this structure open, to
1115 accommodate Proof General as well as quick and dirty interactive
1116 experiments with references.
1118 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1119 parallel tactical reasoning.
1121 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1122 are similar to SUBPROOF, but are slightly more flexible: only the
1123 specified parts of the subgoal are imported into the context, and the
1124 body tactic may introduce new subgoals and schematic variables.
1126 * Old tactical METAHYPS, which does not observe the proof context, has
1127 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1128 or Subgoal.FOCUS etc.
1130 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1131 functors have their own ML name space there is no point to mark them
1132 separately.) Minor INCOMPATIBILITY.
1134 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1136 * Renamed several structures FooBar to Foo_Bar. Occasional,
1139 * Operations of structure Skip_Proof no longer require quick_and_dirty
1140 mode, which avoids critical setmp.
1142 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1143 combinators for "args". INCOMPATIBILITY, need to use simplified
1144 Attrib/Method.setup introduced in Isabelle2009.
1146 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1147 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1148 last resort. INCOMPATIBILITY.
1150 * Display.pretty_thm now requires a proper context (cf. former
1151 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1152 or even Display.pretty_thm_without_context as last resort.
1155 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1156 Syntax.pretty_typ/term directly, preferably with proper context
1157 instead of global theory.
1162 * Further fine tuning of parallel proof checking, scales up to 8 cores
1163 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1166 * Support for additional "Isabelle components" via etc/components, see
1167 also the system manual.
1169 * The isabelle makeall tool now operates on all components with
1170 IsaMakefile, not just hardwired "logics".
1172 * Removed "compress" option from isabelle-process and isabelle usedir;
1173 this is always enabled.
1175 * Discontinued support for Poly/ML 4.x versions.
1177 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1178 on a given logic image. This requires the lighttpd webserver and is
1179 currently supported on Linux only.
1183 New in Isabelle2009 (April 2009)
1184 --------------------------------
1188 * Simplified main Isabelle executables, with less surprises on
1189 case-insensitive file-systems (such as Mac OS).
1191 - The main Isabelle tool wrapper is now called "isabelle" instead of
1194 - The former "isabelle" alias for "isabelle-process" has been
1195 removed (should rarely occur to regular users).
1197 - The former "isabelle-interface" and its alias "Isabelle" have been
1198 removed (interfaces are now regular Isabelle tools).
1200 Within scripts and make files, the Isabelle environment variables
1201 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1202 respectively. (The latter are still available as legacy feature.)
1204 The old isabelle-interface wrapper could react in confusing ways if
1205 the interface was uninstalled or changed otherwise. Individual
1206 interface tool configuration is now more explicit, see also the
1207 Isabelle system manual. In particular, Proof General is now available
1208 via "isabelle emacs".
1210 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1211 purge installed copies of Isabelle executables and re-run "isabelle
1212 install -p ...", or use symlinks.
1214 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1215 old ~/isabelle, which was slightly non-standard and apt to cause
1216 surprises on case-insensitive file-systems (such as Mac OS).
1218 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1219 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1220 care is required when using older releases of Isabelle. Note that
1221 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1222 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1224 * Proofs of fully specified statements are run in parallel on
1225 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1226 a regular 4-core machine, if the initial heap space is made reasonably
1227 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1229 * The main reference manuals ("isar-ref", "implementation", and
1230 "system") have been updated and extended. Formally checked references
1231 as hyperlinks are now available uniformly.
1236 * Complete re-implementation of locales. INCOMPATIBILITY in several
1237 respects. The most important changes are listed below. See the
1238 Tutorial on Locales ("locales" manual) for details.
1240 - In locale expressions, instantiation replaces renaming. Parameters
1241 must be declared in a for clause. To aid compatibility with previous
1242 parameter inheritance, in locale declarations, parameters that are not
1243 'touched' (instantiation position "_" or omitted) are implicitly added
1244 with their syntax at the beginning of the for clause.
1246 - Syntax from abbreviations and definitions in locales is available in
1247 locale expressions and context elements. The latter is particularly
1248 useful in locale declarations.
1250 - More flexible mechanisms to qualify names generated by locale
1251 expressions. Qualifiers (prefixes) may be specified in locale
1252 expressions, and can be marked as mandatory (syntax: "name!:") or
1253 optional (syntax "name?:"). The default depends for plain "name:"
1254 depends on the situation where a locale expression is used: in
1255 commands 'locale' and 'sublocale' prefixes are optional, in
1256 'interpretation' and 'interpret' prefixes are mandatory. The old
1257 implicit qualifiers derived from the parameter names of a locale are
1258 no longer generated.
1260 - Command "sublocale l < e" replaces "interpretation l < e". The
1261 instantiation clause in "interpretation" and "interpret" (square
1262 brackets) is no longer available. Use locale expressions.
1264 - When converting proof scripts, mandatory qualifiers in
1265 'interpretation' and 'interpret' should be retained by default, even
1266 if this is an INCOMPATIBILITY compared to former behavior. In the
1267 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1268 in locale expressions range over a single locale instance only.
1270 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1271 In existing theorem specifications replace the includes element by the
1272 respective context elements of the included locale, omitting those
1273 that are already present in the theorem specification. Multiple
1274 assume elements of a locale should be replaced by a single one
1275 involving the locale predicate. In the proof body, declarations (most
1276 notably theorems) may be regained by interpreting the respective
1277 locales in the proof context as required (command "interpret").
1279 If using "includes" in replacement of a target solely because the
1280 parameter types in the theorem are not as general as in the target,
1281 consider declaring a new locale with additional type constraints on
1282 the parameters (context element "constrains").
1284 - Discontinued "locale (open)". INCOMPATIBILITY.
1286 - Locale interpretation commands no longer attempt to simplify goal.
1287 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1288 methods intro_locales and unfold_locales to clarify.
1290 - Locale interpretation commands no longer accept interpretation
1291 attributes. INCOMPATIBILITY.
1293 * Class declaration: so-called "base sort" must not be given in import
1294 list any longer, but is inferred from the specification. Particularly
1301 class foo = type + ...
1303 * Class target: global versions of theorems stemming do not carry a
1304 parameter prefix any longer. INCOMPATIBILITY.
1306 * Class 'instance' command no longer accepts attached definitions.
1307 INCOMPATIBILITY, use proper 'instantiation' target instead.
1309 * Recovered hiding of consts, which was accidentally broken in
1310 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1311 makes c inaccessible; consider using ``hide (open) const c'' instead.
1313 * Slightly more coherent Pure syntax, with updated documentation in
1314 isar-ref manual. Removed locales meta_term_syntax and
1315 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1316 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1317 directly in regular applications.
1319 * There is a new syntactic category "float_const" for signed decimal
1320 fractions (e.g. 123.45 or -123.45).
1322 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1323 interface with 'setup' command instead.
1325 * Command 'local_setup' is similar to 'setup', but operates on a local
1328 * The 'axiomatization' command now only works within a global theory
1329 context. INCOMPATIBILITY.
1331 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1332 hypotheses. Sorts required in the course of reasoning need to be
1333 covered by the constraints in the initial statement, completed by the
1334 type instance information of the background theory. Non-trivial sort
1335 hypotheses, which rarely occur in practice, may be specified via
1336 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1338 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1340 The result contains an implicit sort hypotheses as before --
1341 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1344 * Generalized Isar history, with support for linear undo, direct state
1347 * Changed defaults for unify configuration options:
1349 unify_trace_bound = 50 (formerly 25)
1350 unify_search_bound = 60 (formerly 30)
1352 * Different bookkeeping for code equations (INCOMPATIBILITY):
1354 a) On theory merge, the last set of code equations for a particular
1355 constant is taken (in accordance with the policy applied by other
1356 parts of the code generator framework).
1358 b) Code equations stemming from explicit declarations (e.g. code
1359 attribute) gain priority over default code equations stemming
1360 from definition, primrec, fun etc.
1362 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1364 * Unified theorem tables for both code generators. Thus [code
1365 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1367 * Command 'find_consts' searches for constants based on type and name
1370 find_consts "_ => bool"
1372 By default, matching is against subtypes, but it may be restricted to
1373 the whole type. Searching by name is possible. Multiple queries are
1374 conjunctive and queries may be negated by prefixing them with a
1377 find_consts strict: "_ => bool" name: "Int" -"int => int"
1379 * New 'find_theorems' criterion "solves" matches theorems that
1380 directly solve the current goal (modulo higher-order unification).
1382 * Auto solve feature for main theorem statements: whenever a new goal
1383 is stated, "find_theorems solves" is called; any theorems that could
1384 solve the lemma directly are listed as part of the goal state.
1385 Cf. associated options in Proof General Isabelle settings menu,
1386 enabled by default, with reasonable timeout for pathological cases of
1387 higher-order unification.
1390 *** Document preparation ***
1392 * Antiquotation @{lemma} now imitates a regular terminal proof,
1393 demanding keyword 'by' and supporting the full method expression
1394 syntax just like the Isar command 'by'.
1399 * Integrated main parts of former image HOL-Complex with HOL. Entry
1400 points Main and Complex_Main remain as before.
1402 * Logic image HOL-Plain provides a minimal HOL with the most important
1403 tools available (inductive, datatype, primrec, ...). This facilitates
1404 experimentation and tool development. Note that user applications
1405 (and library theories) should never refer to anything below theory
1408 * Logic image HOL-Main stops at theory Main, and thus facilitates
1409 experimentation due to shorter build times.
1411 * Logic image HOL-NSA contains theories of nonstandard analysis which
1412 were previously part of former HOL-Complex. Entry point Hyperreal
1413 remains valid, but theories formerly using Complex_Main should now use
1414 new entry point Hypercomplex.
1416 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1417 Posix processes. Avoids potentially expensive forking of the ML
1418 process. New thread-based implementation also works on non-Unix
1419 platforms (Cygwin). Provers are no longer hardwired, but defined
1420 within the theory via plain ML wrapper functions. Basic Sledgehammer
1421 commands are covered in the isar-ref manual.
1423 * Wrapper scripts for remote SystemOnTPTP service allows to use
1424 sledgehammer without local ATP installation (Vampire etc.). Other
1425 provers may be included via suitable ML wrappers, see also
1426 src/HOL/ATP_Linkup.thy.
1428 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1431 * The metis method no longer fails because the theorem is too trivial
1432 (contains the empty clause).
1434 * The metis method now fails in the usual manner, rather than raising
1435 an exception, if it determines that it cannot prove the theorem.
1437 * Method "coherent" implements a prover for coherent logic (see also
1438 src/Tools/coherent.ML).
1440 * Constants "undefined" and "default" replace "arbitrary". Usually
1441 "undefined" is the right choice to replace "arbitrary", though
1442 logically there is no difference. INCOMPATIBILITY.
1444 * Command "value" now integrates different evaluation mechanisms. The
1445 result of the first successful evaluation mechanism is printed. In
1446 square brackets a particular named evaluation mechanisms may be
1447 specified (currently, [SML], [code] or [nbe]). See further
1448 src/HOL/ex/Eval_Examples.thy.
1450 * Normalization by evaluation now allows non-leftlinear equations.
1451 Declare with attribute [code nbe].
1453 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1454 as the structured Isar versions "cases" and "induct", cf. the
1455 corresponding "cases" and "induct" attributes. Mutual induction rules
1456 are now presented as a list of individual projections
1457 (e.g. foo_bar.inducts for types foo and bar); the old format with
1458 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1459 rare situations a different rule is selected --- notably nested tuple
1460 elimination instead of former prod.exhaust: use explicit (case_tac t
1461 rule: prod.exhaust) here.
1463 * Attributes "cases", "induct", "coinduct" support "del" option.
1465 * Removed fact "case_split_thm", which duplicates "case_split".
1467 * The option datatype has been moved to a new theory Option. Renamed
1468 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1470 * New predicate "strict_mono" classifies strict functions on partial
1471 orders. With strict functions on linear orders, reasoning about
1472 (in)equalities is facilitated by theorems "strict_mono_eq",
1473 "strict_mono_less_eq" and "strict_mono_less".
1475 * Some set operations are now proper qualified constants with
1476 authentic syntax. INCOMPATIBILITY:
1487 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1490 * Auxiliary class "itself" has disappeared -- classes without any
1491 parameter are treated as expected by the 'class' command.
1493 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1495 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1496 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1498 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1499 method "approximation". It proves formulas on real values by using
1500 interval arithmetic. In the formulas are also the transcendental
1501 functions sin, cos, tan, atan, ln, exp and the constant pi are
1502 allowed. For examples see
1503 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1505 * Theory "Reflection" now resides in HOL/Library.
1507 * Entry point to Word library now simply named "Word".
1510 * Made source layout more coherent with logical distribution
1513 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1514 src/HOL/Library/Code_Message.thy ~> src/HOL/
1515 src/HOL/Library/GCD.thy ~> src/HOL/
1516 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1517 src/HOL/Library/Parity.thy ~> src/HOL/
1518 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1519 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1520 src/HOL/Real/Lubs.thy ~> src/HOL/
1521 src/HOL/Real/PReal.thy ~> src/HOL/
1522 src/HOL/Real/Rational.thy ~> src/HOL/
1523 src/HOL/Real/RComplete.thy ~> src/HOL/
1524 src/HOL/Real/RealDef.thy ~> src/HOL/
1525 src/HOL/Real/RealPow.thy ~> src/HOL/
1526 src/HOL/Real/Real.thy ~> src/HOL/
1527 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1528 src/HOL/Complex/Complex.thy ~> src/HOL/
1529 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1530 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1531 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1532 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1533 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1534 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1535 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1536 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1537 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1538 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1539 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1540 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1541 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1542 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1543 src/HOL/Real/Float ~> src/HOL/Library/
1544 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1545 src/HOL/Real/RealVector.thy ~> src/HOL/
1547 src/HOL/arith_data.ML ~> src/HOL/Tools
1548 src/HOL/hologic.ML ~> src/HOL/Tools
1549 src/HOL/simpdata.ML ~> src/HOL/Tools
1550 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1551 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1552 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1553 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1554 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1555 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1556 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1558 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1559 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1560 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1561 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1562 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1563 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1565 * If methods "eval" and "evaluation" encounter a structured proof
1566 state with !!/==>, only the conclusion is evaluated to True (if
1567 possible), avoiding strange error messages.
1569 * Method "sizechange" automates termination proofs using (a
1570 modification of) the size-change principle. Requires SAT solver. See
1571 src/HOL/ex/Termination.thy for examples.
1573 * Simplifier: simproc for let expressions now unfolds if bound
1574 variable occurs at most once in let expression body. INCOMPATIBILITY.
1576 * Method "arith": Linear arithmetic now ignores all inequalities when
1577 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1579 * New attribute "arith" for facts that should always be used
1580 automatically by arithmetic. It is intended to be used locally in
1583 assumes [arith]: "x > 0"
1585 Global usage is discouraged because of possible performance impact.
1587 * New classes "top" and "bot" with corresponding operations "top" and
1588 "bot" in theory Orderings; instantiation of class "complete_lattice"
1589 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1591 * Changed definition lemma "less_fun_def" in order to provide an
1592 instance for preorders on functions; use lemma "less_le" instead.
1595 * Theory Orderings: class "wellorder" moved here, with explicit
1596 induction rule "less_induct" as assumption. For instantiation of
1597 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1600 * Theory Orderings: added class "preorder" as superclass of "order".
1601 INCOMPATIBILITY: Instantiation proofs for order, linorder
1602 etc. slightly changed. Some theorems named order_class.* now named
1605 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1608 * Theory Finite_Set: added a new fold combinator of type
1610 ('a => 'b => 'b) => 'b => 'a set => 'b
1612 Occasionally this is more convenient than the old fold combinator
1613 which is now defined in terms of the new one and renamed to
1616 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1617 and "ring_simps" have been replaced by "algebra_simps" (which can be
1618 extended with further lemmas!). At the moment both still exist but
1619 the former will disappear at some point.
1621 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1622 class recpower. Type-specific simp rules for various recpower types
1623 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1625 rat_power_0 -> power_0
1626 rat_power_Suc -> power_Suc
1627 realpow_0 -> power_0
1628 realpow_Suc -> power_Suc
1629 complexpow_0 -> power_0
1630 complexpow_Suc -> power_Suc
1631 power_poly_0 -> power_0
1632 power_poly_Suc -> power_Suc
1634 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1635 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1636 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1637 of lemmas from Divides has been generalized from nat to class
1638 semiring_div. INCOMPATIBILITY. This involves the following theorem
1639 renames resulting from duplicate elimination:
1641 dvd_def_mod ~> dvd_eq_mod_eq_0
1642 zero_dvd_iff ~> dvd_0_left_iff
1643 dvd_0 ~> dvd_0_right
1644 DIVISION_BY_ZERO_DIV ~> div_by_0
1645 DIVISION_BY_ZERO_MOD ~> mod_by_0
1646 mult_div ~> div_mult_self2_is_id
1647 mult_mod ~> mod_mult_self2_is_0
1649 * Theory IntDiv: removed many lemmas that are instances of class-based
1650 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1651 rename old lemmas as follows:
1653 dvd_diff -> nat_dvd_diff
1654 dvd_zminus_iff -> dvd_minus_iff
1655 mod_add1_eq -> mod_add_eq
1656 mod_mult1_eq -> mod_mult_right_eq
1657 mod_mult1_eq' -> mod_mult_left_eq
1658 mod_mult_distrib_mod -> mod_mult_eq
1659 nat_mod_add_left_eq -> mod_add_left_eq
1660 nat_mod_add_right_eq -> mod_add_right_eq
1661 nat_mod_div_trivial -> mod_div_trivial
1662 nat_mod_mod_trivial -> mod_mod_trivial
1663 zdiv_zadd_self1 -> div_add_self1
1664 zdiv_zadd_self2 -> div_add_self2
1665 zdiv_zmult_self1 -> div_mult_self2_is_id
1666 zdiv_zmult_self2 -> div_mult_self1_is_id
1667 zdvd_triv_left -> dvd_triv_left
1668 zdvd_triv_right -> dvd_triv_right
1669 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1670 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1671 zmod_zadd_left_eq -> mod_add_left_eq
1672 zmod_zadd_right_eq -> mod_add_right_eq
1673 zmod_zadd_self1 -> mod_add_self1
1674 zmod_zadd_self2 -> mod_add_self2
1675 zmod_zadd1_eq -> mod_add_eq
1676 zmod_zdiff1_eq -> mod_diff_eq
1677 zmod_zdvd_zmod -> mod_mod_cancel
1678 zmod_zmod_cancel -> mod_mod_cancel
1679 zmod_zmult_self1 -> mod_mult_self2_is_0
1680 zmod_zmult_self2 -> mod_mult_self1_is_0
1683 zdvd_abs1 -> abs_dvd_iff
1684 zdvd_abs2 -> dvd_abs_iff
1685 zdvd_refl -> dvd_refl
1686 zdvd_trans -> dvd_trans
1687 zdvd_zadd -> dvd_add
1688 zdvd_zdiff -> dvd_diff
1689 zdvd_zminus_iff -> dvd_minus_iff
1690 zdvd_zminus2_iff -> minus_dvd_iff
1691 zdvd_zmultD -> dvd_mult_right
1692 zdvd_zmultD2 -> dvd_mult_left
1693 zdvd_zmult_mono -> mult_dvd_mono
1694 zdvd_0_right -> dvd_0_right
1695 zdvd_0_left -> dvd_0_left_iff
1696 zdvd_1_left -> one_dvd
1697 zminus_dvd_iff -> minus_dvd_iff
1699 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1701 * The real numbers offer decimal input syntax: 12.34 is translated
1702 into 1234/10^2. This translation is not reversed upon output.
1704 * Theory Library/Polynomial defines an abstract type 'a poly of
1705 univariate polynomials with coefficients of type 'a. In addition to
1706 the standard ring operations, it also supports div and mod. Code
1707 generation is also supported, using list-style constructors.
1709 * Theory Library/Inner_Product defines a class of real_inner for real
1710 inner product spaces, with an overloaded operation inner :: 'a => 'a
1711 => real. Class real_inner is a subclass of real_normed_vector from
1714 * Theory Library/Product_Vector provides instances for the product
1715 type 'a * 'b of several classes from RealVector and Inner_Product.
1716 Definitions of addition, subtraction, scalar multiplication, norms,
1717 and inner products are included.
1719 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1720 addition to the field operations, numerals and case syntax are also
1723 * Theory Library/Diagonalize provides constructive version of Cantor's
1724 first diagonalization argument.
1726 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1727 zlcm (for int); carried together from various gcd/lcm developements in
1728 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1729 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1730 may recover tupled syntax as follows:
1732 hide (open) const gcd
1733 abbreviation gcd where
1734 "gcd == (%(a, b). GCD.gcd a b)"
1736 GCD.gcd ("gcd '(_, _')")
1738 The same works for lcm, zgcd, zlcm.
1740 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1741 instantiations for algebraic structures. Removed some duplicate
1742 theorems. Changes in simp rules. INCOMPATIBILITY.
1744 * ML antiquotation @{code} takes a constant as argument and generates
1745 corresponding code in background and inserts name of the corresponding
1746 resulting ML value/function/datatype constructor binding in place.
1747 All occurrences of @{code} with a single ML block are generated
1748 simultaneously. Provides a generic and safe interface for
1749 instrumentalizing code generation. See
1750 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1751 In future you ought to refrain from ad-hoc compiling generated SML
1752 code on the ML toplevel. Note that (for technical reasons) @{code}
1753 cannot refer to constants for which user-defined serializations are
1754 set. Refer to the corresponding ML counterpart directly in that
1757 * Command 'rep_datatype': instead of theorem names the command now
1758 takes a list of terms denoting the constructors of the type to be
1759 represented as datatype. The characteristic theorems have to be
1760 proven. INCOMPATIBILITY. Also observe that the following theorems
1761 have disappeared in favour of existing ones:
1763 unit_induct ~> unit.induct
1764 prod_induct ~> prod.induct
1765 sum_induct ~> sum.induct
1766 Suc_Suc_eq ~> nat.inject
1767 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1772 * New locales for orders and lattices where the equivalence relation
1773 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1774 locales use a record structure with field eq for the equivalence.
1776 * New theory of factorial domains.
1778 * Units_l_inv and Units_r_inv are now simp rules by default.
1779 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1780 and/or r_inv will now also require deletion of these lemmas.
1782 * Renamed the following theorems, INCOMPATIBILITY:
1784 UpperD ~> Upper_memD
1785 LowerD ~> Lower_memD
1786 least_carrier ~> least_closed
1787 greatest_carrier ~> greatest_closed
1788 greatest_Lower_above ~> greatest_Lower_below
1789 one_zero ~> carrier_one_zero
1790 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1795 * Nominal datatypes can now contain type-variables.
1797 * Commands 'nominal_inductive' and 'equivariance' work with local
1800 * Nominal primrec can now works with local theory targets and its
1801 specification syntax now conforms to the general format as seen in
1804 * Method "perm_simp" honours the standard simplifier attributes
1805 (no_asm), (no_asm_use) etc.
1807 * The new predicate #* is defined like freshness, except that on the
1808 left hand side can be a set or list of atoms.
1810 * Experimental command 'nominal_inductive2' derives strong induction
1811 principles for inductive definitions. In contrast to
1812 'nominal_inductive', which can only deal with a fixed number of
1813 binders, it can deal with arbitrary expressions standing for sets of
1814 atoms to be avoided. The only inductive definition we have at the
1815 moment that needs this generalisation is the typing rule for Lets in
1818 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1819 -----------------------------------------------------------------
1820 Gamma |- Let x be t1 in t2 : T2
1822 In this rule one wants to avoid all the binders that are introduced by
1823 "close Gamma T1". We are looking for other examples where this
1824 feature might be useful. Please let us know.
1829 * Reimplemented the simplification procedure for proving continuity
1830 subgoals. The new simproc is extensible; users can declare additional
1831 continuity introduction rules with the attribute [cont2cont].
1833 * The continuity simproc now uses a different introduction rule for
1834 solving continuity subgoals on terms with lambda abstractions. In
1835 some rare cases the new simproc may fail to solve subgoals that the
1836 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1837 Potential INCOMPATIBILITY.
1839 * Command 'fixrec': specification syntax now conforms to the general
1840 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1841 examples. INCOMPATIBILITY.
1846 * Proof of Zorn's Lemma for partial orders.
1851 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1852 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1853 depends on multithreading, so timouts will not work before Poly/ML
1856 * High-level support for concurrent ML programming, see
1857 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1858 particularly convenient to organize independent functional
1859 computations. The concept of "synchronized variables" provides a
1860 higher-order interface for components with shared state, avoiding the
1861 delicate details of mutexes and condition variables. (Requires
1862 Poly/ML 5.2.1 or later.)
1864 * ML bindings produced via Isar commands are stored within the Isar
1865 context (theory or proof). Consequently, commands like 'use' and 'ML'
1866 become thread-safe and work with undo as expected (concerning
1867 top-level bindings, not side-effects on global references).
1868 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1869 compiler at runtime; really global bindings need to be given outside a
1870 theory. (Requires Poly/ML 5.2 or later.)
1872 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1873 context. Top-level ML bindings are stored within the proof context in
1874 a purely sequential fashion, disregarding the nested proof structure.
1875 ML bindings introduced by 'ML_prf' are discarded at the end of the
1876 proof. (Requires Poly/ML 5.2 or later.)
1878 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1879 and Method.setup, as well as Isar commands 'attribute_setup' and
1880 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1881 existing code accordingly, or use plain 'setup' together with old
1884 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1885 to 'a -> thm, while results are always tagged with an authentic oracle
1886 name. The Isar command 'oracle' is now polymorphic, no argument type
1887 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1888 accordingly. Note that extra performance may be gained by producing
1889 the cterm carefully, avoiding slow Thm.cterm_of.
1891 * Simplified interface for defining document antiquotations via
1892 ThyOutput.antiquotation, ThyOutput.output, and optionally
1893 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1894 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1897 * More systematic treatment of long names, abstract name bindings, and
1898 name space operations. Basic operations on qualified names have been
1899 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1900 Long_Name.append. Old type bstring has been mostly replaced by
1901 abstract type binding (see structure Binding), which supports precise
1902 qualification by packages and local theory targets, as well as proper
1903 tracking of source positions. INCOMPATIBILITY, need to wrap old
1904 bstring values into Binding.name, or better pass through abstract
1905 bindings everywhere. See further src/Pure/General/long_name.ML,
1906 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1908 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1909 LocalTheory.note etc.) now refer to the *full* internal name, not the
1910 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1912 * Disposed old type and term read functions (Sign.read_def_typ,
1913 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1914 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1915 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1916 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1917 resort for legacy applications.
1919 * Disposed old declarations, tactics, tactic combinators that refer to
1920 the simpset or claset of an implicit theory (such as Addsimps,
1921 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1922 embedded ML text, or local_simpset_of with a proper context passed as
1923 explicit runtime argument.
1925 * Rules and tactics that read instantiations (read_instantiate,
1926 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1927 context, which is required for parsing and type-checking. Moreover,
1928 the variables are specified as plain indexnames, not string encodings
1929 thereof. INCOMPATIBILITY.
1931 * Generic Toplevel.add_hook interface allows to analyze the result of
1932 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1933 for theorem dependency output of transactions resulting in a new
1936 * ML antiquotations: block-structured compilation context indicated by
1937 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1939 @{binding name} - basic name binding
1940 @{let ?pat = term} - term abbreviation (HO matching)
1941 @{note name = fact} - fact abbreviation
1942 @{thm fact} - singleton fact (with attributes)
1943 @{thms fact} - general fact (with attributes)
1944 @{lemma prop by method} - singleton goal
1945 @{lemma prop by meth1 meth2} - singleton goal
1946 @{lemma prop1 ... propN by method} - general goal
1947 @{lemma prop1 ... propN by meth1 meth2} - general goal
1948 @{lemma (open) ...} - open derivation
1953 * The Isabelle "emacs" tool provides a specific interface to invoke
1954 Proof General / Emacs, with more explicit failure if that is not
1955 installed (the old isabelle-interface script silently falls back on
1956 isabelle-process). The PROOFGENERAL_HOME setting determines the
1957 installation location of the Proof General distribution.
1959 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1960 the Isabelle process into a JVM/Scala application. See
1961 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1962 process wrapper has been discontinued.)
1964 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1966 * Various status messages (with exact source position information) are
1967 emitted, if proper markup print mode is enabled. This allows
1968 user-interface components to provide detailed feedback on internal
1973 New in Isabelle2008 (June 2008)
1974 -------------------------------
1978 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1979 and updated, with formally checked references as hyperlinks.
1981 * Theory loader: use_thy (and similar operations) no longer set the
1982 implicit ML context, which was occasionally hard to predict and in
1983 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1984 provides a proper context already.
1986 * Theory loader: old-style ML proof scripts being *attached* to a thy
1987 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1988 'use' within a theory file will do the job.
1990 * Name space merge now observes canonical order, i.e. the second space
1991 is inserted into the first one, while existing entries in the first
1992 space take precedence. INCOMPATIBILITY in rare situations, may try to
1993 swap theory imports.
1995 * Syntax: symbol \<chi> is now considered a letter. Potential
1996 INCOMPATIBILITY in identifier syntax etc.
1998 * Outer syntax: string tokens no longer admit escaped white space,
1999 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
2000 white space without escapes.
2002 * Outer syntax: string tokens may contain arbitrary character codes
2003 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
2009 * Context-dependent token translations. Default setup reverts locally
2010 fixed variables, and adds hilite markup for undeclared frees.
2012 * Unused theorems can be found using the new command 'unused_thms'.
2013 There are three ways of invoking it:
2016 Only finds unused theorems in the current theory.
2018 (2) unused_thms thy_1 ... thy_n -
2019 Finds unused theorems in the current theory and all of its ancestors,
2020 excluding the theories thy_1 ... thy_n and all of their ancestors.
2022 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
2023 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
2024 their ancestors, excluding the theories thy_1 ... thy_n and all of
2027 In order to increase the readability of the list produced by
2028 unused_thms, theorems that have been created by a particular instance
2029 of a theory command such as 'inductive' or 'function' are considered
2030 to belong to the same "group", meaning that if at least one theorem in
2031 this group is used, the other theorems in the same group are no longer
2032 reported as unused. Moreover, if all theorems in the group are
2033 unused, only one theorem in the group is displayed.
2035 Note that proof objects have to be switched on in order for
2036 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2037 usually the case when using Proof General with the default settings).
2039 * Authentic naming of facts disallows ad-hoc overwriting of previous
2040 theorems within the same name space. INCOMPATIBILITY, need to remove
2041 duplicate fact bindings, or even accidental fact duplications. Note
2042 that tools may maintain dynamically scoped facts systematically, using
2043 PureThy.add_thms_dynamic.
2045 * Command 'hide' now allows to hide from "fact" name space as well.
2047 * Eliminated destructive theorem database, simpset, claset, and
2048 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2049 update of theories within ML code.
2051 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2052 INCOMPATIBILITY, object-logics depending on former Pure require
2053 additional setup PureThy.old_appl_syntax_setup; object-logics
2054 depending on former CPure need to refer to Pure.
2056 * Commands 'use' and 'ML' are now purely functional, operating on
2057 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2058 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2061 * Command 'setup': discontinued implicit version with ML reference.
2063 * Instantiation target allows for simultaneous specification of class
2064 instance operations together with an instantiation proof.
2065 Type-checking phase allows to refer to class operations uniformly.
2066 See src/HOL/Complex/Complex.thy for an Isar example and
2067 src/HOL/Library/Eval.thy for an ML example.
2069 * Indexing of literal facts: be more serious about including only
2070 facts from the visible specification/proof context, but not the
2071 background context (locale etc.). Affects `prop` notation and method
2072 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2075 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2076 "(open)" option, which used to expose internal bound variables to the
2079 * Isar statements: removed obsolete case "rule_context".
2080 INCOMPATIBILITY, better use explicit fixes/assumes.
2082 * Locale proofs: default proof step now includes 'unfold_locales';
2083 hence 'proof' without argument may be used to unfold locale
2087 *** Document preparation ***
2089 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2090 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2091 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2092 spot); renamed link color from "darkblue" to "linkcolor" (default
2093 value unchanged, can be redefined via \definecolor); no longer sets
2094 "a4paper" option (unnecessary or even intrusive).
2096 * Antiquotation @{lemma A method} proves proposition A by the given
2097 method (either a method name or a method name plus (optional) method
2098 arguments in parentheses) and prints A just like @{prop A}.
2103 * New primrec package. Specification syntax conforms in style to
2104 definition/function/.... No separate induction rule is provided. The
2105 "primrec" command distinguishes old-style and new-style specifications
2106 by syntax. The former primrec package is now named OldPrimrecPackage.
2107 When adjusting theories, beware: constants stemming from new-style
2108 primrec specifications have authentic syntax.
2110 * Metis prover is now an order of magnitude faster, and also works
2111 with multithreading.
2113 * Metis: the maximum number of clauses that can be produced from a
2114 theorem is now given by the attribute max_clauses. Theorems that
2115 exceed this number are ignored, with a warning printed.
2117 * Sledgehammer no longer produces structured proofs by default. To
2118 enable, declare [[sledgehammer_full = true]]. Attributes
2119 reconstruction_modulus, reconstruction_sorts renamed
2120 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2122 * Method "induct_scheme" derives user-specified induction rules
2123 from well-founded induction and completeness of patterns. This factors
2124 out some operations that are done internally by the function package
2125 and makes them available separately. See
2126 src/HOL/ex/Induction_Scheme.thy for examples.
2128 * More flexible generation of measure functions for termination
2129 proofs: Measure functions can be declared by proving a rule of the
2130 form "is_measure f" and giving it the [measure_function] attribute.
2131 The "is_measure" predicate is logically meaningless (always true), and
2132 just guides the heuristic. To find suitable measure functions, the
2133 termination prover sets up the goal "is_measure ?f" of the appropriate
2134 type and generates all solutions by prolog-style backwards proof using
2137 This setup also deals with rules like
2139 "is_measure f ==> is_measure (list_size f)"
2141 which accommodates nested datatypes that recurse through lists.
2142 Similar rules are predeclared for products and option types.
2144 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2148 - Definitions of overloaded constants on sets have to be replaced by
2149 definitions on => and bool.
2151 - Some definitions of overloaded operators on sets can now be proved
2152 using the definitions of the operators on => and bool. Therefore,
2153 the following theorems have been renamed:
2155 subset_def -> subset_eq
2156 psubset_def -> psubset_eq
2157 set_diff_def -> set_diff_eq
2158 Compl_def -> Compl_eq
2159 Sup_set_def -> Sup_set_eq
2160 Inf_set_def -> Inf_set_eq
2161 sup_set_def -> sup_set_eq
2162 inf_set_def -> inf_set_eq
2164 - Due to the incompleteness of the HO unification algorithm, some
2165 rules such as subst may require manual instantiation, if some of
2166 the unknowns in the rule is a set.
2168 - Higher order unification and forward proofs:
2171 have "P (S::'a set)" <...>
2172 then have "EX S. P S" ..
2174 no longer works (due to the incompleteness of the HO unification
2175 algorithm) and must be replaced by the pattern
2182 - Calculational reasoning with subst (or similar rules):
2185 have "P (S::'a set)" <...>
2186 also have "S = T" <...>
2187 finally have "P T" .
2189 no longer works (for similar reasons as the previous example) and
2190 must be replaced by something like
2192 have "P (S::'a set)" <...>
2193 moreover have "S = T" <...>
2194 ultimately have "P T" by simp
2196 - Tactics or packages written in ML code:
2197 Code performing pattern matching on types via
2199 Type ("set", [T]) => ...
2201 must be rewritten. Moreover, functions like strip_type or
2202 binder_types no longer return the right value when applied to a
2205 T1 => ... => Tn => U => bool
2209 T1 => ... => Tn => U set
2211 * Merged theories Wellfounded_Recursion, Accessible_Part and
2212 Wellfounded_Relations to theory Wellfounded.
2214 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2216 * Class finite no longer treats UNIV as class parameter. Use class
2217 enum from theory Library/Enum instead to achieve a similar effect.
2220 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2221 and "Cons". INCOMPATIBILITY.
2223 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2224 Potential INCOMPATIBILITY.
2226 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2227 injective_fst_snd removed, use split_eta and prod_eqI instead.
2228 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2230 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2231 the same name in theory Orderings:
2241 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2242 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2243 and different variable names.
2245 * Library/Option_ord.thy: Canonical order on option type.
2247 * Library/RBT.thy: Red-black trees, an efficient implementation of
2250 * Library/Countable.thy: Type class for countable types.
2252 * Theory Int: The representation of numerals has changed. The infix
2253 operator BIT and the bit datatype with constructors B0 and B1 have
2254 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2255 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2256 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2259 * Theory Nat: definition of <= and < on natural numbers no longer
2260 depend on well-founded relations. INCOMPATIBILITY. Definitions
2261 le_def and less_def have disappeared. Consider lemmas not_less
2262 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2264 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2265 (whose purpose mainly is for various fold_set functionals) have been
2266 abandoned in favor of the existing algebraic classes
2267 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2268 lower_semilattice (resp. upper_semilattice) and linorder.
2271 * Theory Transitive_Closure: induct and cases rules now declare proper
2272 case_names ("base" and "step"). INCOMPATIBILITY.
2274 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2275 lattices. The form set-specific version is available as
2276 Inductive.lfp_ordinal_induct_set.
2278 * Renamed theorems "power.simps" to "power_int.simps".
2281 * Class semiring_div provides basic abstract properties of semirings
2282 with division and modulo operations. Subsumes former class dvd_mod.
2284 * Merged theories IntDef, Numeral and IntArith into unified theory
2285 Int. INCOMPATIBILITY.
2287 * Theory Library/Code_Index: type "index" now represents natural
2288 numbers rather than integers. INCOMPATIBILITY.
2290 * New class "uminus" with operation "uminus" (split of from class
2291 "minus" which now only has operation "minus", binary).
2294 * Constants "card", "internal_split", "option_map" now with authentic
2295 syntax. INCOMPATIBILITY.
2297 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2298 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2299 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2300 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2301 Sup_set_def, le_def, less_def, option_map_def now with object
2302 equality. INCOMPATIBILITY.
2304 * Records. Removed K_record, and replaced it by pure lambda term
2305 %x. c. The simplifier setup is now more robust against eta expansion.
2306 INCOMPATIBILITY: in cases explicitly referring to K_record.
2308 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2310 * Library/ListVector: new theory of arithmetic vector operations.
2312 * Library/Order_Relation: new theory of various orderings as sets of
2313 pairs. Defines preorders, partial orders, linear orders and
2314 well-orders on sets and on types.
2319 * Renamed some theories to allow to loading both ZF and HOL in the
2322 Datatype -> Datatype_ZF
2323 Inductive -> Inductive_ZF
2330 INCOMPATIBILITY: ZF theories that import individual theories below
2331 Main might need to be adapted. Regular theory Main is still
2332 available, as trivial extension of Main_ZF.
2337 * ML within Isar: antiquotation @{const name} or @{const
2338 name(typargs)} produces statically-checked Const term.
2340 * Functor NamedThmsFun: data is available to the user as dynamic fact
2341 (of the same name). Removed obsolete print command.
2343 * Removed obsolete "use_legacy_bindings" function.
2345 * The ``print mode'' is now a thread-local value derived from a global
2346 template (the former print_mode reference), thus access becomes
2347 non-critical. The global print_mode reference is for session
2348 management only; user-code should use print_mode_value,
2349 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2351 * Functions system/system_out provide a robust way to invoke external
2352 shell commands, with propagation of interrupts (requires Poly/ML
2353 5.2.1). Do not use OS.Process.system etc. from the basis library!
2358 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2359 in accordance with Proof General 3.7, which prefers GNU emacs.
2361 * isatool tty runs Isabelle process with plain tty interaction;
2362 optional line editor may be specified via ISABELLE_LINE_EDITOR
2363 setting, the default settings attempt to locate "ledit" and "rlwrap".
2365 * isatool browser now works with Cygwin as well, using general
2366 "javapath" function defined in Isabelle process environment.
2368 * YXML notation provides a simple and efficient alternative to
2369 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2370 isatool yxml as described in the Isabelle system manual.
2372 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2373 provides general wrapper for managing an Isabelle process in a robust
2374 fashion, with ``cooked'' output from stdin/stderr.
2376 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2377 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2379 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2380 way of changing the user's settings is via
2381 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2384 * Multithreading.max_threads := 0 refers to the number of actual CPU
2385 cores of the underlying machine, which is a good starting point for
2386 optimal performance tuning. The corresponding usedir option -M allows
2387 "max" as an alias for "0". WARNING: does not work on certain versions
2388 of Mac OS (with Poly/ML 5.1).
2390 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2391 adverse effect of Isabelle flooding interactive front-ends (notably
2392 ProofGeneral / XEmacs).
2396 New in Isabelle2007 (November 2007)
2397 -----------------------------------
2401 * More uniform information about legacy features, notably a
2402 warning/error of "Legacy feature: ...", depending on the state of the
2403 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2404 legacy features will disappear eventually.
2406 * Theory syntax: the header format ``theory A = B + C:'' has been
2407 discontinued in favour of ``theory A imports B C begin''. Use isatool
2408 fixheaders to convert existing theory files. INCOMPATIBILITY.
2410 * Theory syntax: the old non-Isar theory file format has been
2411 discontinued altogether. Note that ML proof scripts may still be used
2412 with Isar theories; migration is usually quite simple with the ML
2413 function use_legacy_bindings. INCOMPATIBILITY.
2415 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2416 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2419 * Theory loader: be more serious about observing the static theory
2420 header specifications (including optional directories), but not the
2421 accidental file locations of previously successful loads. The strict
2422 update policy of former update_thy is now already performed by
2423 use_thy, so the former has been removed; use_thys updates several
2424 theories simultaneously, just as 'imports' within a theory header
2425 specification, but without merging the results. Potential
2426 INCOMPATIBILITY: may need to refine theory headers and commands
2427 ROOT.ML which depend on load order.
2429 * Theory loader: optional support for content-based file
2430 identification, instead of the traditional scheme of full physical
2431 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2432 (cf. the system manual). The new scheme allows to work with
2433 non-finished theories in persistent session images, such that source
2434 files may be moved later on without requiring reloads.
2436 * Theory loader: old-style ML proof scripts being *attached* to a thy
2437 file (with the same base name as the theory) are considered a legacy
2438 feature, which will disappear eventually. Even now, the theory loader
2439 no longer maintains dependencies on such files.
2441 * Syntax: the scope for resolving ambiguities via type-inference is
2442 now limited to individual terms, instead of whole simultaneous
2443 specifications as before. This greatly reduces the complexity of the
2444 syntax module and improves flexibility by separating parsing and
2445 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2446 'fixes' etc.) are required in rare situations.
2448 * Syntax: constants introduced by new-style packages ('definition',
2449 'abbreviation' etc.) are passed through the syntax module in
2450 ``authentic mode''. This means that associated mixfix annotations
2451 really stick to such constants, independently of potential name space
2452 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2453 trees are represented slightly differently, may need to adapt syntax
2454 translations accordingly. Use CONST marker in 'translations' and
2455 @{const_syntax} antiquotation in 'parse_translation' etc.
2457 * Legacy goal package: reduced interface to the bare minimum required
2458 to keep existing proof scripts running. Most other user-level
2459 functions are now part of the OldGoals structure, which is *not* open
2460 by default (consider isatool expandshort before open OldGoals).
2461 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2462 these tend to cause confusion about the actual goal (!) context being
2463 used here, which is not necessarily the same as the_context().
2465 * Command 'find_theorems': supports "*" wild-card in "name:"
2466 criterion; "with_dups" option. Certain ProofGeneral versions might
2467 support a specific search form (see ProofGeneral/CHANGES).
2469 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2470 by default, which means that "prems" (and also "fixed variables") are
2471 suppressed from proof state output. Note that the ProofGeneral
2472 settings mechanism allows to change and save options persistently, but
2473 older versions of Isabelle will fail to start up if a negative prems
2476 * Local theory targets may be specified by non-nested blocks of
2477 ``context/locale/class ... begin'' followed by ``end''. The body may
2478 contain definitions, theorems etc., including any derived mechanism
2479 that has been implemented on top of these primitives. This concept
2480 generalizes the existing ``theorem (in ...)'' towards more versatility
2483 * Proof General interface: proper undo of final 'end' command;
2484 discontinued Isabelle/classic mode (ML proof scripts).
2487 *** Document preparation ***
2489 * Added antiquotation @{theory name} which prints the given name,
2490 after checking that it refers to a valid ancestor theory in the
2493 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2494 check the given source text as ML type/structure, printing verbatim.
2496 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2497 "c args == rhs" given in the current context. (Any number of
2498 arguments may be given on the LHS.)
2503 * The 'class' package offers a combination of axclass and locale to
2504 achieve Haskell-like type classes in Isabelle. Definitions and
2505 theorems within a class context produce both relative results (with
2506 implicit parameters according to the locale context), and polymorphic
2507 constants with qualified polymorphism (according to the class
2508 context). Within the body context of a 'class' target, a separate
2509 syntax layer ("user space type system") takes care of converting
2510 between global polymorphic consts and internal locale representation.
2511 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2512 "isatool doc classes" provides a tutorial.
2514 * Generic code generator framework allows to generate executable
2515 code for ML and Haskell (including Isabelle classes). A short usage
2518 internal compilation:
2519 export_code <list of constants (term syntax)> in SML
2520 writing SML code to a file:
2521 export_code <list of constants (term syntax)> in SML <filename>
2522 writing OCaml code to a file:
2523 export_code <list of constants (term syntax)> in OCaml <filename>
2524 writing Haskell code to a bunch of files:
2525 export_code <list of constants (term syntax)> in Haskell <filename>
2527 evaluating closed propositions to True/False using code generation:
2530 Reasonable default setup of framework in HOL.
2532 Theorem attributs for selecting and transforming function equations theorems:
2534 [code fun]: select a theorem as function equation for a specific constant
2535 [code fun del]: deselect a theorem as function equation for a specific constant
2536 [code inline]: select an equation theorem for unfolding (inlining) in place
2537 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2539 User-defined serializations (target in {SML, OCaml, Haskell}):
2541 code_const <and-list of constants (term syntax)>
2542 {(target) <and-list of const target syntax>}+
2544 code_type <and-list of type constructors>
2545 {(target) <and-list of type target syntax>}+
2547 code_instance <and-list of instances>
2549 where instance ::= <type constructor> :: <class>
2551 code_class <and_list of classes>
2552 {(target) <and-list of class target syntax>}+
2553 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2555 code_instance and code_class only are effective to target Haskell.
2557 For example usage see src/HOL/ex/Codegenerator.thy and
2558 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2559 generation from Isabelle/HOL theories is available via "isatool doc
2562 * Code generator: consts in 'consts_code' Isar commands are now
2563 referred to by usual term syntax (including optional type
2566 * Command 'no_translations' removes translation rules from theory
2569 * Overloaded definitions are now actually checked for acyclic
2570 dependencies. The overloading scheme is slightly more general than
2571 that of Haskell98, although Isabelle does not demand an exact
2572 correspondence to type class and instance declarations.
2573 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2574 exotic versions of overloading -- at the discretion of the user!
2576 Polymorphic constants are represented via type arguments, i.e. the
2577 instantiation that matches an instance against the most general
2578 declaration given in the signature. For example, with the declaration
2579 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2580 as c(nat). Overloading is essentially simultaneous structural
2581 recursion over such type arguments. Incomplete specification patterns
2582 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2583 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2584 Command 'print_theory' outputs the normalized system of recursive
2585 equations, see section "definitions".
2587 * Configuration options are maintained within the theory or proof
2588 context (with name and type bool/int/string), providing a very simple
2589 interface to a poor-man's version of general context data. Tools may
2590 declare options in ML (e.g. using Attrib.config_int) and then refer to
2591 these values using Config.get etc. Users may change options via an
2592 associated attribute of the same name. This form of context
2593 declaration works particularly well with commands 'declare' or
2594 'using', for example ``declare [[foo = 42]]''. Thus it has become
2595 very easy to avoid global references, which would not observe Isar
2596 toplevel undo/redo and fail to work with multithreading.
2598 Various global ML references of Pure and HOL have been turned into
2599 configuration options:
2601 Unify.search_bound unify_search_bound
2602 Unify.trace_bound unify_trace_bound
2603 Unify.trace_simp unify_trace_simp
2604 Unify.trace_types unify_trace_types
2605 Simplifier.simp_depth_limit simp_depth_limit
2606 Blast.depth_limit blast_depth_limit
2607 DatatypeProp.dtK datatype_distinctness_limit
2608 fast_arith_neq_limit fast_arith_neq_limit
2609 fast_arith_split_limit fast_arith_split_limit
2611 * Named collections of theorems may be easily installed as context
2612 data using the functor NamedThmsFun (see also
2613 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2614 attributes; there is also a toplevel print command. This facility is
2615 just a common case of general context data, which is the preferred way
2616 for anything more complex than just a list of facts in canonical
2619 * Isar: command 'declaration' augments a local theory by generic
2620 declaration functions written in ML. This enables arbitrary content
2621 being added to the context, depending on a morphism that tells the
2622 difference of the original declaration context wrt. the application
2623 context encountered later on.
2625 * Isar: proper interfaces for simplification procedures. Command
2626 'simproc_setup' declares named simprocs (with match patterns, and body
2627 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2628 context. ML antiquotation @{simproc name} retrieves named simprocs.
2630 * Isar: an extra pair of brackets around attribute declarations
2631 abbreviates a theorem reference involving an internal dummy fact,
2632 which will be ignored later --- only the effect of the attribute on
2633 the background context will persist. This form of in-place
2634 declarations is particularly useful with commands like 'declare' and
2635 'using', for example ``have A using [[simproc a]] by simp''.
2637 * Isar: method "assumption" (and implicit closing of subproofs) now
2638 takes simple non-atomic goal assumptions into account: after applying
2639 an assumption as a rule the resulting subgoals are solved by atomic
2640 assumption steps. This is particularly useful to finish 'obtain'
2641 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2642 without referring to the original premise "!!x. P x ==> thesis" in the
2643 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2646 * Isar: implicit use of prems from the Isar proof context is
2647 considered a legacy feature. Common applications like ``have A .''
2648 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2649 referencing facts explicitly here improves readability and
2650 maintainability of proof texts.
2652 * Isar: improper proof element 'guess' is like 'obtain', but derives
2653 the obtained context from the course of reasoning! For example:
2655 assume "EX x y. A x & B y" -- "any previous fact"
2656 then guess x and y by clarify
2658 This technique is potentially adventurous, depending on the facts and
2659 proof tools being involved here.
2661 * Isar: known facts from the proof context may be specified as literal
2662 propositions, using ASCII back-quote syntax. This works wherever
2663 named facts used to be allowed so far, in proof commands, proof
2664 methods, attributes etc. Literal facts are retrieved from the context
2665 according to unification of type and term parameters. For example,
2666 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2667 theorems in the current context, then these are valid literal facts:
2668 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2670 There is also a proof method "fact" which does the same composition
2671 for explicit goal states, e.g. the following proof texts coincide with
2672 certain special cases of literal facts:
2674 have "A" by fact == note `A`
2675 have "A ==> B" by fact == note `A ==> B`
2676 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2677 have "P a ==> Q a" by fact == note `P a ==> Q a`
2679 * Isar: ":" (colon) is no longer a symbolic identifier character in
2680 outer syntax. Thus symbolic identifiers may be used without
2681 additional white space in declarations like this: ``assume *: A''.
2683 * Isar: 'print_facts' prints all local facts of the current context,
2684 both named and unnamed ones.
2686 * Isar: 'def' now admits simultaneous definitions, e.g.:
2688 def x == "t" and y == "u"
2690 * Isar: added command 'unfolding', which is structurally similar to
2691 'using', but affects both the goal state and facts by unfolding given
2692 rewrite rules. Thus many occurrences of the 'unfold' method or
2693 'unfolded' attribute may be replaced by first-class proof text.
2695 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2696 and command 'unfolding' now all support object-level equalities
2697 (potentially conditional). The underlying notion of rewrite rule is
2698 analogous to the 'rule_format' attribute, but *not* that of the
2699 Simplifier (which is usually more generous).
2701 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2702 premises of a theorem by n. Useful in conjunction with drule.
2704 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2705 method expression within a sandbox consisting of the first N
2706 sub-goals, which need to exist. For example, ``simp_all [3]''
2707 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2708 simplifies all new goals that emerge from applying rule foo to the
2709 originally first one.
2711 * Isar: schematic goals are no longer restricted to higher-order
2712 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2715 * Isar: the conclusion of a long theorem statement is now either
2716 'shows' (a simultaneous conjunction, as before), or 'obtains'
2717 (essentially a disjunction of cases with local parameters and
2718 assumptions). The latter allows to express general elimination rules
2719 adequately; in this notation common elimination rules look like this:
2721 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2723 obtains x where "P x"
2725 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2729 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2735 The subsequent classical rules even refer to the formal "thesis"
2738 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2741 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2742 obtains "thesis ==> something"
2744 The actual proof of an 'obtains' statement is analogous to that of the
2745 Isar proof element 'obtain', only that there may be several cases.
2746 Optional case names may be specified in parentheses; these will be
2747 available both in the present proof and as annotations in the
2748 resulting rule, for later use with the 'cases' method (cf. attribute
2751 * Isar: the assumptions of a long theorem statement are available as
2752 "assms" fact in the proof context. This is more appropriate than the
2753 (historical) "prems", which refers to all assumptions of the current
2754 context, including those from the target locale, proof body etc.
2756 * Isar: 'print_statement' prints theorems from the current theory or
2757 proof context in long statement form, according to the syntax of a
2760 * Isar: 'obtain' takes an optional case name for the local context
2761 introduction rule (default "that").
2763 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2764 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2767 * Pure: syntax "CONST name" produces a fully internalized constant
2768 according to the current context. This is particularly useful for
2769 syntax translations that should refer to internal constant
2770 representations independently of name spaces.
2772 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2773 instead of "FOO ". This allows multiple binder declarations to coexist
2774 in the same context. INCOMPATIBILITY.
2776 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2777 primitive that also works in a locale context (both for constants and
2778 fixed variables). Type declaration and internal syntactic representation
2779 of given constants retrieved from the context. Likewise, the
2780 'no_notation' command allows to remove given syntax annotations from the
2783 * Isar/locales: new derived specification elements 'axiomatization',
2784 'definition', 'abbreviation', which support type-inference, admit
2785 object-level specifications (equality, equivalence). See also the
2786 isar-ref manual. Examples:
2789 eq (infix "===" 50) where
2790 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2792 definition "f x y = x + y + 1"
2793 definition g where "g x = f x x"
2796 neq (infix "=!=" 50) where
2797 "x =!= y == ~ (x === y)"
2799 These specifications may be also used in a locale context. Then the
2800 constants being introduced depend on certain fixed parameters, and the
2801 constant name is qualified by the locale base name. An internal
2802 abbreviation takes care for convenient input and output, making the
2803 parameters implicit and using the original short name. See also
2804 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2805 entities from a monomorphic theory.
2807 Presently, abbreviations are only available 'in' a target locale, but
2808 not inherited by general import expressions. Also note that
2809 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2810 'translations' in common applications. The "no_abbrevs" print mode
2811 prevents folding of abbreviations in term output.
2813 Concrete syntax is attached to specified constants in internal form,
2814 independently of name spaces. The parse tree representation is
2815 slightly different -- use 'notation' instead of raw 'syntax', and
2816 'translations' with explicit "CONST" markup to accommodate this.
2818 * Pure/Isar: unified syntax for new-style specification mechanisms
2819 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2820 full type inference and dummy patterns ("_"). For example:
2822 definition "K x _ = x"
2824 inductive conj for A B
2825 where "A ==> B ==> conj A B"
2827 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2828 the current context. Print mode "no_abbrevs" prevents inversion of
2829 abbreviations on output.
2831 * Isar/locales: improved parameter handling: use of locales "var" and
2832 "struct" no longer necessary; - parameter renamings are no longer
2833 required to be injective. For example, this allows to define
2834 endomorphisms as locale endom = homom mult mult h.
2836 * Isar/locales: changed the way locales with predicates are defined.
2837 Instead of accumulating the specification, the imported expression is
2838 now an interpretation. INCOMPATIBILITY: different normal form of
2839 locale expressions. In particular, in interpretations of locales with
2840 predicates, goals repesenting already interpreted fragments are not
2841 removed automatically. Use methods `intro_locales' and
2842 `unfold_locales'; see below.
2844 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2845 provide backward reasoning on locales predicates. The methods are
2846 aware of interpretations and discharge corresponding goals.
2847 `intro_locales' is less aggressive then `unfold_locales' and does not
2848 unfold predicates to assumptions.
2850 * Isar/locales: the order in which locale fragments are accumulated
2851 has changed. This enables to override declarations from fragments due
2852 to interpretations -- for example, unwanted simp rules.
2854 * Isar/locales: interpretation in theories and proof contexts has been
2855 extended. One may now specify (and prove) equations, which are
2856 unfolded in interpreted theorems. This is useful for replacing
2857 defined concepts (constants depending on locale parameters) by
2858 concepts already existing in the target context. Example:
2860 interpretation partial_order ["op <= :: [int, int] => bool"]
2861 where "partial_order.less (op <=) (x::int) y = (x < y)"
2863 Typically, the constant `partial_order.less' is created by a
2864 definition specification element in the context of locale
2867 * Method "induct": improved internal context management to support
2868 local fixes and defines on-the-fly. Thus explicit meta-level
2869 connectives !! and ==> are rarely required anymore in inductive goals
2870 (using object-logic connectives for this purpose has been long
2871 obsolete anyway). Common proof patterns are explained in
2872 src/HOL/Induct/Common_Patterns.thy, see also
2873 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2876 * Method "induct": improved handling of simultaneous goals. Instead of
2877 introducing object-level conjunction, the statement is now split into
2878 several conclusions, while the corresponding symbolic cases are nested
2879 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2880 see src/HOL/Induct/Common_Patterns.thy, for example.
2882 * Method "induct": mutual induction rules are now specified as a list
2883 of rule sharing the same induction cases. HOL packages usually provide
2884 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2885 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2886 mutual induction rules differently, i.e. like this:
2888 (induct rule: foo_bar.inducts)
2889 (induct set: foo bar)
2890 (induct pred: foo bar)
2891 (induct type: foo bar)
2893 The ML function ProjectRule.projections turns old-style rules into the
2896 * Method "coinduct": dual of induction, see
2897 src/HOL/Library/Coinductive_List.thy for various examples.
2899 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2900 considered a legacy feature.
2902 * Attribute "symmetric" produces result with standardized schematic
2903 variables (index 0). Potential INCOMPATIBILITY.
2905 * Simplifier: by default the simplifier trace only shows top level
2906 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2907 default. Thus there is less danger of being flooded by the trace. The
2908 trace indicates where parts have been suppressed.
2910 * Provers/classical: removed obsolete classical version of elim_format
2911 attribute; classical elim/dest rules are now treated uniformly when
2912 manipulating the claset.
2914 * Provers/classical: stricter checks to ensure that supplied intro,
2915 dest and elim rules are well-formed; dest and elim rules must have at
2918 * Provers/classical: attributes dest/elim/intro take an optional
2919 weight argument for the rule (just as the Pure versions). Weights are
2920 ignored by automated tools, but determine the search order of single
2923 * Syntax: input syntax now supports dummy variable binding "%_. b",
2924 where the body does not mention the bound variable. Note that dummy
2925 patterns implicitly depend on their context of bounds, which makes
2926 "{_. _}" match any set comprehension as expected. Potential
2927 INCOMPATIBILITY -- parse translations need to cope with syntactic
2928 constant "_idtdummy" in the binding position.
2930 * Syntax: removed obsolete syntactic constant "_K" and its associated
2931 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2932 for example "A -> B" => "Pi A (%_. B)".
2934 * Pure: 'class_deps' command visualizes the subclass relation, using
2935 the graph browser tool.
2937 * Pure: 'print_theory' now suppresses certain internal declarations by
2938 default; use '!' option for full details.
2943 * Method "metis" proves goals by applying the Metis general-purpose
2944 resolution prover (see also http://gilith.com/software/metis/).
2945 Examples are in the directory MetisExamples. WARNING: the
2946 Isabelle/HOL-Metis integration does not yet work properly with
2949 * Command 'sledgehammer' invokes external automatic theorem provers as
2950 background processes. It generates calls to the "metis" method if
2951 successful. These can be pasted into the proof. Users do not have to
2952 wait for the automatic provers to return. WARNING: does not really
2953 work with multi-threading.
2955 * New "auto_quickcheck" feature tests outermost goal statements for
2956 potential counter-examples. Controlled by ML references
2957 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2958 5000 milliseconds). Fails silently if statements is outside of
2959 executable fragment, or any other codgenerator problem occurs.
2961 * New constant "undefined" with axiom "undefined x = undefined".
2963 * Added class "HOL.eq", allowing for code generation with polymorphic
2966 * Some renaming of class constants due to canonical name prefixing in
2967 the new 'class' package:
2969 HOL.abs ~> HOL.abs_class.abs
2970 HOL.divide ~> HOL.divide_class.divide
2971 0 ~> HOL.zero_class.zero
2972 1 ~> HOL.one_class.one
2973 op + ~> HOL.plus_class.plus
2974 op - ~> HOL.minus_class.minus
2975 uminus ~> HOL.minus_class.uminus
2976 op * ~> HOL.times_class.times
2977 op < ~> HOL.ord_class.less
2978 op <= > HOL.ord_class.less_eq
2979 Nat.power ~> Power.power_class.power
2980 Nat.size ~> Nat.size_class.size
2981 Numeral.number_of ~> Numeral.number_class.number_of
2982 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2983 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2984 Orderings.min ~> Orderings.ord_class.min
2985 Orderings.max ~> Orderings.ord_class.max
2986 Divides.op div ~> Divides.div_class.div
2987 Divides.op mod ~> Divides.div_class.mod
2988 Divides.op dvd ~> Divides.div_class.dvd
2990 INCOMPATIBILITY. Adaptions may be required in the following cases:
2992 a) User-defined constants using any of the names "plus", "minus",
2993 "times", "less" or "less_eq". The standard syntax translations for
2994 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2997 b) Variables named "plus", "minus", "times", "less", "less_eq"
2998 INCOMPATIBILITY: use more specific names.
3000 c) Permutative equations (e.g. "a + b = b + a")
3001 Since the change of names also changes the order of terms, permutative
3002 rewrite rules may get applied in a different order. Experience shows
3003 that this is rarely the case (only two adaptions in the whole Isabelle
3004 distribution). INCOMPATIBILITY: rewrite proofs
3006 d) ML code directly refering to constant names
3007 This in general only affects hand-written proof tactics, simprocs and
3008 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
3009 Consider using @{const_name} antiquotation.
3011 * New class "default" with associated constant "default".
3013 * Function "sgn" is now overloaded and available on int, real, complex
3014 (and other numeric types), using class "sgn". Two possible defs of
3015 sgn are given as equational assumptions in the classes sgn_if and
3016 sgn_div_norm; ordered_idom now also inherits from sgn_if.
3019 * Locale "partial_order" now unified with class "order" (cf. theory
3020 Orderings), added parameter "less". INCOMPATIBILITY.
3022 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
3023 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
3024 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3026 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3027 changed order of proof goals in instance proofs.
3029 * The transitivity reasoner for partial and linear orders is set up
3030 for classes "order" and "linorder". Instances of the reasoner are available
3031 in all contexts importing or interpreting the corresponding locales.
3032 Method "order" invokes the reasoner separately; the reasoner
3033 is also integrated with the Simplifier as a solver. Diagnostic
3034 command 'print_orders' shows the available instances of the reasoner
3035 in the current context.
3037 * Localized monotonicity predicate in theory "Orderings"; integrated
3038 lemmas max_of_mono and min_of_mono with this predicate.
3041 * Formulation of theorem "dense" changed slightly due to integration
3042 with new class dense_linear_order.
3044 * Uniform lattice theory development in HOL.
3046 constants "meet" and "join" now named "inf" and "sup"
3047 constant "Meet" now named "Inf"
3049 classes "meet_semilorder" and "join_semilorder" now named
3050 "lower_semilattice" and "upper_semilattice"
3051 class "lorder" now named "lattice"
3052 class "comp_lat" now named "complete_lattice"
3054 Instantiation of lattice classes allows explicit definitions
3055 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3057 INCOMPATIBILITY. Theorem renames:
3059 meet_left_le ~> inf_le1
3060 meet_right_le ~> inf_le2
3061 join_left_le ~> sup_ge1
3062 join_right_le ~> sup_ge2
3063 meet_join_le ~> inf_sup_ord
3066 le_meet ~> le_inf_iff
3067 le_join ~> ge_sup_conv
3068 meet_idempotent ~> inf_idem
3069 join_idempotent ~> sup_idem
3070 meet_comm ~> inf_commute
3071 join_comm ~> sup_commute
3072 meet_leI1 ~> le_infI1
3073 meet_leI2 ~> le_infI2
3074 le_joinI1 ~> le_supI1
3075 le_joinI2 ~> le_supI2
3076 meet_assoc ~> inf_assoc
3077 join_assoc ~> sup_assoc
3078 meet_left_comm ~> inf_left_commute
3079 meet_left_idempotent ~> inf_left_idem
3080 join_left_comm ~> sup_left_commute
3081 join_left_idempotent ~> sup_left_idem
3084 le_def_meet ~> le_iff_inf
3085 le_def_join ~> le_iff_sup
3086 join_absorp2 ~> sup_absorb2
3087 join_absorp1 ~> sup_absorb1
3088 meet_absorp1 ~> inf_absorb1
3089 meet_absorp2 ~> inf_absorb2
3090 meet_join_absorp ~> inf_sup_absorb
3091 join_meet_absorp ~> sup_inf_absorb
3092 distrib_join_le ~> distrib_sup_le
3093 distrib_meet_le ~> distrib_inf_le
3095 add_meet_distrib_left ~> add_inf_distrib_left
3096 add_join_distrib_left ~> add_sup_distrib_left
3097 is_join_neg_meet ~> is_join_neg_inf
3098 is_meet_neg_join ~> is_meet_neg_sup
3099 add_meet_distrib_right ~> add_inf_distrib_right
3100 add_join_distrib_right ~> add_sup_distrib_right
3101 add_meet_join_distribs ~> add_sup_inf_distribs
3102 join_eq_neg_meet ~> sup_eq_neg_inf
3103 meet_eq_neg_join ~> inf_eq_neg_sup
3104 add_eq_meet_join ~> add_eq_inf_sup
3105 meet_0_imp_0 ~> inf_0_imp_0
3106 join_0_imp_0 ~> sup_0_imp_0
3107 meet_0_eq_0 ~> inf_0_eq_0
3108 join_0_eq_0 ~> sup_0_eq_0
3109 neg_meet_eq_join ~> neg_inf_eq_sup
3110 neg_join_eq_meet ~> neg_sup_eq_inf
3111 join_eq_if ~> sup_eq_if
3113 mono_meet ~> mono_inf
3114 mono_join ~> mono_sup
3115 meet_bool_eq ~> inf_bool_eq
3116 join_bool_eq ~> sup_bool_eq
3117 meet_fun_eq ~> inf_fun_eq
3118 join_fun_eq ~> sup_fun_eq
3119 meet_set_eq ~> inf_set_eq
3120 join_set_eq ~> sup_set_eq
3121 meet1_iff ~> inf1_iff
3122 meet2_iff ~> inf2_iff
3131 join1_iff ~> sup1_iff
3132 join2_iff ~> sup2_iff
3142 is_meet_Meet ~> is_meet_Inf
3143 Meet_bool_def ~> Inf_bool_def
3144 Meet_fun_def ~> Inf_fun_def
3145 Meet_greatest ~> Inf_greatest
3146 Meet_lower ~> Inf_lower
3147 Meet_set_def ~> Inf_set_def
3150 Sup_bool_eq ~> Sup_bool_def
3151 Sup_fun_eq ~> Sup_fun_def
3152 Sup_set_eq ~> Sup_set_def
3154 listsp_meetI ~> listsp_infI
3155 listsp_meet_eq ~> listsp_inf_eq
3160 * Added syntactic class "size"; overloaded constant "size" now has
3161 type "'a::size ==> bool"
3163 * Internal reorganisation of `size' of datatypes: size theorems
3164 "foo.size" are no longer subsumed by "foo.simps" (but are still
3165 simplification rules by default!); theorems "prod.size" now named
3168 * Class "div" now inherits from class "times" rather than "type".
3171 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3172 Linorder etc. have disappeared; operations defined in terms of
3173 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3175 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3177 * HOL-Word: New extensive library and type for generic, fixed size
3178 machine words, with arithemtic, bit-wise, shifting and rotating
3179 operations, reflection into int, nat, and bool lists, automation for
3180 linear arithmetic (by automatic reflection into nat or int), including
3181 lemmas on overflow and monotonicity. Instantiated to all appropriate
3182 arithmetic type classes, supporting automatic simplification of
3183 numerals on all operations.
3185 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3187 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3189 * Code generator library theories:
3190 - Code_Integer represents HOL integers by big integer literals in target
3192 - Code_Char represents HOL characters by character literals in target
3194 - Code_Char_chr like Code_Char, but also offers treatment of character
3195 codes; includes Code_Integer.
3196 - Executable_Set allows to generate code for finite sets using lists.
3197 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3199 - Executable_Real implements a subset of real numbers, namly those
3200 representable by rational numbers.
3201 - Efficient_Nat implements natural numbers by integers, which in general will
3202 result in higher efficency; pattern matching with 0/Suc is eliminated;
3203 includes Code_Integer.
3204 - Code_Index provides an additional datatype index which is mapped to
3205 target-language built-in integers.
3206 - Code_Message provides an additional datatype message_string which is isomorphic to
3207 strings; messages are mapped to target-language strings.
3209 * New package for inductive predicates
3211 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3214 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3215 for z_1 :: U_1 and ... and z_n :: U_m
3217 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3220 with full support for type-inference, rather than
3222 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3224 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3225 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3227 inductive "s z_1 ... z_m"
3229 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3232 For backward compatibility, there is a wrapper allowing inductive
3233 sets to be defined with the new package via
3236 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3237 for z_1 :: U_1 and ... and z_n :: U_m
3239 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3245 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3246 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3247 for z_1 :: U_1 and ... and z_n :: U_m
3249 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3250 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3253 if the additional syntax "p ..." is required.
3255 Numerous examples can be found in the subdirectories src/HOL/Auth,
3256 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3260 - Since declaration and definition of inductive sets or predicates
3261 is no longer separated, abbreviations involving the newly
3262 introduced sets or predicates must be specified together with the
3263 introduction rules after the 'where' keyword (see above), rather
3264 than before the actual inductive definition.
3266 - The variables in induction and elimination rules are now
3267 quantified in the order of their occurrence in the introduction
3268 rules, rather than in alphabetical order. Since this may break
3269 some proofs, these proofs either have to be repaired, e.g. by
3270 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3271 statements of the form
3273 case (rule_i a_i_1 ... a_i_{k_i})
3275 or the old order of quantification has to be restored by explicitly adding
3276 meta-level quantifiers in the introduction rules, i.e.
3278 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3280 - The format of the elimination rules is now
3282 p z_1 ... z_m x_1 ... x_n ==>
3283 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3288 (x_1, ..., x_n) : s z_1 ... z_m ==>
3289 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3292 for sets rather than
3294 x : s z_1 ... z_m ==>
3295 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3298 This may require terms in goals to be expanded to n-tuples
3299 (e.g. using case_tac or simplification with the split_paired_all
3300 rule) before the above elimination rule is applicable.
3302 - The elimination or case analysis rules for (mutually) inductive
3303 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3304 list of rules "p_1_..._p_k.elims" is no longer available.
3306 * New package "function"/"fun" for general recursive functions,
3307 supporting mutual and nested recursion, definitions in local contexts,
3308 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3309 for small examples, and the separate tutorial on the function
3310 package. The old recdef "package" is still available as before, but
3311 users are encouraged to use the new package.
3313 * Method "lexicographic_order" automatically synthesizes termination
3314 relations as lexicographic combinations of size measures.
3316 * Case-expressions allow arbitrary constructor-patterns (including
3317 "_") and take their order into account, like in functional
3318 programming. Internally, this is translated into nested
3319 case-expressions; missing cases are added and mapped to the predefined
3320 constant "undefined". In complicated cases printing may no longer show
3321 the original input but the internal form. Lambda-abstractions allow
3322 the same form of pattern matching: "% pat1 => e1 | ..." is an
3323 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3326 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3327 is an abbreviation for "of_nat :: nat => int". The simplification
3328 rules for "of_nat" have been changed to work like "int" did
3329 previously. Potential INCOMPATIBILITY:
3330 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3331 - of_nat_diff and of_nat_mult are no longer default simp rules
3333 * Method "algebra" solves polynomial equations over (semi)rings using
3334 Groebner bases. The (semi)ring structure is defined by locales and the
3335 tool setup depends on that generic context. Installing the method for
3336 a specific type involves instantiating the locale and possibly adding
3337 declarations for computation on the coefficients. The method is
3338 already instantiated for natural numbers and for the axiomatic class
3339 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3340 CALCULEMUS 2007 for the general principles underlying this
3341 architecture of context-aware proof-tools.
3343 * Method "ferrack" implements quantifier elimination over
3344 special-purpose dense linear orders using locales (analogous to
3345 "algebra"). The method is already installed for class
3346 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3349 * Former constant "List.op @" now named "List.append". Use ML
3350 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3351 circumvent possible incompatibilities when working on ML level.
3353 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3355 * New function listsum :: 'a list => 'a for arbitrary monoids.
3356 Special syntax: "SUM x <- xs. f x" (and latex variants)
3358 * New syntax for Haskell-like list comprehension (input only), eg.
3359 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3361 * The special syntax for function "filter" has changed from [x :
3362 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3363 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3365 * [a..b] is now defined for arbitrary linear orders. It used to be
3366 defined on nat only, as an abbreviation for [a..<Suc b]
3369 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3371 * New functions "sorted" and "sort" in src/HOL/List.thy.
3373 * New lemma collection field_simps (an extension of ring_simps) for
3374 manipulating (in)equations involving division. Multiplies with all
3375 denominators that can be proved to be non-zero (in equations) or
3376 positive/negative (in inequations).
3378 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3379 have been improved and renamed to ring_simps, group_simps and
3380 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3381 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3383 * Theory Library/Commutative_Ring: switched from recdef to function
3384 package; constants add, mul, pow now curried. Infix syntax for
3385 algebraic operations.
3387 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3390 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3393 * HOL/records: generalised field-update to take a function on the
3394 field rather than the new value: r(|A := x|) is translated to A_update
3395 (K x) r The K-combinator that is internally used is called K_record.
3396 INCOMPATIBILITY: Usage of the plain update functions has to be
3399 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3400 * x = 0, which are required for a semiring. Richer structures do not
3401 inherit from semiring_0 anymore, because this property is a theorem
3402 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3403 there is more to prove, but this is mostly trivial.
3405 * Class "recpower" is generalized to arbitrary monoids, not just
3406 commutative semirings. INCOMPATIBILITY: may need to incorporate
3407 commutativity or semiring properties additionally.
3409 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3410 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3411 better use 'abbreviation'.
3413 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3415 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3416 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3417 significant changes for setting up numeral syntax for types:
3418 - New constants Numeral.pred and Numeral.succ instead
3419 of former Numeral.bin_pred and Numeral.bin_succ.
3420 - Use integer operations instead of bin_add, bin_mult and so on.
3421 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3422 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3424 See src/HOL/Integ/IntArith.thy for an example setup.
3426 * Command 'normal_form' computes the normal form of a term that may
3427 contain free variables. For example ``normal_form "rev [a, b, c]"''
3428 produces ``[b, c, a]'' (without proof). This command is suitable for
3429 heavy-duty computations because the functions are compiled to ML
3430 first. Correspondingly, a method "normalization" is provided. See
3431 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3433 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3434 25 like -->); output depends on the "iff" print_mode, the default is
3435 "A = B" (with priority 50).
3437 * Relations less (<) and less_eq (<=) are also available on type bool.
3438 Modified syntax to disallow nesting without explicit parentheses,
3439 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3442 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3444 * Relation composition operator "op O" now has precedence 75 and binds
3445 stronger than union and intersection. INCOMPATIBILITY.
3447 * The old set interval syntax "{m..n(}" (and relatives) has been
3448 removed. Use "{m..<n}" (and relatives) instead.
3450 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3451 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3452 ``declare [[simproc del: neq]]''.
3454 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3457 * Theorem Cons_eq_map_conv no longer declared as "simp".
3459 * Theorem setsum_mult renamed to setsum_right_distrib.
3461 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3464 * Reimplemented methods "sat" and "satx", with several improvements:
3465 goals no longer need to be stated as "<prems> ==> False", equivalences
3466 (i.e. "=" on type bool) are handled, variable names of the form
3467 "lit_<n>" are no longer reserved, significant speedup.
3469 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3470 zChaff is still supported as well.
3472 * 'inductive' and 'datatype': provide projections of mutual rules,
3473 bundled as foo_bar.inducts;
3475 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3478 * Library: moved theory Accessible_Part to main HOL.
3480 * Library: added theory Coinductive_List of potentially infinite lists
3481 as greatest fixed-point.
3483 * Library: added theory AssocList which implements (finite) maps as
3486 * Method "evaluation" solves goals (i.e. a boolean expression)
3487 efficiently by compiling it to ML. The goal is "proved" (via an
3488 oracle) if it evaluates to True.
3490 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3491 also when invoked by the simplifier. This results in the Simplifier
3492 being more powerful on arithmetic goals. INCOMPATIBILITY.
3493 Configuration option fast_arith_split_limit=0 recovers the old
3496 * Support for hex (0x20) and binary (0b1001) numerals.
3498 * New method: reify eqs (t), where eqs are equations for an
3499 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3500 parameter, computes a term s::'b and a list xs::'a list and proves the
3501 theorem I xs s = t. This is also known as reification or quoting. The
3502 resulting theorem is applied to the subgoal to substitute t with I xs
3503 s. If t is omitted, the subgoal itself is reified.
3505 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3506 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3507 where f is supposed to be a computable function (in the sense of code
3508 generattion). The method uses reify to compute s and xs as above then
3509 applies corr_thm and uses normalization by evaluation to "prove" f s =
3510 r and finally gets the theorem t = r, which is again applied to the
3511 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3513 * Reflection: Automatic reification now handels binding, an example is
3514 available in src/HOL/ex/ReflectionEx.thy
3516 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3517 command 'statespace' that is similar to 'record', but introduces an
3518 abstract specification based on the locale infrastructure instead of
3519 HOL types. This leads to extra flexibility in composing state spaces,
3520 in particular multiple inheritance and renaming of components.
3525 * Hyperreal: Functions root and sqrt are now defined on negative real
3526 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3527 Nonnegativity side conditions have been removed from many lemmas, so
3528 that more subgoals may now be solved by simplification; potential
3531 * Real: new type classes formalize real normed vector spaces and
3532 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3533 and norm :: 'a => real.
3535 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3536 reals into other types. The overloaded constant Reals :: 'a set is now
3537 defined as range of_real; potential INCOMPATIBILITY.
3539 * Real: proper support for ML code generation, including 'quickcheck'.
3540 Reals are implemented as arbitrary precision rationals.
3542 * Hyperreal: Several constants that previously worked only for the
3543 reals have been generalized, so they now work over arbitrary vector
3544 spaces. Type annotations may need to be added in some cases; potential
3547 Infinitesimal :: ('a::real_normed_vector) star set
3548 HFinite :: ('a::real_normed_vector) star set
3549 HInfinite :: ('a::real_normed_vector) star set
3550 approx :: ('a::real_normed_vector) star => 'a star => bool
3551 monad :: ('a::real_normed_vector) star => 'a star set
3552 galaxy :: ('a::real_normed_vector) star => 'a star set
3553 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3554 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3555 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3556 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3557 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3558 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3559 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3560 sgn :: 'a::real_normed_vector => 'a
3561 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3563 * Complex: Some complex-specific constants are now abbreviations for
3564 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3565 hnorm. Other constants have been entirely removed in favor of the
3566 polymorphic versions (INCOMPATIBILITY):
3570 HInfinite <-- CInfinite
3571 Infinitesimal <-- CInfinitesimal
3574 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3575 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3576 (ns)deriv <-- (ns)cderiv
3581 * Formalisation of ideals and the quotient construction over rings.
3583 * Order and lattice theory no longer based on records.
3586 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3587 greatest_closed. INCOMPATIBILITY.
3589 * Method algebra is now set up via an attribute. For examples see
3590 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3591 of algebraic structures.
3593 * Renamed theory CRing to Ring.
3598 * Substantial, yet incomplete support for nominal datatypes (binding
3599 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3600 src/HOL/Nominal/Examples. Prospective users should consult
3601 http://isabelle.in.tum.de/nominal/
3606 * ML basics: just one true type int, which coincides with IntInf.int
3609 * ML within Isar: antiquotations allow to embed statically-checked
3610 formal entities in the source, referring to the context available at
3611 compile-time. For example:
3613 ML {* @{sort "{zero,one}"} *}
3614 ML {* @{typ "'a => 'b"} *}
3615 ML {* @{term "%x. x"} *}
3616 ML {* @{prop "x == y"} *}
3617 ML {* @{ctyp "'a => 'b"} *}
3618 ML {* @{cterm "%x. x"} *}
3619 ML {* @{cprop "x == y"} *}
3620 ML {* @{thm asm_rl} *}
3621 ML {* @{thms asm_rl} *}
3622 ML {* @{type_name c} *}
3623 ML {* @{type_syntax c} *}
3624 ML {* @{const_name c} *}
3625 ML {* @{const_syntax c} *}
3628 ML {* @{theory Pure} *}
3629 ML {* @{theory_ref} *}
3630 ML {* @{theory_ref Pure} *}
3633 ML {* @{clasimpset} *}
3635 The same works for sources being ``used'' within an Isar context.
3637 * ML in Isar: improved error reporting; extra verbosity with
3638 ML_Context.trace enabled.
3640 * Pure/General/table.ML: the join operations now works via exceptions
3641 DUP/SAME instead of type option. This is simpler in simple cases, and
3642 admits slightly more efficient complex applications.
3644 * Pure: 'advanced' translation functions (parse_translation etc.) now
3645 use Context.generic instead of just theory.
3647 * Pure: datatype Context.generic joins theory/Proof.context and
3648 provides some facilities for code that works in either kind of
3649 context, notably GenericDataFun for uniform theory and proof data.
3651 * Pure: simplified internal attribute type, which is now always
3652 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3653 local (Proof.context) attributes have been discontinued, while
3654 minimizing code duplication. Thm.rule_attribute and
3655 Thm.declaration_attribute build canonical attributes; see also structure
3656 Context for further operations on Context.generic, notably
3657 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3658 declarations and definitions.
3660 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3661 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3662 init only required for impure data. INCOMPATIBILITY: empty really need
3663 to be empty (no dependencies on theory content!)
3665 * Pure/kernel: consts certification ignores sort constraints given in
3666 signature declarations. (This information is not relevant to the
3667 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3668 potential INCOMPATIBILITY.
3670 * Pure: axiomatic type classes are now purely definitional, with
3671 explicit proofs of class axioms and super class relations performed
3672 internally. See Pure/axclass.ML for the main internal interfaces --
3673 notably AxClass.define_class supercedes AxClass.add_axclass, and
3674 AxClass.axiomatize_class/classrel/arity supersede
3675 Sign.add_classes/classrel/arities.
3677 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3678 global/local versions on theory vs. Proof.context have been
3679 discontinued; Attrib.syntax and Method.syntax have been adapted
3680 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3681 attributes, methods, etc.
3683 * Pure: several functions of signature "... -> theory -> theory * ..."
3684 have been reoriented to "... -> theory -> ... * theory" in order to
3685 allow natural usage in combination with the ||>, ||>>, |-> and
3686 fold_map combinators.
3688 * Pure: official theorem names (closed derivations) and additional
3689 comments (tags) are now strictly separate. Name hints -- which are
3690 maintained as tags -- may be attached any time without affecting the
3693 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3694 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3695 achieve the old behaviour.
3697 * Pure: the "Goal" constant is now called "prop", supporting a
3698 slightly more general idea of ``protecting'' meta-level rule
3701 * Pure: Logic.(un)varify only works in a global context, which is now
3702 enforced instead of silently assumed. INCOMPATIBILITY, may use
3703 Logic.legacy_(un)varify as temporary workaround.
3705 * Pure: structure Name provides scalable operations for generating
3706 internal variable names, notably Name.variants etc. This replaces
3707 some popular functions from term.ML:
3709 Term.variant -> Name.variant
3710 Term.variantlist -> Name.variant_list
3711 Term.invent_names -> Name.invent_list
3713 Note that low-level renaming rarely occurs in new code -- operations
3714 from structure Variable are used instead (see below).
3716 * Pure: structure Variable provides fundamental operations for proper
3717 treatment of fixed/schematic variables in a context. For example,
3718 Variable.import introduces fixes for schematics of given facts and
3719 Variable.export reverses the effect (up to renaming) -- this replaces
3720 various freeze_thaw operations.
3722 * Pure: structure Goal provides simple interfaces for
3723 init/conclude/finish and tactical prove operations (replacing former
3724 Tactic.prove). Goal.prove is the canonical way to prove results
3725 within a given context; Goal.prove_global is a degraded version for
3726 theory level goals, including a global Drule.standard. Note that
3727 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3728 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3729 in a locale context).
3731 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3732 and type checking (Syntax.check_term etc.), with common combinations
3733 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3734 which are considered legacy and await removal.
3736 * Pure/Syntax: generic interfaces for type unchecking
3737 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3738 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3739 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3740 available for convenience, but refer to the very same operations using
3741 a mere theory instead of a full context.
3743 * Isar: simplified treatment of user-level errors, using exception
3744 ERROR of string uniformly. Function error now merely raises ERROR,
3745 without any side effect on output channels. The Isar toplevel takes
3746 care of proper display of ERROR exceptions. ML code may use plain
3747 handle/can/try; cat_error may be used to concatenate errors like this:
3749 ... handle ERROR msg => cat_error msg "..."
3751 Toplevel ML code (run directly or through the Isar toplevel) may be
3752 embedded into the Isar toplevel with exception display/debug like
3755 Isar.toplevel (fn () => ...)
3757 INCOMPATIBILITY, removed special transform_error facilities, removed
3758 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3759 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3760 -- use plain ERROR instead.
3762 * Isar: theory setup now has type (theory -> theory), instead of a
3763 list. INCOMPATIBILITY, may use #> to compose setup functions.
3765 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3766 ProofContext.debug/verbose flags.
3768 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3769 theory before entering a proof state. Transactions now always see a
3770 quasi-functional intermediate checkpoint, both in interactive and
3773 * Isar: simplified interfaces for outer syntax. Renamed
3774 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3775 OuterSyntax.add_parsers -- this functionality is now included in
3776 OuterSyntax.command etc. INCOMPATIBILITY.
3778 * Simplifier: the simpset of a running simplification process now
3779 contains a proof context (cf. Simplifier.the_context), which is the
3780 very context that the initial simpset has been retrieved from (by
3781 simpset_of/local_simpset_of). Consequently, all plug-in components
3782 (solver, looper etc.) may depend on arbitrary proof data.
3784 * Simplifier.inherit_context inherits the proof context (plus the
3785 local bounds) of the current simplification process; any simproc
3786 etc. that calls the Simplifier recursively should do this! Removed
3787 former Simplifier.inherit_bounds, which is already included here --
3788 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3789 specify an explicit context using Simplifier.context/theory_context.
3791 * Simplifier/Classical Reasoner: more abstract interfaces
3792 change_simpset/claset for modifying the simpset/claset reference of a
3793 theory; raw versions simpset/claset_ref etc. have been discontinued --
3796 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3802 * settings: the default heap location within ISABELLE_HOME_USER now
3803 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3804 Isabelle installations.
3806 * isabelle-process: option -S (secure mode) disables some critical
3807 operations, notably runtime compilation and evaluation of ML source
3810 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3812 * Support for parallel execution, using native multicore support of
3813 Poly/ML 5.1. The theory loader exploits parallelism when processing
3814 independent theories, according to the given theory header
3815 specifications. The maximum number of worker threads is specified via
3816 usedir option -M or the "max-threads" setting in Proof General. A
3817 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3818 to 6 on a 8-core machine. User-code needs to observe certain
3819 guidelines for thread-safe programming, see appendix A in the Isar
3820 Implementation manual.
3824 New in Isabelle2005 (October 2005)
3825 ----------------------------------
3829 * Theory headers: the new header syntax for Isar theories is
3832 imports <theory1> ... <theoryN>
3833 uses <file1> ... <fileM>
3836 where the 'uses' part is optional. The previous syntax
3838 theory <name> = <theory1> + ... + <theoryN>:
3840 will disappear in the next release. Use isatool fixheaders to convert
3841 existing theory files. Note that there is no change in ancient
3842 non-Isar theories now, but these will disappear soon.
3844 * Theory loader: parent theories can now also be referred to via
3845 relative and absolute paths.
3847 * Command 'find_theorems' searches for a list of criteria instead of a
3848 list of constants. Known criteria are: intro, elim, dest, name:string,
3849 simp:term, and any term. Criteria can be preceded by '-' to select
3850 theorems that do not match. Intro, elim, dest select theorems that
3851 match the current goal, name:s selects theorems whose fully qualified
3852 name contain s, and simp:term selects all simplification rules whose
3853 lhs match term. Any other term is interpreted as pattern and selects
3854 all theorems matching the pattern. Available in ProofGeneral under
3855 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3857 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3859 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3860 matching the current goal as introduction rule and not having "HOL."
3861 in their name (i.e. not being defined in theory HOL).
3863 * Command 'thms_containing' has been discontinued in favour of
3864 'find_theorems'; INCOMPATIBILITY.
3866 * Communication with Proof General is now 8bit clean, which means that
3867 Unicode text in UTF-8 encoding may be used within theory texts (both
3868 formal and informal parts). Cf. option -U of the Isabelle Proof
3869 General interface. Here are some simple examples (cf. src/HOL/ex):
3871 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3872 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3874 * Improved efficiency of the Simplifier and, to a lesser degree, the
3875 Classical Reasoner. Typical big applications run around 2 times
3879 *** Document preparation ***
3881 * Commands 'display_drafts' and 'print_drafts' perform simple output
3882 of raw sources. Only those symbols that do not require additional
3883 LaTeX packages (depending on comments in isabellesym.sty) are
3884 displayed properly, everything else is left verbatim. isatool display
3885 and isatool print are used as front ends (these are subject to the
3886 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3888 * Command tags control specific markup of certain regions of text,
3889 notably folding and hiding. Predefined tags include "theory" (for
3890 theory begin and end), "proof" for proof commands, and "ML" for
3891 commands involving ML code; the additional tags "visible" and
3892 "invisible" are unused by default. Users may give explicit tag
3893 specifications in the text, e.g. ''by %invisible (auto)''. The
3894 interpretation of tags is determined by the LaTeX job during document
3895 preparation: see option -V of isatool usedir, or options -n and -t of
3896 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3899 Several document versions may be produced at the same time via isatool
3900 usedir (the generated index.html will link all of them). Typical
3901 specifications include ''-V document=theory,proof,ML'' to present
3902 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3903 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3904 these parts without any formal replacement text. The Isabelle site
3905 default settings produce ''document'' and ''outline'' versions as
3908 * Several new antiquotations:
3910 @{term_type term} prints a term with its type annotated;
3912 @{typeof term} prints the type of a term;
3914 @{const const} is the same as @{term const}, but checks that the
3915 argument is a known logical constant;
3917 @{term_style style term} and @{thm_style style thm} print a term or
3918 theorem applying a "style" to it
3922 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3923 definitions, equations, inequations etc., 'concl' printing only the
3924 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3925 to print the specified premise. TermStyle.add_style provides an ML
3926 interface for introducing further styles. See also the "LaTeX Sugar"
3927 document practical applications. The ML antiquotation prints
3928 type-checked ML expressions verbatim.
3930 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3931 and 'text' support optional locale specification '(in loc)', which
3932 specifies the default context for interpreting antiquotations. For
3933 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3935 * Option 'locale=NAME' of antiquotations specifies an alternative
3936 context interpreting the subsequent argument. For example: @{thm
3937 [locale=lattice] inf_assoc}.
3939 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3942 * Proper output of antiquotations for theory commands involving a
3943 proof context (such as 'locale' or 'theorem (in loc) ...').
3945 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3946 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3948 * isatool usedir: new option -C (default true) controls whether option
3949 -D should include a copy of the original document directory; -C false
3950 prevents unwanted effects such as copying of administrative CVS data.
3955 * Considerably improved version of 'constdefs' command. Now performs
3956 automatic type-inference of declared constants; additional support for
3957 local structure declarations (cf. locales and HOL records), see also
3958 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3959 sequential dependencies of definitions within a single 'constdefs'
3960 section; moreover, the declared name needs to be an identifier. If
3961 all fails, consider to fall back on 'consts' and 'defs' separately.
3963 * Improved indexed syntax and implicit structures. First of all,
3964 indexed syntax provides a notational device for subscripted
3965 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3966 expressions. Secondly, in a local context with structure
3967 declarations, number indexes \<^sub>n or the empty index (default
3968 number 1) refer to a certain fixed variable implicitly; option
3969 show_structs controls printing of implicit structures. Typical
3970 applications of these concepts involve record types and locales.
3972 * New command 'no_syntax' removes grammar declarations (and
3973 translations) resulting from the given syntax specification, which is
3974 interpreted in the same manner as for the 'syntax' command.
3976 * 'Advanced' translation functions (parse_translation etc.) may depend
3977 on the signature of the theory context being presently used for
3978 parsing/printing, see also isar-ref manual.
3980 * Improved 'oracle' command provides a type-safe interface to turn an
3981 ML expression of type theory -> T -> term into a primitive rule of
3982 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3983 is already included here); see also FOL/ex/IffExample.thy;
3986 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3987 before); "cI" is no longer bound, use "c.intro" instead.
3988 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3989 axclasses vs. locales.
3991 * Improved internal renaming of symbolic identifiers -- attach primes
3992 instead of base 26 numbers.
3994 * New flag show_question_marks controls printing of leading question
3995 marks in schematic variable names.
3997 * In schematic variable names, *any* symbol following \<^isub> or
3998 \<^isup> is now treated as part of the base name. For example, the
3999 following works without printing of awkward ".0" indexes:
4001 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
4004 * Inner syntax includes (*(*nested*) comments*).
4006 * Pretty printer now supports unbreakable blocks, specified in mixfix
4007 annotations as "(00...)".
4009 * Clear separation of logical types and nonterminals, where the latter
4010 may only occur in 'syntax' specifications or type abbreviations.
4011 Before that distinction was only partially implemented via type class
4012 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
4013 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
4014 exotic syntax specifications may require further adaption
4015 (e.g. Cube/Cube.thy).
4017 * Removed obsolete type class "logic", use the top sort {} instead.
4018 Note that non-logical types should be declared as 'nonterminals'
4019 rather than 'types'. INCOMPATIBILITY for new object-logic
4022 * Attributes 'induct' and 'cases': type or set names may now be
4023 locally fixed variables as well.
4025 * Simplifier: can now control the depth to which conditional rewriting
4026 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4029 * Simplifier: simplification procedures may now take the current
4030 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4031 interface), which is very useful for calling the Simplifier
4032 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4033 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4034 low-level mk_simproc no longer applies Logic.varify internally, to
4035 allow for use in a context of fixed variables.
4037 * thin_tac now works even if the assumption being deleted contains !!
4038 or ==>. More generally, erule now works even if the major premise of
4039 the elimination rule contains !! or ==>.
4041 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4043 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4044 from Pure, which contains all common declarations already. Both
4045 theories are defined via plain Isabelle/Isar .thy files.
4046 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4047 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4048 use isatool fixcpure to adapt your theory and ML sources.
4050 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4051 selections of theorems in named facts via index ranges.
4053 * 'print_theorems': in theory mode, really print the difference
4054 wrt. the last state (works for interactive theory development only),
4055 in proof mode print all local facts (cf. 'print_facts');
4057 * 'hide': option '(open)' hides only base names.
4059 * More efficient treatment of intermediate checkpoints in interactive
4062 * Code generator is now invoked via code_module (incremental code
4063 generation) and code_library (modular code generation, ML structures
4064 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4065 must be quoted when used as identifiers.
4067 * New 'value' command for reading, evaluating and printing terms using
4068 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4069 quoted when used as identifier.
4074 * New commands for the interpretation of locale expressions in
4075 theories (1), locales (2) and proof contexts (3). These generate
4076 proof obligations from the expression specification. After the
4077 obligations have been discharged, theorems of the expression are added
4078 to the theory, target locale or proof context. The synopsis of the
4079 commands is a follows:
4081 (1) interpretation expr inst
4082 (2) interpretation target < expr
4083 (3) interpret expr inst
4085 Interpretation in theories and proof contexts require a parameter
4086 instantiation of terms from the current context. This is applied to
4087 specifications and theorems of the interpreted expression.
4088 Interpretation in locales only permits parameter renaming through the
4089 locale expression. Interpretation is smart in that interpretations
4090 that are active already do not occur in proof obligations, neither are
4091 instantiated theorems stored in duplicate. Use 'print_interps' to
4092 inspect active interpretations of a particular locale. For details,
4093 see the Isar Reference manual. Examples can be found in
4094 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4096 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4097 'interpret' instead.
4099 * New context element 'constrains' for adding type constraints to
4102 * Context expressions: renaming of parameters with syntax
4105 * Locale declaration: 'includes' disallowed.
4107 * Proper static binding of attribute syntax -- i.e. types / terms /
4108 facts mentioned as arguments are always those of the locale definition
4109 context, independently of the context of later invocations. Moreover,
4110 locale operations (renaming and type / term instantiation) are applied
4111 to attribute arguments as expected.
4113 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4114 actual attributes; rare situations may require Attrib.attribute to
4115 embed those attributes into Attrib.src that lack concrete syntax.
4116 Attribute implementations need to cooperate properly with the static
4117 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4118 Attrib.XXX_thm etc. already do the right thing without further
4119 intervention. Only unusual applications -- such as "where" or "of"
4120 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4121 on the context and the facts involved -- may have to assign parsed
4122 values to argument tokens explicitly.
4124 * Changed parameter management in theorem generation for long goal
4125 statements with 'includes'. INCOMPATIBILITY: produces a different
4126 theorem statement in rare situations.
4128 * Locale inspection command 'print_locale' omits notes elements. Use
4129 'print_locale!' to have them included in the output.
4134 * Provers/hypsubst.ML: improved version of the subst method, for
4135 single-step rewriting: it now works in bound variable contexts. New is
4136 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4137 rewrite a different subterm than the original subst method, which is
4138 still available as 'simplesubst'.
4140 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4143 * Provers/trancl.ML: new transitivity reasoner for transitive and
4144 reflexive-transitive closure of relations.
4146 * Provers/blast.ML: new reference depth_limit to make blast's depth
4147 limit (previously hard-coded with a value of 20) user-definable.
4149 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4150 is peformed already. Object-logics merely need to finish their
4151 initial simpset configuration as before. INCOMPATIBILITY.
4156 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4159 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4161 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4162 and x-symbol; use option '-m epsilon' to get it actually printed.
4163 Moreover, the mathematically important symbolic identifier \<epsilon>
4164 becomes available as variable, constant etc. INCOMPATIBILITY,
4166 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4167 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4168 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4169 support corresponding Isar calculations.
4171 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4174 * theory SetInterval: changed the syntax for open intervals:
4183 The old syntax is still supported but will disappear in the next
4184 release. For conversion use the following Emacs search and replace
4185 patterns (these are not perfect but work quite well):
4187 {)\([^\.]*\)\.\. -> {\1<\.\.}
4188 \.\.\([^(}]*\)(} -> \.\.<\1}
4190 * Theory Commutative_Ring (in Library): method comm_ring for proving
4191 equalities in commutative rings; method 'algebra' provides a generic
4194 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4195 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4196 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4199 Some new syntax forms are available:
4201 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4202 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4203 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4204 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4206 The latter form "\<Sum>x < k. e" used to be based on a separate
4207 function "Summation", which has been discontinued.
4209 * theory Finite_Set: in structured induction proofs, the insert case
4210 is now 'case (insert x F)' instead of the old counterintuitive 'case
4213 * The 'refute' command has been extended to support a much larger
4214 fragment of HOL, including axiomatic type classes, constdefs and
4215 typedefs, inductive datatypes and recursion.
4217 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4218 Requires zChaff with proof generation to be installed. See
4219 HOL/ex/SAT_Examples.thy for examples.
4221 * Datatype induction via method 'induct' now preserves the name of the
4222 induction variable. For example, when proving P(xs::'a list) by
4223 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4224 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4225 in unstructured proof scripts.
4227 * Reworked implementation of records. Improved scalability for
4228 records with many fields, avoiding performance problems for type
4229 inference. Records are no longer composed of nested field types, but
4230 of nested extension types. Therefore the record type only grows linear
4231 in the number of extensions and not in the number of fields. The
4232 top-level (users) view on records is preserved. Potential
4233 INCOMPATIBILITY only in strange cases, where the theory depends on the
4234 old record representation. The type generated for a record is called
4235 <record_name>_ext_type.
4237 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4238 proofs triggered by a record definition or a simproc (if
4239 quick_and_dirty is enabled). Definitions of large records can take
4242 New simproc record_upd_simproc for simplification of multiple record
4243 updates enabled by default. Moreover, trivial updates are also
4244 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4245 occasionally, since simplification is more powerful by default.
4247 * typedef: proper support for polymorphic sets, which contain extra
4248 type-variables in the term.
4250 * Simplifier: automatically reasons about transitivity chains
4251 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4252 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4253 old proofs break occasionally as simplification may now solve more
4254 goals than previously.
4256 * Simplifier: converts x <= y into x = y if assumption y <= x is
4257 present. Works for all partial orders (class "order"), in particular
4258 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4261 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4262 bound variable or a constant then the let is unfolded. Otherwise
4263 first a is simplified to b, and then f b is simplified to g. If
4264 possible we abstract b from g arriving at "let x = b in h x",
4265 otherwise we unfold the let and arrive at g. The simproc can be
4266 enabled/disabled by the reference use_let_simproc. Potential
4267 INCOMPATIBILITY since simplification is more powerful by default.
4269 * Classical reasoning: the meson method now accepts theorems as arguments.
4271 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4272 jobs to provide advice on the provability of subgoals.
4274 * Theory OrderedGroup and Ring_and_Field: various additions and
4275 improvements to faciliate calculations involving equalities and
4278 The following theorems have been eliminated or modified
4281 abs_eq now named abs_of_nonneg
4282 abs_of_ge_0 now named abs_of_nonneg
4283 abs_minus_eq now named abs_of_nonpos
4284 imp_abs_id now named abs_of_nonneg
4285 imp_abs_neg_id now named abs_of_nonpos
4286 mult_pos now named mult_pos_pos
4287 mult_pos_le now named mult_nonneg_nonneg
4288 mult_pos_neg_le now named mult_nonneg_nonpos
4289 mult_pos_neg2_le now named mult_nonneg_nonpos2
4290 mult_neg now named mult_neg_neg
4291 mult_neg_le now named mult_nonpos_nonpos
4293 * The following lemmas in Ring_and_Field have been added to the simplifier:
4296 not_square_less_zero
4298 The following lemmas have been deleted from Real/RealPow:
4308 * Theory Parity: added rules for simplifying exponents.
4312 The following theorems have been eliminated or modified
4315 list_all_Nil now named list_all.simps(1)
4316 list_all_Cons now named list_all.simps(2)
4317 list_all_conv now named list_all_iff
4318 set_mem_eq now named mem_iff
4320 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4321 asymptotic "big O" calculations. See the notes in BigO.thy.
4326 * Theory RealDef: better support for embedding natural numbers and
4327 integers in the reals.
4329 The following theorems have been eliminated or modified
4332 exp_ge_add_one_self now requires no hypotheses
4333 real_of_int_add reversed direction of equality (use [symmetric])
4334 real_of_int_minus reversed direction of equality (use [symmetric])
4335 real_of_int_diff reversed direction of equality (use [symmetric])
4336 real_of_int_mult reversed direction of equality (use [symmetric])
4338 * Theory RComplete: expanded support for floor and ceiling functions.
4340 * Theory Ln is new, with properties of the natural logarithm
4342 * Hyperreal: There is a new type constructor "star" for making
4343 nonstandard types. The old type names are now type synonyms:
4347 hcomplex = complex star
4349 * Hyperreal: Many groups of similarly-defined constants have been
4350 replaced by polymorphic versions (INCOMPATIBILITY):
4352 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4354 starset <-- starsetNat, starsetC
4355 *s* <-- *sNat*, *sc*
4356 starset_n <-- starsetNat_n, starsetC_n
4357 *sn* <-- *sNatn*, *scn*
4358 InternalSets <-- InternalNatSets, InternalCSets
4360 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4361 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4362 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4363 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4364 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4366 * Hyperreal: Many type-specific theorems have been removed in favor of
4367 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4369 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4370 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4371 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4372 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4373 right_minus <-- hypreal_add_minus
4374 left_minus <-- {hypreal,hcomplex}_add_minus_left
4375 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4376 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4377 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4378 mult_1_right <-- hcomplex_mult_one_right
4379 mult_zero_left <-- hcomplex_mult_zero_left
4380 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4381 right_distrib <-- hypnat_add_mult_distrib2
4382 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4383 right_inverse <-- hypreal_mult_inverse
4384 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4385 order_refl <-- {hypreal,hypnat}_le_refl
4386 order_trans <-- {hypreal,hypnat}_le_trans
4387 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4388 order_less_le <-- {hypreal,hypnat}_less_le
4389 linorder_linear <-- {hypreal,hypnat}_le_linear
4390 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4391 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4392 add_nonneg_nonneg <-- hypreal_le_add_order
4394 * Hyperreal: Separate theorems having to do with type-specific
4395 versions of constants have been merged into theorems that apply to the
4396 new polymorphic constants (INCOMPATIBILITY):
4398 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4399 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4400 STAR_Un <-- {STAR,NatStar,STARC}_Un
4401 STAR_Int <-- {STAR,NatStar,STARC}_Int
4402 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4403 STAR_subset <-- {STAR,NatStar,STARC}_subset
4404 STAR_mem <-- {STAR,NatStar,STARC}_mem
4405 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4406 STAR_diff <-- {STAR,STARC}_diff
4407 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4408 STARC_hcomplex_of_complex}_image_subset
4409 starset_n_Un <-- starset{Nat,C}_n_Un
4410 starset_n_Int <-- starset{Nat,C}_n_Int
4411 starset_n_Compl <-- starset{Nat,C}_n_Compl
4412 starset_n_diff <-- starset{Nat,C}_n_diff
4413 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4414 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4415 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4416 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4417 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4418 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4419 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4420 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4421 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4422 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4423 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4424 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4425 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4426 starfun_diff <-- starfun{C,RC,CR}_diff
4427 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4428 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4429 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4430 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4431 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4432 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4433 starfun_Id <-- starfunC_Id
4434 starfun_approx <-- starfun{Nat,CR}_approx
4435 starfun_capprox <-- starfun{C,RC}_capprox
4436 starfun_abs <-- starfunNat_rabs
4437 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4438 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4439 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4440 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4441 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4442 starfun_add_approx <-- starfunCR_add_approx
4443 starfun_inverse_inverse <-- starfunC_inverse_inverse
4444 starfun_divide <-- starfun{C,CR,RC}_divide
4445 starfun_n <-- starfun{Nat,C}_n
4446 starfun_n_mult <-- starfun{Nat,C}_n_mult
4447 starfun_n_add <-- starfun{Nat,C}_n_add
4448 starfun_n_add_minus <-- starfunNat_n_add_minus
4449 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4450 starfun_n_minus <-- starfun{Nat,C}_n_minus
4451 starfun_n_eq <-- starfun{Nat,C}_n_eq
4453 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4454 star_n_minus <-- {hypreal,hcomplex}_minus
4455 star_n_diff <-- {hypreal,hcomplex}_diff
4456 star_n_mult <-- {hypreal,hcomplex}_mult
4457 star_n_inverse <-- {hypreal,hcomplex}_inverse
4458 star_n_le <-- {hypreal,hypnat}_le
4459 star_n_less <-- {hypreal,hypnat}_less
4460 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4461 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4462 star_n_abs <-- hypreal_hrabs
4463 star_n_divide <-- hcomplex_divide
4465 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4466 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4467 star_of_diff <-- hypreal_of_real_diff
4468 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4469 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4470 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4471 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4472 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4473 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4474 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4475 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4476 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4477 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4478 star_of_number_of <-- {hypreal,hcomplex}_number_of
4479 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4480 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4481 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4482 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4483 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4484 star_of_power <-- hypreal_of_real_power
4485 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4487 * Hyperreal: new method "transfer" that implements the transfer
4488 principle of nonstandard analysis. With a subgoal that mentions
4489 nonstandard types like "'a star", the command "apply transfer"
4490 replaces it with an equivalent one that mentions only standard types.
4491 To be successful, all free variables must have standard types; non-
4492 standard variables must have explicit universal quantifiers.
4494 * Hyperreal: A theory of Taylor series.
4499 * Discontinued special version of 'constdefs' (which used to support
4500 continuous functions) in favor of the general Pure one with full
4503 * New simplification procedure for solving continuity conditions; it
4504 is much faster on terms with many nested lambda abstractions (cubic
4505 instead of exponential time).
4507 * New syntax for domain package: selector names are now optional.
4508 Parentheses should be omitted unless argument is lazy, for example:
4510 domain 'a stream = cons "'a" (lazy "'a stream")
4512 * New command 'fixrec' for defining recursive functions with pattern
4513 matching; defining multiple functions with mutual recursion is also
4514 supported. Patterns may include the constants cpair, spair, up, sinl,
4515 sinr, or any data constructor defined by the domain package. The given
4516 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4517 syntax and examples.
4519 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4520 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4521 but the proof obligation additionally includes an admissibility
4522 requirement. The packages generate instances of class cpo or pcpo,
4523 with continuity and strictness theorems for Rep and Abs.
4525 * HOLCF: Many theorems have been renamed according to a more standard naming
4526 scheme (INCOMPATIBILITY):
4528 foo_inject: "foo$x = foo$y ==> x = y"
4529 foo_eq: "(foo$x = foo$y) = (x = y)"
4530 foo_less: "(foo$x << foo$y) = (x << y)"
4531 foo_strict: "foo$UU = UU"
4532 foo_defined: "... ==> foo$x ~= UU"
4533 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4538 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4539 including the First Isomorphism Theorem (on quotienting by the kernel
4542 * ZF/Simplifier: install second copy of type solver that actually
4543 makes use of TC rules declared to Isar proof contexts (or locales);
4544 the old version is still required for ML proof scripts.
4549 * Converted to Isar theory format; use locales instead of axiomatic
4555 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4558 * Pure/library.ML no longer defines its own option datatype, but uses
4559 that of the SML basis, which has constructors NONE and SOME instead of
4560 None and Some, as well as exception Option.Option instead of OPTION.
4561 The functions the, if_none, is_some, is_none have been adapted
4562 accordingly, while Option.map replaces apsome.
4564 * Pure/library.ML: the exception LIST has been given up in favour of
4565 the standard exceptions Empty and Subscript, as well as
4566 Library.UnequalLengths. Function like Library.hd and Library.tl are
4567 superceded by the standard hd and tl functions etc.
4569 A number of basic list functions are no longer exported to the ML
4570 toplevel, as they are variants of predefined functions. The following
4571 suggests how one can translate existing code:
4573 rev_append xs ys = List.revAppend (xs, ys)
4574 nth_elem (i, xs) = List.nth (xs, i)
4575 last_elem xs = List.last xs
4576 flat xss = List.concat xss
4577 seq fs = List.app fs
4578 partition P xs = List.partition P xs
4579 mapfilter f xs = List.mapPartial f xs
4581 * Pure/library.ML: several combinators for linear functional
4582 transformations, notably reverse application and composition:
4585 (x, y) |-> f f #-> g
4587 * Pure/library.ML: introduced/changed precedence of infix operators:
4589 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4591 infix 3 o oo ooo oooo;
4592 infix 4 ~~ upto downto;
4594 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4597 * Pure/library.ML: natural list combinators fold, fold_rev, and
4598 fold_map support linear functional transformations and nesting. For
4601 fold f [x1, ..., xN] y =
4602 y |> f x1 |> ... |> f xN
4604 (fold o fold) f [xs1, ..., xsN] y =
4605 y |> fold f xs1 |> ... |> fold f xsN
4607 fold f [x1, ..., xN] =
4610 (fold o fold) f [xs1, ..., xsN] =
4611 fold f xs1 #> ... #> fold f xsN
4613 * Pure/library.ML: the following selectors on type 'a option are
4616 the: 'a option -> 'a (*partial*)
4617 these: 'a option -> 'a where 'a = 'b list
4618 the_default: 'a -> 'a option -> 'a
4619 the_list: 'a option -> 'a list
4621 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4622 basic operations for association lists, following natural argument
4623 order; moreover the explicit equality predicate passed here avoids
4624 potentially expensive polymorphic runtime equality checks.
4625 The old functions may be expressed as follows:
4627 assoc = uncurry (AList.lookup (op =))
4628 assocs = these oo AList.lookup (op =)
4629 overwrite = uncurry (AList.update (op =)) o swap
4631 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4633 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4634 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4636 replacing make_keylist and keyfilter (occassionally used)
4639 make_keylist = AList.make
4640 keyfilter = AList.find (op =)
4642 * eq_fst and eq_snd now take explicit equality parameter, thus
4643 avoiding eqtypes. Naive rewrites:
4645 eq_fst = eq_fst (op =)
4646 eq_snd = eq_snd (op =)
4648 * Removed deprecated apl and apr (rarely used).
4651 apl (n, op) =>>= curry op n
4652 apr (op, m) =>>= fn n => op (n, m)
4654 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4655 provides a reasonably efficient light-weight implementation of sets as
4658 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4659 few new operations; existing lookup and update are now curried to
4660 follow natural argument order (for use with fold etc.);
4661 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4663 * Pure/General: output via the Isabelle channels of
4664 writeln/warning/error etc. is now passed through Output.output, with a
4665 hook for arbitrary transformations depending on the print_mode
4666 (cf. Output.add_mode -- the first active mode that provides a output
4667 function wins). Already formatted output may be embedded into further
4668 text via Output.raw; the result of Pretty.string_of/str_of and derived
4669 functions (string_of_term/cterm/thm etc.) is already marked raw to
4670 accommodate easy composition of diagnostic messages etc. Programmers
4671 rarely need to care about Output.output or Output.raw at all, with
4672 some notable exceptions: Output.output is required when bypassing the
4673 standard channels (writeln etc.), or in token translations to produce
4674 properly formatted results; Output.raw is required when capturing
4675 already output material that will eventually be presented to the user
4676 a second time. For the default print mode, both Output.output and
4677 Output.raw have no effect.
4679 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4680 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4681 cumulative results are displayed at the end of a batch session.
4683 * Pure/General: File.sysify_path and File.quote_sysify path have been
4684 replaced by File.platform_path and File.shell_path (with appropriate
4685 hooks). This provides a clean interface for unusual systems where the
4686 internal and external process view of file names are different.
4688 * Pure: more efficient orders for basic syntactic entities: added
4689 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4690 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4691 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4692 orders now -- potential INCOMPATIBILITY for code that depends on a
4693 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4694 Library.sort_strings on result).
4696 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4697 fold_types traverse types/terms from left to right, observing natural
4698 argument order. Supercedes previous foldl_XXX versions, add_frees,
4699 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4701 * Pure: name spaces have been refined, with significant changes of the
4702 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4703 to extern(_table). The plain name entry path is superceded by a
4704 general 'naming' context, which also includes the 'policy' to produce
4705 a fully qualified name and external accesses of a fully qualified
4706 name; NameSpace.extend is superceded by context dependent
4707 Sign.declare_name. Several theory and proof context operations modify
4708 the naming context. Especially note Theory.restore_naming and
4709 ProofContext.restore_naming to get back to a sane state; note that
4710 Theory.add_path is no longer sufficient to recover from
4711 Theory.absolute_path in particular.
4713 * Pure: new flags short_names (default false) and unique_names
4714 (default true) for controlling output of qualified names. If
4715 short_names is set, names are printed unqualified. If unique_names is
4716 reset, the name prefix is reduced to the minimum required to achieve
4717 the original result when interning again, even if there is an overlap
4718 with earlier declarations.
4720 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4721 now 'extend', and 'merge' gets an additional Pretty.pp argument
4722 (useful for printing error messages). INCOMPATIBILITY.
4724 * Pure: major reorganization of the theory context. Type Sign.sg and
4725 Theory.theory are now identified, referring to the universal
4726 Context.theory (see Pure/context.ML). Actual signature and theory
4727 content is managed as theory data. The old code and interfaces were
4728 spread over many files and structures; the new arrangement introduces
4729 considerable INCOMPATIBILITY to gain more clarity:
4731 Context -- theory management operations (name, identity, inclusion,
4732 parents, ancestors, merge, etc.), plus generic theory data;
4734 Sign -- logical signature and syntax operations (declaring consts,
4735 types, etc.), plus certify/read for common entities;
4737 Theory -- logical theory operations (stating axioms, definitions,
4738 oracles), plus a copy of logical signature operations (consts,
4739 types, etc.); also a few basic management operations (Theory.copy,
4742 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4743 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4744 for convenience -- they merely return the theory.
4746 * Pure: type Type.tsig is superceded by theory in most interfaces.
4748 * Pure: the Isar proof context type is already defined early in Pure
4749 as Context.proof (note that ProofContext.context and Proof.context are
4750 aliases, where the latter is the preferred name). This enables other
4751 Isabelle components to refer to that type even before Isar is present.
4753 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4754 typeK, constK, axiomK, oracleK), but provide explicit operations for
4755 any of these kinds. For example, Sign.intern typeK is now
4756 Sign.intern_type, Theory.hide_space Sign.typeK is now
4757 Theory.hide_types. Also note that former
4758 Theory.hide_classes/types/consts are now
4759 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4760 internalize their arguments! INCOMPATIBILITY.
4762 * Pure: get_thm interface (of PureThy and ProofContext) expects
4763 datatype thmref (with constructors Name and NameSelection) instead of
4764 plain string -- INCOMPATIBILITY;
4766 * Pure: cases produced by proof methods specify options, where NONE
4767 means to remove case bindings -- INCOMPATIBILITY in
4770 * Pure: the following operations retrieve axioms or theorems from a
4771 theory node or theory hierarchy, respectively:
4773 Theory.axioms_of: theory -> (string * term) list
4774 Theory.all_axioms_of: theory -> (string * term) list
4775 PureThy.thms_of: theory -> (string * thm) list
4776 PureThy.all_thms_of: theory -> (string * thm) list
4778 * Pure: print_tac now outputs the goal through the trace channel.
4780 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4781 Reference Toplevel.debug (default false) controls detailed printing
4782 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4783 controls execution profiling -- set to 1 for time and 2 for space
4784 (both increase the runtime).
4786 * Isar session: The initial use of ROOT.ML is now always timed,
4787 i.e. the log will show the actual process times, in contrast to the
4788 elapsed wall-clock time that the outer shell wrapper produces.
4790 * Simplifier: improved handling of bound variables (nameless
4791 representation, avoid allocating new strings). Simprocs that invoke
4792 the Simplifier recursively should use Simplifier.inherit_bounds to
4793 avoid local name clashes. Failure to do so produces warnings
4794 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4795 for further details.
4797 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4798 bindings for all theorems stored within a given theory; this may help
4799 in porting non-Isar theories to Isar ones, while keeping ML proof
4800 scripts for the time being.
4802 * ML operator HTML.with_charset specifies the charset begin used for
4803 generated HTML files. For example:
4805 HTML.with_charset "utf-8" use_thy "Hebrew";
4806 HTML.with_charset "utf-8" use_thy "Chinese";
4811 * Allow symlinks to all proper Isabelle executables (Isabelle,
4812 isabelle, isatool etc.).
4814 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4815 isatool doc, isatool mkdir, display_drafts etc.).
4817 * isatool usedir: option -f allows specification of the ML file to be
4818 used by Isabelle; default is ROOT.ML.
4820 * New isatool version outputs the version identifier of the Isabelle
4821 distribution being used.
4823 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4824 (containing Boolean satisfiability problems) into Isabelle/HOL
4829 New in Isabelle2004 (April 2004)
4830 --------------------------------
4834 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4835 Replaces linorder.ML.
4837 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4838 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4839 (\<a>...\<z>), are now considered normal letters, and can therefore
4840 be used anywhere where an ASCII letter (a...zA...Z) has until
4841 now. COMPATIBILITY: This obviously changes the parsing of some
4842 terms, especially where a symbol has been used as a binder, say
4843 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4844 as an identifier. Fix it by inserting a space around former
4845 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4846 existing theory and ML files.
4848 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4850 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4851 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4852 a normal (but invisible) letter. For multiple letter subscripts repeat
4853 \<^isub> like this: x\<^isub>1\<^isub>2.
4855 * Pure: There are now sub-/superscripts that can span more than one
4856 character. Text between \<^bsub> and \<^esub> is set in subscript in
4857 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4858 superscript. The new control characters are not identifier parts.
4860 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4861 content of "..." to the latex file instead of \isacntrl... . The "..."
4862 may consist of any printable characters excluding the end bracket >.
4864 * Pure: Using new Isar command "finalconsts" (or the ML functions
4865 Theory.add_finals or Theory.add_finals_i) it is now possible to
4866 declare constants "final", which prevents their being given a definition
4867 later. It is useful for constants whose behaviour is fixed axiomatically
4868 rather than definitionally, such as the meta-logic connectives.
4870 * Pure: 'instance' now handles general arities with general sorts
4871 (i.e. intersections of classes),
4873 * Presentation: generated HTML now uses a CSS style sheet to make layout
4874 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4875 It can be changed to alter the colors/layout of generated pages.
4880 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4881 cut_tac, subgoal_tac and thin_tac:
4882 - Now understand static (Isar) contexts. As a consequence, users of Isar
4883 locales are no longer forced to write Isar proof scripts.
4884 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4886 - INCOMPATIBILITY: names of variables to be instantiated may no
4887 longer be enclosed in quotes. Instead, precede variable name with `?'.
4888 This is consistent with the instantiation attribute "where".
4890 * Attributes "where" and "of":
4891 - Now take type variables of instantiated theorem into account when reading
4892 the instantiation string. This fixes a bug that caused instantiated
4893 theorems to have too special types in some circumstances.
4894 - "where" permits explicit instantiations of type variables.
4896 * Calculation commands "moreover" and "also" no longer interfere with
4897 current facts ("this"), admitting arbitrary combinations with "then"
4901 - Goal statements involving the context element "includes" no longer
4902 generate theorems with internal delta predicates (those ending on
4903 "_axioms") in the premise.
4904 Resolve particular premise with <locale>.intro to obtain old form.
4905 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4906 specification and "includes" elements in goal statement.
4907 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4908 [intro?] and [elim?] (respectively) by default.
4909 - Experimental command for instantiation of locales in proof contexts:
4910 instantiate <label>[<attrs>]: <loc>
4911 Instantiates locale <loc> and adds all its theorems to the current context
4912 taking into account their attributes. Label and attrs are optional
4913 modifiers, like in theorem declarations. If present, names of
4914 instantiated theorems are qualified with <label>, and the attributes
4915 <attrs> are applied after any attributes these theorems might have already.
4916 If the locale has assumptions, a chained fact of the form
4917 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4918 are derived. The command does not support old-style locales declared
4919 with "locale (open)".
4920 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4922 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4928 * Proof import: new image HOL4 contains the imported library from
4929 the HOL4 system with about 2500 theorems. It is imported by
4930 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4931 can be used like any other Isabelle image. See
4932 HOL/Import/HOL/README for more information.
4935 - Much improved handling of linear and partial orders.
4936 Reasoners for linear and partial orders are set up for type classes
4937 "linorder" and "order" respectively, and are added to the default simpset
4938 as solvers. This means that the simplifier can build transitivity chains
4939 to solve goals from the assumptions.
4940 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4941 of blast or auto after simplification become unnecessary because the goal
4942 is solved by simplification already.
4944 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4945 all proved in axiomatic type classes for semirings, rings and fields.
4948 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4949 now formalized using the Ring_and_Field theory mentioned above.
4950 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4951 than before, because now they are set up once in a generic manner.
4952 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4953 Look for the general versions in Ring_and_Field (and Power if they concern
4956 * Type "rat" of the rational numbers is now available in HOL-Complex.
4959 - Record types are now by default printed with their type abbreviation
4960 instead of the list of all field types. This can be configured via
4961 the reference "print_record_type_abbr".
4962 - Simproc "record_upd_simproc" for simplification of multiple updates added
4963 (not enabled by default).
4964 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4965 EX x. x = sel r to True (not enabled by default).
4966 - Tactic "record_split_simp_tac" to split and simplify records added.
4968 * 'specification' command added, allowing for definition by
4969 specification. There is also an 'ax_specification' command that
4970 introduces the new constants axiomatically.
4972 * arith(_tac) is now able to generate counterexamples for reals as well.
4974 * HOL-Algebra: new locale "ring" for non-commutative rings.
4976 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4977 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4979 * HOL-Matrix: a first theory for matrices in HOL with an application of
4980 matrix theory to linear programming.
4982 * Unions and Intersections:
4983 The latex output syntax of UN and INT has been changed
4984 from "\Union x \in A. B" to "\Union_{x \in A} B"
4985 i.e. the index formulae has become a subscript.
4986 Similarly for "\Union x. B", and for \Inter instead of \Union.
4988 * Unions and Intersections over Intervals:
4989 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4990 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4991 like in normal math, and corresponding versions for < and for intersection.
4993 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4994 lexicographic dictonary ordering has been added as "lexord".
4996 * ML: the legacy theory structures Int and List have been removed. They had
4997 conflicted with ML Basis Library structures having the same names.
4999 * 'refute' command added to search for (finite) countermodels. Only works
5000 for a fragment of HOL. The installation of an external SAT solver is
5001 highly recommended. See "HOL/Refute.thy" for details.
5003 * 'quickcheck' command: Allows to find counterexamples by evaluating
5004 formulae under an assignment of free variables to random values.
5005 In contrast to 'refute', it can deal with inductive datatypes,
5006 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
5012 * Streams now come with concatenation and are part of the HOLCF image
5016 New in Isabelle2003 (May 2003)
5017 ------------------------------
5021 * Provers/simplifier:
5023 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
5024 Assumptions are now subject to complete mutual simplification,
5025 not just from left to right. The simplifier now preserves
5026 the order of assumptions.
5028 Potential INCOMPATIBILITY:
5030 -- simp sometimes diverges where the old version did
5031 not, e.g. invoking simp on the goal
5033 [| P (f x); y = x; f x = f y |] ==> Q
5035 now gives rise to the infinite reduction sequence
5037 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5039 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5042 -- Tactics combining classical reasoner and simplification (such as auto)
5043 are also affected by this change, because many of them rely on
5044 simp. They may sometimes diverge as well or yield a different numbers
5045 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5046 in case of problems. Sometimes subsequent calls to the classical
5047 reasoner will fail because a preceeding call to the simplifier too
5048 eagerly simplified the goal, e.g. deleted redundant premises.
5050 - The simplifier trace now shows the names of the applied rewrite rules
5052 - You can limit the number of recursive invocations of the simplifier
5053 during conditional rewriting (where the simplifie tries to solve the
5054 conditions before applying the rewrite rule):
5055 ML "simp_depth_limit := n"
5056 where n is an integer. Thus you can force termination where previously
5057 the simplifier would diverge.
5059 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5061 - No longer aborts on failed congruence proof. Instead, the
5062 congruence is ignored.
5064 * Pure: New generic framework for extracting programs from constructive
5065 proofs. See HOL/Extraction.thy for an example instantiation, as well
5066 as HOL/Extraction for some case studies.
5068 * Pure: The main goal of the proof state is no longer shown by default, only
5069 the subgoals. This behaviour is controlled by a new flag.
5070 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5071 (ML: Proof.show_main_goal).
5073 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5074 rules whose conclusion matches subgoal 1:
5075 PG menu: Isabelle/Isar -> Show me -> matching rules
5076 The rules are ordered by how closely they match the subgoal.
5077 In particular, rules that solve a subgoal outright are displayed first
5078 (or rather last, the way they are printed).
5079 (ML: ProofGeneral.print_intros())
5081 * Pure: New flag trace_unify_fail causes unification to print
5082 diagnostic information (PG: in trace buffer) when it fails. This is
5083 useful for figuring out why single step proofs like rule, erule or
5086 * Pure: Locale specifications now produce predicate definitions
5087 according to the body of text (covering assumptions modulo local
5088 definitions); predicate "loc_axioms" covers newly introduced text,
5089 while "loc" is cumulative wrt. all included locale expressions; the
5090 latter view is presented only on export into the global theory
5091 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5092 on the old view without predicates;
5094 * Pure: predefined locales "var" and "struct" are useful for sharing
5095 parameters (as in CASL, for example); just specify something like
5096 ``var x + var y + struct M'' as import;
5098 * Pure: improved thms_containing: proper indexing of facts instead of
5099 raw theorems; check validity of results wrt. current name space;
5100 include local facts of proof configuration (also covers active
5101 locales), cover fixed variables in index; may use "_" in term
5102 specification; an optional limit for the number of printed facts may
5103 be given (the default is 40);
5105 * Pure: disallow duplicate fact bindings within new-style theory files
5108 * Provers: improved induct method: assumptions introduced by case
5109 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5110 the goal statement); "foo" still refers to all facts collectively;
5112 * Provers: the function blast.overloaded has been removed: all constants
5113 are regarded as potentially overloaded, which improves robustness in exchange
5114 for slight decrease in efficiency;
5116 * Provers/linorder: New generic prover for transitivity reasoning over
5117 linear orders. Note: this prover is not efficient!
5119 * Isar: preview of problems to finish 'show' now produce an error
5120 rather than just a warning (in interactive mode);
5127 - Produces a counter example if it cannot prove a goal.
5128 Note that the counter example may be spurious if the goal is not a formula
5129 of quantifier-free linear arithmetic.
5130 In ProofGeneral the counter example appears in the trace buffer.
5132 - Knows about div k and mod k where k is a numeral of type nat or int.
5134 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5135 linear arithmetic fails. This takes account of quantifiers and divisibility.
5136 Presburger arithmetic can also be called explicitly via presburger(_tac).
5138 * simp's arithmetic capabilities have been enhanced a bit: it now
5139 takes ~= in premises into account (by performing a case split);
5141 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5142 are distributed over a sum of terms;
5144 * New tactic "trans_tac" and method "trans" instantiate
5145 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5148 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5149 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5151 * 'typedef' command has new option "open" to suppress the set
5154 * functions Min and Max on finite sets have been introduced (theory
5157 * attribute [symmetric] now works for relations as well; it turns
5158 (x,y) : R^-1 into (y,x) : R, and vice versa;
5160 * induct over a !!-quantified statement (say !!x1..xn):
5161 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5163 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5164 %x. None. Warning: empty_def now refers to the previously hidden definition
5167 * Algebra: formalization of classical algebra. Intended as base for
5168 any algebraic development in Isabelle. Currently covers group theory
5169 (up to Sylow's theorem) and ring theory (Universal Property of
5170 Univariate Polynomials). Contributions welcome;
5172 * GroupTheory: deleted, since its material has been moved to Algebra;
5174 * Complex: new directory of the complex numbers with numeric constants,
5175 nonstandard complex numbers, and some complex analysis, standard and
5176 nonstandard (Jacques Fleuriot);
5178 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5180 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5183 * Real/HahnBanach: updated and adapted to locales;
5185 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5188 * UNITY: added the Meier-Sanders theory of progress sets;
5190 * MicroJava: bytecode verifier and lightweight bytecode verifier
5191 as abstract algorithms, instantiated to the JVM;
5193 * Bali: Java source language formalization. Type system, operational
5194 semantics, axiomatic semantics. Supported language features:
5195 classes, interfaces, objects,virtual methods, static methods,
5196 static/instance fields, arrays, access modifiers, definite
5197 assignment, exceptions.
5202 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5205 * Main ZF: virtually all theories converted to new-style format;
5210 * Pure: Tactic.prove provides sane interface for internal proofs;
5211 omits the infamous "standard" operation, so this is more appropriate
5212 than prove_goalw_cterm in many situations (e.g. in simprocs);
5214 * Pure: improved error reporting of simprocs;
5216 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5220 *** Document preparation ***
5222 * uses \par instead of \\ for line breaks in theory text. This may
5223 shift some page breaks in large documents. To get the old behaviour
5224 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5226 * minimized dependencies of isabelle.sty and isabellesym.sty on
5229 * \<euro> now needs package babel/greek instead of marvosym (which
5232 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5237 New in Isabelle2002 (March 2002)
5238 --------------------------------
5240 *** Document preparation ***
5242 * greatly simplified document preparation setup, including more
5243 graceful interpretation of isatool usedir -i/-d/-D options, and more
5244 instructive isatool mkdir; users should basically be able to get
5245 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5246 users may run a separate document processing stage manually like this:
5247 "isatool usedir -D output HOL Test && isatool document Test/output";
5249 * theory dependency graph may now be incorporated into documents;
5250 isatool usedir -g true will produce session_graph.eps/.pdf for use
5251 with \includegraphics of LaTeX;
5253 * proper spacing of consecutive markup elements, especially text
5254 blocks after section headings;
5256 * support bold style (for single symbols only), input syntax is like
5257 this: "\<^bold>\<alpha>" or "\<^bold>A";
5259 * \<bullet> is now output as bold \cdot by default, which looks much
5260 better in printed text;
5262 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5263 note that these symbols are currently unavailable in Proof General /
5264 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5266 * isatool latex no longer depends on changed TEXINPUTS, instead
5267 isatool document copies the Isabelle style files to the target
5273 * Pure/Provers: improved proof by cases and induction;
5274 - 'case' command admits impromptu naming of parameters (such as
5276 - 'induct' method divinates rule instantiation from the inductive
5277 claim; no longer requires excessive ?P bindings for proper
5278 instantiation of cases;
5279 - 'induct' method properly enumerates all possibilities of set/type
5280 rules; as a consequence facts may be also passed through *type*
5281 rules without further ado;
5282 - 'induct' method now derives symbolic cases from the *rulified*
5283 rule (before it used to rulify cases stemming from the internal
5284 atomized version); this means that the context of a non-atomic
5285 statement becomes is included in the hypothesis, avoiding the
5286 slightly cumbersome show "PROP ?case" form;
5287 - 'induct' may now use elim-style induction rules without chaining
5288 facts, using ``missing'' premises from the goal state; this allows
5289 rules stemming from inductive sets to be applied in unstructured
5290 scripts, while still benefitting from proper handling of non-atomic
5291 statements; NB: major inductive premises need to be put first, all
5292 the rest of the goal is passed through the induction;
5293 - 'induct' proper support for mutual induction involving non-atomic
5294 rule statements (uses the new concept of simultaneous goals, see
5296 - append all possible rule selections, but only use the first
5297 success (no backtracking);
5298 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5299 - undeclared rule case names default to numbers 1, 2, 3, ...;
5300 - added 'print_induct_rules' (covered by help item in recent Proof
5302 - moved induct/cases attributes to Pure, methods to Provers;
5303 - generic method setup instantiated for FOL and HOL;
5305 * Pure: support multiple simultaneous goal statements, for example
5306 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5307 meta-level mechanism, this acts as if several individual goals had
5308 been stated separately; in particular common proof methods need to be
5309 repeated in order to cover all claims; note that a single elimination
5310 step is *not* sufficient to establish the two conjunctions, so this
5313 assume "A & B" then have A and B .. (*".." fails*)
5315 better use "obtain" in situations as above; alternative refer to
5316 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5318 * Pure: proper integration with ``locales''; unlike the original
5319 version by Florian Kammller, Isar locales package high-level proof
5320 contexts rather than raw logical ones (e.g. we admit to include
5321 attributes everywhere); operations on locales include merge and
5322 rename; support for implicit arguments (``structures''); simultaneous
5323 type-inference over imports and text; see also HOL/ex/Locales.thy for
5326 * Pure: the following commands have been ``localized'', supporting a
5327 target locale specification "(in name)": 'lemma', 'theorem',
5328 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5329 stored both within the locale and at the theory level (exported and
5330 qualified by the locale name);
5332 * Pure: theory goals may now be specified in ``long'' form, with
5333 ad-hoc contexts consisting of arbitrary locale elements. for example
5334 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5335 definitions may be given, too); the result is a meta-level rule with
5336 the context elements being discharged in the obvious way;
5338 * Pure: new proof command 'using' allows to augment currently used
5339 facts after a goal statement ('using' is syntactically analogous to
5340 'apply', but acts on the goal's facts only); this allows chained facts
5341 to be separated into parts given before and after a claim, as in
5342 ``from a and b have C using d and e <proof>'';
5344 * Pure: renamed "antecedent" case to "rule_context";
5346 * Pure: new 'judgment' command records explicit information about the
5347 object-logic embedding (used by several tools internally); no longer
5348 use hard-wired "Trueprop";
5350 * Pure: added 'corollary' command;
5352 * Pure: fixed 'token_translation' command;
5354 * Pure: removed obsolete 'exported' attribute;
5356 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5357 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5358 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5360 * Pure: method 'atomize' presents local goal premises as object-level
5361 statements (atomic meta-level propositions); setup controlled via
5362 rewrite rules declarations of 'atomize' attribute; example
5363 application: 'induct' method with proper rule statements in improper
5366 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5367 now consider the syntactic context of assumptions, giving a better
5368 chance to get type-inference of the arguments right (this is
5369 especially important for locales);
5371 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5374 * Pure/obtain: the formal conclusion "thesis", being marked as
5375 ``internal'', may no longer be reference directly in the text;
5376 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5379 * Pure: generic 'sym' attribute which declares a rule both as pure
5380 'elim?' and for the 'symmetric' operation;
5382 * Pure: marginal comments ``--'' may now occur just anywhere in the
5383 text; the fixed correlation with particular command syntax has been
5386 * Pure: new method 'rules' is particularly well-suited for proof
5387 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5388 but often produces more compact proof terms with less detours;
5390 * Pure/Provers/classical: simplified integration with pure rule
5391 attributes and methods; the classical "intro?/elim?/dest?"
5392 declarations coincide with the pure ones; the "rule" method no longer
5393 includes classically swapped intros; "intro" and "elim" methods no
5394 longer pick rules from the context; also got rid of ML declarations
5395 AddXIs/AddXEs/AddXDs; all of this has some potential for
5398 * Provers/classical: attribute 'swapped' produces classical inversions
5399 of introduction rules;
5401 * Provers/simplifier: 'simplified' attribute may refer to explicit
5402 rules instead of full simplifier context; 'iff' attribute handles
5405 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5407 * HOL: 'recdef' now fails on unfinished automated proofs, use
5408 "(permissive)" option to recover old behavior;
5410 * HOL: 'inductive' no longer features separate (collective) attributes
5411 for 'intros' (was found too confusing);
5413 * HOL: properly declared induction rules less_induct and
5419 * HOL: moved over to sane numeral syntax; the new policy is as
5422 - 0 and 1 are polymorphic constants, which are defined on any
5423 numeric type (nat, int, real etc.);
5425 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5426 binary representation internally;
5428 - type nat has special constructor Suc, and generally prefers Suc 0
5429 over 1::nat and Suc (Suc 0) over 2::nat;
5431 This change may cause significant problems of INCOMPATIBILITY; here
5432 are some hints on converting existing sources:
5434 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5435 entities, so expressions involving "-" (unary or binary minus) need
5436 to be spaced properly;
5438 - existing occurrences of "1" may need to be constraint "1::nat" or
5439 even replaced by Suc 0; similar for old "2";
5441 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5443 - remove all special provisions on numerals in proofs;
5445 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5446 representation (depends on bin_arith_simps in the default context);
5448 * HOL: symbolic syntax for x^2 (numeral 2);
5450 * HOL: the class of all HOL types is now called "type" rather than
5451 "term"; INCOMPATIBILITY, need to adapt references to this type class
5452 in axclass/classes, instance/arities, and (usually rare) occurrences
5453 in typings (of consts etc.); internally the class is called
5454 "HOL.type", ML programs should refer to HOLogic.typeS;
5456 * HOL/record package improvements:
5457 - new derived operations "fields" to build a partial record section,
5458 "extend" to promote a fixed record to a record scheme, and
5459 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5460 declared as simp by default;
5461 - shared operations ("more", "fields", etc.) now need to be always
5462 qualified) --- potential INCOMPATIBILITY;
5463 - removed "make_scheme" operations (use "make" with "extend") --
5465 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5466 - provides cases/induct rules for use with corresponding Isar
5467 methods (for concrete records, record schemes, concrete more
5468 parts, and schematic more parts -- in that order);
5469 - internal definitions directly based on a light-weight abstract
5470 theory of product types over typedef rather than datatype;
5472 * HOL: generic code generator for generating executable ML code from
5473 specifications; specific support for HOL constructs such as inductive
5474 datatypes and sets, as well as recursive functions; can be invoked
5475 via 'generate_code' theory section;
5477 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5479 * HOL: consolidated and renamed several theories. In particular:
5480 Ord.thy has been absorbed into HOL.thy
5481 String.thy has been absorbed into List.thy
5483 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5484 (beware of argument permutation!);
5486 * HOL: linorder_less_split superseded by linorder_cases;
5488 * HOL/List: "nodups" renamed to "distinct";
5490 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5491 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5492 - Ex_def has changed, now need to use some_eq_ex
5494 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5495 in this (rare) case use:
5497 delSWrapper "split_all_tac"
5498 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5500 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5503 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5504 Isabelle's type classes, ^ on functions and relations has too general
5505 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5506 necessary to attach explicit type constraints;
5508 * HOL/Relation: the prefix name of the infix "O" has been changed from
5509 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5510 renamed accordingly (eg "compI" -> "rel_compI").
5512 * HOL: syntax translations now work properly with numerals and records
5515 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5516 of "lam" -- INCOMPATIBILITY;
5518 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5519 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5520 renamed "Product_Type.unit";
5522 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5524 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5525 the "cases" method);
5527 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5530 * HOL/IMP: updated and converted to new-style theory format; several
5531 parts turned into readable document, with proper Isar proof texts and
5532 some explanations (by Gerwin Klein);
5534 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5536 * HOL-Hyperreal is now a logic image;
5541 * Isar: consts/constdefs supports mixfix syntax for continuous
5544 * Isar: domain package adapted to new-style theory format, e.g. see
5547 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5548 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5549 lift.induct_tac, always use UU instead of Undef;
5551 * HOLCF/IMP: updated and converted to new-style theory;
5556 * Isar: proper integration of logic-specific tools and packages,
5557 including theory commands '(co)inductive', '(co)datatype',
5558 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5559 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5561 * theory Main no longer includes AC; for the Axiom of Choice, base
5562 your theory on Main_ZFC;
5564 * the integer library now covers quotients and remainders, with many
5565 laws relating division to addition, multiplication, etc.;
5567 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5568 typeless version of the formalism;
5570 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5573 * ZF/Induct: new directory for examples of inductive definitions,
5574 including theory Multiset for multiset orderings; converted to
5575 new-style theory format;
5577 * ZF: many new theorems about lists, ordinals, etc.;
5582 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5583 variable proof controls level of detail: 0 = no proofs (only oracle
5584 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5585 also ref manual for further ML interfaces;
5587 * Pure/axclass: removed obsolete ML interface
5588 goal_subclass/goal_arity;
5590 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5591 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5592 separate tokens, so expressions involving minus need to be spaced
5595 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5596 rather than "infixl" or "infixr";
5598 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5599 sort constraint specifications in type inference; e.g. "x::_::foo"
5600 ensures that the type of "x" is of sort "foo" (but not necessarily a
5603 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5604 control output of nested => (types); the default behavior is
5607 * Pure/syntax: builtin parse translation for "_constify" turns valued
5608 tokens into AST constants;
5610 * Pure/syntax: prefer later declarations of translations and print
5611 translation functions; potential INCOMPATIBILITY: need to reverse
5612 multiple declarations for same syntax element constant;
5614 * Pure/show_hyps reset by default (in accordance to existing Isar
5617 * Provers/classical: renamed addaltern to addafter, addSaltern to
5620 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5623 * system: tested support for MacOS X; should be able to get Isabelle +
5624 Proof General to work in a plain Terminal after installing Poly/ML
5625 (e.g. from the Isabelle distribution area) and GNU bash alone
5626 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5627 support requires further installations, e.g. from
5628 http://fink.sourceforge.net/);
5630 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5632 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5633 of 40 MB), cf. ML_OPTIONS;
5635 * system: Proof General keywords specification is now part of the
5636 Isabelle distribution (see etc/isar-keywords.el);
5638 * system: support for persistent Proof General sessions (refrain from
5639 outdating all loaded theories on startup); user may create writable
5640 logic images like this: ``isabelle -q HOL Test'';
5642 * system: smart selection of Isabelle process versus Isabelle
5643 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5644 run both "isabelle" and "Isabelle" even if file names are badly
5645 damaged (executable inspects the case of the first letter of its own
5646 name); added separate "isabelle-process" and "isabelle-interface";
5648 * system: refrain from any attempt at filtering input streams; no
5649 longer support ``8bit'' encoding of old isabelle font, instead proper
5650 iso-latin characters may now be used; the related isatools
5651 "symbolinput" and "nonascii" have disappeared as well;
5653 * system: removed old "xterm" interface (the print modes "xterm" and
5654 "xterm_color" are still available for direct use in a suitable
5659 New in Isabelle99-2 (February 2001)
5660 -----------------------------------
5662 *** Overview of INCOMPATIBILITIES ***
5664 * HOL: please note that theories in the Library and elsewhere often use the
5665 new-style (Isar) format; to refer to their theorems in an ML script you must
5666 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5668 * HOL: inductive package no longer splits induction rule aggressively,
5669 but only as far as specified by the introductions given; the old
5670 format may be recovered via ML function complete_split_rule or attribute
5671 'split_rule (complete)';
5673 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5674 gfp_Tarski to gfp_unfold;
5676 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5678 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5679 relation); infix "^^" has been renamed "``"; infix "``" has been
5680 renamed "`"; "univalent" has been renamed "single_valued";
5682 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5685 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5687 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5689 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5690 consequence, it is no longer monotonic wrt. the local goal context
5691 (which is now passed through the inductive cases);
5693 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5694 \<gg> to \<ggreater>;
5697 *** Document preparation ***
5699 * \isabellestyle{NAME} selects version of Isabelle output (currently
5700 available: are "it" for near math-mode best-style output, "sl" for
5701 slanted text style, and "tt" for plain type-writer; if no
5702 \isabellestyle command is given, output is according to slanted
5705 * support sub/super scripts (for single symbols only), input syntax is
5706 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5708 * some more standard symbols; see Appendix A of the system manual for
5709 the complete list of symbols defined in isabellesym.sty;
5711 * improved isabelle style files; more abstract symbol implementation
5712 (should now use \isamath{...} and \isatext{...} in custom symbol
5715 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5716 state; Note that presentation of goal states does not conform to
5717 actual human-readable proof documents. Please do not include goal
5718 states into document output unless you really know what you are doing!
5720 * proper indentation of antiquoted output with proportional LaTeX
5723 * no_document ML operator temporarily disables LaTeX document
5726 * isatool unsymbolize tunes sources for plain ASCII communication;
5731 * Pure: Isar now suffers initial goal statements to contain unbound
5732 schematic variables (this does not conform to actual readable proof
5733 documents, due to unpredictable outcome and non-compositional proof
5734 checking); users who know what they are doing may use schematic goals
5735 for Prolog-style synthesis of proven results;
5737 * Pure: assumption method (an implicit finishing) now handles actual
5740 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5741 initial goal, declare "that" only as Pure intro (only for single
5742 steps); the "that" rule assumption may now be involved in implicit
5743 finishing, thus ".." becomes a feasible for trivial obtains;
5745 * Pure: default proof step now includes 'intro_classes'; thus trivial
5746 instance proofs may be performed by "..";
5748 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5751 * Pure: more robust selection of calculational rules;
5753 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5754 rule (as well as the assumption rule);
5756 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5757 lemmas, using the graph browser tool;
5759 * Pure: predict failure of "show" in interactive mode;
5761 * Pure: 'thms_containing' now takes actual terms as arguments;
5763 * HOL: improved method 'induct' --- now handles non-atomic goals
5764 (potential INCOMPATIBILITY); tuned error handling;
5766 * HOL: cases and induct rules now provide explicit hints about the
5767 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5768 any remaining facts are inserted into the goal verbatim;
5770 * HOL: local contexts (aka cases) may now contain term bindings as
5771 well; the 'cases' and 'induct' methods new provide a ?case binding for
5772 the result to be shown in each case;
5774 * HOL: added 'recdef_tc' command;
5776 * isatool convert assists in eliminating legacy ML scripts;
5781 * HOL/Library: a collection of generic theories to be used together
5782 with main HOL; the theory loader path already includes this directory
5783 by default; the following existing theories have been moved here:
5784 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5785 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5787 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5788 modelling and verification task performed in Isabelle/HOL +
5789 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5791 * HOL/Algebra: special summation operator SUM no longer exists, it has
5792 been replaced by setsum; infix 'assoc' now has priority 50 (like
5793 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5794 'domain', this makes the theory consistent with mathematical
5797 * HOL basics: added overloaded operations "inverse" and "divide"
5798 (infix "/"), syntax for generic "abs" operation, generic summation
5801 * HOL/typedef: simplified package, provide more useful rules (see also
5804 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5805 now expressed as a proper nested rule (old-style tactic scripts may
5806 require atomize_strip_tac to cope with non-atomic premises);
5808 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5809 to "split_conv" (old name still available for compatibility);
5811 * HOL: improved concrete syntax for strings (e.g. allows translation
5812 rules with string literals);
5814 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5815 and Fleuriot's mechanization of analysis, including the transcendental
5816 functions for the reals;
5818 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5823 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5824 "lam" is displayed as TWO lambda-symbols
5826 * CTT: theory Main now available, containing everything (that is, Bool
5832 * Pure: the Simplifier has been implemented properly as a derived rule
5833 outside of the actual kernel (at last!); the overall performance
5834 penalty in practical applications is about 50%, while reliability of
5835 the Isabelle inference kernel has been greatly improved;
5837 * print modes "brackets" and "no_brackets" control output of nested =>
5838 (types) and ==> (props); the default behaviour is "brackets";
5840 * Provers: fast_tac (and friends) now handle actual object-logic rules
5841 as assumptions as well;
5843 * system: support Poly/ML 4.0;
5845 * system: isatool install handles KDE version 1 or 2;
5849 New in Isabelle99-1 (October 2000)
5850 ----------------------------------
5852 *** Overview of INCOMPATIBILITIES ***
5854 * HOL: simplification of natural numbers is much changed; to partly
5855 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5856 issue the following ML commands:
5858 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5859 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5861 * HOL: simplification no longer dives into case-expressions; this is
5862 controlled by "t.weak_case_cong" for each datatype t;
5864 * HOL: nat_less_induct renamed to less_induct;
5866 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5867 fixsome to patch .thy and .ML sources automatically;
5869 select_equality -> some_equality
5870 select_eq_Ex -> some_eq_ex
5871 selectI2EX -> someI2_ex
5874 select1_equality -> some1_equality
5875 Eps_sym_eq -> some_sym_eq_trivial
5876 Eps_eq -> some_eq_trivial
5878 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5880 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5883 * HOL: the recursion equations generated by 'recdef' are now called
5884 f.simps instead of f.rules;
5886 * HOL: qed_spec_mp now also handles bounded ALL as well;
5888 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5889 sometimes be needed;
5891 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5893 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5895 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5896 product is now "<*>" instead of "Times"; the lexicographic product is
5897 now "<*lex*>" instead of "**";
5899 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5900 of main HOL, but was unused); better use HOL's datatype package;
5902 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5903 the old syntax may be recovered as follows:
5906 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5907 (infixl "\\<oplus>" 100)
5909 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5911 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5912 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5915 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5916 changed from A/r to A//r;
5918 * ZF: new treatment of arithmetic (nat & int) may break some old
5921 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5922 rulify -> rule_format, elimify -> elim_format, ...);
5924 * Isar/Provers: intro/elim/dest attributes changed; renamed
5925 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5926 should have to change intro!! to intro? only); replaced "delrule" by
5929 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5931 * Provers: strengthened force_tac by using new first_best_tac;
5933 * LaTeX document preparation: several changes of isabelle.sty (see
5937 *** Document preparation ***
5939 * formal comments (text blocks etc.) in new-style theories may now
5940 contain antiquotations of thm/prop/term/typ/text to be presented
5941 according to latex print mode; concrete syntax is like this:
5942 @{term[show_types] "f(x) = a + x"};
5944 * isatool mkdir provides easy setup of Isabelle session directories,
5945 including proper document sources;
5947 * generated LaTeX sources are now deleted after successful run
5948 (isatool document -c); may retain a copy somewhere else via -D option
5951 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5952 style files, achieving self-contained LaTeX sources and simplifying
5955 * old-style theories now produce (crude) LaTeX output as well;
5957 * browser info session directories are now self-contained (may be put
5958 on WWW server seperately); improved graphs of nested sessions; removed
5959 graph for 'all sessions';
5961 * several improvements in isabelle style files; \isabellestyle{it}
5962 produces fake math mode output; \isamarkupheader is now \section by
5963 default; see lib/texinputs/isabelle.sty etc.;
5968 * Isar/Pure: local results and corresponding term bindings are now
5969 subject to Hindley-Milner polymorphism (similar to ML); this
5970 accommodates incremental type-inference very nicely;
5972 * Isar/Pure: new derived language element 'obtain' supports
5973 generalized existence reasoning;
5975 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5976 support accumulation of results, without applying any rules yet;
5977 useful to collect intermediate results without explicit name
5978 references, and for use with transitivity rules with more than 2
5981 * Isar/Pure: scalable support for case-analysis type proofs: new
5982 'case' language element refers to local contexts symbolically, as
5983 produced by certain proof methods; internally, case names are attached
5984 to theorems as "tags";
5986 * Isar/Pure: theory command 'hide' removes declarations from
5987 class/type/const name spaces;
5989 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5990 indicate potential overloading;
5992 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5994 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5995 "{a,b,c}" instead of {a,b,c};
5997 * Isar/Pure now provides its own version of intro/elim/dest
5998 attributes; useful for building new logics, but beware of confusion
5999 with the version in Provers/classical;
6001 * Isar/Pure: the local context of (non-atomic) goals is provided via
6002 case name 'antecedent';
6004 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
6005 to the current context is now done automatically);
6007 * Isar/Pure: theory command 'method_setup' provides a simple interface
6008 for definining proof methods in ML;
6010 * Isar/Provers: intro/elim/dest attributes changed; renamed
6011 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
6012 most cases, one should have to change intro!! to intro? only);
6013 replaced "delrule" by "rule del";
6015 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
6016 'symmetric' attribute (the latter supercedes [RS sym]);
6018 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
6019 method modifier); 'simp' method: 'only:' modifier removes loopers as
6020 well (including splits);
6022 * Isar/Provers: Simplifier and Classical methods now support all kind
6023 of modifiers used in the past, including 'cong', 'iff', etc.
6025 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6026 of Simplifier and Classical reasoner);
6028 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6029 now support named cases; major packages (inductive, datatype, primrec,
6030 recdef) support case names and properly name parameters;
6032 * Isar/HOL: new transitivity rules for substitution in inequalities --
6033 monotonicity conditions are extracted to be proven at end of
6036 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6039 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6040 split_if split_if_asm; datatype package provides theorems foo.splits =
6041 foo.split foo.split_asm for each datatype;
6043 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6044 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6045 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6046 use "(cases (simplified))" method in proper proof texts);
6048 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6050 * Isar: names of theorems etc. may be natural numbers as well;
6052 * Isar: 'pr' command: optional arguments for goals_limit and
6053 ProofContext.prems_limit; no longer prints theory contexts, but only
6056 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6057 additional print modes to be specified; e.g. "pr(latex)" will print
6058 proof state according to the Isabelle LaTeX style;
6060 * Isar: improved support for emulating tactic scripts, including proof
6061 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6062 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6063 (for HOL datatypes);
6065 * Isar: simplified (more robust) goal selection of proof methods: 1st
6066 goal, all goals, or explicit goal specifier (tactic emulation); thus
6067 'proof method scripts' have to be in depth-first order;
6069 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6071 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6072 should instead use individual commands for printing items
6073 (print_commands, print_methods etc.);
6075 * Isar: added 'nothing' --- the empty list of theorems;
6080 * HOL/MicroJava: formalization of a fragment of Java, together with a
6081 corresponding virtual machine and a specification of its bytecode
6082 verifier and a lightweight bytecode verifier, including proofs of
6083 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6084 Cornelia Pusch (see also the homepage of project Bali at
6085 http://isabelle.in.tum.de/Bali/);
6087 * HOL/Algebra: new theory of rings and univariate polynomials, by
6090 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6091 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6094 * HOL/Lattice: fundamental concepts of lattice theory and order
6095 structures, including duals, properties of bounds versus algebraic
6096 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6097 Theorem for complete lattices etc.; may also serve as a demonstration
6098 for abstract algebraic reasoning using axiomatic type classes, and
6099 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6101 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6104 * HOL/IMPP: extension of IMP with local variables and mutually
6105 recursive procedures, by David von Oheimb;
6107 * HOL/Lambda: converted into new-style theory and document;
6109 * HOL/ex/Multiquote: example of multiple nested quotations and
6110 anti-quotations -- basically a generalized version of de-Bruijn
6111 representation; very useful in avoiding lifting of operations;
6113 * HOL/record: added general record equality rule to simpset; fixed
6114 select-update simplification procedure to handle extended records as
6115 well; admit "r" as field name;
6117 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6118 other numeric types and also as the identity of groups, rings, etc.;
6120 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6121 Types nat and int belong to this axclass;
6123 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6124 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6125 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6126 two terms #m*u and #n*u are replaced by #(m+n)*u
6127 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6128 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6129 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6131 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6132 powerful prover for predicate logic but knows nothing of clasets; see
6133 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6135 * HOL: new version of "case_tac" subsumes both boolean case split and
6136 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6137 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6139 * HOL: simplification no longer dives into case-expressions: only the
6140 selector expression is simplified, but not the remaining arms; to
6141 enable full simplification of case-expressions for datatype t, you may
6142 remove t.weak_case_cong from the simpset, either globally (Delcongs
6143 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6145 * HOL/recdef: the recursion equations generated by 'recdef' for
6146 function 'f' are now called f.simps instead of f.rules; if all
6147 termination conditions are proved automatically, these simplification
6148 rules are added to the simpset, as in primrec; rules may be named
6149 individually as well, resulting in a separate list of theorems for
6152 * HOL/While is a new theory that provides a while-combinator. It
6153 permits the definition of tail-recursive functions without the
6154 provision of a termination measure. The latter is necessary once the
6155 invariant proof rule for while is applied.
6157 * HOL: new (overloaded) notation for the set of elements below/above
6158 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6160 * HOL: theorems impI, allI, ballI bound as "strip";
6162 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6163 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6164 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6166 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6168 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6169 main HOL, but was unused);
6171 * HOL: fewer consts declared as global (e.g. have to refer to
6172 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6174 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6175 in case of overlap with user translations (e.g. judgements over
6176 tuples); (note that the underlying logical represenation is still
6182 * ZF: simplification automatically cancels common terms in arithmetic
6183 expressions over nat and int;
6185 * ZF: new treatment of nat to minimize type-checking: all operators
6186 coerce their operands to a natural number using the function natify,
6187 making the algebraic laws unconditional;
6189 * ZF: as above, for int: operators coerce their operands to an integer
6190 using the function intify;
6192 * ZF: the integer library now contains many of the usual laws for the
6193 orderings, including $<=, and monotonicity laws for $+ and $*;
6195 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6198 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6199 to the simplifier and classical reasoner simultaneously;
6204 * Provers: blast_tac now handles actual object-logic rules as
6205 assumptions; note that auto_tac uses blast_tac internally as well;
6207 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6208 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6210 * Provers: delrules now handles destruct rules as well (no longer need
6211 explicit make_elim);
6213 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6214 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6215 use instead the strong form,
6216 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6217 in HOL, FOL and ZF the function cla_make_elim will create such rules
6218 from destruct-rules;
6220 * Provers: Simplifier.easy_setup provides a fast path to basic
6221 Simplifier setup for new object-logics;
6223 * Pure: AST translation rules no longer require constant head on LHS;
6225 * Pure: improved name spaces: ambiguous output is qualified; support
6226 for hiding of names;
6228 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6229 XSYMBOL_HOME; no longer need to do manual configuration in most
6232 * system: compression of ML heaps images may now be controlled via -c
6233 option of isabelle and isatool usedir (currently only observed by
6236 * system: isatool installfonts may handle X-Symbol fonts as well (very
6237 useful for remote X11);
6239 * system: provide TAGS file for Isabelle sources;
6241 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6244 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6245 timing flag supersedes proof_timing and Toplevel.trace;
6247 * ML: new combinators |>> and |>>> for incremental transformations
6248 with secondary results (e.g. certain theory extensions):
6250 * ML: PureThy.add_defs gets additional argument to indicate potential
6251 overloading (usually false);
6253 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6258 New in Isabelle99 (October 1999)
6259 --------------------------------
6261 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6263 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6264 are no longer simplified. (This allows the simplifier to unfold recursive
6265 functional programs.) To restore the old behaviour, declare
6267 Delcongs [if_weak_cong];
6269 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6272 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6274 * HOL/datatype: mutual_induct_tac no longer exists --
6275 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6277 * HOL/typedef: fixed type inference for representing set; type
6278 arguments now have to occur explicitly on the rhs as type constraints;
6280 * ZF: The con_defs part of an inductive definition may no longer refer
6281 to constants declared in the same theory;
6283 * HOL, ZF: the function mk_cases, generated by the inductive
6284 definition package, has lost an argument. To simplify its result, it
6285 uses the default simpset instead of a supplied list of theorems.
6287 * HOL/List: the constructors of type list are now Nil and Cons;
6289 * Simplifier: the type of the infix ML functions
6290 setSSolver addSSolver setSolver addSolver
6291 is now simpset * solver -> simpset where `solver' is a new abstract type
6292 for packaging solvers. A solver is created via
6293 mk_solver: string -> (thm list -> int -> tactic) -> solver
6294 where the string argument is only a comment.
6299 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6300 decision procedure for linear arithmetic. Currently it is used for
6301 types `nat', `int', and `real' in HOL (see below); it can, should and
6302 will be instantiated for other types and logics as well.
6304 * The simplifier now accepts rewrite rules with flexible heads, eg
6305 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6306 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6312 * New Isabelle/Isar subsystem provides an alternative to traditional
6313 tactical theorem proving; together with the ProofGeneral/isar user
6314 interface it offers an interactive environment for developing human
6315 readable proof documents (Isar == Intelligible semi-automated
6316 reasoning); for further information see isatool doc isar-ref,
6317 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6319 * improved and simplified presentation of theories: better HTML markup
6320 (including colors), graph views in several sizes; isatool usedir now
6321 provides a proper interface for user theories (via -P option); actual
6322 document preparation based on (PDF)LaTeX is available as well (for
6323 new-style theories only); see isatool doc system for more information;
6325 * native support for Proof General, both for classic Isabelle and
6328 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6329 using the graph browser tool;
6331 * Isabelle manuals now also available as PDF;
6333 * theory loader rewritten from scratch (may not be fully
6334 bug-compatible); old loadpath variable has been replaced by show_path,
6335 add_path, del_path, reset_path functions; new operations such as
6336 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6339 * improved isatool install: option -k creates KDE application icon,
6340 option -p DIR installs standalone binaries;
6342 * added ML_PLATFORM setting (useful for cross-platform installations);
6343 more robust handling of platform specific ML images for SML/NJ;
6345 * the settings environment is now statically scoped, i.e. it is never
6346 created again in sub-processes invoked from isabelle, isatool, or
6349 * path element specification '~~' refers to '$ISABELLE_HOME';
6351 * in locales, the "assumes" and "defines" parts may be omitted if
6354 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6357 * new print_mode "HTML";
6359 * new flag show_tags controls display of tags of theorems (which are
6360 basically just comments that may be attached by some tools);
6362 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6363 mode and goal output format:
6365 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6367 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6369 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6370 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6372 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6374 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6376 * function bind_thms stores lists of theorems (cf. bind_thm);
6378 * new shorthand tactics ftac, eatac, datac, fatac;
6380 * qed (and friends) now accept "" as result name; in that case the
6381 theorem is not stored, but proper checks and presentation of the
6384 * theorem database now also indexes constants "Trueprop", "all",
6385 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6390 ** HOL arithmetic **
6392 * There are now decision procedures for linear arithmetic over nat and
6395 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6396 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6397 are treated as atomic; subformulae not involving type `nat' or `int'
6398 are ignored; quantified subformulae are ignored unless they are
6399 positive universal or negative existential. The tactic has to be
6400 invoked by hand and can be a little bit slow. In particular, the
6401 running time is exponential in the number of occurrences of `min' and
6402 `max', and `-' on `nat'.
6404 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6405 (negated) (in)equalities among the premises and the conclusion into
6406 account (i.e. no compound formulae) and does not know about `min' and
6407 `max', and `-' on `nat'. It is fast and is used automatically by the
6410 NB: At the moment, these decision procedures do not cope with mixed
6411 nat/int formulae where the two parts interact, such as `m < n ==>
6414 * HOL/Numeral provides a generic theory of numerals (encoded
6415 efficiently as bit strings); setup for types nat/int/real is in place;
6416 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6417 int, existing theories and proof scripts may require a few additional
6420 * integer division and remainder can now be performed on constant
6423 * many properties of integer multiplication, division and remainder
6426 * An interface to the Stanford Validity Checker (SVC) is available through the
6427 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6428 are proved automatically. SVC must be installed separately, and its results
6429 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6430 invocation of the underlying oracle). For SVC see
6431 http://verify.stanford.edu/SVC
6433 * IsaMakefile: the HOL-Real target now builds an actual image;
6438 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6439 (in Isabelle/Isar) -- by Gertrud Bauer;
6441 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6442 analysis for assembly languages with subtypes;
6444 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6445 -- avoids syntactic ambiguities and treats state, transition, and
6446 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6447 changed syntax and (many) tactics;
6449 * HOL/inductive: Now also handles more general introduction rules such
6450 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6451 theorems are now maintained within the theory (maintained via the
6454 * HOL/datatype: Now also handles arbitrarily branching datatypes
6455 (using function types) such as
6457 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6459 * HOL/record: record_simproc (part of the default simpset) takes care
6460 of selectors applied to updated records; record_split_tac is no longer
6461 part of the default claset; update_defs may now be removed from the
6462 simpset in many cases; COMPATIBILITY: old behavior achieved by
6464 claset_ref () := claset() addSWrapper record_split_wrapper;
6465 Delsimprocs [record_simproc]
6467 * HOL/typedef: fixed type inference for representing set; type
6468 arguments now have to occur explicitly on the rhs as type constraints;
6470 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6471 names rather than an ML expression;
6473 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6474 supplied later. Program schemes can be defined, such as
6475 "While B C s = (if B s then While B C (C s) else s)"
6476 where the well-founded relation can be chosen after B and C have been given.
6478 * HOL/List: the constructors of type list are now Nil and Cons;
6479 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6480 course, ML tools referring to List.list.op # etc. have to be adapted;
6482 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6483 disabled by default; run isabelle with option -m HOL to get back to
6484 the original Gordon/HOL-style output;
6486 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6487 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6489 * HOL basic syntax simplified (more orthogonal): all variants of
6490 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6491 Eps operator is provided as well: "SOME x. P[x]";
6493 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6495 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6496 thus available for user theories;
6498 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6499 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6502 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6503 several times and then mp;
6508 * the notation <<...>> is now available as a notation for sequences of
6511 * the simplifier is now installed
6513 * the axiom system has been generalized (thanks to Soren Heilmann)
6515 * the classical reasoner now has a default rule database
6520 * new primrec section allows primitive recursive functions to be given
6521 directly (as in HOL) over datatypes and the natural numbers;
6523 * new tactics induct_tac and exhaust_tac for induction (or case
6524 analysis) over datatypes and the natural numbers;
6526 * the datatype declaration of type T now defines the recursor T_rec;
6528 * simplification automatically does freeness reasoning for datatype
6531 * automatic type-inference, with AddTCs command to insert new
6532 type-checking rules;
6534 * datatype introduction rules are now added as Safe Introduction rules
6537 * the syntax "if P then x else y" is now available in addition to
6541 *** Internal programming interfaces ***
6543 * tuned simplifier trace output; new flag debug_simp;
6545 * structures Vartab / Termtab (instances of TableFun) offer efficient
6546 tables indexed by indexname_ord / term_ord (compatible with aconv);
6548 * AxClass.axclass_tac lost the theory argument;
6550 * tuned current_goals_markers semantics: begin / end goal avoids
6551 printing empty lines;
6553 * removed prs and prs_fn hook, which was broken because it did not
6554 include \n in its semantics, forcing writeln to add one
6555 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6556 string -> unit if you really want to output text without newline;
6558 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6559 plain output, interface builders may have to enable 'isabelle_font'
6560 mode to get Isabelle font glyphs as before;
6562 * refined token_translation interface; INCOMPATIBILITY: output length
6563 now of type real instead of int;
6565 * theory loader actions may be traced via new ThyInfo.add_hook
6566 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6567 your own database of information attached to *whole* theories -- as
6568 opposed to intra-theory data slots offered via TheoryDataFun;
6570 * proper handling of dangling sort hypotheses (at last!);
6571 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6572 extra sort hypotheses that can be witnessed from the type signature;
6573 the force_strip_shyps flag is gone, any remaining shyps are simply
6574 left in the theorem (with a warning issued by strip_shyps_warning);
6578 New in Isabelle98-1 (October 1998)
6579 ----------------------------------
6581 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6583 * several changes of automated proof tools;
6585 * HOL: major changes to the inductive and datatype packages, including
6586 some minor incompatibilities of theory syntax;
6588 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6591 * HOL: removed duplicate thms in Arith:
6592 less_imp_add_less should be replaced by trans_less_add1
6593 le_imp_add_le should be replaced by trans_le_add1
6595 * HOL: unary minus is now overloaded (new type constraints may be
6598 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6599 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6600 now taken as an integer constant.
6602 * Pure: ML function 'theory_of' renamed to 'theory';
6608 1. Asm_full_simp_tac is now more aggressive.
6609 1. It will sometimes reorient premises if that increases their power to
6611 2. It does no longer proceed strictly from left to right but may also
6612 rotate premises to achieve further simplification.
6613 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6614 old Asm_full_simp_tac in that it does not rotate premises.
6615 2. The simplifier now knows a little bit about nat-arithmetic.
6617 * Classical reasoner: wrapper mechanism for the classical reasoner now
6618 allows for selected deletion of wrappers, by introduction of names for
6619 wrapper functionals. This implies that addbefore, addSbefore,
6620 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6621 and that adding two tactics with the same name overwrites the first
6622 one (emitting a warning).
6623 type wrapper = (int -> tactic) -> (int -> tactic)
6624 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6625 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6626 delWrapper, delSWrapper: claset * string -> claset
6627 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6629 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6630 semantics; addbefore now affects only the unsafe part of step_tac
6631 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6632 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6635 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6636 compWrapper; added safe wrapper (and access functions for it);
6638 * HOL/split_all_tac is now much faster and fails if there is nothing
6639 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6640 and the names of the automatically generated variables have changed.
6641 split_all_tac has moved within claset() from unsafe wrappers to safe
6642 wrappers, which means that !!-bound variables are split much more
6643 aggressively, and safe_tac and clarify_tac now split such variables.
6644 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6645 Note: the same holds for record_split_tac, which does the job of
6646 split_all_tac for record fields.
6648 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6649 permanently to the default simpset using Addsplits just like
6650 Addsimps. They can be removed via Delsplits just like
6651 Delsimps. Lower-case versions are also available.
6653 * HOL/Simplifier: The rule split_if is now part of the default
6654 simpset. This means that the simplifier will eliminate all occurrences
6655 of if-then-else in the conclusion of a goal. To prevent this, you can
6656 either remove split_if completely from the default simpset by
6657 `Delsplits [split_if]' or remove it in a specific call of the
6658 simplifier using `... delsplits [split_if]'. You can also add/delete
6659 other case splitting rules to/from the default simpset: every datatype
6660 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6661 t is the name of the datatype).
6663 * Classical reasoner / Simplifier combination: new force_tac (and
6664 derivatives Force_tac, force) combines rewriting and classical
6665 reasoning (and whatever other tools) similarly to auto_tac, but is
6666 aimed to solve the given subgoal completely.
6671 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6672 and `goalw': the theory is no longer needed as an explicit argument -
6673 the current theory context is used; assumptions are no longer returned
6674 at the ML-level unless one of them starts with ==> or !!; it is
6675 recommended to convert to these new commands using isatool fixgoal
6676 (backup your sources first!);
6678 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6679 the current theory context, and 'theory' to lookup stored theories;
6681 * new theory section 'locale' for declaring constants, assumptions and
6682 definitions that have local scope;
6684 * new theory section 'nonterminals' for purely syntactic types;
6686 * new theory section 'setup' for generic ML setup functions
6687 (e.g. package initialization);
6689 * the distribution now includes Isabelle icons: see
6690 lib/logo/isabelle-{small,tiny}.xpm;
6692 * isatool install - install binaries with absolute references to
6695 * isatool logo -- create instances of the Isabelle logo (as EPS);
6697 * print mode 'emacs' reserved for Isamode;
6699 * support multiple print (ast) translations per constant name;
6701 * theorems involving oracles are now printed with a suffixed [!];
6706 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6708 * HOL/inductive package reorganized and improved: now supports mutual
6714 oddI "n : EVEN ==> Suc n : ODD"
6715 evenI "n : ODD ==> Suc n : EVEN"
6717 new theorem list "elims" contains an elimination rule for each of the
6718 recursive sets; inductive definitions now handle disjunctive premises
6719 correctly (also ZF);
6721 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6722 "mutual_induct" no longer exists - the induction rule is always
6723 contained in "induct";
6726 * HOL/datatype package re-implemented and greatly improved: now
6727 supports mutually recursive datatypes such as
6730 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6731 | SUM ('a aexp) ('a aexp)
6732 | DIFF ('a aexp) ('a aexp)
6735 'a bexp = LESS ('a aexp) ('a aexp)
6736 | AND ('a bexp) ('a bexp)
6737 | OR ('a bexp) ('a bexp)
6739 as well as indirectly recursive datatypes such as
6742 ('a, 'b) term = Var 'a
6743 | App 'b ((('a, 'b) term) list)
6745 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6746 induction on mutually / indirectly recursive datatypes.
6748 Primrec equations are now stored in theory and can be accessed via
6749 <function_name>.simps.
6753 - Theories using datatypes must now have theory Datatype as an
6755 - The specific <typename>.induct_tac no longer exists - use the
6756 generic induct_tac instead.
6757 - natE has been renamed to nat.exhaust - use exhaust_tac
6758 instead of res_inst_tac ... natE. Note that the variable
6759 names in nat.exhaust differ from the names in natE, this
6760 may cause some "fragile" proofs to fail.
6761 - The theorems split_<typename>_case and split_<typename>_case_asm
6762 have been renamed to <typename>.split and <typename>.split_asm.
6763 - Since default sorts of type variables are now handled correctly,
6764 some datatype definitions may have to be annotated with explicit
6766 - Primrec definitions no longer require function name and type
6767 of recursive argument.
6769 Consider using isatool fixdatatype to adapt your theories and proof
6770 scripts to the new package (backup your sources first!).
6773 * HOL/record package: considerably improved implementation; now
6774 includes concrete syntax for record types, terms, updates; theorems
6775 for surjective pairing and splitting !!-bound record variables; proof
6776 support is as follows:
6778 1) standard conversions (selectors or updates applied to record
6779 constructor terms) are part of the standard simpset;
6781 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6782 made part of standard simpset and claset via addIffs;
6784 3) a tactic for record field splitting (record_split_tac) is part of
6785 the standard claset (addSWrapper);
6787 To get a better idea about these rules you may retrieve them via
6788 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6789 the name of your record type.
6791 The split tactic 3) conceptually simplifies by the following rule:
6793 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6795 Thus any record variable that is bound by meta-all will automatically
6796 blow up into some record constructor term, consequently the
6797 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6798 solve record problems automatically.
6801 * reorganized the main HOL image: HOL/Integ and String loaded by
6802 default; theory Main includes everything;
6804 * automatic simplification of integer sums and comparisons, using cancellation;
6806 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6808 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6810 * many new identities for unions, intersections, set difference, etc.;
6812 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6813 called split_if, split_split, split_sum_case and split_nat_case (to go
6814 with add/delsplits);
6816 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6817 (?x::unit) = (); this is made part of the default simpset, which COULD
6818 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6819 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6820 unit_abs_eta_conv is added in order to counter the effect of
6821 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6824 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6827 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6828 It and 'sym RS equals0D' are now in the default claset, giving automatic
6829 disjointness reasoning but breaking a few old proofs.
6831 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6832 to 'converse' from 'inverse' (for compatibility with ZF and some
6835 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6836 the well-founded relation;
6838 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6839 Compl A. The "Compl" syntax remains available as input syntax for this
6842 * HOL/Update: new theory of function updates:
6843 f(a:=b) == %x. if x=a then b else f x
6844 may also be iterated as in f(a:=b,c:=d,...);
6846 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6849 - new function list_update written xs[i:=v] that updates the i-th
6850 list position. May also be iterated as in xs[i:=a,j:=b,...].
6851 - new function `upt' written [i..j(] which generates the list
6852 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6853 bound write [i..j], which is a shorthand for [i..j+1(].
6854 - new lexicographic orderings and corresponding wellfoundedness theorems.
6857 - removed 'pred' (predecessor) function;
6858 - generalized some theorems about n-1;
6859 - many new laws about "div" and "mod";
6860 - new laws about greatest common divisors (see theory ex/Primes);
6862 * HOL/Relation: renamed the relational operator r^-1 "converse"
6863 instead of "inverse";
6865 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6866 of the multiset ordering;
6868 * directory HOL/Real: a construction of the reals using Dedekind cuts
6869 (not included by default);
6871 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6873 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6874 programs, i.e. different program variables may have different types.
6876 * calling (stac rew i) now fails if "rew" has no effect on the goal
6877 [previously, this check worked only if the rewrite rule was unconditional]
6878 Now rew can involve either definitions or equalities (either == or =).
6883 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6884 only the theorems proved on ZF.ML;
6886 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6887 It and 'sym RS equals0D' are now in the default claset, giving automatic
6888 disjointness reasoning but breaking a few old proofs.
6890 * ZF/Update: new theory of function updates
6891 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6892 may also be iterated as in f(a:=b,c:=d,...);
6894 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6896 * calling (stac rew i) now fails if "rew" has no effect on the goal
6897 [previously, this check worked only if the rewrite rule was unconditional]
6898 Now rew can involve either definitions or equalities (either == or =).
6900 * case_tac provided for compatibility with HOL
6901 (like the old excluded_middle_tac, but with subgoals swapped)
6904 *** Internal programming interfaces ***
6906 * Pure: several new basic modules made available for general use, see
6907 also src/Pure/README;
6909 * improved the theory data mechanism to support encapsulation (data
6910 kind name replaced by private Object.kind, acting as authorization
6911 key); new type-safe user interface via functor TheoryDataFun; generic
6912 print_data function becomes basically useless;
6914 * removed global_names compatibility flag -- all theory declarations
6915 are qualified by default;
6917 * module Pure/Syntax now offers quote / antiquote translation
6918 functions (useful for Hoare logic etc. with implicit dependencies);
6919 see HOL/ex/Antiquote for an example use;
6921 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6924 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6927 * Display.print_goals function moved to Locale.print_goals;
6929 * standard print function for goals supports current_goals_markers
6930 variable for marking begin of proof, end of proof, start of goal; the
6931 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6932 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6937 New in Isabelle98 (January 1998)
6938 --------------------------------
6940 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6942 * changed lexical syntax of terms / types: dots made part of long
6943 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6945 * simpset (and claset) reference variable replaced by functions
6946 simpset / simpset_ref;
6948 * no longer supports theory aliases (via merge) and non-trivial
6949 implicit merge of thms' signatures;
6951 * most internal names of constants changed due to qualified names;
6953 * changed Pure/Sequence interface (see Pure/seq.ML);
6956 *** General Changes ***
6958 * hierachically structured name spaces (for consts, types, axms, thms
6959 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6960 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6961 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6962 long_names for fully qualified output names; NOTE: ML programs
6963 (special tactics, packages etc.) referring to internal names may have
6964 to be adapted to cope with fully qualified names; in case of severe
6965 backward campatibility problems try setting 'global_names' at compile
6966 time to have enrything declared within a flat name space; one may also
6967 fine tune name declarations in theories via the 'global' and 'local'
6970 * reimplemented the implicit simpset and claset using the new anytype
6971 data filed in signatures; references simpset:simpset ref etc. are
6972 replaced by functions simpset:unit->simpset and
6973 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6974 to patch your ML files accordingly;
6976 * HTML output now includes theory graph data for display with Java
6977 applet or isatool browser; data generated automatically via isatool
6978 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6980 * defs may now be conditional; improved rewrite_goals_tac to handle
6981 conditional equations;
6983 * defs now admits additional type arguments, using TYPE('a) syntax;
6985 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6986 creates a new theory node; implicit merge of thms' signatures is
6987 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6988 transfer:theory->thm->thm in (rare) cases;
6990 * improved handling of draft signatures / theories; draft thms (and
6991 ctyps, cterms) are automatically promoted to real ones;
6993 * slightly changed interfaces for oracles: admit many per theory, named
6994 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6996 * print_goals: optional output of const types (set show_consts and
6999 * improved output of warnings (###) and errors (***);
7001 * subgoal_tac displays a warning if the new subgoal has type variables;
7003 * removed old README and Makefiles;
7005 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
7007 * removed obsolete init_pps and init_database;
7009 * deleted the obsolete tactical STATE, which was declared by
7010 fun STATE tacfun st = tacfun st st;
7012 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
7013 (which abbreviates $HOME);
7015 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
7016 use isatool fixseq to adapt your ML programs (this works for fully
7017 qualified references to the Sequence structure only!);
7019 * use_thy no longer requires writable current directory; it always
7020 reloads .ML *and* .thy file, if either one is out of date;
7023 *** Classical Reasoner ***
7025 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7026 tactics that use classical reasoning to simplify a subgoal without
7027 splitting it into several subgoals;
7029 * Safe_tac: like safe_tac but uses the default claset;
7034 * added simplification meta rules:
7035 (asm_)(full_)simplify: simpset -> thm -> thm;
7037 * simplifier.ML no longer part of Pure -- has to be loaded by object
7040 * added prems argument to simplification procedures;
7042 * HOL, FOL, ZF: added infix function `addsplits':
7043 instead of `<simpset> setloop (split_tac <thms>)'
7044 you can simply write `<simpset> addsplits <thms>'
7049 * TYPE('a) syntax for type reflection terms;
7051 * no longer handles consts with name "" -- declare as 'syntax' instead;
7053 * pretty printer: changed order of mixfix annotation preference (again!);
7055 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7060 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7061 with `addloop' of the simplifier to faciliate case splitting in premises.
7063 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7065 * HOL/Auth: new protocol proofs including some for the Internet
7068 * HOL/Map: new theory of `maps' a la VDM;
7070 * HOL/simplifier: simplification procedures nat_cancel_sums for
7071 cancelling out common nat summands from =, <, <= (in)equalities, or
7072 differences; simplification procedures nat_cancel_factor for
7073 cancelling common factor from =, <, <= (in)equalities over natural
7074 sums; nat_cancel contains both kinds of procedures, it is installed by
7075 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7077 * HOL/simplifier: terms of the form
7078 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7080 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7081 and those of the form
7082 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7084 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7087 Each datatype `t' now comes with a theorem `split_t_case' of the form
7089 P(t_case f1 ... fn x) =
7090 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7092 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7095 and a theorem `split_t_case_asm' of the form
7097 P(t_case f1 ... fn x) =
7098 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7100 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7102 which can be added to a simpset via `addsplits'. The existing theorems
7103 expand_list_case and expand_option_case have been renamed to
7104 split_list_case and split_option_case.
7107 - `pred n' is automatically converted to `n-1'.
7108 Users are strongly encouraged not to use `pred' any longer,
7109 because it will disappear altogether at some point.
7110 - Users are strongly encouraged to write "0 < n" rather than
7111 "n ~= 0". Theorems and proof tools have been modified towards this
7115 the function "set_of_list" has been renamed "set" (and its theorems too);
7116 the function "nth" now takes its arguments in the reverse order and
7117 has acquired the infix notation "!" as in "xs!n".
7119 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7121 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7122 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7124 * HOL/record: extensible records with schematic structural subtyping
7125 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7126 still lacks various theorems and concrete record syntax;
7131 * removed "axioms" and "generated by" sections;
7133 * replaced "ops" section by extended "consts" section, which is capable of
7134 handling the continuous function space "->" directly;
7137 . proves theorems immediately and stores them in the theory,
7138 . creates hierachical name space,
7139 . now uses normal mixfix annotations (instead of cinfix...),
7140 . minor changes to some names and values (for consistency),
7141 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7142 . separator between mutual domain defs: changed "," to "and",
7143 . improved handling of sort constraints; now they have to
7144 appear on the left-hand side of the equations only;
7146 * fixed LAM <x,y,zs>.b syntax;
7148 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7149 adm (%x. P (t x)), where P is chainfinite and t continuous;
7154 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7155 with `addloop' of the simplifier to faciliate case splitting in premises.
7157 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7158 in HOL, they strip ALL and --> from proved theorems;
7162 New in Isabelle94-8 (May 1997)
7163 ------------------------------
7165 *** General Changes ***
7167 * new utilities to build / run / maintain Isabelle etc. (in parts
7168 still somewhat experimental); old Makefiles etc. still functional;
7170 * new 'Isabelle System Manual';
7172 * INSTALL text, together with ./configure and ./build scripts;
7174 * reimplemented type inference for greater efficiency, better error
7175 messages and clean internal interface;
7177 * prlim command for dealing with lots of subgoals (an easier way of
7178 setting goals_limit);
7183 * supports alternative (named) syntax tables (parser and pretty
7184 printer); internal interface is provided by add_modesyntax(_i);
7186 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7187 be used in conjunction with the Isabelle symbol font; uses the
7188 "symbols" syntax table;
7190 * added token_translation interface (may translate name tokens in
7191 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7192 the current print_mode); IMPORTANT: user print translation functions
7193 are responsible for marking newly introduced bounds
7194 (Syntax.mark_boundT);
7196 * token translations for modes "xterm" and "xterm_color" that display
7197 names in bold, underline etc. or colors (which requires a color
7200 * infixes may now be declared with names independent of their syntax;
7202 * added typed_print_translation (like print_translation, but may
7203 access type of constant);
7206 *** Classical Reasoner ***
7208 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7209 some limitations. Blast_tac...
7210 + ignores addss, addbefore, addafter; this restriction is intrinsic
7211 + ignores elimination rules that don't have the correct format
7212 (the conclusion MUST be a formula variable)
7213 + ignores types, which can make HOL proofs fail
7214 + rules must not require higher-order unification, e.g. apply_type in ZF
7215 [message "Function Var's argument not a bound variable" relates to this]
7216 + its proof strategy is more general but can actually be slower
7218 * substitution with equality assumptions no longer permutes other
7221 * minor changes in semantics of addafter (now called addaltern); renamed
7222 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7223 (and access functions for it);
7225 * improved combination of classical reasoner and simplifier:
7226 + functions for handling clasimpsets
7227 + improvement of addss: now the simplifier is called _after_ the
7229 + safe variant of addss called addSss: uses safe simplifications
7230 _during_ the safe steps. It is more complete as it allows multiple
7231 instantiations of unknowns (e.g. with slow_tac).
7235 * added interface for simplification procedures (functions that
7236 produce *proven* rewrite rules on the fly, depending on current
7239 * ordering on terms as parameter (used for ordered rewriting);
7241 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7243 * the solver is now split into a safe and an unsafe part.
7244 This should be invisible for the normal user, except that the
7245 functions setsolver and addsolver have been renamed to setSolver and
7246 addSolver; added safe_asm_full_simp_tac;
7251 * a generic induction tactic `induct_tac' which works for all datatypes and
7252 also for type `nat';
7254 * a generic case distinction tactic `exhaust_tac' which works for all
7255 datatypes and also for type `nat';
7257 * each datatype comes with a function `size';
7259 * patterns in case expressions allow tuple patterns as arguments to
7260 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7262 * primrec now also works with type nat;
7264 * recdef: a new declaration form, allows general recursive functions to be
7265 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7267 * the constant for negation has been renamed from "not" to "Not" to
7268 harmonize with FOL, ZF, LK, etc.;
7270 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7273 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7275 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7276 problems in commutative rings, using axiomatic type classes for + and *;
7278 * more examples in HOL/MiniML and HOL/Auth;
7280 * more default rewrite rules for quantifiers, union/intersection;
7282 * a new constant `arbitrary == @x.False';
7284 * HOLCF/IOA replaces old HOL/IOA;
7286 * HOLCF changes: derived all rules and arities
7287 + axiomatic type classes instead of classes
7288 + typedef instead of faking type definitions
7289 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7290 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7291 + eliminated the types void, one, tr
7292 + use unit lift and bool lift (with translations) instead of one and tr
7293 + eliminated blift from Lift3.thy (use Def instead of blift)
7294 all eliminated rules are derived as theorems --> no visible changes ;
7299 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7300 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7301 as ZF_cs addSIs [equalityI];
7305 New in Isabelle94-7 (November 96)
7306 ---------------------------------
7308 * allowing negative levels (as offsets) in prlev and choplev;
7310 * super-linear speedup for large simplifications;
7312 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7313 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7314 FAIL); can suppress it using the command Delsimps (ex_simps @
7315 all_simps); De Morgan laws are also now included, by default;
7317 * improved printing of ==> : ~:
7319 * new object-logic "Sequents" adds linear logic, while replacing LK
7320 and Modal (thanks to Sara Kalvala);
7322 * HOL/Auth: correctness proofs for authentication protocols;
7324 * HOL: new auto_tac combines rewriting and classical reasoning (many
7325 examples on HOL/Auth);
7327 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7328 the rewriter and classical reasoner simultaneously;
7330 * function uresult no longer returns theorems in "standard" format;
7331 regain previous version by: val uresult = standard o uresult;
7338 * oracles -- these establish an interface between Isabelle and trusted
7339 external reasoners, which may deliver results as theorems;
7341 * proof objects (in particular record all uses of oracles);
7343 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7345 * "constdefs" section in theory files;
7347 * "primrec" section (HOL) no longer requires names;
7349 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7356 * reduced space requirements;
7358 * automatic HTML generation from theories;
7360 * theory files no longer require "..." (quotes) around most types;
7362 * new examples, including two proofs of the Church-Rosser theorem;
7364 * non-curried (1994) version of HOL is no longer distributed;
7371 * greatly reduced space requirements;
7373 * theory files (.thy) no longer require \...\ escapes at line breaks;
7375 * searchable theorem database (see the section "Retrieving theorems" on
7376 page 8 of the Reference Manual);
7378 * new examples, including Grabczewski's monumental case study of the
7381 * The previous version of HOL renamed to Old_HOL;
7383 * The new version of HOL (previously called CHOL) uses a curried syntax
7384 for functions. Application looks like f a b instead of f(a,b);
7386 * Mutually recursive inductive definitions finally work in HOL;
7388 * In ZF, pattern-matching on tuples is now available in all abstractions and
7389 translates to the operator "split";
7396 * new infix operator, addss, allowing the classical reasoner to
7397 perform simplification at each step of its search. Example:
7398 fast_tac (cs addss ss)
7400 * a new logic, CHOL, the same as HOL, but with a curried syntax
7401 for functions. Application looks like f a b instead of f(a,b). Also pairs
7402 look like (a,b) instead of <a,b>;
7404 * PLEASE NOTE: CHOL will eventually replace HOL!
7406 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7407 It translates to the operator "split". A new theory of integers is available;
7409 * In ZF, integer numerals now denote two's-complement binary integers.
7410 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7412 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7413 of the Axiom of Choice;
7420 * Significantly faster resolution;
7422 * the different sections in a .thy file can now be mixed and repeated
7425 * Database of theorems for FOL, HOL and ZF. New
7426 commands including qed, qed_goal and bind_thm store theorems in the database.
7428 * Simple database queries: return a named theorem (get_thm) or all theorems of
7429 a given theory (thms_of), or find out what theory a theorem was proved in
7432 * Bugs fixed in the inductive definition and datatype packages;
7434 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7435 and HOL_dup_cs obsolete;
7437 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7440 * Simpler definition of function space in ZF;
7442 * new results about cardinal and ordinal arithmetic in ZF;
7444 * 'subtype' facility in HOL for introducing new types as subsets of existing
7447 :mode=text:wrap=hard:maxLineLen=72: