Documentation of 'interpret' updated.
1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Explicit treatment of UTF8 sequences as Isabelle symbols, such that
10 a Unicode character is treated as a single symbol, not a sequence of
11 non-ASCII bytes as before. Since Isabelle/ML string literals may
12 contain symbols without further backslash escapes, Unicode can now be
13 used here as well. Recall that Symbol.explode in ML provides a
14 consistent view on symbols, while raw explode (or String.explode)
15 merely give a byte-oriented representation.
17 * Special treatment of ML file names has been discontinued.
18 Historically, optional extensions .ML or .sml were added on demand --
19 at the cost of clarity of file dependencies. Recall that Isabelle/ML
20 files exclusively use the .ML extension. Minor INCOMPATIBILTY.
25 * Interpretation command 'interpret' accepts a list of equations like
26 'interpretation' does.
28 * Diagnostic command 'print_interps' prints interpretations in proofs
29 in addition to interpretations in theories.
34 * code generator: export_code without explicit file declaration prints
35 to standard output. INCOMPATIBILITY.
37 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
38 respectively. INCOMPATIBILITY.
40 * Constant "split" has been merged with constant "prod_case"; names
41 of ML functions, facts etc. involving split have been retained so far,
42 though. INCOMPATIBILITY.
44 * Dropped old infix syntax "mem" for List.member; use "in set"
45 instead. INCOMPATIBILITY.
47 * Refactoring of code-generation specific operations in List.thy
54 null_empty ~> null_def
56 INCOMPATIBILITY. Note that these were not suppossed to be used
57 regularly unless for striking reasons; their main purpose was code
60 * Some previously unqualified names have been qualified:
69 Pair ~> Product_Type.Pair
70 fst ~> Product_Type.fst
71 snd ~> Product_Type.snd
72 curry ~> Product_Type.curry
74 Collect ~> Set.Collect
78 * Removed simplifier congruence rule of "prod_case", as has for long
79 been the case with "split".
81 * Datatype package: theorems generated for executable equality
82 (class eq) carry proper names and are treated as default code
85 * List.thy: use various operations from the Haskell prelude when
86 generating Haskell code.
88 * code_simp.ML: simplification with rules determined by
91 * code generator: do not print function definitions for case
92 combinators any longer.
94 * Multivariate Analysis: Introduced a type class for euclidean space. Most
95 theorems are now stated in terms of euclidean spaces instead of finite
99 real ^ 'n ~> 'a::real_vector
100 ~> 'a::euclidean_space
101 ~> 'a::ordered_euclidean_space
102 (depends on your needs)
106 \<chi> x. _ ~> \<chi>\<chi> x. _
109 Also note that the indices are now natural numbers and not from some finite
110 type. Finite cartesian products of euclidean spaces, products of euclidean
111 spaces the real and complex numbers are instantiated to be euclidean_spaces.
115 * Inductive package: offers new command "inductive_simps" to automatically
116 derive instantiated and simplified equations for inductive predicates,
117 similar to inductive_cases.
122 * ML antiquotations @{theory} and @{theory_ref} refer to named
123 theories from the ancestry of the current context, not any accidental
124 theory loader state as before. Potential INCOMPATIBILITY, subtle
129 New in Isabelle2009-2 (June 2010)
130 ---------------------------------
134 * Authentic syntax for *all* logical entities (type classes, type
135 constructors, term constants): provides simple and robust
136 correspondence between formal entities and concrete syntax. Within
137 the parse tree / AST representations, "constants" are decorated by
138 their category (class, type, const) and spelled out explicitly with
139 their full internal name.
141 Substantial INCOMPATIBILITY concerning low-level syntax declarations
142 and translations (translation rules and translation functions in ML).
143 Some hints on upgrading:
145 - Many existing uses of 'syntax' and 'translations' can be replaced
146 by more modern 'type_notation', 'notation' and 'abbreviation',
147 which are independent of this issue.
149 - 'translations' require markup within the AST; the term syntax
150 provides the following special forms:
152 CONST c -- produces syntax version of constant c from context
153 XCONST c -- literally c, checked as constant from context
154 c -- literally c, if declared by 'syntax'
156 Plain identifiers are treated as AST variables -- occasionally the
157 system indicates accidental variables via the error "rhs contains
160 Type classes and type constructors are marked according to their
161 concrete syntax. Some old translations rules need to be written
162 for the "type" category, using type constructor application
163 instead of pseudo-term application of the default category
166 - 'parse_translation' etc. in ML may use the following
169 @{class_syntax c} -- type class c within parse tree / AST
170 @{term_syntax c} -- type constructor c within parse tree / AST
171 @{const_syntax c} -- ML version of "CONST c" above
172 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
174 - Literal types within 'typed_print_translations', i.e. those *not*
175 represented as pseudo-terms are represented verbatim. Use @{class
176 c} or @{type_name c} here instead of the above syntax
179 Note that old non-authentic syntax was based on unqualified base
180 names, so all of the above "constant" names would coincide. Recall
181 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
182 diagnose syntax problems.
184 * Type constructors admit general mixfix syntax, not just infix.
186 * Concrete syntax may be attached to local entities without a proof
187 body, too. This works via regular mixfix annotations for 'fix',
188 'def', 'obtain' etc. or via the explicit 'write' command, which is
189 similar to the 'notation' command in theory specifications.
191 * Discontinued unnamed infix syntax (legacy feature for many years) --
192 need to specify constant name and syntax separately. Internal ML
193 datatype constructors have been renamed from InfixName to Infix etc.
194 Minor INCOMPATIBILITY.
196 * Schematic theorem statements need to be explicitly markup as such,
197 via commands 'schematic_lemma', 'schematic_theorem',
198 'schematic_corollary'. Thus the relevance of the proof is made
199 syntactically clear, which impacts performance in a parallel or
200 asynchronous interactive environment. Minor INCOMPATIBILITY.
202 * Use of cumulative prems via "!" in some proof methods has been
203 discontinued (old legacy feature).
205 * References 'trace_simp' and 'debug_simp' have been replaced by
206 configuration options stored in the context. Enabling tracing (the
207 case of debugging is similar) in proofs works via
209 using [[trace_simp = true]]
211 Tracing is then active for all invocations of the simplifier in
212 subsequent goal refinement steps. Tracing may also still be enabled or
213 disabled via the ProofGeneral settings menu.
215 * Separate commands 'hide_class', 'hide_type', 'hide_const',
216 'hide_fact' replace the former 'hide' KIND command. Minor
219 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
220 more efficient than combinations with -q1 or -q2.
225 * Proofterms record type-class reasoning explicitly, using the
226 "unconstrain" operation internally. This eliminates all sort
227 constraints from a theorem and proof, introducing explicit
228 OFCLASS-premises. On the proof term level, this operation is
229 automatically applied at theorem boundaries, such that closed proofs
230 are always free of sort constraints. INCOMPATIBILITY for tools that
233 * Local theory specifications may depend on extra type variables that
234 are not present in the result type -- arguments TYPE('a) :: 'a itself
235 are added internally. For example:
237 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
239 * Predicates of locales introduced by classes carry a mandatory
240 "class" prefix. INCOMPATIBILITY.
242 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
244 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
247 * Command 'code_reflect' allows to incorporate generated ML code into
248 runtime environment; replaces immature code_datatype antiquotation.
251 * Code generator: simple concept for abstract datatypes obeying
254 * Code generator: details of internal data cache have no impact on the
255 user space functionality any longer.
257 * Methods "unfold_locales" and "intro_locales" ignore non-locale
258 subgoals. This is more appropriate for interpretations with 'where'.
261 * Command 'example_proof' opens an empty proof body. This allows to
262 experiment with Isar, without producing any persistent result.
264 * Commands 'type_notation' and 'no_type_notation' declare type syntax
265 within a local theory context, with explicit checking of the
266 constructors involved (in contrast to the raw 'syntax' versions).
268 * Commands 'types' and 'typedecl' now work within a local theory
269 context -- without introducing dependencies on parameters or
270 assumptions, which is not possible in Isabelle/Pure.
272 * Command 'defaultsort' has been renamed to 'default_sort', it works
273 within a local theory context. Minor INCOMPATIBILITY.
278 * Command 'typedef' now works within a local theory context -- without
279 introducing dependencies on parameters or assumptions, which is not
280 possible in Isabelle/Pure/HOL. Note that the logical environment may
281 contain multiple interpretations of local typedefs (with different
282 non-emptiness proofs), even in a global theory context.
284 * New package for quotient types. Commands 'quotient_type' and
285 'quotient_definition' may be used for defining types and constants by
286 quotient constructions. An example is the type of integers created by
287 quotienting pairs of natural numbers:
290 intrel :: "(nat * nat) => (nat * nat) => bool"
292 "intrel (x, y) (u, v) = (x + v = u + y)"
294 quotient_type int = "nat * nat" / intrel
295 by (auto simp add: equivp_def expand_fun_eq)
298 "0::int" is "(0::nat, 0::nat)"
300 The method "lifting" can be used to lift of theorems from the
301 underlying "raw" type to the quotient type. The example
302 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
303 construction and provides a reasoning infrastructure for finite sets.
305 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
306 clash with new theory Quotient in Main HOL.
308 * Moved the SMT binding into the main HOL session, eliminating
309 separate HOL-SMT session.
311 * List membership infix mem operation is only an input abbreviation.
314 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
315 for future developements; former Library/Word.thy is still present in
316 the AFP entry RSAPPS.
318 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
319 longer shadowed. INCOMPATIBILITY.
321 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
324 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
327 * Dropped normalizing_semiring etc; use the facts in semiring classes
328 instead. INCOMPATIBILITY.
330 * Dropped several real-specific versions of lemmas about floor and
331 ceiling; use the generic lemmas from theory "Archimedean_Field"
332 instead. INCOMPATIBILITY.
334 floor_number_of_eq ~> floor_number_of
335 le_floor_eq_number_of ~> number_of_le_floor
336 le_floor_eq_zero ~> zero_le_floor
337 le_floor_eq_one ~> one_le_floor
338 floor_less_eq_number_of ~> floor_less_number_of
339 floor_less_eq_zero ~> floor_less_zero
340 floor_less_eq_one ~> floor_less_one
341 less_floor_eq_number_of ~> number_of_less_floor
342 less_floor_eq_zero ~> zero_less_floor
343 less_floor_eq_one ~> one_less_floor
344 floor_le_eq_number_of ~> floor_le_number_of
345 floor_le_eq_zero ~> floor_le_zero
346 floor_le_eq_one ~> floor_le_one
347 floor_subtract_number_of ~> floor_diff_number_of
348 floor_subtract_one ~> floor_diff_one
349 ceiling_number_of_eq ~> ceiling_number_of
350 ceiling_le_eq_number_of ~> ceiling_le_number_of
351 ceiling_le_zero_eq ~> ceiling_le_zero
352 ceiling_le_eq_one ~> ceiling_le_one
353 less_ceiling_eq_number_of ~> number_of_less_ceiling
354 less_ceiling_eq_zero ~> zero_less_ceiling
355 less_ceiling_eq_one ~> one_less_ceiling
356 ceiling_less_eq_number_of ~> ceiling_less_number_of
357 ceiling_less_eq_zero ~> ceiling_less_zero
358 ceiling_less_eq_one ~> ceiling_less_one
359 le_ceiling_eq_number_of ~> number_of_le_ceiling
360 le_ceiling_eq_zero ~> zero_le_ceiling
361 le_ceiling_eq_one ~> one_le_ceiling
362 ceiling_subtract_number_of ~> ceiling_diff_number_of
363 ceiling_subtract_one ~> ceiling_diff_one
365 * Theory "Finite_Set": various folding_XXX locales facilitate the
366 application of the various fold combinators on finite sets.
368 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
369 provides abstract red-black tree type which is backed by "RBT_Impl" as
370 implementation. INCOMPATIBILTY.
372 * Theory Library/Coinductive_List has been removed -- superseded by
373 AFP/thys/Coinductive.
375 * Theory PReal, including the type "preal" and related operations, has
376 been removed. INCOMPATIBILITY.
378 * Real: new development using Cauchy Sequences.
380 * Split off theory "Big_Operators" containing setsum, setprod,
381 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
383 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
384 "Int" etc. INCOMPATIBILITY.
386 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
388 * New set of rules "ac_simps" provides combined assoc / commute
389 rewrites for all interpretations of the appropriate generic locales.
391 * Renamed theory "OrderedGroup" to "Groups" and split theory
392 "Ring_and_Field" into theories "Rings" and "Fields"; for more
393 appropriate and more consistent names suitable for name prefixes
394 within the HOL theories. INCOMPATIBILITY.
396 * Some generic constants have been put to appropriate theories:
397 - less_eq, less: Orderings
398 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
399 - inverse, divide: Rings
402 * More consistent naming of type classes involving orderings (and
405 lower_semilattice ~> semilattice_inf
406 upper_semilattice ~> semilattice_sup
408 dense_linear_order ~> dense_linorder
410 pordered_ab_group_add ~> ordered_ab_group_add
411 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
412 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
413 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
414 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
415 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
416 pordered_cancel_semiring ~> ordered_cancel_semiring
417 pordered_comm_monoid_add ~> ordered_comm_monoid_add
418 pordered_comm_ring ~> ordered_comm_ring
419 pordered_comm_semiring ~> ordered_comm_semiring
420 pordered_ring ~> ordered_ring
421 pordered_ring_abs ~> ordered_ring_abs
422 pordered_semiring ~> ordered_semiring
424 ordered_ab_group_add ~> linordered_ab_group_add
425 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
426 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
427 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
428 ordered_field ~> linordered_field
429 ordered_field_no_lb ~> linordered_field_no_lb
430 ordered_field_no_ub ~> linordered_field_no_ub
431 ordered_field_dense_linear_order ~> dense_linordered_field
432 ordered_idom ~> linordered_idom
433 ordered_ring ~> linordered_ring
434 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
435 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
436 ordered_ring_strict ~> linordered_ring_strict
437 ordered_semidom ~> linordered_semidom
438 ordered_semiring ~> linordered_semiring
439 ordered_semiring_1 ~> linordered_semiring_1
440 ordered_semiring_1_strict ~> linordered_semiring_1_strict
441 ordered_semiring_strict ~> linordered_semiring_strict
443 The following slightly odd type classes have been moved to a
444 separate theory Library/Lattice_Algebras:
446 lordered_ab_group_add ~> lattice_ab_group_add
447 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
448 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
449 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
450 lordered_ring ~> lattice_ring
454 * Refined field classes:
455 - classes division_ring_inverse_zero, field_inverse_zero,
456 linordered_field_inverse_zero include rule inverse 0 = 0 --
457 subsumes former division_by_zero class;
458 - numerous lemmas have been ported from field to division_ring.
461 * Refined algebra theorem collections:
462 - dropped theorem group group_simps, use algebra_simps instead;
463 - dropped theorem group ring_simps, use field_simps instead;
464 - proper theorem collection field_simps subsumes former theorem
465 groups field_eq_simps and field_simps;
466 - dropped lemma eq_minus_self_iff which is a duplicate for
470 * Theory Finite_Set and List: some lemmas have been generalized from
473 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
474 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
475 inter_Inter_fold_inter ~> inf_Inf_fold_inf
476 union_Union_fold_union ~> sup_Sup_fold_sup
477 Inter_fold_inter ~> Inf_fold_inf
478 Union_fold_union ~> Sup_fold_sup
479 inter_INTER_fold_inter ~> inf_INFI_fold_inf
480 union_UNION_fold_union ~> sup_SUPR_fold_sup
481 INTER_fold_inter ~> INFI_fold_inf
482 UNION_fold_union ~> SUPR_fold_sup
484 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
485 replaced by the more convenient lemmas Inf_empty and Sup_empty.
486 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
487 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
488 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
489 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
491 * Reorganized theory Multiset: swapped notation of pointwise and
494 - pointwise ordering is instance of class order with standard syntax
496 - multiset ordering has syntax <=# and <#; partial order properties
497 are provided by means of interpretation with prefix
499 - less duplication, less historical organization of sections,
500 conversion from associations lists to multisets, rudimentary code
502 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
507 multiset_eq_conv_count_eq ~> multiset_ext_iff
508 multi_count_ext ~> multiset_ext
509 diff_union_inverse2 ~> diff_union_cancelR
513 * Theory Permutation: replaced local "remove" by List.remove1.
515 * Code generation: ML and OCaml code is decorated with signatures.
517 * Theory List: added transpose.
519 * Library/Nat_Bijection.thy is a collection of bijective functions
520 between nat and other types, which supersedes the older libraries
521 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
524 Nat_Int_Bij.nat2_to_nat ~> prod_encode
525 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
526 Nat_Int_Bij.int_to_nat_bij ~> int_encode
527 Nat_Int_Bij.nat_to_int_bij ~> int_decode
528 Countable.pair_encode ~> prod_encode
529 NatIso.prod2nat ~> prod_encode
530 NatIso.nat2prod ~> prod_decode
531 NatIso.sum2nat ~> sum_encode
532 NatIso.nat2sum ~> sum_decode
533 NatIso.list2nat ~> list_encode
534 NatIso.nat2list ~> list_decode
535 NatIso.set2nat ~> set_encode
536 NatIso.nat2set ~> set_decode
539 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
540 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
541 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
542 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
543 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
544 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
545 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
546 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
547 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
548 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
549 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
550 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
551 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
554 - Renamed ATP commands:
555 atp_info ~> sledgehammer running_atps
556 atp_kill ~> sledgehammer kill_atps
557 atp_messages ~> sledgehammer messages
558 atp_minimize ~> sledgehammer minimize
559 print_atps ~> sledgehammer available_atps
561 - Added user's manual ("isabelle doc sledgehammer").
562 - Added option syntax and "sledgehammer_params" to customize
563 Sledgehammer's behavior. See the manual for details.
564 - Modified the Isar proof reconstruction code so that it produces
565 direct proofs rather than proofs by contradiction. (This feature
566 is still experimental.)
567 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
569 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
572 - Added and implemented "binary_ints" and "bits" options.
573 - Added "std" option and implemented support for nonstandard models.
574 - Added and implemented "finitize" option to improve the precision
575 of infinite datatypes based on a monotonicity analysis.
576 - Added support for quotient types.
577 - Added support for "specification" and "ax_specification"
579 - Added support for local definitions (for "function" and
580 "termination" proofs).
581 - Added support for term postprocessors.
582 - Optimized "Multiset.multiset" and "FinFun.finfun".
583 - Improved efficiency of "destroy_constrs" optimization.
584 - Fixed soundness bugs related to "destroy_constrs" optimization and
586 - Fixed soundness bug related to higher-order constructors.
587 - Fixed soundness bug when "full_descrs" is enabled.
588 - Improved precision of set constructs.
589 - Added "atoms" option.
590 - Added cache to speed up repeated Kodkod invocations on the same
592 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
593 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
594 "SAT4J_Light". INCOMPATIBILITY.
595 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
596 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
597 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
599 * Method "induct" now takes instantiations of the form t, where t is not
600 a variable, as a shorthand for "x == t", where x is a fresh variable.
601 If this is not intended, t has to be enclosed in parentheses.
602 By default, the equalities generated by definitional instantiations
603 are pre-simplified, which may cause parameters of inductive cases
604 to disappear, or may even delete some of the inductive cases.
605 Use "induct (no_simp)" instead of "induct" to restore the old
606 behaviour. The (no_simp) option is also understood by the "cases"
607 and "nominal_induct" methods, which now perform pre-simplification, too.
613 * Variable names in lemmas generated by the domain package have
614 changed; the naming scheme is now consistent with the HOL datatype
615 package. Some proof scripts may be affected, INCOMPATIBILITY.
617 * The domain package no longer defines the function "foo_copy" for
618 recursive domain "foo". The reach lemma is now stated directly in
619 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
620 be reformulated in terms of "foo_take", INCOMPATIBILITY.
622 * Most definedness lemmas generated by the domain package (previously
623 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
624 like "foo$x = UU <-> x = UU", which works better as a simp rule.
625 Proofs that used definedness lemmas as intro rules may break,
626 potential INCOMPATIBILITY.
628 * Induction and casedist rules generated by the domain package now
629 declare proper case_names (one called "bottom", and one named for each
630 constructor). INCOMPATIBILITY.
632 * For mutually-recursive domains, separate "reach" and "take_lemma"
633 rules are generated for each domain, INCOMPATIBILITY.
635 foo_bar.reach ~> foo.reach bar.reach
636 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
638 * Some lemmas generated by the domain package have been renamed for
639 consistency with the datatype package, INCOMPATIBILITY.
641 foo.ind ~> foo.induct
642 foo.finite_ind ~> foo.finite_induct
643 foo.coind ~> foo.coinduct
644 foo.casedist ~> foo.exhaust
645 foo.exhaust ~> foo.nchotomy
647 * For consistency with other definition packages, the fixrec package
648 now generates qualified theorem names, INCOMPATIBILITY.
650 foo_simps ~> foo.simps
651 foo_unfold ~> foo.unfold
652 foo_induct ~> foo.induct
654 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
655 method and internal fixrec proofs now use the default simpset instead.
658 * The "contlub" predicate has been removed. Proof scripts should use
659 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
661 * The "admw" predicate has been removed, INCOMPATIBILITY.
663 * The constants cpair, cfst, and csnd have been removed in favor of
664 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
669 * Antiquotations for basic formal entities:
671 @{class NAME} -- type class
672 @{class_syntax NAME} -- syntax representation of the above
674 @{type_name NAME} -- logical type
675 @{type_abbrev NAME} -- type abbreviation
676 @{nonterminal NAME} -- type of concrete syntactic category
677 @{type_syntax NAME} -- syntax representation of any of the above
679 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
680 @{const_abbrev NAME} -- abbreviated constant
681 @{const_syntax NAME} -- syntax representation of any of the above
683 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
684 syntax constant (cf. 'syntax' command).
686 * Antiquotation @{make_string} inlines a function to print arbitrary
687 values similar to the ML toplevel. The result is compiler dependent
688 and may fall back on "?" in certain situations.
690 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
691 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
692 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
693 not work with the asynchronous Isar document model.
695 * Configuration options now admit dynamic default values, depending on
696 the context or even global references.
698 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
699 uses an efficient external library if available (for Poly/ML).
701 * Renamed some important ML structures, while keeping the old names
702 for some time as aliases within the structure Legacy:
704 OuterKeyword ~> Keyword
707 OuterSyntax ~> Outer_Syntax
708 PrintMode ~> Print_Mode
709 SpecParse ~> Parse_Spec
712 ThyOutput ~> Thy_Output
713 TypeInfer ~> Type_Infer
715 Note that "open Legacy" simplifies porting of sources, but forgetting
716 to remove it again will complicate porting again in the future.
718 * Most operations that refer to a global context are named
719 accordingly, e.g. Simplifier.global_context or
720 ProofContext.init_global. There are some situations where a global
721 context actually works, but under normal circumstances one needs to
722 pass the proper local context through the code!
724 * Discontinued old TheoryDataFun with its copy/init operation -- data
725 needs to be pure. Functor Theory_Data_PP retains the traditional
726 Pretty.pp argument to merge, which is absent in the standard
729 * Sorts.certify_sort and derived "cert" operations for types and terms
730 no longer minimize sorts. Thus certification at the boundary of the
731 inference kernel becomes invariant under addition of class relations,
732 which is an important monotonicity principle. Sorts are now minimized
733 in the syntax layer only, at the boundary between the end-user and the
734 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
735 explicitly in rare situations.
737 * Renamed old-style Drule.standard to Drule.export_without_context, to
738 emphasize that this is in no way a standard operation.
741 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
742 usual for resolution. Rare INCOMPATIBILITY.
744 * Renamed varify/unvarify operations to varify_global/unvarify_global
745 to emphasize that these only work in a global situation (which is
748 * Curried take and drop in library.ML; negative length is interpreted
749 as infinity (as in chop). Subtle INCOMPATIBILITY.
751 * Proof terms: type substitutions on proof constants now use canonical
752 order of type variables. INCOMPATIBILITY for tools working with proof
755 * Raw axioms/defs may no longer carry sort constraints, and raw defs
756 may no longer carry premises. User-level specifications are
757 transformed accordingly by Thm.add_axiom/add_def.
762 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
763 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
764 proof terms are enabled unconditionally in the new HOL-Proofs image.
766 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
767 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
770 * Old lib/scripts/polyml-platform is superseded by the
771 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
772 variant, even on a 64 bit machine. The following example setting
773 prefers 64 bit if available:
775 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
777 * The preliminary Isabelle/jEdit application demonstrates the emerging
778 Isabelle/Scala layer for advanced prover interaction and integration.
779 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
782 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
783 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
784 similar to the default assignment of the document preparation system
785 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
786 provides some operations for direct access to the font without asking
787 the user for manual installation.
791 New in Isabelle2009-1 (December 2009)
792 -------------------------------------
796 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
797 one backslash should be used, even in ML sources.
802 * Locale interpretation propagates mixins along the locale hierarchy.
803 The currently only available mixins are the equations used to map
804 local definitions to terms of the target domain of an interpretation.
806 * Reactivated diagnostic command 'print_interps'. Use "print_interps
807 loc" to print all interpretations of locale "loc" in the theory.
808 Interpretations in proofs are not shown.
810 * Thoroughly revised locales tutorial. New section on conditional
813 * On instantiation of classes, remaining undefined class parameters
814 are formally declared. INCOMPATIBILITY.
817 *** Document preparation ***
819 * New generalized style concept for printing terms: @{foo (style) ...}
820 instead of @{foo_style style ...} (old form is still retained for
821 backward compatibility). Styles can be also applied for
822 antiquotations prop, term_type and typeof.
827 * New proof method "smt" for a combination of first-order logic with
828 equality, linear and nonlinear (natural/integer/real) arithmetic, and
829 fixed-size bitvectors; there is also basic support for higher-order
830 features (esp. lambda abstractions). It is an incomplete decision
831 procedure based on external SMT solvers using the oracle mechanism;
832 for the SMT solver Z3, this method is proof-producing. Certificates
833 are provided to avoid calling the external solvers solely for
834 re-checking proofs. Due to a remote SMT service there is no need for
835 installing SMT solvers locally. See src/HOL/SMT.
837 * New commands to load and prove verification conditions generated by
838 the Boogie program verifier or derived systems (e.g. the Verifying C
839 Compiler (VCC) or Spec#). See src/HOL/Boogie.
841 * New counterexample generator tool 'nitpick' based on the Kodkod
842 relational model finder. See src/HOL/Tools/Nitpick and
843 src/HOL/Nitpick_Examples.
845 * New commands 'code_pred' and 'values' to invoke the predicate
846 compiler and to enumerate values of inductive predicates.
848 * A tabled implementation of the reflexive transitive closure.
850 * New implementation of quickcheck uses generic code generator;
851 default generators are provided for all suitable HOL types, records
852 and datatypes. Old quickcheck can be re-activated importing theory
853 Library/SML_Quickcheck.
855 * New testing tool Mirabelle for automated proof tools. Applies
856 several tools and tactics like sledgehammer, metis, or quickcheck, to
857 every proof step in a theory. To be used in batch mode via the
860 * New proof method "sos" (sum of squares) for nonlinear real
861 arithmetic (originally due to John Harison). It requires theory
862 Library/Sum_Of_Squares. It is not a complete decision procedure but
863 works well in practice on quantifier-free real arithmetic with +, -,
864 *, ^, =, <= and <, i.e. boolean combinations of equalities and
865 inequalities between polynomials. It makes use of external
866 semidefinite programming solvers. Method "sos" generates a
867 certificate that can be pasted into the proof thus avoiding the need
868 to call an external tool every time the proof is checked. See
869 src/HOL/Library/Sum_Of_Squares.
871 * New method "linarith" invokes existing linear arithmetic decision
874 * New command 'atp_minimal' reduces result produced by Sledgehammer.
876 * New Sledgehammer option "Full Types" in Proof General settings menu.
877 Causes full type information to be output to the ATPs. This slows
878 ATPs down considerably but eliminates a source of unsound "proofs"
881 * New method "metisFT": A version of metis that uses full type
882 information in order to avoid failures of proof reconstruction.
884 * New evaluator "approximate" approximates an real valued term using
885 the same method as the approximation method.
887 * Method "approximate" now supports arithmetic expressions as
888 boundaries of intervals and implements interval splitting and Taylor
891 * ML antiquotation @{code_datatype} inserts definition of a datatype
892 generated by the code generator; e.g. see src/HOL/Predicate.thy.
894 * New theory SupInf of the supremum and infimum operators for sets of
897 * New theory Probability, which contains a development of measure
898 theory, eventually leading to Lebesgue integration and probability.
900 * Extended Multivariate Analysis to include derivation and Brouwer's
903 * Reorganization of number theory, INCOMPATIBILITY:
904 - new number theory development for nat and int, in theories Divides
905 and GCD as well as in new session Number_Theory
906 - some constants and facts now suffixed with _nat and _int
908 - former session NumberTheory now named Old_Number_Theory, including
909 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
910 - moved theory Pocklington from src/HOL/Library to
911 src/HOL/Old_Number_Theory
913 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
914 lcm of finite and infinite sets. It is shown that they form a complete
917 * Class semiring_div requires superclass no_zero_divisors and proof of
918 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
919 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
920 generalized to class semiring_div, subsuming former theorems
921 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
922 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
925 * Refinements to lattice classes and sets:
926 - less default intro/elim rules in locale variant, more default
927 intro/elim rules in class variant: more uniformity
928 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
930 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
932 - renamed ACI to inf_sup_aci
933 - new class "boolean_algebra"
934 - class "complete_lattice" moved to separate theory
935 "Complete_Lattice"; corresponding constants (and abbreviations)
936 renamed and with authentic syntax:
937 Set.Inf ~> Complete_Lattice.Inf
938 Set.Sup ~> Complete_Lattice.Sup
939 Set.INFI ~> Complete_Lattice.INFI
940 Set.SUPR ~> Complete_Lattice.SUPR
941 Set.Inter ~> Complete_Lattice.Inter
942 Set.Union ~> Complete_Lattice.Union
943 Set.INTER ~> Complete_Lattice.INTER
944 Set.UNION ~> Complete_Lattice.UNION
945 - authentic syntax for
948 - mere abbreviations:
951 Set.inter (for inf, formerly Set.Int)
952 Set.union (for sup, formerly Set.Un)
953 Complete_Lattice.Inter (for Inf)
954 Complete_Lattice.Union (for Sup)
955 Complete_Lattice.INTER (for INFI)
956 Complete_Lattice.UNION (for SUPR)
957 - object-logic definitions as far as appropriate
959 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
960 Un_subset_iff are explicitly deleted as default simp rules; then also
961 their lattice counterparts le_inf_iff and le_sup_iff have to be
962 deleted to achieve the desired effect.
964 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
965 rules by default any longer; the same applies to min_max.inf_absorb1
966 etc. INCOMPATIBILITY.
968 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
969 pred_set_conv by default. INCOMPATIBILITY.
971 * Power operations on relations and functions are now one dedicated
972 constant "compow" with infix syntax "^^". Power operation on
973 multiplicative monoids retains syntax "^" and is now defined generic
974 in class power. INCOMPATIBILITY.
976 * Relation composition "R O S" now has a more standard argument order:
977 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
978 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
979 break, since the O_assoc rule was not rewritten like this. Fix using
980 O_assoc[symmetric]. The same applies to the curried version "R OO S".
982 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
983 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
986 * Most rules produced by inductive and datatype package have mandatory
987 prefixes. INCOMPATIBILITY.
989 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
990 the attribute of the same name. Each of the theorems in the list
991 DERIV_intros assumes composition with an additional function and
992 matches a variable to the derivative, which has to be solved by the
993 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
994 of most elementary terms. Former Maclauren.DERIV_tac and
995 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
998 * Code generator attributes follow the usual underscore convention:
999 code_unfold replaces code unfold
1000 code_post replaces code post
1005 sizechange -> size_change
1006 induct_scheme -> induction_schema
1009 * Discontinued abbreviation "arbitrary" of constant "undefined".
1010 INCOMPATIBILITY, use "undefined" directly.
1013 Suc_eq_add_numeral_1 -> Suc_eq_plus1
1014 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
1015 Suc_plus1 -> Suc_eq_plus1
1016 *anti_sym -> *antisym*
1017 vector_less_eq_def -> vector_le_def
1020 * Added theorem List.map_map as [simp]. Removed List.map_compose.
1023 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1029 * Theory Representable defines a class "rep" of domains that are
1030 representable (via an ep-pair) in the universal domain type "udom".
1031 Instances are provided for all type constructors defined in HOLCF.
1033 * The 'new_domain' command is a purely definitional version of the
1034 domain package, for representable domains. Syntax is identical to the
1035 old domain package. The 'new_domain' package also supports indirect
1036 recursion using previously-defined type constructors. See
1037 src/HOLCF/ex/New_Domain.thy for examples.
1039 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1040 on the left-hand side of an equation, and then performs
1041 simplification. Rewriting is done using rules declared with the
1042 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1043 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1045 * The pattern-match compiler in 'fixrec' can now handle constructors
1046 with HOL function types. Pattern-match combinators for the Pair
1047 constructor are pre-configured.
1049 * The 'fixrec' package now produces better fixed-point induction rules
1050 for mutually-recursive definitions: Induction rules have conclusions
1051 of the form "P foo bar" instead of "P <foo, bar>".
1053 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1054 been renamed to "below". The name "below" now replaces "less" in many
1055 theorem names. (Legacy theorem names using "less" are still supported
1058 * The 'fixrec' package now supports "bottom patterns". Bottom
1059 patterns can be used to generate strictness rules, or to make
1060 functions more strict (much like the bang-patterns supported by the
1061 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1067 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1068 errors and run-time exceptions, including detailed source positions.
1070 * Structure Name_Space (formerly NameSpace) now manages uniquely
1071 identified entries, with some additional information such as source
1072 position, logical grouping etc.
1074 * Theory and context data is now introduced by the simplified and
1075 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1076 to be pure, but the old TheoryDataFun for mutable data (with explicit
1077 copy operation) is still available for some time.
1079 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1080 provides a high-level programming interface to synchronized state
1081 variables with atomic update. This works via pure function
1082 application within a critical section -- its runtime should be as
1083 short as possible; beware of deadlocks if critical code is nested,
1084 either directly or indirectly via other synchronized variables!
1086 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1087 wraps raw ML references, explicitly indicating their non-thread-safe
1088 behaviour. The Isar toplevel keeps this structure open, to
1089 accommodate Proof General as well as quick and dirty interactive
1090 experiments with references.
1092 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1093 parallel tactical reasoning.
1095 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1096 are similar to SUBPROOF, but are slightly more flexible: only the
1097 specified parts of the subgoal are imported into the context, and the
1098 body tactic may introduce new subgoals and schematic variables.
1100 * Old tactical METAHYPS, which does not observe the proof context, has
1101 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1102 or Subgoal.FOCUS etc.
1104 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1105 functors have their own ML name space there is no point to mark them
1106 separately.) Minor INCOMPATIBILITY.
1108 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1110 * Renamed several structures FooBar to Foo_Bar. Occasional,
1113 * Operations of structure Skip_Proof no longer require quick_and_dirty
1114 mode, which avoids critical setmp.
1116 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1117 combinators for "args". INCOMPATIBILITY, need to use simplified
1118 Attrib/Method.setup introduced in Isabelle2009.
1120 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1121 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1122 last resort. INCOMPATIBILITY.
1124 * Display.pretty_thm now requires a proper context (cf. former
1125 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1126 or even Display.pretty_thm_without_context as last resort.
1129 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1130 Syntax.pretty_typ/term directly, preferably with proper context
1131 instead of global theory.
1136 * Further fine tuning of parallel proof checking, scales up to 8 cores
1137 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1140 * Support for additional "Isabelle components" via etc/components, see
1141 also the system manual.
1143 * The isabelle makeall tool now operates on all components with
1144 IsaMakefile, not just hardwired "logics".
1146 * Removed "compress" option from isabelle-process and isabelle usedir;
1147 this is always enabled.
1149 * Discontinued support for Poly/ML 4.x versions.
1151 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1152 on a given logic image. This requires the lighttpd webserver and is
1153 currently supported on Linux only.
1157 New in Isabelle2009 (April 2009)
1158 --------------------------------
1162 * Simplified main Isabelle executables, with less surprises on
1163 case-insensitive file-systems (such as Mac OS).
1165 - The main Isabelle tool wrapper is now called "isabelle" instead of
1168 - The former "isabelle" alias for "isabelle-process" has been
1169 removed (should rarely occur to regular users).
1171 - The former "isabelle-interface" and its alias "Isabelle" have been
1172 removed (interfaces are now regular Isabelle tools).
1174 Within scripts and make files, the Isabelle environment variables
1175 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1176 respectively. (The latter are still available as legacy feature.)
1178 The old isabelle-interface wrapper could react in confusing ways if
1179 the interface was uninstalled or changed otherwise. Individual
1180 interface tool configuration is now more explicit, see also the
1181 Isabelle system manual. In particular, Proof General is now available
1182 via "isabelle emacs".
1184 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1185 purge installed copies of Isabelle executables and re-run "isabelle
1186 install -p ...", or use symlinks.
1188 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1189 old ~/isabelle, which was slightly non-standard and apt to cause
1190 surprises on case-insensitive file-systems (such as Mac OS).
1192 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1193 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1194 care is required when using older releases of Isabelle. Note that
1195 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1196 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1198 * Proofs of fully specified statements are run in parallel on
1199 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1200 a regular 4-core machine, if the initial heap space is made reasonably
1201 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1203 * The main reference manuals ("isar-ref", "implementation", and
1204 "system") have been updated and extended. Formally checked references
1205 as hyperlinks are now available uniformly.
1210 * Complete re-implementation of locales. INCOMPATIBILITY in several
1211 respects. The most important changes are listed below. See the
1212 Tutorial on Locales ("locales" manual) for details.
1214 - In locale expressions, instantiation replaces renaming. Parameters
1215 must be declared in a for clause. To aid compatibility with previous
1216 parameter inheritance, in locale declarations, parameters that are not
1217 'touched' (instantiation position "_" or omitted) are implicitly added
1218 with their syntax at the beginning of the for clause.
1220 - Syntax from abbreviations and definitions in locales is available in
1221 locale expressions and context elements. The latter is particularly
1222 useful in locale declarations.
1224 - More flexible mechanisms to qualify names generated by locale
1225 expressions. Qualifiers (prefixes) may be specified in locale
1226 expressions, and can be marked as mandatory (syntax: "name!:") or
1227 optional (syntax "name?:"). The default depends for plain "name:"
1228 depends on the situation where a locale expression is used: in
1229 commands 'locale' and 'sublocale' prefixes are optional, in
1230 'interpretation' and 'interpret' prefixes are mandatory. The old
1231 implicit qualifiers derived from the parameter names of a locale are
1232 no longer generated.
1234 - Command "sublocale l < e" replaces "interpretation l < e". The
1235 instantiation clause in "interpretation" and "interpret" (square
1236 brackets) is no longer available. Use locale expressions.
1238 - When converting proof scripts, mandatory qualifiers in
1239 'interpretation' and 'interpret' should be retained by default, even
1240 if this is an INCOMPATIBILITY compared to former behavior. In the
1241 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1242 in locale expressions range over a single locale instance only.
1244 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1245 In existing theorem specifications replace the includes element by the
1246 respective context elements of the included locale, omitting those
1247 that are already present in the theorem specification. Multiple
1248 assume elements of a locale should be replaced by a single one
1249 involving the locale predicate. In the proof body, declarations (most
1250 notably theorems) may be regained by interpreting the respective
1251 locales in the proof context as required (command "interpret").
1253 If using "includes" in replacement of a target solely because the
1254 parameter types in the theorem are not as general as in the target,
1255 consider declaring a new locale with additional type constraints on
1256 the parameters (context element "constrains").
1258 - Discontinued "locale (open)". INCOMPATIBILITY.
1260 - Locale interpretation commands no longer attempt to simplify goal.
1261 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1262 methods intro_locales and unfold_locales to clarify.
1264 - Locale interpretation commands no longer accept interpretation
1265 attributes. INCOMPATIBILITY.
1267 * Class declaration: so-called "base sort" must not be given in import
1268 list any longer, but is inferred from the specification. Particularly
1275 class foo = type + ...
1277 * Class target: global versions of theorems stemming do not carry a
1278 parameter prefix any longer. INCOMPATIBILITY.
1280 * Class 'instance' command no longer accepts attached definitions.
1281 INCOMPATIBILITY, use proper 'instantiation' target instead.
1283 * Recovered hiding of consts, which was accidentally broken in
1284 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1285 makes c inaccessible; consider using ``hide (open) const c'' instead.
1287 * Slightly more coherent Pure syntax, with updated documentation in
1288 isar-ref manual. Removed locales meta_term_syntax and
1289 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1290 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1291 directly in regular applications.
1293 * There is a new syntactic category "float_const" for signed decimal
1294 fractions (e.g. 123.45 or -123.45).
1296 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1297 interface with 'setup' command instead.
1299 * Command 'local_setup' is similar to 'setup', but operates on a local
1302 * The 'axiomatization' command now only works within a global theory
1303 context. INCOMPATIBILITY.
1305 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1306 hypotheses. Sorts required in the course of reasoning need to be
1307 covered by the constraints in the initial statement, completed by the
1308 type instance information of the background theory. Non-trivial sort
1309 hypotheses, which rarely occur in practice, may be specified via
1310 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1312 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1314 The result contains an implicit sort hypotheses as before --
1315 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1318 * Generalized Isar history, with support for linear undo, direct state
1321 * Changed defaults for unify configuration options:
1323 unify_trace_bound = 50 (formerly 25)
1324 unify_search_bound = 60 (formerly 30)
1326 * Different bookkeeping for code equations (INCOMPATIBILITY):
1328 a) On theory merge, the last set of code equations for a particular
1329 constant is taken (in accordance with the policy applied by other
1330 parts of the code generator framework).
1332 b) Code equations stemming from explicit declarations (e.g. code
1333 attribute) gain priority over default code equations stemming
1334 from definition, primrec, fun etc.
1336 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1338 * Unified theorem tables for both code generators. Thus [code
1339 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1341 * Command 'find_consts' searches for constants based on type and name
1344 find_consts "_ => bool"
1346 By default, matching is against subtypes, but it may be restricted to
1347 the whole type. Searching by name is possible. Multiple queries are
1348 conjunctive and queries may be negated by prefixing them with a
1351 find_consts strict: "_ => bool" name: "Int" -"int => int"
1353 * New 'find_theorems' criterion "solves" matches theorems that
1354 directly solve the current goal (modulo higher-order unification).
1356 * Auto solve feature for main theorem statements: whenever a new goal
1357 is stated, "find_theorems solves" is called; any theorems that could
1358 solve the lemma directly are listed as part of the goal state.
1359 Cf. associated options in Proof General Isabelle settings menu,
1360 enabled by default, with reasonable timeout for pathological cases of
1361 higher-order unification.
1364 *** Document preparation ***
1366 * Antiquotation @{lemma} now imitates a regular terminal proof,
1367 demanding keyword 'by' and supporting the full method expression
1368 syntax just like the Isar command 'by'.
1373 * Integrated main parts of former image HOL-Complex with HOL. Entry
1374 points Main and Complex_Main remain as before.
1376 * Logic image HOL-Plain provides a minimal HOL with the most important
1377 tools available (inductive, datatype, primrec, ...). This facilitates
1378 experimentation and tool development. Note that user applications
1379 (and library theories) should never refer to anything below theory
1382 * Logic image HOL-Main stops at theory Main, and thus facilitates
1383 experimentation due to shorter build times.
1385 * Logic image HOL-NSA contains theories of nonstandard analysis which
1386 were previously part of former HOL-Complex. Entry point Hyperreal
1387 remains valid, but theories formerly using Complex_Main should now use
1388 new entry point Hypercomplex.
1390 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1391 Posix processes. Avoids potentially expensive forking of the ML
1392 process. New thread-based implementation also works on non-Unix
1393 platforms (Cygwin). Provers are no longer hardwired, but defined
1394 within the theory via plain ML wrapper functions. Basic Sledgehammer
1395 commands are covered in the isar-ref manual.
1397 * Wrapper scripts for remote SystemOnTPTP service allows to use
1398 sledgehammer without local ATP installation (Vampire etc.). Other
1399 provers may be included via suitable ML wrappers, see also
1400 src/HOL/ATP_Linkup.thy.
1402 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1405 * The metis method no longer fails because the theorem is too trivial
1406 (contains the empty clause).
1408 * The metis method now fails in the usual manner, rather than raising
1409 an exception, if it determines that it cannot prove the theorem.
1411 * Method "coherent" implements a prover for coherent logic (see also
1412 src/Tools/coherent.ML).
1414 * Constants "undefined" and "default" replace "arbitrary". Usually
1415 "undefined" is the right choice to replace "arbitrary", though
1416 logically there is no difference. INCOMPATIBILITY.
1418 * Command "value" now integrates different evaluation mechanisms. The
1419 result of the first successful evaluation mechanism is printed. In
1420 square brackets a particular named evaluation mechanisms may be
1421 specified (currently, [SML], [code] or [nbe]). See further
1422 src/HOL/ex/Eval_Examples.thy.
1424 * Normalization by evaluation now allows non-leftlinear equations.
1425 Declare with attribute [code nbe].
1427 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1428 as the structured Isar versions "cases" and "induct", cf. the
1429 corresponding "cases" and "induct" attributes. Mutual induction rules
1430 are now presented as a list of individual projections
1431 (e.g. foo_bar.inducts for types foo and bar); the old format with
1432 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1433 rare situations a different rule is selected --- notably nested tuple
1434 elimination instead of former prod.exhaust: use explicit (case_tac t
1435 rule: prod.exhaust) here.
1437 * Attributes "cases", "induct", "coinduct" support "del" option.
1439 * Removed fact "case_split_thm", which duplicates "case_split".
1441 * The option datatype has been moved to a new theory Option. Renamed
1442 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1444 * New predicate "strict_mono" classifies strict functions on partial
1445 orders. With strict functions on linear orders, reasoning about
1446 (in)equalities is facilitated by theorems "strict_mono_eq",
1447 "strict_mono_less_eq" and "strict_mono_less".
1449 * Some set operations are now proper qualified constants with
1450 authentic syntax. INCOMPATIBILITY:
1461 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1464 * Auxiliary class "itself" has disappeared -- classes without any
1465 parameter are treated as expected by the 'class' command.
1467 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1469 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1470 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1472 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1473 method "approximation". It proves formulas on real values by using
1474 interval arithmetic. In the formulas are also the transcendental
1475 functions sin, cos, tan, atan, ln, exp and the constant pi are
1476 allowed. For examples see
1477 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1479 * Theory "Reflection" now resides in HOL/Library.
1481 * Entry point to Word library now simply named "Word".
1484 * Made source layout more coherent with logical distribution
1487 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1488 src/HOL/Library/Code_Message.thy ~> src/HOL/
1489 src/HOL/Library/GCD.thy ~> src/HOL/
1490 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1491 src/HOL/Library/Parity.thy ~> src/HOL/
1492 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1493 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1494 src/HOL/Real/Lubs.thy ~> src/HOL/
1495 src/HOL/Real/PReal.thy ~> src/HOL/
1496 src/HOL/Real/Rational.thy ~> src/HOL/
1497 src/HOL/Real/RComplete.thy ~> src/HOL/
1498 src/HOL/Real/RealDef.thy ~> src/HOL/
1499 src/HOL/Real/RealPow.thy ~> src/HOL/
1500 src/HOL/Real/Real.thy ~> src/HOL/
1501 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1502 src/HOL/Complex/Complex.thy ~> src/HOL/
1503 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1504 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1505 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1506 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1507 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1508 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1509 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1510 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1511 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1512 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1513 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1514 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1515 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1516 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1517 src/HOL/Real/Float ~> src/HOL/Library/
1518 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1519 src/HOL/Real/RealVector.thy ~> src/HOL/
1521 src/HOL/arith_data.ML ~> src/HOL/Tools
1522 src/HOL/hologic.ML ~> src/HOL/Tools
1523 src/HOL/simpdata.ML ~> src/HOL/Tools
1524 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1525 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1526 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1527 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1528 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1529 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1530 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1532 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1533 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1534 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1535 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1536 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1537 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1539 * If methods "eval" and "evaluation" encounter a structured proof
1540 state with !!/==>, only the conclusion is evaluated to True (if
1541 possible), avoiding strange error messages.
1543 * Method "sizechange" automates termination proofs using (a
1544 modification of) the size-change principle. Requires SAT solver. See
1545 src/HOL/ex/Termination.thy for examples.
1547 * Simplifier: simproc for let expressions now unfolds if bound
1548 variable occurs at most once in let expression body. INCOMPATIBILITY.
1550 * Method "arith": Linear arithmetic now ignores all inequalities when
1551 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1553 * New attribute "arith" for facts that should always be used
1554 automatically by arithmetic. It is intended to be used locally in
1557 assumes [arith]: "x > 0"
1559 Global usage is discouraged because of possible performance impact.
1561 * New classes "top" and "bot" with corresponding operations "top" and
1562 "bot" in theory Orderings; instantiation of class "complete_lattice"
1563 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1565 * Changed definition lemma "less_fun_def" in order to provide an
1566 instance for preorders on functions; use lemma "less_le" instead.
1569 * Theory Orderings: class "wellorder" moved here, with explicit
1570 induction rule "less_induct" as assumption. For instantiation of
1571 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1574 * Theory Orderings: added class "preorder" as superclass of "order".
1575 INCOMPATIBILITY: Instantiation proofs for order, linorder
1576 etc. slightly changed. Some theorems named order_class.* now named
1579 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1582 * Theory Finite_Set: added a new fold combinator of type
1584 ('a => 'b => 'b) => 'b => 'a set => 'b
1586 Occasionally this is more convenient than the old fold combinator
1587 which is now defined in terms of the new one and renamed to
1590 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1591 and "ring_simps" have been replaced by "algebra_simps" (which can be
1592 extended with further lemmas!). At the moment both still exist but
1593 the former will disappear at some point.
1595 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1596 class recpower. Type-specific simp rules for various recpower types
1597 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1599 rat_power_0 -> power_0
1600 rat_power_Suc -> power_Suc
1601 realpow_0 -> power_0
1602 realpow_Suc -> power_Suc
1603 complexpow_0 -> power_0
1604 complexpow_Suc -> power_Suc
1605 power_poly_0 -> power_0
1606 power_poly_Suc -> power_Suc
1608 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1609 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1610 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1611 of lemmas from Divides has been generalized from nat to class
1612 semiring_div. INCOMPATIBILITY. This involves the following theorem
1613 renames resulting from duplicate elimination:
1615 dvd_def_mod ~> dvd_eq_mod_eq_0
1616 zero_dvd_iff ~> dvd_0_left_iff
1617 dvd_0 ~> dvd_0_right
1618 DIVISION_BY_ZERO_DIV ~> div_by_0
1619 DIVISION_BY_ZERO_MOD ~> mod_by_0
1620 mult_div ~> div_mult_self2_is_id
1621 mult_mod ~> mod_mult_self2_is_0
1623 * Theory IntDiv: removed many lemmas that are instances of class-based
1624 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1625 rename old lemmas as follows:
1627 dvd_diff -> nat_dvd_diff
1628 dvd_zminus_iff -> dvd_minus_iff
1629 mod_add1_eq -> mod_add_eq
1630 mod_mult1_eq -> mod_mult_right_eq
1631 mod_mult1_eq' -> mod_mult_left_eq
1632 mod_mult_distrib_mod -> mod_mult_eq
1633 nat_mod_add_left_eq -> mod_add_left_eq
1634 nat_mod_add_right_eq -> mod_add_right_eq
1635 nat_mod_div_trivial -> mod_div_trivial
1636 nat_mod_mod_trivial -> mod_mod_trivial
1637 zdiv_zadd_self1 -> div_add_self1
1638 zdiv_zadd_self2 -> div_add_self2
1639 zdiv_zmult_self1 -> div_mult_self2_is_id
1640 zdiv_zmult_self2 -> div_mult_self1_is_id
1641 zdvd_triv_left -> dvd_triv_left
1642 zdvd_triv_right -> dvd_triv_right
1643 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1644 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1645 zmod_zadd_left_eq -> mod_add_left_eq
1646 zmod_zadd_right_eq -> mod_add_right_eq
1647 zmod_zadd_self1 -> mod_add_self1
1648 zmod_zadd_self2 -> mod_add_self2
1649 zmod_zadd1_eq -> mod_add_eq
1650 zmod_zdiff1_eq -> mod_diff_eq
1651 zmod_zdvd_zmod -> mod_mod_cancel
1652 zmod_zmod_cancel -> mod_mod_cancel
1653 zmod_zmult_self1 -> mod_mult_self2_is_0
1654 zmod_zmult_self2 -> mod_mult_self1_is_0
1657 zdvd_abs1 -> abs_dvd_iff
1658 zdvd_abs2 -> dvd_abs_iff
1659 zdvd_refl -> dvd_refl
1660 zdvd_trans -> dvd_trans
1661 zdvd_zadd -> dvd_add
1662 zdvd_zdiff -> dvd_diff
1663 zdvd_zminus_iff -> dvd_minus_iff
1664 zdvd_zminus2_iff -> minus_dvd_iff
1665 zdvd_zmultD -> dvd_mult_right
1666 zdvd_zmultD2 -> dvd_mult_left
1667 zdvd_zmult_mono -> mult_dvd_mono
1668 zdvd_0_right -> dvd_0_right
1669 zdvd_0_left -> dvd_0_left_iff
1670 zdvd_1_left -> one_dvd
1671 zminus_dvd_iff -> minus_dvd_iff
1673 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1675 * The real numbers offer decimal input syntax: 12.34 is translated
1676 into 1234/10^2. This translation is not reversed upon output.
1678 * Theory Library/Polynomial defines an abstract type 'a poly of
1679 univariate polynomials with coefficients of type 'a. In addition to
1680 the standard ring operations, it also supports div and mod. Code
1681 generation is also supported, using list-style constructors.
1683 * Theory Library/Inner_Product defines a class of real_inner for real
1684 inner product spaces, with an overloaded operation inner :: 'a => 'a
1685 => real. Class real_inner is a subclass of real_normed_vector from
1688 * Theory Library/Product_Vector provides instances for the product
1689 type 'a * 'b of several classes from RealVector and Inner_Product.
1690 Definitions of addition, subtraction, scalar multiplication, norms,
1691 and inner products are included.
1693 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1694 addition to the field operations, numerals and case syntax are also
1697 * Theory Library/Diagonalize provides constructive version of Cantor's
1698 first diagonalization argument.
1700 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1701 zlcm (for int); carried together from various gcd/lcm developements in
1702 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1703 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1704 may recover tupled syntax as follows:
1706 hide (open) const gcd
1707 abbreviation gcd where
1708 "gcd == (%(a, b). GCD.gcd a b)"
1710 GCD.gcd ("gcd '(_, _')")
1712 The same works for lcm, zgcd, zlcm.
1714 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1715 instantiations for algebraic structures. Removed some duplicate
1716 theorems. Changes in simp rules. INCOMPATIBILITY.
1718 * ML antiquotation @{code} takes a constant as argument and generates
1719 corresponding code in background and inserts name of the corresponding
1720 resulting ML value/function/datatype constructor binding in place.
1721 All occurrences of @{code} with a single ML block are generated
1722 simultaneously. Provides a generic and safe interface for
1723 instrumentalizing code generation. See
1724 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1725 In future you ought to refrain from ad-hoc compiling generated SML
1726 code on the ML toplevel. Note that (for technical reasons) @{code}
1727 cannot refer to constants for which user-defined serializations are
1728 set. Refer to the corresponding ML counterpart directly in that
1731 * Command 'rep_datatype': instead of theorem names the command now
1732 takes a list of terms denoting the constructors of the type to be
1733 represented as datatype. The characteristic theorems have to be
1734 proven. INCOMPATIBILITY. Also observe that the following theorems
1735 have disappeared in favour of existing ones:
1737 unit_induct ~> unit.induct
1738 prod_induct ~> prod.induct
1739 sum_induct ~> sum.induct
1740 Suc_Suc_eq ~> nat.inject
1741 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1746 * New locales for orders and lattices where the equivalence relation
1747 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1748 locales use a record structure with field eq for the equivalence.
1750 * New theory of factorial domains.
1752 * Units_l_inv and Units_r_inv are now simp rules by default.
1753 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1754 and/or r_inv will now also require deletion of these lemmas.
1756 * Renamed the following theorems, INCOMPATIBILITY:
1758 UpperD ~> Upper_memD
1759 LowerD ~> Lower_memD
1760 least_carrier ~> least_closed
1761 greatest_carrier ~> greatest_closed
1762 greatest_Lower_above ~> greatest_Lower_below
1763 one_zero ~> carrier_one_zero
1764 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1769 * Nominal datatypes can now contain type-variables.
1771 * Commands 'nominal_inductive' and 'equivariance' work with local
1774 * Nominal primrec can now works with local theory targets and its
1775 specification syntax now conforms to the general format as seen in
1778 * Method "perm_simp" honours the standard simplifier attributes
1779 (no_asm), (no_asm_use) etc.
1781 * The new predicate #* is defined like freshness, except that on the
1782 left hand side can be a set or list of atoms.
1784 * Experimental command 'nominal_inductive2' derives strong induction
1785 principles for inductive definitions. In contrast to
1786 'nominal_inductive', which can only deal with a fixed number of
1787 binders, it can deal with arbitrary expressions standing for sets of
1788 atoms to be avoided. The only inductive definition we have at the
1789 moment that needs this generalisation is the typing rule for Lets in
1792 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1793 -----------------------------------------------------------------
1794 Gamma |- Let x be t1 in t2 : T2
1796 In this rule one wants to avoid all the binders that are introduced by
1797 "close Gamma T1". We are looking for other examples where this
1798 feature might be useful. Please let us know.
1803 * Reimplemented the simplification procedure for proving continuity
1804 subgoals. The new simproc is extensible; users can declare additional
1805 continuity introduction rules with the attribute [cont2cont].
1807 * The continuity simproc now uses a different introduction rule for
1808 solving continuity subgoals on terms with lambda abstractions. In
1809 some rare cases the new simproc may fail to solve subgoals that the
1810 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1811 Potential INCOMPATIBILITY.
1813 * Command 'fixrec': specification syntax now conforms to the general
1814 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1815 examples. INCOMPATIBILITY.
1820 * Proof of Zorn's Lemma for partial orders.
1825 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1826 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1827 depends on multithreading, so timouts will not work before Poly/ML
1830 * High-level support for concurrent ML programming, see
1831 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1832 particularly convenient to organize independent functional
1833 computations. The concept of "synchronized variables" provides a
1834 higher-order interface for components with shared state, avoiding the
1835 delicate details of mutexes and condition variables. (Requires
1836 Poly/ML 5.2.1 or later.)
1838 * ML bindings produced via Isar commands are stored within the Isar
1839 context (theory or proof). Consequently, commands like 'use' and 'ML'
1840 become thread-safe and work with undo as expected (concerning
1841 top-level bindings, not side-effects on global references).
1842 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1843 compiler at runtime; really global bindings need to be given outside a
1844 theory. (Requires Poly/ML 5.2 or later.)
1846 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1847 context. Top-level ML bindings are stored within the proof context in
1848 a purely sequential fashion, disregarding the nested proof structure.
1849 ML bindings introduced by 'ML_prf' are discarded at the end of the
1850 proof. (Requires Poly/ML 5.2 or later.)
1852 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1853 and Method.setup, as well as Isar commands 'attribute_setup' and
1854 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1855 existing code accordingly, or use plain 'setup' together with old
1858 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1859 to 'a -> thm, while results are always tagged with an authentic oracle
1860 name. The Isar command 'oracle' is now polymorphic, no argument type
1861 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1862 accordingly. Note that extra performance may be gained by producing
1863 the cterm carefully, avoiding slow Thm.cterm_of.
1865 * Simplified interface for defining document antiquotations via
1866 ThyOutput.antiquotation, ThyOutput.output, and optionally
1867 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1868 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1871 * More systematic treatment of long names, abstract name bindings, and
1872 name space operations. Basic operations on qualified names have been
1873 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1874 Long_Name.append. Old type bstring has been mostly replaced by
1875 abstract type binding (see structure Binding), which supports precise
1876 qualification by packages and local theory targets, as well as proper
1877 tracking of source positions. INCOMPATIBILITY, need to wrap old
1878 bstring values into Binding.name, or better pass through abstract
1879 bindings everywhere. See further src/Pure/General/long_name.ML,
1880 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1882 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1883 LocalTheory.note etc.) now refer to the *full* internal name, not the
1884 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1886 * Disposed old type and term read functions (Sign.read_def_typ,
1887 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1888 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1889 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1890 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1891 resort for legacy applications.
1893 * Disposed old declarations, tactics, tactic combinators that refer to
1894 the simpset or claset of an implicit theory (such as Addsimps,
1895 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1896 embedded ML text, or local_simpset_of with a proper context passed as
1897 explicit runtime argument.
1899 * Rules and tactics that read instantiations (read_instantiate,
1900 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1901 context, which is required for parsing and type-checking. Moreover,
1902 the variables are specified as plain indexnames, not string encodings
1903 thereof. INCOMPATIBILITY.
1905 * Generic Toplevel.add_hook interface allows to analyze the result of
1906 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1907 for theorem dependency output of transactions resulting in a new
1910 * ML antiquotations: block-structured compilation context indicated by
1911 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1913 @{binding name} - basic name binding
1914 @{let ?pat = term} - term abbreviation (HO matching)
1915 @{note name = fact} - fact abbreviation
1916 @{thm fact} - singleton fact (with attributes)
1917 @{thms fact} - general fact (with attributes)
1918 @{lemma prop by method} - singleton goal
1919 @{lemma prop by meth1 meth2} - singleton goal
1920 @{lemma prop1 ... propN by method} - general goal
1921 @{lemma prop1 ... propN by meth1 meth2} - general goal
1922 @{lemma (open) ...} - open derivation
1927 * The Isabelle "emacs" tool provides a specific interface to invoke
1928 Proof General / Emacs, with more explicit failure if that is not
1929 installed (the old isabelle-interface script silently falls back on
1930 isabelle-process). The PROOFGENERAL_HOME setting determines the
1931 installation location of the Proof General distribution.
1933 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1934 the Isabelle process into a JVM/Scala application. See
1935 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1936 process wrapper has been discontinued.)
1938 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1940 * Various status messages (with exact source position information) are
1941 emitted, if proper markup print mode is enabled. This allows
1942 user-interface components to provide detailed feedback on internal
1947 New in Isabelle2008 (June 2008)
1948 -------------------------------
1952 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1953 and updated, with formally checked references as hyperlinks.
1955 * Theory loader: use_thy (and similar operations) no longer set the
1956 implicit ML context, which was occasionally hard to predict and in
1957 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1958 provides a proper context already.
1960 * Theory loader: old-style ML proof scripts being *attached* to a thy
1961 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1962 'use' within a theory file will do the job.
1964 * Name space merge now observes canonical order, i.e. the second space
1965 is inserted into the first one, while existing entries in the first
1966 space take precedence. INCOMPATIBILITY in rare situations, may try to
1967 swap theory imports.
1969 * Syntax: symbol \<chi> is now considered a letter. Potential
1970 INCOMPATIBILITY in identifier syntax etc.
1972 * Outer syntax: string tokens no longer admit escaped white space,
1973 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1974 white space without escapes.
1976 * Outer syntax: string tokens may contain arbitrary character codes
1977 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1983 * Context-dependent token translations. Default setup reverts locally
1984 fixed variables, and adds hilite markup for undeclared frees.
1986 * Unused theorems can be found using the new command 'unused_thms'.
1987 There are three ways of invoking it:
1990 Only finds unused theorems in the current theory.
1992 (2) unused_thms thy_1 ... thy_n -
1993 Finds unused theorems in the current theory and all of its ancestors,
1994 excluding the theories thy_1 ... thy_n and all of their ancestors.
1996 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1997 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1998 their ancestors, excluding the theories thy_1 ... thy_n and all of
2001 In order to increase the readability of the list produced by
2002 unused_thms, theorems that have been created by a particular instance
2003 of a theory command such as 'inductive' or 'function' are considered
2004 to belong to the same "group", meaning that if at least one theorem in
2005 this group is used, the other theorems in the same group are no longer
2006 reported as unused. Moreover, if all theorems in the group are
2007 unused, only one theorem in the group is displayed.
2009 Note that proof objects have to be switched on in order for
2010 unused_thms to work properly (i.e. !proofs must be >= 1, which is
2011 usually the case when using Proof General with the default settings).
2013 * Authentic naming of facts disallows ad-hoc overwriting of previous
2014 theorems within the same name space. INCOMPATIBILITY, need to remove
2015 duplicate fact bindings, or even accidental fact duplications. Note
2016 that tools may maintain dynamically scoped facts systematically, using
2017 PureThy.add_thms_dynamic.
2019 * Command 'hide' now allows to hide from "fact" name space as well.
2021 * Eliminated destructive theorem database, simpset, claset, and
2022 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
2023 update of theories within ML code.
2025 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2026 INCOMPATIBILITY, object-logics depending on former Pure require
2027 additional setup PureThy.old_appl_syntax_setup; object-logics
2028 depending on former CPure need to refer to Pure.
2030 * Commands 'use' and 'ML' are now purely functional, operating on
2031 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2032 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2035 * Command 'setup': discontinued implicit version with ML reference.
2037 * Instantiation target allows for simultaneous specification of class
2038 instance operations together with an instantiation proof.
2039 Type-checking phase allows to refer to class operations uniformly.
2040 See src/HOL/Complex/Complex.thy for an Isar example and
2041 src/HOL/Library/Eval.thy for an ML example.
2043 * Indexing of literal facts: be more serious about including only
2044 facts from the visible specification/proof context, but not the
2045 background context (locale etc.). Affects `prop` notation and method
2046 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2049 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2050 "(open)" option, which used to expose internal bound variables to the
2053 * Isar statements: removed obsolete case "rule_context".
2054 INCOMPATIBILITY, better use explicit fixes/assumes.
2056 * Locale proofs: default proof step now includes 'unfold_locales';
2057 hence 'proof' without argument may be used to unfold locale
2061 *** Document preparation ***
2063 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2064 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2065 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2066 spot); renamed link color from "darkblue" to "linkcolor" (default
2067 value unchanged, can be redefined via \definecolor); no longer sets
2068 "a4paper" option (unnecessary or even intrusive).
2070 * Antiquotation @{lemma A method} proves proposition A by the given
2071 method (either a method name or a method name plus (optional) method
2072 arguments in parentheses) and prints A just like @{prop A}.
2077 * New primrec package. Specification syntax conforms in style to
2078 definition/function/.... No separate induction rule is provided. The
2079 "primrec" command distinguishes old-style and new-style specifications
2080 by syntax. The former primrec package is now named OldPrimrecPackage.
2081 When adjusting theories, beware: constants stemming from new-style
2082 primrec specifications have authentic syntax.
2084 * Metis prover is now an order of magnitude faster, and also works
2085 with multithreading.
2087 * Metis: the maximum number of clauses that can be produced from a
2088 theorem is now given by the attribute max_clauses. Theorems that
2089 exceed this number are ignored, with a warning printed.
2091 * Sledgehammer no longer produces structured proofs by default. To
2092 enable, declare [[sledgehammer_full = true]]. Attributes
2093 reconstruction_modulus, reconstruction_sorts renamed
2094 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2096 * Method "induct_scheme" derives user-specified induction rules
2097 from well-founded induction and completeness of patterns. This factors
2098 out some operations that are done internally by the function package
2099 and makes them available separately. See
2100 src/HOL/ex/Induction_Scheme.thy for examples.
2102 * More flexible generation of measure functions for termination
2103 proofs: Measure functions can be declared by proving a rule of the
2104 form "is_measure f" and giving it the [measure_function] attribute.
2105 The "is_measure" predicate is logically meaningless (always true), and
2106 just guides the heuristic. To find suitable measure functions, the
2107 termination prover sets up the goal "is_measure ?f" of the appropriate
2108 type and generates all solutions by prolog-style backwards proof using
2111 This setup also deals with rules like
2113 "is_measure f ==> is_measure (list_size f)"
2115 which accommodates nested datatypes that recurse through lists.
2116 Similar rules are predeclared for products and option types.
2118 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2122 - Definitions of overloaded constants on sets have to be replaced by
2123 definitions on => and bool.
2125 - Some definitions of overloaded operators on sets can now be proved
2126 using the definitions of the operators on => and bool. Therefore,
2127 the following theorems have been renamed:
2129 subset_def -> subset_eq
2130 psubset_def -> psubset_eq
2131 set_diff_def -> set_diff_eq
2132 Compl_def -> Compl_eq
2133 Sup_set_def -> Sup_set_eq
2134 Inf_set_def -> Inf_set_eq
2135 sup_set_def -> sup_set_eq
2136 inf_set_def -> inf_set_eq
2138 - Due to the incompleteness of the HO unification algorithm, some
2139 rules such as subst may require manual instantiation, if some of
2140 the unknowns in the rule is a set.
2142 - Higher order unification and forward proofs:
2145 have "P (S::'a set)" <...>
2146 then have "EX S. P S" ..
2148 no longer works (due to the incompleteness of the HO unification
2149 algorithm) and must be replaced by the pattern
2156 - Calculational reasoning with subst (or similar rules):
2159 have "P (S::'a set)" <...>
2160 also have "S = T" <...>
2161 finally have "P T" .
2163 no longer works (for similar reasons as the previous example) and
2164 must be replaced by something like
2166 have "P (S::'a set)" <...>
2167 moreover have "S = T" <...>
2168 ultimately have "P T" by simp
2170 - Tactics or packages written in ML code:
2171 Code performing pattern matching on types via
2173 Type ("set", [T]) => ...
2175 must be rewritten. Moreover, functions like strip_type or
2176 binder_types no longer return the right value when applied to a
2179 T1 => ... => Tn => U => bool
2183 T1 => ... => Tn => U set
2185 * Merged theories Wellfounded_Recursion, Accessible_Part and
2186 Wellfounded_Relations to theory Wellfounded.
2188 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2190 * Class finite no longer treats UNIV as class parameter. Use class
2191 enum from theory Library/Enum instead to achieve a similar effect.
2194 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2195 and "Cons". INCOMPATIBILITY.
2197 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2198 Potential INCOMPATIBILITY.
2200 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2201 injective_fst_snd removed, use split_eta and prod_eqI instead.
2202 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2204 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2205 the same name in theory Orderings:
2215 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2216 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2217 and different variable names.
2219 * Library/Option_ord.thy: Canonical order on option type.
2221 * Library/RBT.thy: Red-black trees, an efficient implementation of
2224 * Library/Countable.thy: Type class for countable types.
2226 * Theory Int: The representation of numerals has changed. The infix
2227 operator BIT and the bit datatype with constructors B0 and B1 have
2228 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2229 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2230 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2233 * Theory Nat: definition of <= and < on natural numbers no longer
2234 depend on well-founded relations. INCOMPATIBILITY. Definitions
2235 le_def and less_def have disappeared. Consider lemmas not_less
2236 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2238 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2239 (whose purpose mainly is for various fold_set functionals) have been
2240 abandoned in favor of the existing algebraic classes
2241 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2242 lower_semilattice (resp. upper_semilattice) and linorder.
2245 * Theory Transitive_Closure: induct and cases rules now declare proper
2246 case_names ("base" and "step"). INCOMPATIBILITY.
2248 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2249 lattices. The form set-specific version is available as
2250 Inductive.lfp_ordinal_induct_set.
2252 * Renamed theorems "power.simps" to "power_int.simps".
2255 * Class semiring_div provides basic abstract properties of semirings
2256 with division and modulo operations. Subsumes former class dvd_mod.
2258 * Merged theories IntDef, Numeral and IntArith into unified theory
2259 Int. INCOMPATIBILITY.
2261 * Theory Library/Code_Index: type "index" now represents natural
2262 numbers rather than integers. INCOMPATIBILITY.
2264 * New class "uminus" with operation "uminus" (split of from class
2265 "minus" which now only has operation "minus", binary).
2268 * Constants "card", "internal_split", "option_map" now with authentic
2269 syntax. INCOMPATIBILITY.
2271 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2272 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2273 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2274 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2275 Sup_set_def, le_def, less_def, option_map_def now with object
2276 equality. INCOMPATIBILITY.
2278 * Records. Removed K_record, and replaced it by pure lambda term
2279 %x. c. The simplifier setup is now more robust against eta expansion.
2280 INCOMPATIBILITY: in cases explicitly referring to K_record.
2282 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2284 * Library/ListVector: new theory of arithmetic vector operations.
2286 * Library/Order_Relation: new theory of various orderings as sets of
2287 pairs. Defines preorders, partial orders, linear orders and
2288 well-orders on sets and on types.
2293 * Renamed some theories to allow to loading both ZF and HOL in the
2296 Datatype -> Datatype_ZF
2297 Inductive -> Inductive_ZF
2304 INCOMPATIBILITY: ZF theories that import individual theories below
2305 Main might need to be adapted. Regular theory Main is still
2306 available, as trivial extension of Main_ZF.
2311 * ML within Isar: antiquotation @{const name} or @{const
2312 name(typargs)} produces statically-checked Const term.
2314 * Functor NamedThmsFun: data is available to the user as dynamic fact
2315 (of the same name). Removed obsolete print command.
2317 * Removed obsolete "use_legacy_bindings" function.
2319 * The ``print mode'' is now a thread-local value derived from a global
2320 template (the former print_mode reference), thus access becomes
2321 non-critical. The global print_mode reference is for session
2322 management only; user-code should use print_mode_value,
2323 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2325 * Functions system/system_out provide a robust way to invoke external
2326 shell commands, with propagation of interrupts (requires Poly/ML
2327 5.2.1). Do not use OS.Process.system etc. from the basis library!
2332 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2333 in accordance with Proof General 3.7, which prefers GNU emacs.
2335 * isatool tty runs Isabelle process with plain tty interaction;
2336 optional line editor may be specified via ISABELLE_LINE_EDITOR
2337 setting, the default settings attempt to locate "ledit" and "rlwrap".
2339 * isatool browser now works with Cygwin as well, using general
2340 "javapath" function defined in Isabelle process environment.
2342 * YXML notation provides a simple and efficient alternative to
2343 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2344 isatool yxml as described in the Isabelle system manual.
2346 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2347 provides general wrapper for managing an Isabelle process in a robust
2348 fashion, with ``cooked'' output from stdin/stderr.
2350 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2351 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2353 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2354 way of changing the user's settings is via
2355 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2358 * Multithreading.max_threads := 0 refers to the number of actual CPU
2359 cores of the underlying machine, which is a good starting point for
2360 optimal performance tuning. The corresponding usedir option -M allows
2361 "max" as an alias for "0". WARNING: does not work on certain versions
2362 of Mac OS (with Poly/ML 5.1).
2364 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2365 adverse effect of Isabelle flooding interactive front-ends (notably
2366 ProofGeneral / XEmacs).
2370 New in Isabelle2007 (November 2007)
2371 -----------------------------------
2375 * More uniform information about legacy features, notably a
2376 warning/error of "Legacy feature: ...", depending on the state of the
2377 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2378 legacy features will disappear eventually.
2380 * Theory syntax: the header format ``theory A = B + C:'' has been
2381 discontinued in favour of ``theory A imports B C begin''. Use isatool
2382 fixheaders to convert existing theory files. INCOMPATIBILITY.
2384 * Theory syntax: the old non-Isar theory file format has been
2385 discontinued altogether. Note that ML proof scripts may still be used
2386 with Isar theories; migration is usually quite simple with the ML
2387 function use_legacy_bindings. INCOMPATIBILITY.
2389 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2390 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2393 * Theory loader: be more serious about observing the static theory
2394 header specifications (including optional directories), but not the
2395 accidental file locations of previously successful loads. The strict
2396 update policy of former update_thy is now already performed by
2397 use_thy, so the former has been removed; use_thys updates several
2398 theories simultaneously, just as 'imports' within a theory header
2399 specification, but without merging the results. Potential
2400 INCOMPATIBILITY: may need to refine theory headers and commands
2401 ROOT.ML which depend on load order.
2403 * Theory loader: optional support for content-based file
2404 identification, instead of the traditional scheme of full physical
2405 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2406 (cf. the system manual). The new scheme allows to work with
2407 non-finished theories in persistent session images, such that source
2408 files may be moved later on without requiring reloads.
2410 * Theory loader: old-style ML proof scripts being *attached* to a thy
2411 file (with the same base name as the theory) are considered a legacy
2412 feature, which will disappear eventually. Even now, the theory loader
2413 no longer maintains dependencies on such files.
2415 * Syntax: the scope for resolving ambiguities via type-inference is
2416 now limited to individual terms, instead of whole simultaneous
2417 specifications as before. This greatly reduces the complexity of the
2418 syntax module and improves flexibility by separating parsing and
2419 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2420 'fixes' etc.) are required in rare situations.
2422 * Syntax: constants introduced by new-style packages ('definition',
2423 'abbreviation' etc.) are passed through the syntax module in
2424 ``authentic mode''. This means that associated mixfix annotations
2425 really stick to such constants, independently of potential name space
2426 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2427 trees are represented slightly differently, may need to adapt syntax
2428 translations accordingly. Use CONST marker in 'translations' and
2429 @{const_syntax} antiquotation in 'parse_translation' etc.
2431 * Legacy goal package: reduced interface to the bare minimum required
2432 to keep existing proof scripts running. Most other user-level
2433 functions are now part of the OldGoals structure, which is *not* open
2434 by default (consider isatool expandshort before open OldGoals).
2435 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2436 these tend to cause confusion about the actual goal (!) context being
2437 used here, which is not necessarily the same as the_context().
2439 * Command 'find_theorems': supports "*" wild-card in "name:"
2440 criterion; "with_dups" option. Certain ProofGeneral versions might
2441 support a specific search form (see ProofGeneral/CHANGES).
2443 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2444 by default, which means that "prems" (and also "fixed variables") are
2445 suppressed from proof state output. Note that the ProofGeneral
2446 settings mechanism allows to change and save options persistently, but
2447 older versions of Isabelle will fail to start up if a negative prems
2450 * Local theory targets may be specified by non-nested blocks of
2451 ``context/locale/class ... begin'' followed by ``end''. The body may
2452 contain definitions, theorems etc., including any derived mechanism
2453 that has been implemented on top of these primitives. This concept
2454 generalizes the existing ``theorem (in ...)'' towards more versatility
2457 * Proof General interface: proper undo of final 'end' command;
2458 discontinued Isabelle/classic mode (ML proof scripts).
2461 *** Document preparation ***
2463 * Added antiquotation @{theory name} which prints the given name,
2464 after checking that it refers to a valid ancestor theory in the
2467 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2468 check the given source text as ML type/structure, printing verbatim.
2470 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2471 "c args == rhs" given in the current context. (Any number of
2472 arguments may be given on the LHS.)
2477 * The 'class' package offers a combination of axclass and locale to
2478 achieve Haskell-like type classes in Isabelle. Definitions and
2479 theorems within a class context produce both relative results (with
2480 implicit parameters according to the locale context), and polymorphic
2481 constants with qualified polymorphism (according to the class
2482 context). Within the body context of a 'class' target, a separate
2483 syntax layer ("user space type system") takes care of converting
2484 between global polymorphic consts and internal locale representation.
2485 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2486 "isatool doc classes" provides a tutorial.
2488 * Generic code generator framework allows to generate executable
2489 code for ML and Haskell (including Isabelle classes). A short usage
2492 internal compilation:
2493 export_code <list of constants (term syntax)> in SML
2494 writing SML code to a file:
2495 export_code <list of constants (term syntax)> in SML <filename>
2496 writing OCaml code to a file:
2497 export_code <list of constants (term syntax)> in OCaml <filename>
2498 writing Haskell code to a bunch of files:
2499 export_code <list of constants (term syntax)> in Haskell <filename>
2501 evaluating closed propositions to True/False using code generation:
2504 Reasonable default setup of framework in HOL.
2506 Theorem attributs for selecting and transforming function equations theorems:
2508 [code fun]: select a theorem as function equation for a specific constant
2509 [code fun del]: deselect a theorem as function equation for a specific constant
2510 [code inline]: select an equation theorem for unfolding (inlining) in place
2511 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2513 User-defined serializations (target in {SML, OCaml, Haskell}):
2515 code_const <and-list of constants (term syntax)>
2516 {(target) <and-list of const target syntax>}+
2518 code_type <and-list of type constructors>
2519 {(target) <and-list of type target syntax>}+
2521 code_instance <and-list of instances>
2523 where instance ::= <type constructor> :: <class>
2525 code_class <and_list of classes>
2526 {(target) <and-list of class target syntax>}+
2527 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2529 code_instance and code_class only are effective to target Haskell.
2531 For example usage see src/HOL/ex/Codegenerator.thy and
2532 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2533 generation from Isabelle/HOL theories is available via "isatool doc
2536 * Code generator: consts in 'consts_code' Isar commands are now
2537 referred to by usual term syntax (including optional type
2540 * Command 'no_translations' removes translation rules from theory
2543 * Overloaded definitions are now actually checked for acyclic
2544 dependencies. The overloading scheme is slightly more general than
2545 that of Haskell98, although Isabelle does not demand an exact
2546 correspondence to type class and instance declarations.
2547 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2548 exotic versions of overloading -- at the discretion of the user!
2550 Polymorphic constants are represented via type arguments, i.e. the
2551 instantiation that matches an instance against the most general
2552 declaration given in the signature. For example, with the declaration
2553 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2554 as c(nat). Overloading is essentially simultaneous structural
2555 recursion over such type arguments. Incomplete specification patterns
2556 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2557 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2558 Command 'print_theory' outputs the normalized system of recursive
2559 equations, see section "definitions".
2561 * Configuration options are maintained within the theory or proof
2562 context (with name and type bool/int/string), providing a very simple
2563 interface to a poor-man's version of general context data. Tools may
2564 declare options in ML (e.g. using Attrib.config_int) and then refer to
2565 these values using Config.get etc. Users may change options via an
2566 associated attribute of the same name. This form of context
2567 declaration works particularly well with commands 'declare' or
2568 'using', for example ``declare [[foo = 42]]''. Thus it has become
2569 very easy to avoid global references, which would not observe Isar
2570 toplevel undo/redo and fail to work with multithreading.
2572 Various global ML references of Pure and HOL have been turned into
2573 configuration options:
2575 Unify.search_bound unify_search_bound
2576 Unify.trace_bound unify_trace_bound
2577 Unify.trace_simp unify_trace_simp
2578 Unify.trace_types unify_trace_types
2579 Simplifier.simp_depth_limit simp_depth_limit
2580 Blast.depth_limit blast_depth_limit
2581 DatatypeProp.dtK datatype_distinctness_limit
2582 fast_arith_neq_limit fast_arith_neq_limit
2583 fast_arith_split_limit fast_arith_split_limit
2585 * Named collections of theorems may be easily installed as context
2586 data using the functor NamedThmsFun (see also
2587 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2588 attributes; there is also a toplevel print command. This facility is
2589 just a common case of general context data, which is the preferred way
2590 for anything more complex than just a list of facts in canonical
2593 * Isar: command 'declaration' augments a local theory by generic
2594 declaration functions written in ML. This enables arbitrary content
2595 being added to the context, depending on a morphism that tells the
2596 difference of the original declaration context wrt. the application
2597 context encountered later on.
2599 * Isar: proper interfaces for simplification procedures. Command
2600 'simproc_setup' declares named simprocs (with match patterns, and body
2601 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2602 context. ML antiquotation @{simproc name} retrieves named simprocs.
2604 * Isar: an extra pair of brackets around attribute declarations
2605 abbreviates a theorem reference involving an internal dummy fact,
2606 which will be ignored later --- only the effect of the attribute on
2607 the background context will persist. This form of in-place
2608 declarations is particularly useful with commands like 'declare' and
2609 'using', for example ``have A using [[simproc a]] by simp''.
2611 * Isar: method "assumption" (and implicit closing of subproofs) now
2612 takes simple non-atomic goal assumptions into account: after applying
2613 an assumption as a rule the resulting subgoals are solved by atomic
2614 assumption steps. This is particularly useful to finish 'obtain'
2615 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2616 without referring to the original premise "!!x. P x ==> thesis" in the
2617 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2620 * Isar: implicit use of prems from the Isar proof context is
2621 considered a legacy feature. Common applications like ``have A .''
2622 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2623 referencing facts explicitly here improves readability and
2624 maintainability of proof texts.
2626 * Isar: improper proof element 'guess' is like 'obtain', but derives
2627 the obtained context from the course of reasoning! For example:
2629 assume "EX x y. A x & B y" -- "any previous fact"
2630 then guess x and y by clarify
2632 This technique is potentially adventurous, depending on the facts and
2633 proof tools being involved here.
2635 * Isar: known facts from the proof context may be specified as literal
2636 propositions, using ASCII back-quote syntax. This works wherever
2637 named facts used to be allowed so far, in proof commands, proof
2638 methods, attributes etc. Literal facts are retrieved from the context
2639 according to unification of type and term parameters. For example,
2640 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2641 theorems in the current context, then these are valid literal facts:
2642 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2644 There is also a proof method "fact" which does the same composition
2645 for explicit goal states, e.g. the following proof texts coincide with
2646 certain special cases of literal facts:
2648 have "A" by fact == note `A`
2649 have "A ==> B" by fact == note `A ==> B`
2650 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2651 have "P a ==> Q a" by fact == note `P a ==> Q a`
2653 * Isar: ":" (colon) is no longer a symbolic identifier character in
2654 outer syntax. Thus symbolic identifiers may be used without
2655 additional white space in declarations like this: ``assume *: A''.
2657 * Isar: 'print_facts' prints all local facts of the current context,
2658 both named and unnamed ones.
2660 * Isar: 'def' now admits simultaneous definitions, e.g.:
2662 def x == "t" and y == "u"
2664 * Isar: added command 'unfolding', which is structurally similar to
2665 'using', but affects both the goal state and facts by unfolding given
2666 rewrite rules. Thus many occurrences of the 'unfold' method or
2667 'unfolded' attribute may be replaced by first-class proof text.
2669 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2670 and command 'unfolding' now all support object-level equalities
2671 (potentially conditional). The underlying notion of rewrite rule is
2672 analogous to the 'rule_format' attribute, but *not* that of the
2673 Simplifier (which is usually more generous).
2675 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2676 premises of a theorem by n. Useful in conjunction with drule.
2678 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2679 method expression within a sandbox consisting of the first N
2680 sub-goals, which need to exist. For example, ``simp_all [3]''
2681 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2682 simplifies all new goals that emerge from applying rule foo to the
2683 originally first one.
2685 * Isar: schematic goals are no longer restricted to higher-order
2686 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2689 * Isar: the conclusion of a long theorem statement is now either
2690 'shows' (a simultaneous conjunction, as before), or 'obtains'
2691 (essentially a disjunction of cases with local parameters and
2692 assumptions). The latter allows to express general elimination rules
2693 adequately; in this notation common elimination rules look like this:
2695 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2697 obtains x where "P x"
2699 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2703 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2709 The subsequent classical rules even refer to the formal "thesis"
2712 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2715 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2716 obtains "thesis ==> something"
2718 The actual proof of an 'obtains' statement is analogous to that of the
2719 Isar proof element 'obtain', only that there may be several cases.
2720 Optional case names may be specified in parentheses; these will be
2721 available both in the present proof and as annotations in the
2722 resulting rule, for later use with the 'cases' method (cf. attribute
2725 * Isar: the assumptions of a long theorem statement are available as
2726 "assms" fact in the proof context. This is more appropriate than the
2727 (historical) "prems", which refers to all assumptions of the current
2728 context, including those from the target locale, proof body etc.
2730 * Isar: 'print_statement' prints theorems from the current theory or
2731 proof context in long statement form, according to the syntax of a
2734 * Isar: 'obtain' takes an optional case name for the local context
2735 introduction rule (default "that").
2737 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2738 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2741 * Pure: syntax "CONST name" produces a fully internalized constant
2742 according to the current context. This is particularly useful for
2743 syntax translations that should refer to internal constant
2744 representations independently of name spaces.
2746 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2747 instead of "FOO ". This allows multiple binder declarations to coexist
2748 in the same context. INCOMPATIBILITY.
2750 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2751 primitive that also works in a locale context (both for constants and
2752 fixed variables). Type declaration and internal syntactic representation
2753 of given constants retrieved from the context. Likewise, the
2754 'no_notation' command allows to remove given syntax annotations from the
2757 * Isar/locales: new derived specification elements 'axiomatization',
2758 'definition', 'abbreviation', which support type-inference, admit
2759 object-level specifications (equality, equivalence). See also the
2760 isar-ref manual. Examples:
2763 eq (infix "===" 50) where
2764 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2766 definition "f x y = x + y + 1"
2767 definition g where "g x = f x x"
2770 neq (infix "=!=" 50) where
2771 "x =!= y == ~ (x === y)"
2773 These specifications may be also used in a locale context. Then the
2774 constants being introduced depend on certain fixed parameters, and the
2775 constant name is qualified by the locale base name. An internal
2776 abbreviation takes care for convenient input and output, making the
2777 parameters implicit and using the original short name. See also
2778 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2779 entities from a monomorphic theory.
2781 Presently, abbreviations are only available 'in' a target locale, but
2782 not inherited by general import expressions. Also note that
2783 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2784 'translations' in common applications. The "no_abbrevs" print mode
2785 prevents folding of abbreviations in term output.
2787 Concrete syntax is attached to specified constants in internal form,
2788 independently of name spaces. The parse tree representation is
2789 slightly different -- use 'notation' instead of raw 'syntax', and
2790 'translations' with explicit "CONST" markup to accommodate this.
2792 * Pure/Isar: unified syntax for new-style specification mechanisms
2793 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2794 full type inference and dummy patterns ("_"). For example:
2796 definition "K x _ = x"
2798 inductive conj for A B
2799 where "A ==> B ==> conj A B"
2801 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2802 the current context. Print mode "no_abbrevs" prevents inversion of
2803 abbreviations on output.
2805 * Isar/locales: improved parameter handling: use of locales "var" and
2806 "struct" no longer necessary; - parameter renamings are no longer
2807 required to be injective. For example, this allows to define
2808 endomorphisms as locale endom = homom mult mult h.
2810 * Isar/locales: changed the way locales with predicates are defined.
2811 Instead of accumulating the specification, the imported expression is
2812 now an interpretation. INCOMPATIBILITY: different normal form of
2813 locale expressions. In particular, in interpretations of locales with
2814 predicates, goals repesenting already interpreted fragments are not
2815 removed automatically. Use methods `intro_locales' and
2816 `unfold_locales'; see below.
2818 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2819 provide backward reasoning on locales predicates. The methods are
2820 aware of interpretations and discharge corresponding goals.
2821 `intro_locales' is less aggressive then `unfold_locales' and does not
2822 unfold predicates to assumptions.
2824 * Isar/locales: the order in which locale fragments are accumulated
2825 has changed. This enables to override declarations from fragments due
2826 to interpretations -- for example, unwanted simp rules.
2828 * Isar/locales: interpretation in theories and proof contexts has been
2829 extended. One may now specify (and prove) equations, which are
2830 unfolded in interpreted theorems. This is useful for replacing
2831 defined concepts (constants depending on locale parameters) by
2832 concepts already existing in the target context. Example:
2834 interpretation partial_order ["op <= :: [int, int] => bool"]
2835 where "partial_order.less (op <=) (x::int) y = (x < y)"
2837 Typically, the constant `partial_order.less' is created by a
2838 definition specification element in the context of locale
2841 * Method "induct": improved internal context management to support
2842 local fixes and defines on-the-fly. Thus explicit meta-level
2843 connectives !! and ==> are rarely required anymore in inductive goals
2844 (using object-logic connectives for this purpose has been long
2845 obsolete anyway). Common proof patterns are explained in
2846 src/HOL/Induct/Common_Patterns.thy, see also
2847 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2850 * Method "induct": improved handling of simultaneous goals. Instead of
2851 introducing object-level conjunction, the statement is now split into
2852 several conclusions, while the corresponding symbolic cases are nested
2853 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2854 see src/HOL/Induct/Common_Patterns.thy, for example.
2856 * Method "induct": mutual induction rules are now specified as a list
2857 of rule sharing the same induction cases. HOL packages usually provide
2858 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2859 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2860 mutual induction rules differently, i.e. like this:
2862 (induct rule: foo_bar.inducts)
2863 (induct set: foo bar)
2864 (induct pred: foo bar)
2865 (induct type: foo bar)
2867 The ML function ProjectRule.projections turns old-style rules into the
2870 * Method "coinduct": dual of induction, see
2871 src/HOL/Library/Coinductive_List.thy for various examples.
2873 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2874 considered a legacy feature.
2876 * Attribute "symmetric" produces result with standardized schematic
2877 variables (index 0). Potential INCOMPATIBILITY.
2879 * Simplifier: by default the simplifier trace only shows top level
2880 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2881 default. Thus there is less danger of being flooded by the trace. The
2882 trace indicates where parts have been suppressed.
2884 * Provers/classical: removed obsolete classical version of elim_format
2885 attribute; classical elim/dest rules are now treated uniformly when
2886 manipulating the claset.
2888 * Provers/classical: stricter checks to ensure that supplied intro,
2889 dest and elim rules are well-formed; dest and elim rules must have at
2892 * Provers/classical: attributes dest/elim/intro take an optional
2893 weight argument for the rule (just as the Pure versions). Weights are
2894 ignored by automated tools, but determine the search order of single
2897 * Syntax: input syntax now supports dummy variable binding "%_. b",
2898 where the body does not mention the bound variable. Note that dummy
2899 patterns implicitly depend on their context of bounds, which makes
2900 "{_. _}" match any set comprehension as expected. Potential
2901 INCOMPATIBILITY -- parse translations need to cope with syntactic
2902 constant "_idtdummy" in the binding position.
2904 * Syntax: removed obsolete syntactic constant "_K" and its associated
2905 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2906 for example "A -> B" => "Pi A (%_. B)".
2908 * Pure: 'class_deps' command visualizes the subclass relation, using
2909 the graph browser tool.
2911 * Pure: 'print_theory' now suppresses certain internal declarations by
2912 default; use '!' option for full details.
2917 * Method "metis" proves goals by applying the Metis general-purpose
2918 resolution prover (see also http://gilith.com/software/metis/).
2919 Examples are in the directory MetisExamples. WARNING: the
2920 Isabelle/HOL-Metis integration does not yet work properly with
2923 * Command 'sledgehammer' invokes external automatic theorem provers as
2924 background processes. It generates calls to the "metis" method if
2925 successful. These can be pasted into the proof. Users do not have to
2926 wait for the automatic provers to return. WARNING: does not really
2927 work with multi-threading.
2929 * New "auto_quickcheck" feature tests outermost goal statements for
2930 potential counter-examples. Controlled by ML references
2931 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2932 5000 milliseconds). Fails silently if statements is outside of
2933 executable fragment, or any other codgenerator problem occurs.
2935 * New constant "undefined" with axiom "undefined x = undefined".
2937 * Added class "HOL.eq", allowing for code generation with polymorphic
2940 * Some renaming of class constants due to canonical name prefixing in
2941 the new 'class' package:
2943 HOL.abs ~> HOL.abs_class.abs
2944 HOL.divide ~> HOL.divide_class.divide
2945 0 ~> HOL.zero_class.zero
2946 1 ~> HOL.one_class.one
2947 op + ~> HOL.plus_class.plus
2948 op - ~> HOL.minus_class.minus
2949 uminus ~> HOL.minus_class.uminus
2950 op * ~> HOL.times_class.times
2951 op < ~> HOL.ord_class.less
2952 op <= > HOL.ord_class.less_eq
2953 Nat.power ~> Power.power_class.power
2954 Nat.size ~> Nat.size_class.size
2955 Numeral.number_of ~> Numeral.number_class.number_of
2956 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2957 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2958 Orderings.min ~> Orderings.ord_class.min
2959 Orderings.max ~> Orderings.ord_class.max
2960 Divides.op div ~> Divides.div_class.div
2961 Divides.op mod ~> Divides.div_class.mod
2962 Divides.op dvd ~> Divides.div_class.dvd
2964 INCOMPATIBILITY. Adaptions may be required in the following cases:
2966 a) User-defined constants using any of the names "plus", "minus",
2967 "times", "less" or "less_eq". The standard syntax translations for
2968 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2971 b) Variables named "plus", "minus", "times", "less", "less_eq"
2972 INCOMPATIBILITY: use more specific names.
2974 c) Permutative equations (e.g. "a + b = b + a")
2975 Since the change of names also changes the order of terms, permutative
2976 rewrite rules may get applied in a different order. Experience shows
2977 that this is rarely the case (only two adaptions in the whole Isabelle
2978 distribution). INCOMPATIBILITY: rewrite proofs
2980 d) ML code directly refering to constant names
2981 This in general only affects hand-written proof tactics, simprocs and
2982 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2983 Consider using @{const_name} antiquotation.
2985 * New class "default" with associated constant "default".
2987 * Function "sgn" is now overloaded and available on int, real, complex
2988 (and other numeric types), using class "sgn". Two possible defs of
2989 sgn are given as equational assumptions in the classes sgn_if and
2990 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2993 * Locale "partial_order" now unified with class "order" (cf. theory
2994 Orderings), added parameter "less". INCOMPATIBILITY.
2996 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2997 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2998 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
3000 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
3001 changed order of proof goals in instance proofs.
3003 * The transitivity reasoner for partial and linear orders is set up
3004 for classes "order" and "linorder". Instances of the reasoner are available
3005 in all contexts importing or interpreting the corresponding locales.
3006 Method "order" invokes the reasoner separately; the reasoner
3007 is also integrated with the Simplifier as a solver. Diagnostic
3008 command 'print_orders' shows the available instances of the reasoner
3009 in the current context.
3011 * Localized monotonicity predicate in theory "Orderings"; integrated
3012 lemmas max_of_mono and min_of_mono with this predicate.
3015 * Formulation of theorem "dense" changed slightly due to integration
3016 with new class dense_linear_order.
3018 * Uniform lattice theory development in HOL.
3020 constants "meet" and "join" now named "inf" and "sup"
3021 constant "Meet" now named "Inf"
3023 classes "meet_semilorder" and "join_semilorder" now named
3024 "lower_semilattice" and "upper_semilattice"
3025 class "lorder" now named "lattice"
3026 class "comp_lat" now named "complete_lattice"
3028 Instantiation of lattice classes allows explicit definitions
3029 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3031 INCOMPATIBILITY. Theorem renames:
3033 meet_left_le ~> inf_le1
3034 meet_right_le ~> inf_le2
3035 join_left_le ~> sup_ge1
3036 join_right_le ~> sup_ge2
3037 meet_join_le ~> inf_sup_ord
3040 le_meet ~> le_inf_iff
3041 le_join ~> ge_sup_conv
3042 meet_idempotent ~> inf_idem
3043 join_idempotent ~> sup_idem
3044 meet_comm ~> inf_commute
3045 join_comm ~> sup_commute
3046 meet_leI1 ~> le_infI1
3047 meet_leI2 ~> le_infI2
3048 le_joinI1 ~> le_supI1
3049 le_joinI2 ~> le_supI2
3050 meet_assoc ~> inf_assoc
3051 join_assoc ~> sup_assoc
3052 meet_left_comm ~> inf_left_commute
3053 meet_left_idempotent ~> inf_left_idem
3054 join_left_comm ~> sup_left_commute
3055 join_left_idempotent ~> sup_left_idem
3058 le_def_meet ~> le_iff_inf
3059 le_def_join ~> le_iff_sup
3060 join_absorp2 ~> sup_absorb2
3061 join_absorp1 ~> sup_absorb1
3062 meet_absorp1 ~> inf_absorb1
3063 meet_absorp2 ~> inf_absorb2
3064 meet_join_absorp ~> inf_sup_absorb
3065 join_meet_absorp ~> sup_inf_absorb
3066 distrib_join_le ~> distrib_sup_le
3067 distrib_meet_le ~> distrib_inf_le
3069 add_meet_distrib_left ~> add_inf_distrib_left
3070 add_join_distrib_left ~> add_sup_distrib_left
3071 is_join_neg_meet ~> is_join_neg_inf
3072 is_meet_neg_join ~> is_meet_neg_sup
3073 add_meet_distrib_right ~> add_inf_distrib_right
3074 add_join_distrib_right ~> add_sup_distrib_right
3075 add_meet_join_distribs ~> add_sup_inf_distribs
3076 join_eq_neg_meet ~> sup_eq_neg_inf
3077 meet_eq_neg_join ~> inf_eq_neg_sup
3078 add_eq_meet_join ~> add_eq_inf_sup
3079 meet_0_imp_0 ~> inf_0_imp_0
3080 join_0_imp_0 ~> sup_0_imp_0
3081 meet_0_eq_0 ~> inf_0_eq_0
3082 join_0_eq_0 ~> sup_0_eq_0
3083 neg_meet_eq_join ~> neg_inf_eq_sup
3084 neg_join_eq_meet ~> neg_sup_eq_inf
3085 join_eq_if ~> sup_eq_if
3087 mono_meet ~> mono_inf
3088 mono_join ~> mono_sup
3089 meet_bool_eq ~> inf_bool_eq
3090 join_bool_eq ~> sup_bool_eq
3091 meet_fun_eq ~> inf_fun_eq
3092 join_fun_eq ~> sup_fun_eq
3093 meet_set_eq ~> inf_set_eq
3094 join_set_eq ~> sup_set_eq
3095 meet1_iff ~> inf1_iff
3096 meet2_iff ~> inf2_iff
3105 join1_iff ~> sup1_iff
3106 join2_iff ~> sup2_iff
3116 is_meet_Meet ~> is_meet_Inf
3117 Meet_bool_def ~> Inf_bool_def
3118 Meet_fun_def ~> Inf_fun_def
3119 Meet_greatest ~> Inf_greatest
3120 Meet_lower ~> Inf_lower
3121 Meet_set_def ~> Inf_set_def
3124 Sup_bool_eq ~> Sup_bool_def
3125 Sup_fun_eq ~> Sup_fun_def
3126 Sup_set_eq ~> Sup_set_def
3128 listsp_meetI ~> listsp_infI
3129 listsp_meet_eq ~> listsp_inf_eq
3134 * Added syntactic class "size"; overloaded constant "size" now has
3135 type "'a::size ==> bool"
3137 * Internal reorganisation of `size' of datatypes: size theorems
3138 "foo.size" are no longer subsumed by "foo.simps" (but are still
3139 simplification rules by default!); theorems "prod.size" now named
3142 * Class "div" now inherits from class "times" rather than "type".
3145 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3146 Linorder etc. have disappeared; operations defined in terms of
3147 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3149 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3151 * HOL-Word: New extensive library and type for generic, fixed size
3152 machine words, with arithemtic, bit-wise, shifting and rotating
3153 operations, reflection into int, nat, and bool lists, automation for
3154 linear arithmetic (by automatic reflection into nat or int), including
3155 lemmas on overflow and monotonicity. Instantiated to all appropriate
3156 arithmetic type classes, supporting automatic simplification of
3157 numerals on all operations.
3159 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3161 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3163 * Code generator library theories:
3164 - Code_Integer represents HOL integers by big integer literals in target
3166 - Code_Char represents HOL characters by character literals in target
3168 - Code_Char_chr like Code_Char, but also offers treatment of character
3169 codes; includes Code_Integer.
3170 - Executable_Set allows to generate code for finite sets using lists.
3171 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3173 - Executable_Real implements a subset of real numbers, namly those
3174 representable by rational numbers.
3175 - Efficient_Nat implements natural numbers by integers, which in general will
3176 result in higher efficency; pattern matching with 0/Suc is eliminated;
3177 includes Code_Integer.
3178 - Code_Index provides an additional datatype index which is mapped to
3179 target-language built-in integers.
3180 - Code_Message provides an additional datatype message_string which is isomorphic to
3181 strings; messages are mapped to target-language strings.
3183 * New package for inductive predicates
3185 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3188 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3189 for z_1 :: U_1 and ... and z_n :: U_m
3191 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3194 with full support for type-inference, rather than
3196 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3198 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3199 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3201 inductive "s z_1 ... z_m"
3203 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3206 For backward compatibility, there is a wrapper allowing inductive
3207 sets to be defined with the new package via
3210 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3211 for z_1 :: U_1 and ... and z_n :: U_m
3213 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3219 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3220 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3221 for z_1 :: U_1 and ... and z_n :: U_m
3223 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3224 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3227 if the additional syntax "p ..." is required.
3229 Numerous examples can be found in the subdirectories src/HOL/Auth,
3230 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3234 - Since declaration and definition of inductive sets or predicates
3235 is no longer separated, abbreviations involving the newly
3236 introduced sets or predicates must be specified together with the
3237 introduction rules after the 'where' keyword (see above), rather
3238 than before the actual inductive definition.
3240 - The variables in induction and elimination rules are now
3241 quantified in the order of their occurrence in the introduction
3242 rules, rather than in alphabetical order. Since this may break
3243 some proofs, these proofs either have to be repaired, e.g. by
3244 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3245 statements of the form
3247 case (rule_i a_i_1 ... a_i_{k_i})
3249 or the old order of quantification has to be restored by explicitly adding
3250 meta-level quantifiers in the introduction rules, i.e.
3252 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3254 - The format of the elimination rules is now
3256 p z_1 ... z_m x_1 ... x_n ==>
3257 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3262 (x_1, ..., x_n) : s z_1 ... z_m ==>
3263 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3266 for sets rather than
3268 x : s z_1 ... z_m ==>
3269 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3272 This may require terms in goals to be expanded to n-tuples
3273 (e.g. using case_tac or simplification with the split_paired_all
3274 rule) before the above elimination rule is applicable.
3276 - The elimination or case analysis rules for (mutually) inductive
3277 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3278 list of rules "p_1_..._p_k.elims" is no longer available.
3280 * New package "function"/"fun" for general recursive functions,
3281 supporting mutual and nested recursion, definitions in local contexts,
3282 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3283 for small examples, and the separate tutorial on the function
3284 package. The old recdef "package" is still available as before, but
3285 users are encouraged to use the new package.
3287 * Method "lexicographic_order" automatically synthesizes termination
3288 relations as lexicographic combinations of size measures.
3290 * Case-expressions allow arbitrary constructor-patterns (including
3291 "_") and take their order into account, like in functional
3292 programming. Internally, this is translated into nested
3293 case-expressions; missing cases are added and mapped to the predefined
3294 constant "undefined". In complicated cases printing may no longer show
3295 the original input but the internal form. Lambda-abstractions allow
3296 the same form of pattern matching: "% pat1 => e1 | ..." is an
3297 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3300 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3301 is an abbreviation for "of_nat :: nat => int". The simplification
3302 rules for "of_nat" have been changed to work like "int" did
3303 previously. Potential INCOMPATIBILITY:
3304 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3305 - of_nat_diff and of_nat_mult are no longer default simp rules
3307 * Method "algebra" solves polynomial equations over (semi)rings using
3308 Groebner bases. The (semi)ring structure is defined by locales and the
3309 tool setup depends on that generic context. Installing the method for
3310 a specific type involves instantiating the locale and possibly adding
3311 declarations for computation on the coefficients. The method is
3312 already instantiated for natural numbers and for the axiomatic class
3313 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3314 CALCULEMUS 2007 for the general principles underlying this
3315 architecture of context-aware proof-tools.
3317 * Method "ferrack" implements quantifier elimination over
3318 special-purpose dense linear orders using locales (analogous to
3319 "algebra"). The method is already installed for class
3320 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3323 * Former constant "List.op @" now named "List.append". Use ML
3324 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3325 circumvent possible incompatibilities when working on ML level.
3327 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3329 * New function listsum :: 'a list => 'a for arbitrary monoids.
3330 Special syntax: "SUM x <- xs. f x" (and latex variants)
3332 * New syntax for Haskell-like list comprehension (input only), eg.
3333 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3335 * The special syntax for function "filter" has changed from [x :
3336 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3337 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3339 * [a..b] is now defined for arbitrary linear orders. It used to be
3340 defined on nat only, as an abbreviation for [a..<Suc b]
3343 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3345 * New functions "sorted" and "sort" in src/HOL/List.thy.
3347 * New lemma collection field_simps (an extension of ring_simps) for
3348 manipulating (in)equations involving division. Multiplies with all
3349 denominators that can be proved to be non-zero (in equations) or
3350 positive/negative (in inequations).
3352 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3353 have been improved and renamed to ring_simps, group_simps and
3354 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3355 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3357 * Theory Library/Commutative_Ring: switched from recdef to function
3358 package; constants add, mul, pow now curried. Infix syntax for
3359 algebraic operations.
3361 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3364 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3367 * HOL/records: generalised field-update to take a function on the
3368 field rather than the new value: r(|A := x|) is translated to A_update
3369 (K x) r The K-combinator that is internally used is called K_record.
3370 INCOMPATIBILITY: Usage of the plain update functions has to be
3373 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3374 * x = 0, which are required for a semiring. Richer structures do not
3375 inherit from semiring_0 anymore, because this property is a theorem
3376 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3377 there is more to prove, but this is mostly trivial.
3379 * Class "recpower" is generalized to arbitrary monoids, not just
3380 commutative semirings. INCOMPATIBILITY: may need to incorporate
3381 commutativity or semiring properties additionally.
3383 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3384 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3385 better use 'abbreviation'.
3387 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3389 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3390 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3391 significant changes for setting up numeral syntax for types:
3392 - New constants Numeral.pred and Numeral.succ instead
3393 of former Numeral.bin_pred and Numeral.bin_succ.
3394 - Use integer operations instead of bin_add, bin_mult and so on.
3395 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3396 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3398 See src/HOL/Integ/IntArith.thy for an example setup.
3400 * Command 'normal_form' computes the normal form of a term that may
3401 contain free variables. For example ``normal_form "rev [a, b, c]"''
3402 produces ``[b, c, a]'' (without proof). This command is suitable for
3403 heavy-duty computations because the functions are compiled to ML
3404 first. Correspondingly, a method "normalization" is provided. See
3405 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3407 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3408 25 like -->); output depends on the "iff" print_mode, the default is
3409 "A = B" (with priority 50).
3411 * Relations less (<) and less_eq (<=) are also available on type bool.
3412 Modified syntax to disallow nesting without explicit parentheses,
3413 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3416 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3418 * Relation composition operator "op O" now has precedence 75 and binds
3419 stronger than union and intersection. INCOMPATIBILITY.
3421 * The old set interval syntax "{m..n(}" (and relatives) has been
3422 removed. Use "{m..<n}" (and relatives) instead.
3424 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3425 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3426 ``declare [[simproc del: neq]]''.
3428 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3431 * Theorem Cons_eq_map_conv no longer declared as "simp".
3433 * Theorem setsum_mult renamed to setsum_right_distrib.
3435 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3438 * Reimplemented methods "sat" and "satx", with several improvements:
3439 goals no longer need to be stated as "<prems> ==> False", equivalences
3440 (i.e. "=" on type bool) are handled, variable names of the form
3441 "lit_<n>" are no longer reserved, significant speedup.
3443 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3444 zChaff is still supported as well.
3446 * 'inductive' and 'datatype': provide projections of mutual rules,
3447 bundled as foo_bar.inducts;
3449 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3452 * Library: moved theory Accessible_Part to main HOL.
3454 * Library: added theory Coinductive_List of potentially infinite lists
3455 as greatest fixed-point.
3457 * Library: added theory AssocList which implements (finite) maps as
3460 * Method "evaluation" solves goals (i.e. a boolean expression)
3461 efficiently by compiling it to ML. The goal is "proved" (via an
3462 oracle) if it evaluates to True.
3464 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3465 also when invoked by the simplifier. This results in the Simplifier
3466 being more powerful on arithmetic goals. INCOMPATIBILITY.
3467 Configuration option fast_arith_split_limit=0 recovers the old
3470 * Support for hex (0x20) and binary (0b1001) numerals.
3472 * New method: reify eqs (t), where eqs are equations for an
3473 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3474 parameter, computes a term s::'b and a list xs::'a list and proves the
3475 theorem I xs s = t. This is also known as reification or quoting. The
3476 resulting theorem is applied to the subgoal to substitute t with I xs
3477 s. If t is omitted, the subgoal itself is reified.
3479 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3480 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3481 where f is supposed to be a computable function (in the sense of code
3482 generattion). The method uses reify to compute s and xs as above then
3483 applies corr_thm and uses normalization by evaluation to "prove" f s =
3484 r and finally gets the theorem t = r, which is again applied to the
3485 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3487 * Reflection: Automatic reification now handels binding, an example is
3488 available in src/HOL/ex/ReflectionEx.thy
3490 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3491 command 'statespace' that is similar to 'record', but introduces an
3492 abstract specification based on the locale infrastructure instead of
3493 HOL types. This leads to extra flexibility in composing state spaces,
3494 in particular multiple inheritance and renaming of components.
3499 * Hyperreal: Functions root and sqrt are now defined on negative real
3500 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3501 Nonnegativity side conditions have been removed from many lemmas, so
3502 that more subgoals may now be solved by simplification; potential
3505 * Real: new type classes formalize real normed vector spaces and
3506 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3507 and norm :: 'a => real.
3509 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3510 reals into other types. The overloaded constant Reals :: 'a set is now
3511 defined as range of_real; potential INCOMPATIBILITY.
3513 * Real: proper support for ML code generation, including 'quickcheck'.
3514 Reals are implemented as arbitrary precision rationals.
3516 * Hyperreal: Several constants that previously worked only for the
3517 reals have been generalized, so they now work over arbitrary vector
3518 spaces. Type annotations may need to be added in some cases; potential
3521 Infinitesimal :: ('a::real_normed_vector) star set
3522 HFinite :: ('a::real_normed_vector) star set
3523 HInfinite :: ('a::real_normed_vector) star set
3524 approx :: ('a::real_normed_vector) star => 'a star => bool
3525 monad :: ('a::real_normed_vector) star => 'a star set
3526 galaxy :: ('a::real_normed_vector) star => 'a star set
3527 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3528 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3529 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3530 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3531 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3532 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3533 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3534 sgn :: 'a::real_normed_vector => 'a
3535 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3537 * Complex: Some complex-specific constants are now abbreviations for
3538 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3539 hnorm. Other constants have been entirely removed in favor of the
3540 polymorphic versions (INCOMPATIBILITY):
3544 HInfinite <-- CInfinite
3545 Infinitesimal <-- CInfinitesimal
3548 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3549 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3550 (ns)deriv <-- (ns)cderiv
3555 * Formalisation of ideals and the quotient construction over rings.
3557 * Order and lattice theory no longer based on records.
3560 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3561 greatest_closed. INCOMPATIBILITY.
3563 * Method algebra is now set up via an attribute. For examples see
3564 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3565 of algebraic structures.
3567 * Renamed theory CRing to Ring.
3572 * Substantial, yet incomplete support for nominal datatypes (binding
3573 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3574 src/HOL/Nominal/Examples. Prospective users should consult
3575 http://isabelle.in.tum.de/nominal/
3580 * ML basics: just one true type int, which coincides with IntInf.int
3583 * ML within Isar: antiquotations allow to embed statically-checked
3584 formal entities in the source, referring to the context available at
3585 compile-time. For example:
3587 ML {* @{sort "{zero,one}"} *}
3588 ML {* @{typ "'a => 'b"} *}
3589 ML {* @{term "%x. x"} *}
3590 ML {* @{prop "x == y"} *}
3591 ML {* @{ctyp "'a => 'b"} *}
3592 ML {* @{cterm "%x. x"} *}
3593 ML {* @{cprop "x == y"} *}
3594 ML {* @{thm asm_rl} *}
3595 ML {* @{thms asm_rl} *}
3596 ML {* @{type_name c} *}
3597 ML {* @{type_syntax c} *}
3598 ML {* @{const_name c} *}
3599 ML {* @{const_syntax c} *}
3602 ML {* @{theory Pure} *}
3603 ML {* @{theory_ref} *}
3604 ML {* @{theory_ref Pure} *}
3607 ML {* @{clasimpset} *}
3609 The same works for sources being ``used'' within an Isar context.
3611 * ML in Isar: improved error reporting; extra verbosity with
3612 ML_Context.trace enabled.
3614 * Pure/General/table.ML: the join operations now works via exceptions
3615 DUP/SAME instead of type option. This is simpler in simple cases, and
3616 admits slightly more efficient complex applications.
3618 * Pure: 'advanced' translation functions (parse_translation etc.) now
3619 use Context.generic instead of just theory.
3621 * Pure: datatype Context.generic joins theory/Proof.context and
3622 provides some facilities for code that works in either kind of
3623 context, notably GenericDataFun for uniform theory and proof data.
3625 * Pure: simplified internal attribute type, which is now always
3626 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3627 local (Proof.context) attributes have been discontinued, while
3628 minimizing code duplication. Thm.rule_attribute and
3629 Thm.declaration_attribute build canonical attributes; see also structure
3630 Context for further operations on Context.generic, notably
3631 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3632 declarations and definitions.
3634 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3635 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3636 init only required for impure data. INCOMPATIBILITY: empty really need
3637 to be empty (no dependencies on theory content!)
3639 * Pure/kernel: consts certification ignores sort constraints given in
3640 signature declarations. (This information is not relevant to the
3641 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3642 potential INCOMPATIBILITY.
3644 * Pure: axiomatic type classes are now purely definitional, with
3645 explicit proofs of class axioms and super class relations performed
3646 internally. See Pure/axclass.ML for the main internal interfaces --
3647 notably AxClass.define_class supercedes AxClass.add_axclass, and
3648 AxClass.axiomatize_class/classrel/arity supersede
3649 Sign.add_classes/classrel/arities.
3651 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3652 global/local versions on theory vs. Proof.context have been
3653 discontinued; Attrib.syntax and Method.syntax have been adapted
3654 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3655 attributes, methods, etc.
3657 * Pure: several functions of signature "... -> theory -> theory * ..."
3658 have been reoriented to "... -> theory -> ... * theory" in order to
3659 allow natural usage in combination with the ||>, ||>>, |-> and
3660 fold_map combinators.
3662 * Pure: official theorem names (closed derivations) and additional
3663 comments (tags) are now strictly separate. Name hints -- which are
3664 maintained as tags -- may be attached any time without affecting the
3667 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3668 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3669 achieve the old behaviour.
3671 * Pure: the "Goal" constant is now called "prop", supporting a
3672 slightly more general idea of ``protecting'' meta-level rule
3675 * Pure: Logic.(un)varify only works in a global context, which is now
3676 enforced instead of silently assumed. INCOMPATIBILITY, may use
3677 Logic.legacy_(un)varify as temporary workaround.
3679 * Pure: structure Name provides scalable operations for generating
3680 internal variable names, notably Name.variants etc. This replaces
3681 some popular functions from term.ML:
3683 Term.variant -> Name.variant
3684 Term.variantlist -> Name.variant_list
3685 Term.invent_names -> Name.invent_list
3687 Note that low-level renaming rarely occurs in new code -- operations
3688 from structure Variable are used instead (see below).
3690 * Pure: structure Variable provides fundamental operations for proper
3691 treatment of fixed/schematic variables in a context. For example,
3692 Variable.import introduces fixes for schematics of given facts and
3693 Variable.export reverses the effect (up to renaming) -- this replaces
3694 various freeze_thaw operations.
3696 * Pure: structure Goal provides simple interfaces for
3697 init/conclude/finish and tactical prove operations (replacing former
3698 Tactic.prove). Goal.prove is the canonical way to prove results
3699 within a given context; Goal.prove_global is a degraded version for
3700 theory level goals, including a global Drule.standard. Note that
3701 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3702 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3703 in a locale context).
3705 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3706 and type checking (Syntax.check_term etc.), with common combinations
3707 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3708 which are considered legacy and await removal.
3710 * Pure/Syntax: generic interfaces for type unchecking
3711 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3712 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3713 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3714 available for convenience, but refer to the very same operations using
3715 a mere theory instead of a full context.
3717 * Isar: simplified treatment of user-level errors, using exception
3718 ERROR of string uniformly. Function error now merely raises ERROR,
3719 without any side effect on output channels. The Isar toplevel takes
3720 care of proper display of ERROR exceptions. ML code may use plain
3721 handle/can/try; cat_error may be used to concatenate errors like this:
3723 ... handle ERROR msg => cat_error msg "..."
3725 Toplevel ML code (run directly or through the Isar toplevel) may be
3726 embedded into the Isar toplevel with exception display/debug like
3729 Isar.toplevel (fn () => ...)
3731 INCOMPATIBILITY, removed special transform_error facilities, removed
3732 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3733 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3734 -- use plain ERROR instead.
3736 * Isar: theory setup now has type (theory -> theory), instead of a
3737 list. INCOMPATIBILITY, may use #> to compose setup functions.
3739 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3740 ProofContext.debug/verbose flags.
3742 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3743 theory before entering a proof state. Transactions now always see a
3744 quasi-functional intermediate checkpoint, both in interactive and
3747 * Isar: simplified interfaces for outer syntax. Renamed
3748 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3749 OuterSyntax.add_parsers -- this functionality is now included in
3750 OuterSyntax.command etc. INCOMPATIBILITY.
3752 * Simplifier: the simpset of a running simplification process now
3753 contains a proof context (cf. Simplifier.the_context), which is the
3754 very context that the initial simpset has been retrieved from (by
3755 simpset_of/local_simpset_of). Consequently, all plug-in components
3756 (solver, looper etc.) may depend on arbitrary proof data.
3758 * Simplifier.inherit_context inherits the proof context (plus the
3759 local bounds) of the current simplification process; any simproc
3760 etc. that calls the Simplifier recursively should do this! Removed
3761 former Simplifier.inherit_bounds, which is already included here --
3762 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3763 specify an explicit context using Simplifier.context/theory_context.
3765 * Simplifier/Classical Reasoner: more abstract interfaces
3766 change_simpset/claset for modifying the simpset/claset reference of a
3767 theory; raw versions simpset/claset_ref etc. have been discontinued --
3770 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3776 * settings: the default heap location within ISABELLE_HOME_USER now
3777 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3778 Isabelle installations.
3780 * isabelle-process: option -S (secure mode) disables some critical
3781 operations, notably runtime compilation and evaluation of ML source
3784 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3786 * Support for parallel execution, using native multicore support of
3787 Poly/ML 5.1. The theory loader exploits parallelism when processing
3788 independent theories, according to the given theory header
3789 specifications. The maximum number of worker threads is specified via
3790 usedir option -M or the "max-threads" setting in Proof General. A
3791 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3792 to 6 on a 8-core machine. User-code needs to observe certain
3793 guidelines for thread-safe programming, see appendix A in the Isar
3794 Implementation manual.
3798 New in Isabelle2005 (October 2005)
3799 ----------------------------------
3803 * Theory headers: the new header syntax for Isar theories is
3806 imports <theory1> ... <theoryN>
3807 uses <file1> ... <fileM>
3810 where the 'uses' part is optional. The previous syntax
3812 theory <name> = <theory1> + ... + <theoryN>:
3814 will disappear in the next release. Use isatool fixheaders to convert
3815 existing theory files. Note that there is no change in ancient
3816 non-Isar theories now, but these will disappear soon.
3818 * Theory loader: parent theories can now also be referred to via
3819 relative and absolute paths.
3821 * Command 'find_theorems' searches for a list of criteria instead of a
3822 list of constants. Known criteria are: intro, elim, dest, name:string,
3823 simp:term, and any term. Criteria can be preceded by '-' to select
3824 theorems that do not match. Intro, elim, dest select theorems that
3825 match the current goal, name:s selects theorems whose fully qualified
3826 name contain s, and simp:term selects all simplification rules whose
3827 lhs match term. Any other term is interpreted as pattern and selects
3828 all theorems matching the pattern. Available in ProofGeneral under
3829 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3831 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3833 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3834 matching the current goal as introduction rule and not having "HOL."
3835 in their name (i.e. not being defined in theory HOL).
3837 * Command 'thms_containing' has been discontinued in favour of
3838 'find_theorems'; INCOMPATIBILITY.
3840 * Communication with Proof General is now 8bit clean, which means that
3841 Unicode text in UTF-8 encoding may be used within theory texts (both
3842 formal and informal parts). Cf. option -U of the Isabelle Proof
3843 General interface. Here are some simple examples (cf. src/HOL/ex):
3845 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3846 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3848 * Improved efficiency of the Simplifier and, to a lesser degree, the
3849 Classical Reasoner. Typical big applications run around 2 times
3853 *** Document preparation ***
3855 * Commands 'display_drafts' and 'print_drafts' perform simple output
3856 of raw sources. Only those symbols that do not require additional
3857 LaTeX packages (depending on comments in isabellesym.sty) are
3858 displayed properly, everything else is left verbatim. isatool display
3859 and isatool print are used as front ends (these are subject to the
3860 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3862 * Command tags control specific markup of certain regions of text,
3863 notably folding and hiding. Predefined tags include "theory" (for
3864 theory begin and end), "proof" for proof commands, and "ML" for
3865 commands involving ML code; the additional tags "visible" and
3866 "invisible" are unused by default. Users may give explicit tag
3867 specifications in the text, e.g. ''by %invisible (auto)''. The
3868 interpretation of tags is determined by the LaTeX job during document
3869 preparation: see option -V of isatool usedir, or options -n and -t of
3870 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3873 Several document versions may be produced at the same time via isatool
3874 usedir (the generated index.html will link all of them). Typical
3875 specifications include ''-V document=theory,proof,ML'' to present
3876 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3877 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3878 these parts without any formal replacement text. The Isabelle site
3879 default settings produce ''document'' and ''outline'' versions as
3882 * Several new antiquotations:
3884 @{term_type term} prints a term with its type annotated;
3886 @{typeof term} prints the type of a term;
3888 @{const const} is the same as @{term const}, but checks that the
3889 argument is a known logical constant;
3891 @{term_style style term} and @{thm_style style thm} print a term or
3892 theorem applying a "style" to it
3896 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3897 definitions, equations, inequations etc., 'concl' printing only the
3898 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3899 to print the specified premise. TermStyle.add_style provides an ML
3900 interface for introducing further styles. See also the "LaTeX Sugar"
3901 document practical applications. The ML antiquotation prints
3902 type-checked ML expressions verbatim.
3904 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3905 and 'text' support optional locale specification '(in loc)', which
3906 specifies the default context for interpreting antiquotations. For
3907 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3909 * Option 'locale=NAME' of antiquotations specifies an alternative
3910 context interpreting the subsequent argument. For example: @{thm
3911 [locale=lattice] inf_assoc}.
3913 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3916 * Proper output of antiquotations for theory commands involving a
3917 proof context (such as 'locale' or 'theorem (in loc) ...').
3919 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3920 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3922 * isatool usedir: new option -C (default true) controls whether option
3923 -D should include a copy of the original document directory; -C false
3924 prevents unwanted effects such as copying of administrative CVS data.
3929 * Considerably improved version of 'constdefs' command. Now performs
3930 automatic type-inference of declared constants; additional support for
3931 local structure declarations (cf. locales and HOL records), see also
3932 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3933 sequential dependencies of definitions within a single 'constdefs'
3934 section; moreover, the declared name needs to be an identifier. If
3935 all fails, consider to fall back on 'consts' and 'defs' separately.
3937 * Improved indexed syntax and implicit structures. First of all,
3938 indexed syntax provides a notational device for subscripted
3939 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3940 expressions. Secondly, in a local context with structure
3941 declarations, number indexes \<^sub>n or the empty index (default
3942 number 1) refer to a certain fixed variable implicitly; option
3943 show_structs controls printing of implicit structures. Typical
3944 applications of these concepts involve record types and locales.
3946 * New command 'no_syntax' removes grammar declarations (and
3947 translations) resulting from the given syntax specification, which is
3948 interpreted in the same manner as for the 'syntax' command.
3950 * 'Advanced' translation functions (parse_translation etc.) may depend
3951 on the signature of the theory context being presently used for
3952 parsing/printing, see also isar-ref manual.
3954 * Improved 'oracle' command provides a type-safe interface to turn an
3955 ML expression of type theory -> T -> term into a primitive rule of
3956 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3957 is already included here); see also FOL/ex/IffExample.thy;
3960 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3961 before); "cI" is no longer bound, use "c.intro" instead.
3962 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3963 axclasses vs. locales.
3965 * Improved internal renaming of symbolic identifiers -- attach primes
3966 instead of base 26 numbers.
3968 * New flag show_question_marks controls printing of leading question
3969 marks in schematic variable names.
3971 * In schematic variable names, *any* symbol following \<^isub> or
3972 \<^isup> is now treated as part of the base name. For example, the
3973 following works without printing of awkward ".0" indexes:
3975 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3978 * Inner syntax includes (*(*nested*) comments*).
3980 * Pretty printer now supports unbreakable blocks, specified in mixfix
3981 annotations as "(00...)".
3983 * Clear separation of logical types and nonterminals, where the latter
3984 may only occur in 'syntax' specifications or type abbreviations.
3985 Before that distinction was only partially implemented via type class
3986 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3987 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3988 exotic syntax specifications may require further adaption
3989 (e.g. Cube/Cube.thy).
3991 * Removed obsolete type class "logic", use the top sort {} instead.
3992 Note that non-logical types should be declared as 'nonterminals'
3993 rather than 'types'. INCOMPATIBILITY for new object-logic
3996 * Attributes 'induct' and 'cases': type or set names may now be
3997 locally fixed variables as well.
3999 * Simplifier: can now control the depth to which conditional rewriting
4000 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
4003 * Simplifier: simplification procedures may now take the current
4004 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
4005 interface), which is very useful for calling the Simplifier
4006 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
4007 is gone -- use prems_of_ss on the simpset instead. Moreover, the
4008 low-level mk_simproc no longer applies Logic.varify internally, to
4009 allow for use in a context of fixed variables.
4011 * thin_tac now works even if the assumption being deleted contains !!
4012 or ==>. More generally, erule now works even if the major premise of
4013 the elimination rule contains !! or ==>.
4015 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
4017 * Reorganized bootstrapping of the Pure theories; CPure is now derived
4018 from Pure, which contains all common declarations already. Both
4019 theories are defined via plain Isabelle/Isar .thy files.
4020 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
4021 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
4022 use isatool fixcpure to adapt your theory and ML sources.
4024 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
4025 selections of theorems in named facts via index ranges.
4027 * 'print_theorems': in theory mode, really print the difference
4028 wrt. the last state (works for interactive theory development only),
4029 in proof mode print all local facts (cf. 'print_facts');
4031 * 'hide': option '(open)' hides only base names.
4033 * More efficient treatment of intermediate checkpoints in interactive
4036 * Code generator is now invoked via code_module (incremental code
4037 generation) and code_library (modular code generation, ML structures
4038 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4039 must be quoted when used as identifiers.
4041 * New 'value' command for reading, evaluating and printing terms using
4042 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4043 quoted when used as identifier.
4048 * New commands for the interpretation of locale expressions in
4049 theories (1), locales (2) and proof contexts (3). These generate
4050 proof obligations from the expression specification. After the
4051 obligations have been discharged, theorems of the expression are added
4052 to the theory, target locale or proof context. The synopsis of the
4053 commands is a follows:
4055 (1) interpretation expr inst
4056 (2) interpretation target < expr
4057 (3) interpret expr inst
4059 Interpretation in theories and proof contexts require a parameter
4060 instantiation of terms from the current context. This is applied to
4061 specifications and theorems of the interpreted expression.
4062 Interpretation in locales only permits parameter renaming through the
4063 locale expression. Interpretation is smart in that interpretations
4064 that are active already do not occur in proof obligations, neither are
4065 instantiated theorems stored in duplicate. Use 'print_interps' to
4066 inspect active interpretations of a particular locale. For details,
4067 see the Isar Reference manual. Examples can be found in
4068 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4070 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4071 'interpret' instead.
4073 * New context element 'constrains' for adding type constraints to
4076 * Context expressions: renaming of parameters with syntax
4079 * Locale declaration: 'includes' disallowed.
4081 * Proper static binding of attribute syntax -- i.e. types / terms /
4082 facts mentioned as arguments are always those of the locale definition
4083 context, independently of the context of later invocations. Moreover,
4084 locale operations (renaming and type / term instantiation) are applied
4085 to attribute arguments as expected.
4087 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4088 actual attributes; rare situations may require Attrib.attribute to
4089 embed those attributes into Attrib.src that lack concrete syntax.
4090 Attribute implementations need to cooperate properly with the static
4091 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4092 Attrib.XXX_thm etc. already do the right thing without further
4093 intervention. Only unusual applications -- such as "where" or "of"
4094 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4095 on the context and the facts involved -- may have to assign parsed
4096 values to argument tokens explicitly.
4098 * Changed parameter management in theorem generation for long goal
4099 statements with 'includes'. INCOMPATIBILITY: produces a different
4100 theorem statement in rare situations.
4102 * Locale inspection command 'print_locale' omits notes elements. Use
4103 'print_locale!' to have them included in the output.
4108 * Provers/hypsubst.ML: improved version of the subst method, for
4109 single-step rewriting: it now works in bound variable contexts. New is
4110 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4111 rewrite a different subterm than the original subst method, which is
4112 still available as 'simplesubst'.
4114 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4117 * Provers/trancl.ML: new transitivity reasoner for transitive and
4118 reflexive-transitive closure of relations.
4120 * Provers/blast.ML: new reference depth_limit to make blast's depth
4121 limit (previously hard-coded with a value of 20) user-definable.
4123 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4124 is peformed already. Object-logics merely need to finish their
4125 initial simpset configuration as before. INCOMPATIBILITY.
4130 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4133 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4135 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4136 and x-symbol; use option '-m epsilon' to get it actually printed.
4137 Moreover, the mathematically important symbolic identifier \<epsilon>
4138 becomes available as variable, constant etc. INCOMPATIBILITY,
4140 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4141 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4142 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4143 support corresponding Isar calculations.
4145 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4148 * theory SetInterval: changed the syntax for open intervals:
4157 The old syntax is still supported but will disappear in the next
4158 release. For conversion use the following Emacs search and replace
4159 patterns (these are not perfect but work quite well):
4161 {)\([^\.]*\)\.\. -> {\1<\.\.}
4162 \.\.\([^(}]*\)(} -> \.\.<\1}
4164 * Theory Commutative_Ring (in Library): method comm_ring for proving
4165 equalities in commutative rings; method 'algebra' provides a generic
4168 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4169 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4170 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4173 Some new syntax forms are available:
4175 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4176 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4177 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4178 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4180 The latter form "\<Sum>x < k. e" used to be based on a separate
4181 function "Summation", which has been discontinued.
4183 * theory Finite_Set: in structured induction proofs, the insert case
4184 is now 'case (insert x F)' instead of the old counterintuitive 'case
4187 * The 'refute' command has been extended to support a much larger
4188 fragment of HOL, including axiomatic type classes, constdefs and
4189 typedefs, inductive datatypes and recursion.
4191 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4192 Requires zChaff with proof generation to be installed. See
4193 HOL/ex/SAT_Examples.thy for examples.
4195 * Datatype induction via method 'induct' now preserves the name of the
4196 induction variable. For example, when proving P(xs::'a list) by
4197 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4198 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4199 in unstructured proof scripts.
4201 * Reworked implementation of records. Improved scalability for
4202 records with many fields, avoiding performance problems for type
4203 inference. Records are no longer composed of nested field types, but
4204 of nested extension types. Therefore the record type only grows linear
4205 in the number of extensions and not in the number of fields. The
4206 top-level (users) view on records is preserved. Potential
4207 INCOMPATIBILITY only in strange cases, where the theory depends on the
4208 old record representation. The type generated for a record is called
4209 <record_name>_ext_type.
4211 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4212 proofs triggered by a record definition or a simproc (if
4213 quick_and_dirty is enabled). Definitions of large records can take
4216 New simproc record_upd_simproc for simplification of multiple record
4217 updates enabled by default. Moreover, trivial updates are also
4218 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4219 occasionally, since simplification is more powerful by default.
4221 * typedef: proper support for polymorphic sets, which contain extra
4222 type-variables in the term.
4224 * Simplifier: automatically reasons about transitivity chains
4225 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4226 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4227 old proofs break occasionally as simplification may now solve more
4228 goals than previously.
4230 * Simplifier: converts x <= y into x = y if assumption y <= x is
4231 present. Works for all partial orders (class "order"), in particular
4232 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4235 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4236 bound variable or a constant then the let is unfolded. Otherwise
4237 first a is simplified to b, and then f b is simplified to g. If
4238 possible we abstract b from g arriving at "let x = b in h x",
4239 otherwise we unfold the let and arrive at g. The simproc can be
4240 enabled/disabled by the reference use_let_simproc. Potential
4241 INCOMPATIBILITY since simplification is more powerful by default.
4243 * Classical reasoning: the meson method now accepts theorems as arguments.
4245 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4246 jobs to provide advice on the provability of subgoals.
4248 * Theory OrderedGroup and Ring_and_Field: various additions and
4249 improvements to faciliate calculations involving equalities and
4252 The following theorems have been eliminated or modified
4255 abs_eq now named abs_of_nonneg
4256 abs_of_ge_0 now named abs_of_nonneg
4257 abs_minus_eq now named abs_of_nonpos
4258 imp_abs_id now named abs_of_nonneg
4259 imp_abs_neg_id now named abs_of_nonpos
4260 mult_pos now named mult_pos_pos
4261 mult_pos_le now named mult_nonneg_nonneg
4262 mult_pos_neg_le now named mult_nonneg_nonpos
4263 mult_pos_neg2_le now named mult_nonneg_nonpos2
4264 mult_neg now named mult_neg_neg
4265 mult_neg_le now named mult_nonpos_nonpos
4267 * The following lemmas in Ring_and_Field have been added to the simplifier:
4270 not_square_less_zero
4272 The following lemmas have been deleted from Real/RealPow:
4282 * Theory Parity: added rules for simplifying exponents.
4286 The following theorems have been eliminated or modified
4289 list_all_Nil now named list_all.simps(1)
4290 list_all_Cons now named list_all.simps(2)
4291 list_all_conv now named list_all_iff
4292 set_mem_eq now named mem_iff
4294 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4295 asymptotic "big O" calculations. See the notes in BigO.thy.
4300 * Theory RealDef: better support for embedding natural numbers and
4301 integers in the reals.
4303 The following theorems have been eliminated or modified
4306 exp_ge_add_one_self now requires no hypotheses
4307 real_of_int_add reversed direction of equality (use [symmetric])
4308 real_of_int_minus reversed direction of equality (use [symmetric])
4309 real_of_int_diff reversed direction of equality (use [symmetric])
4310 real_of_int_mult reversed direction of equality (use [symmetric])
4312 * Theory RComplete: expanded support for floor and ceiling functions.
4314 * Theory Ln is new, with properties of the natural logarithm
4316 * Hyperreal: There is a new type constructor "star" for making
4317 nonstandard types. The old type names are now type synonyms:
4321 hcomplex = complex star
4323 * Hyperreal: Many groups of similarly-defined constants have been
4324 replaced by polymorphic versions (INCOMPATIBILITY):
4326 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4328 starset <-- starsetNat, starsetC
4329 *s* <-- *sNat*, *sc*
4330 starset_n <-- starsetNat_n, starsetC_n
4331 *sn* <-- *sNatn*, *scn*
4332 InternalSets <-- InternalNatSets, InternalCSets
4334 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4335 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4336 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4337 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4338 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4340 * Hyperreal: Many type-specific theorems have been removed in favor of
4341 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4343 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4344 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4345 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4346 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4347 right_minus <-- hypreal_add_minus
4348 left_minus <-- {hypreal,hcomplex}_add_minus_left
4349 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4350 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4351 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4352 mult_1_right <-- hcomplex_mult_one_right
4353 mult_zero_left <-- hcomplex_mult_zero_left
4354 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4355 right_distrib <-- hypnat_add_mult_distrib2
4356 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4357 right_inverse <-- hypreal_mult_inverse
4358 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4359 order_refl <-- {hypreal,hypnat}_le_refl
4360 order_trans <-- {hypreal,hypnat}_le_trans
4361 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4362 order_less_le <-- {hypreal,hypnat}_less_le
4363 linorder_linear <-- {hypreal,hypnat}_le_linear
4364 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4365 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4366 add_nonneg_nonneg <-- hypreal_le_add_order
4368 * Hyperreal: Separate theorems having to do with type-specific
4369 versions of constants have been merged into theorems that apply to the
4370 new polymorphic constants (INCOMPATIBILITY):
4372 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4373 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4374 STAR_Un <-- {STAR,NatStar,STARC}_Un
4375 STAR_Int <-- {STAR,NatStar,STARC}_Int
4376 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4377 STAR_subset <-- {STAR,NatStar,STARC}_subset
4378 STAR_mem <-- {STAR,NatStar,STARC}_mem
4379 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4380 STAR_diff <-- {STAR,STARC}_diff
4381 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4382 STARC_hcomplex_of_complex}_image_subset
4383 starset_n_Un <-- starset{Nat,C}_n_Un
4384 starset_n_Int <-- starset{Nat,C}_n_Int
4385 starset_n_Compl <-- starset{Nat,C}_n_Compl
4386 starset_n_diff <-- starset{Nat,C}_n_diff
4387 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4388 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4389 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4390 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4391 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4392 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4393 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4394 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4395 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4396 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4397 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4398 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4399 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4400 starfun_diff <-- starfun{C,RC,CR}_diff
4401 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4402 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4403 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4404 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4405 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4406 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4407 starfun_Id <-- starfunC_Id
4408 starfun_approx <-- starfun{Nat,CR}_approx
4409 starfun_capprox <-- starfun{C,RC}_capprox
4410 starfun_abs <-- starfunNat_rabs
4411 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4412 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4413 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4414 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4415 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4416 starfun_add_approx <-- starfunCR_add_approx
4417 starfun_inverse_inverse <-- starfunC_inverse_inverse
4418 starfun_divide <-- starfun{C,CR,RC}_divide
4419 starfun_n <-- starfun{Nat,C}_n
4420 starfun_n_mult <-- starfun{Nat,C}_n_mult
4421 starfun_n_add <-- starfun{Nat,C}_n_add
4422 starfun_n_add_minus <-- starfunNat_n_add_minus
4423 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4424 starfun_n_minus <-- starfun{Nat,C}_n_minus
4425 starfun_n_eq <-- starfun{Nat,C}_n_eq
4427 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4428 star_n_minus <-- {hypreal,hcomplex}_minus
4429 star_n_diff <-- {hypreal,hcomplex}_diff
4430 star_n_mult <-- {hypreal,hcomplex}_mult
4431 star_n_inverse <-- {hypreal,hcomplex}_inverse
4432 star_n_le <-- {hypreal,hypnat}_le
4433 star_n_less <-- {hypreal,hypnat}_less
4434 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4435 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4436 star_n_abs <-- hypreal_hrabs
4437 star_n_divide <-- hcomplex_divide
4439 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4440 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4441 star_of_diff <-- hypreal_of_real_diff
4442 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4443 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4444 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4445 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4446 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4447 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4448 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4449 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4450 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4451 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4452 star_of_number_of <-- {hypreal,hcomplex}_number_of
4453 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4454 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4455 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4456 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4457 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4458 star_of_power <-- hypreal_of_real_power
4459 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4461 * Hyperreal: new method "transfer" that implements the transfer
4462 principle of nonstandard analysis. With a subgoal that mentions
4463 nonstandard types like "'a star", the command "apply transfer"
4464 replaces it with an equivalent one that mentions only standard types.
4465 To be successful, all free variables must have standard types; non-
4466 standard variables must have explicit universal quantifiers.
4468 * Hyperreal: A theory of Taylor series.
4473 * Discontinued special version of 'constdefs' (which used to support
4474 continuous functions) in favor of the general Pure one with full
4477 * New simplification procedure for solving continuity conditions; it
4478 is much faster on terms with many nested lambda abstractions (cubic
4479 instead of exponential time).
4481 * New syntax for domain package: selector names are now optional.
4482 Parentheses should be omitted unless argument is lazy, for example:
4484 domain 'a stream = cons "'a" (lazy "'a stream")
4486 * New command 'fixrec' for defining recursive functions with pattern
4487 matching; defining multiple functions with mutual recursion is also
4488 supported. Patterns may include the constants cpair, spair, up, sinl,
4489 sinr, or any data constructor defined by the domain package. The given
4490 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4491 syntax and examples.
4493 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4494 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4495 but the proof obligation additionally includes an admissibility
4496 requirement. The packages generate instances of class cpo or pcpo,
4497 with continuity and strictness theorems for Rep and Abs.
4499 * HOLCF: Many theorems have been renamed according to a more standard naming
4500 scheme (INCOMPATIBILITY):
4502 foo_inject: "foo$x = foo$y ==> x = y"
4503 foo_eq: "(foo$x = foo$y) = (x = y)"
4504 foo_less: "(foo$x << foo$y) = (x << y)"
4505 foo_strict: "foo$UU = UU"
4506 foo_defined: "... ==> foo$x ~= UU"
4507 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4512 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4513 including the First Isomorphism Theorem (on quotienting by the kernel
4516 * ZF/Simplifier: install second copy of type solver that actually
4517 makes use of TC rules declared to Isar proof contexts (or locales);
4518 the old version is still required for ML proof scripts.
4523 * Converted to Isar theory format; use locales instead of axiomatic
4529 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4532 * Pure/library.ML no longer defines its own option datatype, but uses
4533 that of the SML basis, which has constructors NONE and SOME instead of
4534 None and Some, as well as exception Option.Option instead of OPTION.
4535 The functions the, if_none, is_some, is_none have been adapted
4536 accordingly, while Option.map replaces apsome.
4538 * Pure/library.ML: the exception LIST has been given up in favour of
4539 the standard exceptions Empty and Subscript, as well as
4540 Library.UnequalLengths. Function like Library.hd and Library.tl are
4541 superceded by the standard hd and tl functions etc.
4543 A number of basic list functions are no longer exported to the ML
4544 toplevel, as they are variants of predefined functions. The following
4545 suggests how one can translate existing code:
4547 rev_append xs ys = List.revAppend (xs, ys)
4548 nth_elem (i, xs) = List.nth (xs, i)
4549 last_elem xs = List.last xs
4550 flat xss = List.concat xss
4551 seq fs = List.app fs
4552 partition P xs = List.partition P xs
4553 mapfilter f xs = List.mapPartial f xs
4555 * Pure/library.ML: several combinators for linear functional
4556 transformations, notably reverse application and composition:
4559 (x, y) |-> f f #-> g
4561 * Pure/library.ML: introduced/changed precedence of infix operators:
4563 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4565 infix 3 o oo ooo oooo;
4566 infix 4 ~~ upto downto;
4568 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4571 * Pure/library.ML: natural list combinators fold, fold_rev, and
4572 fold_map support linear functional transformations and nesting. For
4575 fold f [x1, ..., xN] y =
4576 y |> f x1 |> ... |> f xN
4578 (fold o fold) f [xs1, ..., xsN] y =
4579 y |> fold f xs1 |> ... |> fold f xsN
4581 fold f [x1, ..., xN] =
4584 (fold o fold) f [xs1, ..., xsN] =
4585 fold f xs1 #> ... #> fold f xsN
4587 * Pure/library.ML: the following selectors on type 'a option are
4590 the: 'a option -> 'a (*partial*)
4591 these: 'a option -> 'a where 'a = 'b list
4592 the_default: 'a -> 'a option -> 'a
4593 the_list: 'a option -> 'a list
4595 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4596 basic operations for association lists, following natural argument
4597 order; moreover the explicit equality predicate passed here avoids
4598 potentially expensive polymorphic runtime equality checks.
4599 The old functions may be expressed as follows:
4601 assoc = uncurry (AList.lookup (op =))
4602 assocs = these oo AList.lookup (op =)
4603 overwrite = uncurry (AList.update (op =)) o swap
4605 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4607 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4608 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4610 replacing make_keylist and keyfilter (occassionally used)
4613 make_keylist = AList.make
4614 keyfilter = AList.find (op =)
4616 * eq_fst and eq_snd now take explicit equality parameter, thus
4617 avoiding eqtypes. Naive rewrites:
4619 eq_fst = eq_fst (op =)
4620 eq_snd = eq_snd (op =)
4622 * Removed deprecated apl and apr (rarely used).
4625 apl (n, op) =>>= curry op n
4626 apr (op, m) =>>= fn n => op (n, m)
4628 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4629 provides a reasonably efficient light-weight implementation of sets as
4632 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4633 few new operations; existing lookup and update are now curried to
4634 follow natural argument order (for use with fold etc.);
4635 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4637 * Pure/General: output via the Isabelle channels of
4638 writeln/warning/error etc. is now passed through Output.output, with a
4639 hook for arbitrary transformations depending on the print_mode
4640 (cf. Output.add_mode -- the first active mode that provides a output
4641 function wins). Already formatted output may be embedded into further
4642 text via Output.raw; the result of Pretty.string_of/str_of and derived
4643 functions (string_of_term/cterm/thm etc.) is already marked raw to
4644 accommodate easy composition of diagnostic messages etc. Programmers
4645 rarely need to care about Output.output or Output.raw at all, with
4646 some notable exceptions: Output.output is required when bypassing the
4647 standard channels (writeln etc.), or in token translations to produce
4648 properly formatted results; Output.raw is required when capturing
4649 already output material that will eventually be presented to the user
4650 a second time. For the default print mode, both Output.output and
4651 Output.raw have no effect.
4653 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4654 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4655 cumulative results are displayed at the end of a batch session.
4657 * Pure/General: File.sysify_path and File.quote_sysify path have been
4658 replaced by File.platform_path and File.shell_path (with appropriate
4659 hooks). This provides a clean interface for unusual systems where the
4660 internal and external process view of file names are different.
4662 * Pure: more efficient orders for basic syntactic entities: added
4663 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4664 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4665 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4666 orders now -- potential INCOMPATIBILITY for code that depends on a
4667 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4668 Library.sort_strings on result).
4670 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4671 fold_types traverse types/terms from left to right, observing natural
4672 argument order. Supercedes previous foldl_XXX versions, add_frees,
4673 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4675 * Pure: name spaces have been refined, with significant changes of the
4676 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4677 to extern(_table). The plain name entry path is superceded by a
4678 general 'naming' context, which also includes the 'policy' to produce
4679 a fully qualified name and external accesses of a fully qualified
4680 name; NameSpace.extend is superceded by context dependent
4681 Sign.declare_name. Several theory and proof context operations modify
4682 the naming context. Especially note Theory.restore_naming and
4683 ProofContext.restore_naming to get back to a sane state; note that
4684 Theory.add_path is no longer sufficient to recover from
4685 Theory.absolute_path in particular.
4687 * Pure: new flags short_names (default false) and unique_names
4688 (default true) for controlling output of qualified names. If
4689 short_names is set, names are printed unqualified. If unique_names is
4690 reset, the name prefix is reduced to the minimum required to achieve
4691 the original result when interning again, even if there is an overlap
4692 with earlier declarations.
4694 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4695 now 'extend', and 'merge' gets an additional Pretty.pp argument
4696 (useful for printing error messages). INCOMPATIBILITY.
4698 * Pure: major reorganization of the theory context. Type Sign.sg and
4699 Theory.theory are now identified, referring to the universal
4700 Context.theory (see Pure/context.ML). Actual signature and theory
4701 content is managed as theory data. The old code and interfaces were
4702 spread over many files and structures; the new arrangement introduces
4703 considerable INCOMPATIBILITY to gain more clarity:
4705 Context -- theory management operations (name, identity, inclusion,
4706 parents, ancestors, merge, etc.), plus generic theory data;
4708 Sign -- logical signature and syntax operations (declaring consts,
4709 types, etc.), plus certify/read for common entities;
4711 Theory -- logical theory operations (stating axioms, definitions,
4712 oracles), plus a copy of logical signature operations (consts,
4713 types, etc.); also a few basic management operations (Theory.copy,
4716 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4717 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4718 for convenience -- they merely return the theory.
4720 * Pure: type Type.tsig is superceded by theory in most interfaces.
4722 * Pure: the Isar proof context type is already defined early in Pure
4723 as Context.proof (note that ProofContext.context and Proof.context are
4724 aliases, where the latter is the preferred name). This enables other
4725 Isabelle components to refer to that type even before Isar is present.
4727 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4728 typeK, constK, axiomK, oracleK), but provide explicit operations for
4729 any of these kinds. For example, Sign.intern typeK is now
4730 Sign.intern_type, Theory.hide_space Sign.typeK is now
4731 Theory.hide_types. Also note that former
4732 Theory.hide_classes/types/consts are now
4733 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4734 internalize their arguments! INCOMPATIBILITY.
4736 * Pure: get_thm interface (of PureThy and ProofContext) expects
4737 datatype thmref (with constructors Name and NameSelection) instead of
4738 plain string -- INCOMPATIBILITY;
4740 * Pure: cases produced by proof methods specify options, where NONE
4741 means to remove case bindings -- INCOMPATIBILITY in
4744 * Pure: the following operations retrieve axioms or theorems from a
4745 theory node or theory hierarchy, respectively:
4747 Theory.axioms_of: theory -> (string * term) list
4748 Theory.all_axioms_of: theory -> (string * term) list
4749 PureThy.thms_of: theory -> (string * thm) list
4750 PureThy.all_thms_of: theory -> (string * thm) list
4752 * Pure: print_tac now outputs the goal through the trace channel.
4754 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4755 Reference Toplevel.debug (default false) controls detailed printing
4756 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4757 controls execution profiling -- set to 1 for time and 2 for space
4758 (both increase the runtime).
4760 * Isar session: The initial use of ROOT.ML is now always timed,
4761 i.e. the log will show the actual process times, in contrast to the
4762 elapsed wall-clock time that the outer shell wrapper produces.
4764 * Simplifier: improved handling of bound variables (nameless
4765 representation, avoid allocating new strings). Simprocs that invoke
4766 the Simplifier recursively should use Simplifier.inherit_bounds to
4767 avoid local name clashes. Failure to do so produces warnings
4768 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4769 for further details.
4771 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4772 bindings for all theorems stored within a given theory; this may help
4773 in porting non-Isar theories to Isar ones, while keeping ML proof
4774 scripts for the time being.
4776 * ML operator HTML.with_charset specifies the charset begin used for
4777 generated HTML files. For example:
4779 HTML.with_charset "utf-8" use_thy "Hebrew";
4780 HTML.with_charset "utf-8" use_thy "Chinese";
4785 * Allow symlinks to all proper Isabelle executables (Isabelle,
4786 isabelle, isatool etc.).
4788 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4789 isatool doc, isatool mkdir, display_drafts etc.).
4791 * isatool usedir: option -f allows specification of the ML file to be
4792 used by Isabelle; default is ROOT.ML.
4794 * New isatool version outputs the version identifier of the Isabelle
4795 distribution being used.
4797 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4798 (containing Boolean satisfiability problems) into Isabelle/HOL
4803 New in Isabelle2004 (April 2004)
4804 --------------------------------
4808 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4809 Replaces linorder.ML.
4811 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4812 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4813 (\<a>...\<z>), are now considered normal letters, and can therefore
4814 be used anywhere where an ASCII letter (a...zA...Z) has until
4815 now. COMPATIBILITY: This obviously changes the parsing of some
4816 terms, especially where a symbol has been used as a binder, say
4817 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4818 as an identifier. Fix it by inserting a space around former
4819 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4820 existing theory and ML files.
4822 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4824 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4825 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4826 a normal (but invisible) letter. For multiple letter subscripts repeat
4827 \<^isub> like this: x\<^isub>1\<^isub>2.
4829 * Pure: There are now sub-/superscripts that can span more than one
4830 character. Text between \<^bsub> and \<^esub> is set in subscript in
4831 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4832 superscript. The new control characters are not identifier parts.
4834 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4835 content of "..." to the latex file instead of \isacntrl... . The "..."
4836 may consist of any printable characters excluding the end bracket >.
4838 * Pure: Using new Isar command "finalconsts" (or the ML functions
4839 Theory.add_finals or Theory.add_finals_i) it is now possible to
4840 declare constants "final", which prevents their being given a definition
4841 later. It is useful for constants whose behaviour is fixed axiomatically
4842 rather than definitionally, such as the meta-logic connectives.
4844 * Pure: 'instance' now handles general arities with general sorts
4845 (i.e. intersections of classes),
4847 * Presentation: generated HTML now uses a CSS style sheet to make layout
4848 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4849 It can be changed to alter the colors/layout of generated pages.
4854 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4855 cut_tac, subgoal_tac and thin_tac:
4856 - Now understand static (Isar) contexts. As a consequence, users of Isar
4857 locales are no longer forced to write Isar proof scripts.
4858 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4860 - INCOMPATIBILITY: names of variables to be instantiated may no
4861 longer be enclosed in quotes. Instead, precede variable name with `?'.
4862 This is consistent with the instantiation attribute "where".
4864 * Attributes "where" and "of":
4865 - Now take type variables of instantiated theorem into account when reading
4866 the instantiation string. This fixes a bug that caused instantiated
4867 theorems to have too special types in some circumstances.
4868 - "where" permits explicit instantiations of type variables.
4870 * Calculation commands "moreover" and "also" no longer interfere with
4871 current facts ("this"), admitting arbitrary combinations with "then"
4875 - Goal statements involving the context element "includes" no longer
4876 generate theorems with internal delta predicates (those ending on
4877 "_axioms") in the premise.
4878 Resolve particular premise with <locale>.intro to obtain old form.
4879 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4880 specification and "includes" elements in goal statement.
4881 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4882 [intro?] and [elim?] (respectively) by default.
4883 - Experimental command for instantiation of locales in proof contexts:
4884 instantiate <label>[<attrs>]: <loc>
4885 Instantiates locale <loc> and adds all its theorems to the current context
4886 taking into account their attributes. Label and attrs are optional
4887 modifiers, like in theorem declarations. If present, names of
4888 instantiated theorems are qualified with <label>, and the attributes
4889 <attrs> are applied after any attributes these theorems might have already.
4890 If the locale has assumptions, a chained fact of the form
4891 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4892 are derived. The command does not support old-style locales declared
4893 with "locale (open)".
4894 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4896 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4902 * Proof import: new image HOL4 contains the imported library from
4903 the HOL4 system with about 2500 theorems. It is imported by
4904 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4905 can be used like any other Isabelle image. See
4906 HOL/Import/HOL/README for more information.
4909 - Much improved handling of linear and partial orders.
4910 Reasoners for linear and partial orders are set up for type classes
4911 "linorder" and "order" respectively, and are added to the default simpset
4912 as solvers. This means that the simplifier can build transitivity chains
4913 to solve goals from the assumptions.
4914 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4915 of blast or auto after simplification become unnecessary because the goal
4916 is solved by simplification already.
4918 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4919 all proved in axiomatic type classes for semirings, rings and fields.
4922 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4923 now formalized using the Ring_and_Field theory mentioned above.
4924 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4925 than before, because now they are set up once in a generic manner.
4926 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4927 Look for the general versions in Ring_and_Field (and Power if they concern
4930 * Type "rat" of the rational numbers is now available in HOL-Complex.
4933 - Record types are now by default printed with their type abbreviation
4934 instead of the list of all field types. This can be configured via
4935 the reference "print_record_type_abbr".
4936 - Simproc "record_upd_simproc" for simplification of multiple updates added
4937 (not enabled by default).
4938 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4939 EX x. x = sel r to True (not enabled by default).
4940 - Tactic "record_split_simp_tac" to split and simplify records added.
4942 * 'specification' command added, allowing for definition by
4943 specification. There is also an 'ax_specification' command that
4944 introduces the new constants axiomatically.
4946 * arith(_tac) is now able to generate counterexamples for reals as well.
4948 * HOL-Algebra: new locale "ring" for non-commutative rings.
4950 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4951 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4953 * HOL-Matrix: a first theory for matrices in HOL with an application of
4954 matrix theory to linear programming.
4956 * Unions and Intersections:
4957 The latex output syntax of UN and INT has been changed
4958 from "\Union x \in A. B" to "\Union_{x \in A} B"
4959 i.e. the index formulae has become a subscript.
4960 Similarly for "\Union x. B", and for \Inter instead of \Union.
4962 * Unions and Intersections over Intervals:
4963 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4964 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4965 like in normal math, and corresponding versions for < and for intersection.
4967 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4968 lexicographic dictonary ordering has been added as "lexord".
4970 * ML: the legacy theory structures Int and List have been removed. They had
4971 conflicted with ML Basis Library structures having the same names.
4973 * 'refute' command added to search for (finite) countermodels. Only works
4974 for a fragment of HOL. The installation of an external SAT solver is
4975 highly recommended. See "HOL/Refute.thy" for details.
4977 * 'quickcheck' command: Allows to find counterexamples by evaluating
4978 formulae under an assignment of free variables to random values.
4979 In contrast to 'refute', it can deal with inductive datatypes,
4980 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4986 * Streams now come with concatenation and are part of the HOLCF image
4990 New in Isabelle2003 (May 2003)
4991 ------------------------------
4995 * Provers/simplifier:
4997 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4998 Assumptions are now subject to complete mutual simplification,
4999 not just from left to right. The simplifier now preserves
5000 the order of assumptions.
5002 Potential INCOMPATIBILITY:
5004 -- simp sometimes diverges where the old version did
5005 not, e.g. invoking simp on the goal
5007 [| P (f x); y = x; f x = f y |] ==> Q
5009 now gives rise to the infinite reduction sequence
5011 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
5013 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
5016 -- Tactics combining classical reasoner and simplification (such as auto)
5017 are also affected by this change, because many of them rely on
5018 simp. They may sometimes diverge as well or yield a different numbers
5019 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
5020 in case of problems. Sometimes subsequent calls to the classical
5021 reasoner will fail because a preceeding call to the simplifier too
5022 eagerly simplified the goal, e.g. deleted redundant premises.
5024 - The simplifier trace now shows the names of the applied rewrite rules
5026 - You can limit the number of recursive invocations of the simplifier
5027 during conditional rewriting (where the simplifie tries to solve the
5028 conditions before applying the rewrite rule):
5029 ML "simp_depth_limit := n"
5030 where n is an integer. Thus you can force termination where previously
5031 the simplifier would diverge.
5033 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5035 - No longer aborts on failed congruence proof. Instead, the
5036 congruence is ignored.
5038 * Pure: New generic framework for extracting programs from constructive
5039 proofs. See HOL/Extraction.thy for an example instantiation, as well
5040 as HOL/Extraction for some case studies.
5042 * Pure: The main goal of the proof state is no longer shown by default, only
5043 the subgoals. This behaviour is controlled by a new flag.
5044 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5045 (ML: Proof.show_main_goal).
5047 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5048 rules whose conclusion matches subgoal 1:
5049 PG menu: Isabelle/Isar -> Show me -> matching rules
5050 The rules are ordered by how closely they match the subgoal.
5051 In particular, rules that solve a subgoal outright are displayed first
5052 (or rather last, the way they are printed).
5053 (ML: ProofGeneral.print_intros())
5055 * Pure: New flag trace_unify_fail causes unification to print
5056 diagnostic information (PG: in trace buffer) when it fails. This is
5057 useful for figuring out why single step proofs like rule, erule or
5060 * Pure: Locale specifications now produce predicate definitions
5061 according to the body of text (covering assumptions modulo local
5062 definitions); predicate "loc_axioms" covers newly introduced text,
5063 while "loc" is cumulative wrt. all included locale expressions; the
5064 latter view is presented only on export into the global theory
5065 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5066 on the old view without predicates;
5068 * Pure: predefined locales "var" and "struct" are useful for sharing
5069 parameters (as in CASL, for example); just specify something like
5070 ``var x + var y + struct M'' as import;
5072 * Pure: improved thms_containing: proper indexing of facts instead of
5073 raw theorems; check validity of results wrt. current name space;
5074 include local facts of proof configuration (also covers active
5075 locales), cover fixed variables in index; may use "_" in term
5076 specification; an optional limit for the number of printed facts may
5077 be given (the default is 40);
5079 * Pure: disallow duplicate fact bindings within new-style theory files
5082 * Provers: improved induct method: assumptions introduced by case
5083 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5084 the goal statement); "foo" still refers to all facts collectively;
5086 * Provers: the function blast.overloaded has been removed: all constants
5087 are regarded as potentially overloaded, which improves robustness in exchange
5088 for slight decrease in efficiency;
5090 * Provers/linorder: New generic prover for transitivity reasoning over
5091 linear orders. Note: this prover is not efficient!
5093 * Isar: preview of problems to finish 'show' now produce an error
5094 rather than just a warning (in interactive mode);
5101 - Produces a counter example if it cannot prove a goal.
5102 Note that the counter example may be spurious if the goal is not a formula
5103 of quantifier-free linear arithmetic.
5104 In ProofGeneral the counter example appears in the trace buffer.
5106 - Knows about div k and mod k where k is a numeral of type nat or int.
5108 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5109 linear arithmetic fails. This takes account of quantifiers and divisibility.
5110 Presburger arithmetic can also be called explicitly via presburger(_tac).
5112 * simp's arithmetic capabilities have been enhanced a bit: it now
5113 takes ~= in premises into account (by performing a case split);
5115 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5116 are distributed over a sum of terms;
5118 * New tactic "trans_tac" and method "trans" instantiate
5119 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5122 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5123 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5125 * 'typedef' command has new option "open" to suppress the set
5128 * functions Min and Max on finite sets have been introduced (theory
5131 * attribute [symmetric] now works for relations as well; it turns
5132 (x,y) : R^-1 into (y,x) : R, and vice versa;
5134 * induct over a !!-quantified statement (say !!x1..xn):
5135 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5137 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5138 %x. None. Warning: empty_def now refers to the previously hidden definition
5141 * Algebra: formalization of classical algebra. Intended as base for
5142 any algebraic development in Isabelle. Currently covers group theory
5143 (up to Sylow's theorem) and ring theory (Universal Property of
5144 Univariate Polynomials). Contributions welcome;
5146 * GroupTheory: deleted, since its material has been moved to Algebra;
5148 * Complex: new directory of the complex numbers with numeric constants,
5149 nonstandard complex numbers, and some complex analysis, standard and
5150 nonstandard (Jacques Fleuriot);
5152 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5154 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5157 * Real/HahnBanach: updated and adapted to locales;
5159 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5162 * UNITY: added the Meier-Sanders theory of progress sets;
5164 * MicroJava: bytecode verifier and lightweight bytecode verifier
5165 as abstract algorithms, instantiated to the JVM;
5167 * Bali: Java source language formalization. Type system, operational
5168 semantics, axiomatic semantics. Supported language features:
5169 classes, interfaces, objects,virtual methods, static methods,
5170 static/instance fields, arrays, access modifiers, definite
5171 assignment, exceptions.
5176 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5179 * Main ZF: virtually all theories converted to new-style format;
5184 * Pure: Tactic.prove provides sane interface for internal proofs;
5185 omits the infamous "standard" operation, so this is more appropriate
5186 than prove_goalw_cterm in many situations (e.g. in simprocs);
5188 * Pure: improved error reporting of simprocs;
5190 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5194 *** Document preparation ***
5196 * uses \par instead of \\ for line breaks in theory text. This may
5197 shift some page breaks in large documents. To get the old behaviour
5198 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5200 * minimized dependencies of isabelle.sty and isabellesym.sty on
5203 * \<euro> now needs package babel/greek instead of marvosym (which
5206 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5211 New in Isabelle2002 (March 2002)
5212 --------------------------------
5214 *** Document preparation ***
5216 * greatly simplified document preparation setup, including more
5217 graceful interpretation of isatool usedir -i/-d/-D options, and more
5218 instructive isatool mkdir; users should basically be able to get
5219 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5220 users may run a separate document processing stage manually like this:
5221 "isatool usedir -D output HOL Test && isatool document Test/output";
5223 * theory dependency graph may now be incorporated into documents;
5224 isatool usedir -g true will produce session_graph.eps/.pdf for use
5225 with \includegraphics of LaTeX;
5227 * proper spacing of consecutive markup elements, especially text
5228 blocks after section headings;
5230 * support bold style (for single symbols only), input syntax is like
5231 this: "\<^bold>\<alpha>" or "\<^bold>A";
5233 * \<bullet> is now output as bold \cdot by default, which looks much
5234 better in printed text;
5236 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5237 note that these symbols are currently unavailable in Proof General /
5238 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5240 * isatool latex no longer depends on changed TEXINPUTS, instead
5241 isatool document copies the Isabelle style files to the target
5247 * Pure/Provers: improved proof by cases and induction;
5248 - 'case' command admits impromptu naming of parameters (such as
5250 - 'induct' method divinates rule instantiation from the inductive
5251 claim; no longer requires excessive ?P bindings for proper
5252 instantiation of cases;
5253 - 'induct' method properly enumerates all possibilities of set/type
5254 rules; as a consequence facts may be also passed through *type*
5255 rules without further ado;
5256 - 'induct' method now derives symbolic cases from the *rulified*
5257 rule (before it used to rulify cases stemming from the internal
5258 atomized version); this means that the context of a non-atomic
5259 statement becomes is included in the hypothesis, avoiding the
5260 slightly cumbersome show "PROP ?case" form;
5261 - 'induct' may now use elim-style induction rules without chaining
5262 facts, using ``missing'' premises from the goal state; this allows
5263 rules stemming from inductive sets to be applied in unstructured
5264 scripts, while still benefitting from proper handling of non-atomic
5265 statements; NB: major inductive premises need to be put first, all
5266 the rest of the goal is passed through the induction;
5267 - 'induct' proper support for mutual induction involving non-atomic
5268 rule statements (uses the new concept of simultaneous goals, see
5270 - append all possible rule selections, but only use the first
5271 success (no backtracking);
5272 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5273 - undeclared rule case names default to numbers 1, 2, 3, ...;
5274 - added 'print_induct_rules' (covered by help item in recent Proof
5276 - moved induct/cases attributes to Pure, methods to Provers;
5277 - generic method setup instantiated for FOL and HOL;
5279 * Pure: support multiple simultaneous goal statements, for example
5280 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5281 meta-level mechanism, this acts as if several individual goals had
5282 been stated separately; in particular common proof methods need to be
5283 repeated in order to cover all claims; note that a single elimination
5284 step is *not* sufficient to establish the two conjunctions, so this
5287 assume "A & B" then have A and B .. (*".." fails*)
5289 better use "obtain" in situations as above; alternative refer to
5290 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5292 * Pure: proper integration with ``locales''; unlike the original
5293 version by Florian Kammller, Isar locales package high-level proof
5294 contexts rather than raw logical ones (e.g. we admit to include
5295 attributes everywhere); operations on locales include merge and
5296 rename; support for implicit arguments (``structures''); simultaneous
5297 type-inference over imports and text; see also HOL/ex/Locales.thy for
5300 * Pure: the following commands have been ``localized'', supporting a
5301 target locale specification "(in name)": 'lemma', 'theorem',
5302 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5303 stored both within the locale and at the theory level (exported and
5304 qualified by the locale name);
5306 * Pure: theory goals may now be specified in ``long'' form, with
5307 ad-hoc contexts consisting of arbitrary locale elements. for example
5308 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5309 definitions may be given, too); the result is a meta-level rule with
5310 the context elements being discharged in the obvious way;
5312 * Pure: new proof command 'using' allows to augment currently used
5313 facts after a goal statement ('using' is syntactically analogous to
5314 'apply', but acts on the goal's facts only); this allows chained facts
5315 to be separated into parts given before and after a claim, as in
5316 ``from a and b have C using d and e <proof>'';
5318 * Pure: renamed "antecedent" case to "rule_context";
5320 * Pure: new 'judgment' command records explicit information about the
5321 object-logic embedding (used by several tools internally); no longer
5322 use hard-wired "Trueprop";
5324 * Pure: added 'corollary' command;
5326 * Pure: fixed 'token_translation' command;
5328 * Pure: removed obsolete 'exported' attribute;
5330 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5331 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5332 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5334 * Pure: method 'atomize' presents local goal premises as object-level
5335 statements (atomic meta-level propositions); setup controlled via
5336 rewrite rules declarations of 'atomize' attribute; example
5337 application: 'induct' method with proper rule statements in improper
5340 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5341 now consider the syntactic context of assumptions, giving a better
5342 chance to get type-inference of the arguments right (this is
5343 especially important for locales);
5345 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5348 * Pure/obtain: the formal conclusion "thesis", being marked as
5349 ``internal'', may no longer be reference directly in the text;
5350 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5353 * Pure: generic 'sym' attribute which declares a rule both as pure
5354 'elim?' and for the 'symmetric' operation;
5356 * Pure: marginal comments ``--'' may now occur just anywhere in the
5357 text; the fixed correlation with particular command syntax has been
5360 * Pure: new method 'rules' is particularly well-suited for proof
5361 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5362 but often produces more compact proof terms with less detours;
5364 * Pure/Provers/classical: simplified integration with pure rule
5365 attributes and methods; the classical "intro?/elim?/dest?"
5366 declarations coincide with the pure ones; the "rule" method no longer
5367 includes classically swapped intros; "intro" and "elim" methods no
5368 longer pick rules from the context; also got rid of ML declarations
5369 AddXIs/AddXEs/AddXDs; all of this has some potential for
5372 * Provers/classical: attribute 'swapped' produces classical inversions
5373 of introduction rules;
5375 * Provers/simplifier: 'simplified' attribute may refer to explicit
5376 rules instead of full simplifier context; 'iff' attribute handles
5379 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5381 * HOL: 'recdef' now fails on unfinished automated proofs, use
5382 "(permissive)" option to recover old behavior;
5384 * HOL: 'inductive' no longer features separate (collective) attributes
5385 for 'intros' (was found too confusing);
5387 * HOL: properly declared induction rules less_induct and
5393 * HOL: moved over to sane numeral syntax; the new policy is as
5396 - 0 and 1 are polymorphic constants, which are defined on any
5397 numeric type (nat, int, real etc.);
5399 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5400 binary representation internally;
5402 - type nat has special constructor Suc, and generally prefers Suc 0
5403 over 1::nat and Suc (Suc 0) over 2::nat;
5405 This change may cause significant problems of INCOMPATIBILITY; here
5406 are some hints on converting existing sources:
5408 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5409 entities, so expressions involving "-" (unary or binary minus) need
5410 to be spaced properly;
5412 - existing occurrences of "1" may need to be constraint "1::nat" or
5413 even replaced by Suc 0; similar for old "2";
5415 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5417 - remove all special provisions on numerals in proofs;
5419 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5420 representation (depends on bin_arith_simps in the default context);
5422 * HOL: symbolic syntax for x^2 (numeral 2);
5424 * HOL: the class of all HOL types is now called "type" rather than
5425 "term"; INCOMPATIBILITY, need to adapt references to this type class
5426 in axclass/classes, instance/arities, and (usually rare) occurrences
5427 in typings (of consts etc.); internally the class is called
5428 "HOL.type", ML programs should refer to HOLogic.typeS;
5430 * HOL/record package improvements:
5431 - new derived operations "fields" to build a partial record section,
5432 "extend" to promote a fixed record to a record scheme, and
5433 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5434 declared as simp by default;
5435 - shared operations ("more", "fields", etc.) now need to be always
5436 qualified) --- potential INCOMPATIBILITY;
5437 - removed "make_scheme" operations (use "make" with "extend") --
5439 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5440 - provides cases/induct rules for use with corresponding Isar
5441 methods (for concrete records, record schemes, concrete more
5442 parts, and schematic more parts -- in that order);
5443 - internal definitions directly based on a light-weight abstract
5444 theory of product types over typedef rather than datatype;
5446 * HOL: generic code generator for generating executable ML code from
5447 specifications; specific support for HOL constructs such as inductive
5448 datatypes and sets, as well as recursive functions; can be invoked
5449 via 'generate_code' theory section;
5451 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5453 * HOL: consolidated and renamed several theories. In particular:
5454 Ord.thy has been absorbed into HOL.thy
5455 String.thy has been absorbed into List.thy
5457 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5458 (beware of argument permutation!);
5460 * HOL: linorder_less_split superseded by linorder_cases;
5462 * HOL/List: "nodups" renamed to "distinct";
5464 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5465 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5466 - Ex_def has changed, now need to use some_eq_ex
5468 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5469 in this (rare) case use:
5471 delSWrapper "split_all_tac"
5472 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5474 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5477 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5478 Isabelle's type classes, ^ on functions and relations has too general
5479 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5480 necessary to attach explicit type constraints;
5482 * HOL/Relation: the prefix name of the infix "O" has been changed from
5483 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5484 renamed accordingly (eg "compI" -> "rel_compI").
5486 * HOL: syntax translations now work properly with numerals and records
5489 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5490 of "lam" -- INCOMPATIBILITY;
5492 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5493 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5494 renamed "Product_Type.unit";
5496 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5498 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5499 the "cases" method);
5501 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5504 * HOL/IMP: updated and converted to new-style theory format; several
5505 parts turned into readable document, with proper Isar proof texts and
5506 some explanations (by Gerwin Klein);
5508 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5510 * HOL-Hyperreal is now a logic image;
5515 * Isar: consts/constdefs supports mixfix syntax for continuous
5518 * Isar: domain package adapted to new-style theory format, e.g. see
5521 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5522 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5523 lift.induct_tac, always use UU instead of Undef;
5525 * HOLCF/IMP: updated and converted to new-style theory;
5530 * Isar: proper integration of logic-specific tools and packages,
5531 including theory commands '(co)inductive', '(co)datatype',
5532 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5533 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5535 * theory Main no longer includes AC; for the Axiom of Choice, base
5536 your theory on Main_ZFC;
5538 * the integer library now covers quotients and remainders, with many
5539 laws relating division to addition, multiplication, etc.;
5541 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5542 typeless version of the formalism;
5544 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5547 * ZF/Induct: new directory for examples of inductive definitions,
5548 including theory Multiset for multiset orderings; converted to
5549 new-style theory format;
5551 * ZF: many new theorems about lists, ordinals, etc.;
5556 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5557 variable proof controls level of detail: 0 = no proofs (only oracle
5558 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5559 also ref manual for further ML interfaces;
5561 * Pure/axclass: removed obsolete ML interface
5562 goal_subclass/goal_arity;
5564 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5565 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5566 separate tokens, so expressions involving minus need to be spaced
5569 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5570 rather than "infixl" or "infixr";
5572 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5573 sort constraint specifications in type inference; e.g. "x::_::foo"
5574 ensures that the type of "x" is of sort "foo" (but not necessarily a
5577 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5578 control output of nested => (types); the default behavior is
5581 * Pure/syntax: builtin parse translation for "_constify" turns valued
5582 tokens into AST constants;
5584 * Pure/syntax: prefer later declarations of translations and print
5585 translation functions; potential INCOMPATIBILITY: need to reverse
5586 multiple declarations for same syntax element constant;
5588 * Pure/show_hyps reset by default (in accordance to existing Isar
5591 * Provers/classical: renamed addaltern to addafter, addSaltern to
5594 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5597 * system: tested support for MacOS X; should be able to get Isabelle +
5598 Proof General to work in a plain Terminal after installing Poly/ML
5599 (e.g. from the Isabelle distribution area) and GNU bash alone
5600 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5601 support requires further installations, e.g. from
5602 http://fink.sourceforge.net/);
5604 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5606 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5607 of 40 MB), cf. ML_OPTIONS;
5609 * system: Proof General keywords specification is now part of the
5610 Isabelle distribution (see etc/isar-keywords.el);
5612 * system: support for persistent Proof General sessions (refrain from
5613 outdating all loaded theories on startup); user may create writable
5614 logic images like this: ``isabelle -q HOL Test'';
5616 * system: smart selection of Isabelle process versus Isabelle
5617 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5618 run both "isabelle" and "Isabelle" even if file names are badly
5619 damaged (executable inspects the case of the first letter of its own
5620 name); added separate "isabelle-process" and "isabelle-interface";
5622 * system: refrain from any attempt at filtering input streams; no
5623 longer support ``8bit'' encoding of old isabelle font, instead proper
5624 iso-latin characters may now be used; the related isatools
5625 "symbolinput" and "nonascii" have disappeared as well;
5627 * system: removed old "xterm" interface (the print modes "xterm" and
5628 "xterm_color" are still available for direct use in a suitable
5633 New in Isabelle99-2 (February 2001)
5634 -----------------------------------
5636 *** Overview of INCOMPATIBILITIES ***
5638 * HOL: please note that theories in the Library and elsewhere often use the
5639 new-style (Isar) format; to refer to their theorems in an ML script you must
5640 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5642 * HOL: inductive package no longer splits induction rule aggressively,
5643 but only as far as specified by the introductions given; the old
5644 format may be recovered via ML function complete_split_rule or attribute
5645 'split_rule (complete)';
5647 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5648 gfp_Tarski to gfp_unfold;
5650 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5652 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5653 relation); infix "^^" has been renamed "``"; infix "``" has been
5654 renamed "`"; "univalent" has been renamed "single_valued";
5656 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5659 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5661 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5663 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5664 consequence, it is no longer monotonic wrt. the local goal context
5665 (which is now passed through the inductive cases);
5667 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5668 \<gg> to \<ggreater>;
5671 *** Document preparation ***
5673 * \isabellestyle{NAME} selects version of Isabelle output (currently
5674 available: are "it" for near math-mode best-style output, "sl" for
5675 slanted text style, and "tt" for plain type-writer; if no
5676 \isabellestyle command is given, output is according to slanted
5679 * support sub/super scripts (for single symbols only), input syntax is
5680 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5682 * some more standard symbols; see Appendix A of the system manual for
5683 the complete list of symbols defined in isabellesym.sty;
5685 * improved isabelle style files; more abstract symbol implementation
5686 (should now use \isamath{...} and \isatext{...} in custom symbol
5689 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5690 state; Note that presentation of goal states does not conform to
5691 actual human-readable proof documents. Please do not include goal
5692 states into document output unless you really know what you are doing!
5694 * proper indentation of antiquoted output with proportional LaTeX
5697 * no_document ML operator temporarily disables LaTeX document
5700 * isatool unsymbolize tunes sources for plain ASCII communication;
5705 * Pure: Isar now suffers initial goal statements to contain unbound
5706 schematic variables (this does not conform to actual readable proof
5707 documents, due to unpredictable outcome and non-compositional proof
5708 checking); users who know what they are doing may use schematic goals
5709 for Prolog-style synthesis of proven results;
5711 * Pure: assumption method (an implicit finishing) now handles actual
5714 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5715 initial goal, declare "that" only as Pure intro (only for single
5716 steps); the "that" rule assumption may now be involved in implicit
5717 finishing, thus ".." becomes a feasible for trivial obtains;
5719 * Pure: default proof step now includes 'intro_classes'; thus trivial
5720 instance proofs may be performed by "..";
5722 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5725 * Pure: more robust selection of calculational rules;
5727 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5728 rule (as well as the assumption rule);
5730 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5731 lemmas, using the graph browser tool;
5733 * Pure: predict failure of "show" in interactive mode;
5735 * Pure: 'thms_containing' now takes actual terms as arguments;
5737 * HOL: improved method 'induct' --- now handles non-atomic goals
5738 (potential INCOMPATIBILITY); tuned error handling;
5740 * HOL: cases and induct rules now provide explicit hints about the
5741 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5742 any remaining facts are inserted into the goal verbatim;
5744 * HOL: local contexts (aka cases) may now contain term bindings as
5745 well; the 'cases' and 'induct' methods new provide a ?case binding for
5746 the result to be shown in each case;
5748 * HOL: added 'recdef_tc' command;
5750 * isatool convert assists in eliminating legacy ML scripts;
5755 * HOL/Library: a collection of generic theories to be used together
5756 with main HOL; the theory loader path already includes this directory
5757 by default; the following existing theories have been moved here:
5758 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5759 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5761 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5762 modelling and verification task performed in Isabelle/HOL +
5763 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5765 * HOL/Algebra: special summation operator SUM no longer exists, it has
5766 been replaced by setsum; infix 'assoc' now has priority 50 (like
5767 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5768 'domain', this makes the theory consistent with mathematical
5771 * HOL basics: added overloaded operations "inverse" and "divide"
5772 (infix "/"), syntax for generic "abs" operation, generic summation
5775 * HOL/typedef: simplified package, provide more useful rules (see also
5778 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5779 now expressed as a proper nested rule (old-style tactic scripts may
5780 require atomize_strip_tac to cope with non-atomic premises);
5782 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5783 to "split_conv" (old name still available for compatibility);
5785 * HOL: improved concrete syntax for strings (e.g. allows translation
5786 rules with string literals);
5788 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5789 and Fleuriot's mechanization of analysis, including the transcendental
5790 functions for the reals;
5792 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5797 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5798 "lam" is displayed as TWO lambda-symbols
5800 * CTT: theory Main now available, containing everything (that is, Bool
5806 * Pure: the Simplifier has been implemented properly as a derived rule
5807 outside of the actual kernel (at last!); the overall performance
5808 penalty in practical applications is about 50%, while reliability of
5809 the Isabelle inference kernel has been greatly improved;
5811 * print modes "brackets" and "no_brackets" control output of nested =>
5812 (types) and ==> (props); the default behaviour is "brackets";
5814 * Provers: fast_tac (and friends) now handle actual object-logic rules
5815 as assumptions as well;
5817 * system: support Poly/ML 4.0;
5819 * system: isatool install handles KDE version 1 or 2;
5823 New in Isabelle99-1 (October 2000)
5824 ----------------------------------
5826 *** Overview of INCOMPATIBILITIES ***
5828 * HOL: simplification of natural numbers is much changed; to partly
5829 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5830 issue the following ML commands:
5832 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5833 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5835 * HOL: simplification no longer dives into case-expressions; this is
5836 controlled by "t.weak_case_cong" for each datatype t;
5838 * HOL: nat_less_induct renamed to less_induct;
5840 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5841 fixsome to patch .thy and .ML sources automatically;
5843 select_equality -> some_equality
5844 select_eq_Ex -> some_eq_ex
5845 selectI2EX -> someI2_ex
5848 select1_equality -> some1_equality
5849 Eps_sym_eq -> some_sym_eq_trivial
5850 Eps_eq -> some_eq_trivial
5852 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5854 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5857 * HOL: the recursion equations generated by 'recdef' are now called
5858 f.simps instead of f.rules;
5860 * HOL: qed_spec_mp now also handles bounded ALL as well;
5862 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5863 sometimes be needed;
5865 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5867 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5869 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5870 product is now "<*>" instead of "Times"; the lexicographic product is
5871 now "<*lex*>" instead of "**";
5873 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5874 of main HOL, but was unused); better use HOL's datatype package;
5876 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5877 the old syntax may be recovered as follows:
5880 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5881 (infixl "\\<oplus>" 100)
5883 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5885 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5886 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5889 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5890 changed from A/r to A//r;
5892 * ZF: new treatment of arithmetic (nat & int) may break some old
5895 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5896 rulify -> rule_format, elimify -> elim_format, ...);
5898 * Isar/Provers: intro/elim/dest attributes changed; renamed
5899 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5900 should have to change intro!! to intro? only); replaced "delrule" by
5903 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5905 * Provers: strengthened force_tac by using new first_best_tac;
5907 * LaTeX document preparation: several changes of isabelle.sty (see
5911 *** Document preparation ***
5913 * formal comments (text blocks etc.) in new-style theories may now
5914 contain antiquotations of thm/prop/term/typ/text to be presented
5915 according to latex print mode; concrete syntax is like this:
5916 @{term[show_types] "f(x) = a + x"};
5918 * isatool mkdir provides easy setup of Isabelle session directories,
5919 including proper document sources;
5921 * generated LaTeX sources are now deleted after successful run
5922 (isatool document -c); may retain a copy somewhere else via -D option
5925 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5926 style files, achieving self-contained LaTeX sources and simplifying
5929 * old-style theories now produce (crude) LaTeX output as well;
5931 * browser info session directories are now self-contained (may be put
5932 on WWW server seperately); improved graphs of nested sessions; removed
5933 graph for 'all sessions';
5935 * several improvements in isabelle style files; \isabellestyle{it}
5936 produces fake math mode output; \isamarkupheader is now \section by
5937 default; see lib/texinputs/isabelle.sty etc.;
5942 * Isar/Pure: local results and corresponding term bindings are now
5943 subject to Hindley-Milner polymorphism (similar to ML); this
5944 accommodates incremental type-inference very nicely;
5946 * Isar/Pure: new derived language element 'obtain' supports
5947 generalized existence reasoning;
5949 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5950 support accumulation of results, without applying any rules yet;
5951 useful to collect intermediate results without explicit name
5952 references, and for use with transitivity rules with more than 2
5955 * Isar/Pure: scalable support for case-analysis type proofs: new
5956 'case' language element refers to local contexts symbolically, as
5957 produced by certain proof methods; internally, case names are attached
5958 to theorems as "tags";
5960 * Isar/Pure: theory command 'hide' removes declarations from
5961 class/type/const name spaces;
5963 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5964 indicate potential overloading;
5966 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5968 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5969 "{a,b,c}" instead of {a,b,c};
5971 * Isar/Pure now provides its own version of intro/elim/dest
5972 attributes; useful for building new logics, but beware of confusion
5973 with the version in Provers/classical;
5975 * Isar/Pure: the local context of (non-atomic) goals is provided via
5976 case name 'antecedent';
5978 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5979 to the current context is now done automatically);
5981 * Isar/Pure: theory command 'method_setup' provides a simple interface
5982 for definining proof methods in ML;
5984 * Isar/Provers: intro/elim/dest attributes changed; renamed
5985 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5986 most cases, one should have to change intro!! to intro? only);
5987 replaced "delrule" by "rule del";
5989 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5990 'symmetric' attribute (the latter supercedes [RS sym]);
5992 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5993 method modifier); 'simp' method: 'only:' modifier removes loopers as
5994 well (including splits);
5996 * Isar/Provers: Simplifier and Classical methods now support all kind
5997 of modifiers used in the past, including 'cong', 'iff', etc.
5999 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
6000 of Simplifier and Classical reasoner);
6002 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
6003 now support named cases; major packages (inductive, datatype, primrec,
6004 recdef) support case names and properly name parameters;
6006 * Isar/HOL: new transitivity rules for substitution in inequalities --
6007 monotonicity conditions are extracted to be proven at end of
6010 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
6013 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
6014 split_if split_if_asm; datatype package provides theorems foo.splits =
6015 foo.split foo.split_asm for each datatype;
6017 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
6018 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
6019 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
6020 use "(cases (simplified))" method in proper proof texts);
6022 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
6024 * Isar: names of theorems etc. may be natural numbers as well;
6026 * Isar: 'pr' command: optional arguments for goals_limit and
6027 ProofContext.prems_limit; no longer prints theory contexts, but only
6030 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6031 additional print modes to be specified; e.g. "pr(latex)" will print
6032 proof state according to the Isabelle LaTeX style;
6034 * Isar: improved support for emulating tactic scripts, including proof
6035 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6036 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6037 (for HOL datatypes);
6039 * Isar: simplified (more robust) goal selection of proof methods: 1st
6040 goal, all goals, or explicit goal specifier (tactic emulation); thus
6041 'proof method scripts' have to be in depth-first order;
6043 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6045 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6046 should instead use individual commands for printing items
6047 (print_commands, print_methods etc.);
6049 * Isar: added 'nothing' --- the empty list of theorems;
6054 * HOL/MicroJava: formalization of a fragment of Java, together with a
6055 corresponding virtual machine and a specification of its bytecode
6056 verifier and a lightweight bytecode verifier, including proofs of
6057 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6058 Cornelia Pusch (see also the homepage of project Bali at
6059 http://isabelle.in.tum.de/Bali/);
6061 * HOL/Algebra: new theory of rings and univariate polynomials, by
6064 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6065 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6068 * HOL/Lattice: fundamental concepts of lattice theory and order
6069 structures, including duals, properties of bounds versus algebraic
6070 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6071 Theorem for complete lattices etc.; may also serve as a demonstration
6072 for abstract algebraic reasoning using axiomatic type classes, and
6073 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6075 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6078 * HOL/IMPP: extension of IMP with local variables and mutually
6079 recursive procedures, by David von Oheimb;
6081 * HOL/Lambda: converted into new-style theory and document;
6083 * HOL/ex/Multiquote: example of multiple nested quotations and
6084 anti-quotations -- basically a generalized version of de-Bruijn
6085 representation; very useful in avoiding lifting of operations;
6087 * HOL/record: added general record equality rule to simpset; fixed
6088 select-update simplification procedure to handle extended records as
6089 well; admit "r" as field name;
6091 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6092 other numeric types and also as the identity of groups, rings, etc.;
6094 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6095 Types nat and int belong to this axclass;
6097 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6098 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6099 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6100 two terms #m*u and #n*u are replaced by #(m+n)*u
6101 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6102 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6103 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6105 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6106 powerful prover for predicate logic but knows nothing of clasets; see
6107 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6109 * HOL: new version of "case_tac" subsumes both boolean case split and
6110 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6111 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6113 * HOL: simplification no longer dives into case-expressions: only the
6114 selector expression is simplified, but not the remaining arms; to
6115 enable full simplification of case-expressions for datatype t, you may
6116 remove t.weak_case_cong from the simpset, either globally (Delcongs
6117 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6119 * HOL/recdef: the recursion equations generated by 'recdef' for
6120 function 'f' are now called f.simps instead of f.rules; if all
6121 termination conditions are proved automatically, these simplification
6122 rules are added to the simpset, as in primrec; rules may be named
6123 individually as well, resulting in a separate list of theorems for
6126 * HOL/While is a new theory that provides a while-combinator. It
6127 permits the definition of tail-recursive functions without the
6128 provision of a termination measure. The latter is necessary once the
6129 invariant proof rule for while is applied.
6131 * HOL: new (overloaded) notation for the set of elements below/above
6132 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6134 * HOL: theorems impI, allI, ballI bound as "strip";
6136 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6137 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6138 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6140 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6142 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6143 main HOL, but was unused);
6145 * HOL: fewer consts declared as global (e.g. have to refer to
6146 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6148 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6149 in case of overlap with user translations (e.g. judgements over
6150 tuples); (note that the underlying logical represenation is still
6156 * ZF: simplification automatically cancels common terms in arithmetic
6157 expressions over nat and int;
6159 * ZF: new treatment of nat to minimize type-checking: all operators
6160 coerce their operands to a natural number using the function natify,
6161 making the algebraic laws unconditional;
6163 * ZF: as above, for int: operators coerce their operands to an integer
6164 using the function intify;
6166 * ZF: the integer library now contains many of the usual laws for the
6167 orderings, including $<=, and monotonicity laws for $+ and $*;
6169 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6172 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6173 to the simplifier and classical reasoner simultaneously;
6178 * Provers: blast_tac now handles actual object-logic rules as
6179 assumptions; note that auto_tac uses blast_tac internally as well;
6181 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6182 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6184 * Provers: delrules now handles destruct rules as well (no longer need
6185 explicit make_elim);
6187 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6188 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6189 use instead the strong form,
6190 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6191 in HOL, FOL and ZF the function cla_make_elim will create such rules
6192 from destruct-rules;
6194 * Provers: Simplifier.easy_setup provides a fast path to basic
6195 Simplifier setup for new object-logics;
6197 * Pure: AST translation rules no longer require constant head on LHS;
6199 * Pure: improved name spaces: ambiguous output is qualified; support
6200 for hiding of names;
6202 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6203 XSYMBOL_HOME; no longer need to do manual configuration in most
6206 * system: compression of ML heaps images may now be controlled via -c
6207 option of isabelle and isatool usedir (currently only observed by
6210 * system: isatool installfonts may handle X-Symbol fonts as well (very
6211 useful for remote X11);
6213 * system: provide TAGS file for Isabelle sources;
6215 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6218 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6219 timing flag supersedes proof_timing and Toplevel.trace;
6221 * ML: new combinators |>> and |>>> for incremental transformations
6222 with secondary results (e.g. certain theory extensions):
6224 * ML: PureThy.add_defs gets additional argument to indicate potential
6225 overloading (usually false);
6227 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6232 New in Isabelle99 (October 1999)
6233 --------------------------------
6235 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6237 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6238 are no longer simplified. (This allows the simplifier to unfold recursive
6239 functional programs.) To restore the old behaviour, declare
6241 Delcongs [if_weak_cong];
6243 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6246 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6248 * HOL/datatype: mutual_induct_tac no longer exists --
6249 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6251 * HOL/typedef: fixed type inference for representing set; type
6252 arguments now have to occur explicitly on the rhs as type constraints;
6254 * ZF: The con_defs part of an inductive definition may no longer refer
6255 to constants declared in the same theory;
6257 * HOL, ZF: the function mk_cases, generated by the inductive
6258 definition package, has lost an argument. To simplify its result, it
6259 uses the default simpset instead of a supplied list of theorems.
6261 * HOL/List: the constructors of type list are now Nil and Cons;
6263 * Simplifier: the type of the infix ML functions
6264 setSSolver addSSolver setSolver addSolver
6265 is now simpset * solver -> simpset where `solver' is a new abstract type
6266 for packaging solvers. A solver is created via
6267 mk_solver: string -> (thm list -> int -> tactic) -> solver
6268 where the string argument is only a comment.
6273 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6274 decision procedure for linear arithmetic. Currently it is used for
6275 types `nat', `int', and `real' in HOL (see below); it can, should and
6276 will be instantiated for other types and logics as well.
6278 * The simplifier now accepts rewrite rules with flexible heads, eg
6279 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6280 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6286 * New Isabelle/Isar subsystem provides an alternative to traditional
6287 tactical theorem proving; together with the ProofGeneral/isar user
6288 interface it offers an interactive environment for developing human
6289 readable proof documents (Isar == Intelligible semi-automated
6290 reasoning); for further information see isatool doc isar-ref,
6291 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6293 * improved and simplified presentation of theories: better HTML markup
6294 (including colors), graph views in several sizes; isatool usedir now
6295 provides a proper interface for user theories (via -P option); actual
6296 document preparation based on (PDF)LaTeX is available as well (for
6297 new-style theories only); see isatool doc system for more information;
6299 * native support for Proof General, both for classic Isabelle and
6302 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6303 using the graph browser tool;
6305 * Isabelle manuals now also available as PDF;
6307 * theory loader rewritten from scratch (may not be fully
6308 bug-compatible); old loadpath variable has been replaced by show_path,
6309 add_path, del_path, reset_path functions; new operations such as
6310 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6313 * improved isatool install: option -k creates KDE application icon,
6314 option -p DIR installs standalone binaries;
6316 * added ML_PLATFORM setting (useful for cross-platform installations);
6317 more robust handling of platform specific ML images for SML/NJ;
6319 * the settings environment is now statically scoped, i.e. it is never
6320 created again in sub-processes invoked from isabelle, isatool, or
6323 * path element specification '~~' refers to '$ISABELLE_HOME';
6325 * in locales, the "assumes" and "defines" parts may be omitted if
6328 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6331 * new print_mode "HTML";
6333 * new flag show_tags controls display of tags of theorems (which are
6334 basically just comments that may be attached by some tools);
6336 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6337 mode and goal output format:
6339 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6341 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6343 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6344 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6346 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6348 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6350 * function bind_thms stores lists of theorems (cf. bind_thm);
6352 * new shorthand tactics ftac, eatac, datac, fatac;
6354 * qed (and friends) now accept "" as result name; in that case the
6355 theorem is not stored, but proper checks and presentation of the
6358 * theorem database now also indexes constants "Trueprop", "all",
6359 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6364 ** HOL arithmetic **
6366 * There are now decision procedures for linear arithmetic over nat and
6369 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6370 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6371 are treated as atomic; subformulae not involving type `nat' or `int'
6372 are ignored; quantified subformulae are ignored unless they are
6373 positive universal or negative existential. The tactic has to be
6374 invoked by hand and can be a little bit slow. In particular, the
6375 running time is exponential in the number of occurrences of `min' and
6376 `max', and `-' on `nat'.
6378 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6379 (negated) (in)equalities among the premises and the conclusion into
6380 account (i.e. no compound formulae) and does not know about `min' and
6381 `max', and `-' on `nat'. It is fast and is used automatically by the
6384 NB: At the moment, these decision procedures do not cope with mixed
6385 nat/int formulae where the two parts interact, such as `m < n ==>
6388 * HOL/Numeral provides a generic theory of numerals (encoded
6389 efficiently as bit strings); setup for types nat/int/real is in place;
6390 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6391 int, existing theories and proof scripts may require a few additional
6394 * integer division and remainder can now be performed on constant
6397 * many properties of integer multiplication, division and remainder
6400 * An interface to the Stanford Validity Checker (SVC) is available through the
6401 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6402 are proved automatically. SVC must be installed separately, and its results
6403 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6404 invocation of the underlying oracle). For SVC see
6405 http://verify.stanford.edu/SVC
6407 * IsaMakefile: the HOL-Real target now builds an actual image;
6412 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6413 (in Isabelle/Isar) -- by Gertrud Bauer;
6415 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6416 analysis for assembly languages with subtypes;
6418 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6419 -- avoids syntactic ambiguities and treats state, transition, and
6420 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6421 changed syntax and (many) tactics;
6423 * HOL/inductive: Now also handles more general introduction rules such
6424 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6425 theorems are now maintained within the theory (maintained via the
6428 * HOL/datatype: Now also handles arbitrarily branching datatypes
6429 (using function types) such as
6431 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6433 * HOL/record: record_simproc (part of the default simpset) takes care
6434 of selectors applied to updated records; record_split_tac is no longer
6435 part of the default claset; update_defs may now be removed from the
6436 simpset in many cases; COMPATIBILITY: old behavior achieved by
6438 claset_ref () := claset() addSWrapper record_split_wrapper;
6439 Delsimprocs [record_simproc]
6441 * HOL/typedef: fixed type inference for representing set; type
6442 arguments now have to occur explicitly on the rhs as type constraints;
6444 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6445 names rather than an ML expression;
6447 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6448 supplied later. Program schemes can be defined, such as
6449 "While B C s = (if B s then While B C (C s) else s)"
6450 where the well-founded relation can be chosen after B and C have been given.
6452 * HOL/List: the constructors of type list are now Nil and Cons;
6453 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6454 course, ML tools referring to List.list.op # etc. have to be adapted;
6456 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6457 disabled by default; run isabelle with option -m HOL to get back to
6458 the original Gordon/HOL-style output;
6460 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6461 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6463 * HOL basic syntax simplified (more orthogonal): all variants of
6464 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6465 Eps operator is provided as well: "SOME x. P[x]";
6467 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6469 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6470 thus available for user theories;
6472 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6473 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6476 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6477 several times and then mp;
6482 * the notation <<...>> is now available as a notation for sequences of
6485 * the simplifier is now installed
6487 * the axiom system has been generalized (thanks to Soren Heilmann)
6489 * the classical reasoner now has a default rule database
6494 * new primrec section allows primitive recursive functions to be given
6495 directly (as in HOL) over datatypes and the natural numbers;
6497 * new tactics induct_tac and exhaust_tac for induction (or case
6498 analysis) over datatypes and the natural numbers;
6500 * the datatype declaration of type T now defines the recursor T_rec;
6502 * simplification automatically does freeness reasoning for datatype
6505 * automatic type-inference, with AddTCs command to insert new
6506 type-checking rules;
6508 * datatype introduction rules are now added as Safe Introduction rules
6511 * the syntax "if P then x else y" is now available in addition to
6515 *** Internal programming interfaces ***
6517 * tuned simplifier trace output; new flag debug_simp;
6519 * structures Vartab / Termtab (instances of TableFun) offer efficient
6520 tables indexed by indexname_ord / term_ord (compatible with aconv);
6522 * AxClass.axclass_tac lost the theory argument;
6524 * tuned current_goals_markers semantics: begin / end goal avoids
6525 printing empty lines;
6527 * removed prs and prs_fn hook, which was broken because it did not
6528 include \n in its semantics, forcing writeln to add one
6529 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6530 string -> unit if you really want to output text without newline;
6532 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6533 plain output, interface builders may have to enable 'isabelle_font'
6534 mode to get Isabelle font glyphs as before;
6536 * refined token_translation interface; INCOMPATIBILITY: output length
6537 now of type real instead of int;
6539 * theory loader actions may be traced via new ThyInfo.add_hook
6540 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6541 your own database of information attached to *whole* theories -- as
6542 opposed to intra-theory data slots offered via TheoryDataFun;
6544 * proper handling of dangling sort hypotheses (at last!);
6545 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6546 extra sort hypotheses that can be witnessed from the type signature;
6547 the force_strip_shyps flag is gone, any remaining shyps are simply
6548 left in the theorem (with a warning issued by strip_shyps_warning);
6552 New in Isabelle98-1 (October 1998)
6553 ----------------------------------
6555 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6557 * several changes of automated proof tools;
6559 * HOL: major changes to the inductive and datatype packages, including
6560 some minor incompatibilities of theory syntax;
6562 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6565 * HOL: removed duplicate thms in Arith:
6566 less_imp_add_less should be replaced by trans_less_add1
6567 le_imp_add_le should be replaced by trans_le_add1
6569 * HOL: unary minus is now overloaded (new type constraints may be
6572 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6573 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6574 now taken as an integer constant.
6576 * Pure: ML function 'theory_of' renamed to 'theory';
6582 1. Asm_full_simp_tac is now more aggressive.
6583 1. It will sometimes reorient premises if that increases their power to
6585 2. It does no longer proceed strictly from left to right but may also
6586 rotate premises to achieve further simplification.
6587 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6588 old Asm_full_simp_tac in that it does not rotate premises.
6589 2. The simplifier now knows a little bit about nat-arithmetic.
6591 * Classical reasoner: wrapper mechanism for the classical reasoner now
6592 allows for selected deletion of wrappers, by introduction of names for
6593 wrapper functionals. This implies that addbefore, addSbefore,
6594 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6595 and that adding two tactics with the same name overwrites the first
6596 one (emitting a warning).
6597 type wrapper = (int -> tactic) -> (int -> tactic)
6598 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6599 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6600 delWrapper, delSWrapper: claset * string -> claset
6601 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6603 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6604 semantics; addbefore now affects only the unsafe part of step_tac
6605 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6606 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6609 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6610 compWrapper; added safe wrapper (and access functions for it);
6612 * HOL/split_all_tac is now much faster and fails if there is nothing
6613 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6614 and the names of the automatically generated variables have changed.
6615 split_all_tac has moved within claset() from unsafe wrappers to safe
6616 wrappers, which means that !!-bound variables are split much more
6617 aggressively, and safe_tac and clarify_tac now split such variables.
6618 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6619 Note: the same holds for record_split_tac, which does the job of
6620 split_all_tac for record fields.
6622 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6623 permanently to the default simpset using Addsplits just like
6624 Addsimps. They can be removed via Delsplits just like
6625 Delsimps. Lower-case versions are also available.
6627 * HOL/Simplifier: The rule split_if is now part of the default
6628 simpset. This means that the simplifier will eliminate all occurrences
6629 of if-then-else in the conclusion of a goal. To prevent this, you can
6630 either remove split_if completely from the default simpset by
6631 `Delsplits [split_if]' or remove it in a specific call of the
6632 simplifier using `... delsplits [split_if]'. You can also add/delete
6633 other case splitting rules to/from the default simpset: every datatype
6634 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6635 t is the name of the datatype).
6637 * Classical reasoner / Simplifier combination: new force_tac (and
6638 derivatives Force_tac, force) combines rewriting and classical
6639 reasoning (and whatever other tools) similarly to auto_tac, but is
6640 aimed to solve the given subgoal completely.
6645 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6646 and `goalw': the theory is no longer needed as an explicit argument -
6647 the current theory context is used; assumptions are no longer returned
6648 at the ML-level unless one of them starts with ==> or !!; it is
6649 recommended to convert to these new commands using isatool fixgoal
6650 (backup your sources first!);
6652 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6653 the current theory context, and 'theory' to lookup stored theories;
6655 * new theory section 'locale' for declaring constants, assumptions and
6656 definitions that have local scope;
6658 * new theory section 'nonterminals' for purely syntactic types;
6660 * new theory section 'setup' for generic ML setup functions
6661 (e.g. package initialization);
6663 * the distribution now includes Isabelle icons: see
6664 lib/logo/isabelle-{small,tiny}.xpm;
6666 * isatool install - install binaries with absolute references to
6669 * isatool logo -- create instances of the Isabelle logo (as EPS);
6671 * print mode 'emacs' reserved for Isamode;
6673 * support multiple print (ast) translations per constant name;
6675 * theorems involving oracles are now printed with a suffixed [!];
6680 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6682 * HOL/inductive package reorganized and improved: now supports mutual
6688 oddI "n : EVEN ==> Suc n : ODD"
6689 evenI "n : ODD ==> Suc n : EVEN"
6691 new theorem list "elims" contains an elimination rule for each of the
6692 recursive sets; inductive definitions now handle disjunctive premises
6693 correctly (also ZF);
6695 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6696 "mutual_induct" no longer exists - the induction rule is always
6697 contained in "induct";
6700 * HOL/datatype package re-implemented and greatly improved: now
6701 supports mutually recursive datatypes such as
6704 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6705 | SUM ('a aexp) ('a aexp)
6706 | DIFF ('a aexp) ('a aexp)
6709 'a bexp = LESS ('a aexp) ('a aexp)
6710 | AND ('a bexp) ('a bexp)
6711 | OR ('a bexp) ('a bexp)
6713 as well as indirectly recursive datatypes such as
6716 ('a, 'b) term = Var 'a
6717 | App 'b ((('a, 'b) term) list)
6719 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6720 induction on mutually / indirectly recursive datatypes.
6722 Primrec equations are now stored in theory and can be accessed via
6723 <function_name>.simps.
6727 - Theories using datatypes must now have theory Datatype as an
6729 - The specific <typename>.induct_tac no longer exists - use the
6730 generic induct_tac instead.
6731 - natE has been renamed to nat.exhaust - use exhaust_tac
6732 instead of res_inst_tac ... natE. Note that the variable
6733 names in nat.exhaust differ from the names in natE, this
6734 may cause some "fragile" proofs to fail.
6735 - The theorems split_<typename>_case and split_<typename>_case_asm
6736 have been renamed to <typename>.split and <typename>.split_asm.
6737 - Since default sorts of type variables are now handled correctly,
6738 some datatype definitions may have to be annotated with explicit
6740 - Primrec definitions no longer require function name and type
6741 of recursive argument.
6743 Consider using isatool fixdatatype to adapt your theories and proof
6744 scripts to the new package (backup your sources first!).
6747 * HOL/record package: considerably improved implementation; now
6748 includes concrete syntax for record types, terms, updates; theorems
6749 for surjective pairing and splitting !!-bound record variables; proof
6750 support is as follows:
6752 1) standard conversions (selectors or updates applied to record
6753 constructor terms) are part of the standard simpset;
6755 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6756 made part of standard simpset and claset via addIffs;
6758 3) a tactic for record field splitting (record_split_tac) is part of
6759 the standard claset (addSWrapper);
6761 To get a better idea about these rules you may retrieve them via
6762 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6763 the name of your record type.
6765 The split tactic 3) conceptually simplifies by the following rule:
6767 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6769 Thus any record variable that is bound by meta-all will automatically
6770 blow up into some record constructor term, consequently the
6771 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6772 solve record problems automatically.
6775 * reorganized the main HOL image: HOL/Integ and String loaded by
6776 default; theory Main includes everything;
6778 * automatic simplification of integer sums and comparisons, using cancellation;
6780 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6782 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6784 * many new identities for unions, intersections, set difference, etc.;
6786 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6787 called split_if, split_split, split_sum_case and split_nat_case (to go
6788 with add/delsplits);
6790 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6791 (?x::unit) = (); this is made part of the default simpset, which COULD
6792 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6793 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6794 unit_abs_eta_conv is added in order to counter the effect of
6795 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6798 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6801 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6802 It and 'sym RS equals0D' are now in the default claset, giving automatic
6803 disjointness reasoning but breaking a few old proofs.
6805 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6806 to 'converse' from 'inverse' (for compatibility with ZF and some
6809 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6810 the well-founded relation;
6812 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6813 Compl A. The "Compl" syntax remains available as input syntax for this
6816 * HOL/Update: new theory of function updates:
6817 f(a:=b) == %x. if x=a then b else f x
6818 may also be iterated as in f(a:=b,c:=d,...);
6820 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6823 - new function list_update written xs[i:=v] that updates the i-th
6824 list position. May also be iterated as in xs[i:=a,j:=b,...].
6825 - new function `upt' written [i..j(] which generates the list
6826 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6827 bound write [i..j], which is a shorthand for [i..j+1(].
6828 - new lexicographic orderings and corresponding wellfoundedness theorems.
6831 - removed 'pred' (predecessor) function;
6832 - generalized some theorems about n-1;
6833 - many new laws about "div" and "mod";
6834 - new laws about greatest common divisors (see theory ex/Primes);
6836 * HOL/Relation: renamed the relational operator r^-1 "converse"
6837 instead of "inverse";
6839 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6840 of the multiset ordering;
6842 * directory HOL/Real: a construction of the reals using Dedekind cuts
6843 (not included by default);
6845 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6847 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6848 programs, i.e. different program variables may have different types.
6850 * calling (stac rew i) now fails if "rew" has no effect on the goal
6851 [previously, this check worked only if the rewrite rule was unconditional]
6852 Now rew can involve either definitions or equalities (either == or =).
6857 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6858 only the theorems proved on ZF.ML;
6860 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6861 It and 'sym RS equals0D' are now in the default claset, giving automatic
6862 disjointness reasoning but breaking a few old proofs.
6864 * ZF/Update: new theory of function updates
6865 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6866 may also be iterated as in f(a:=b,c:=d,...);
6868 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6870 * calling (stac rew i) now fails if "rew" has no effect on the goal
6871 [previously, this check worked only if the rewrite rule was unconditional]
6872 Now rew can involve either definitions or equalities (either == or =).
6874 * case_tac provided for compatibility with HOL
6875 (like the old excluded_middle_tac, but with subgoals swapped)
6878 *** Internal programming interfaces ***
6880 * Pure: several new basic modules made available for general use, see
6881 also src/Pure/README;
6883 * improved the theory data mechanism to support encapsulation (data
6884 kind name replaced by private Object.kind, acting as authorization
6885 key); new type-safe user interface via functor TheoryDataFun; generic
6886 print_data function becomes basically useless;
6888 * removed global_names compatibility flag -- all theory declarations
6889 are qualified by default;
6891 * module Pure/Syntax now offers quote / antiquote translation
6892 functions (useful for Hoare logic etc. with implicit dependencies);
6893 see HOL/ex/Antiquote for an example use;
6895 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6898 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6901 * Display.print_goals function moved to Locale.print_goals;
6903 * standard print function for goals supports current_goals_markers
6904 variable for marking begin of proof, end of proof, start of goal; the
6905 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6906 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6911 New in Isabelle98 (January 1998)
6912 --------------------------------
6914 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6916 * changed lexical syntax of terms / types: dots made part of long
6917 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6919 * simpset (and claset) reference variable replaced by functions
6920 simpset / simpset_ref;
6922 * no longer supports theory aliases (via merge) and non-trivial
6923 implicit merge of thms' signatures;
6925 * most internal names of constants changed due to qualified names;
6927 * changed Pure/Sequence interface (see Pure/seq.ML);
6930 *** General Changes ***
6932 * hierachically structured name spaces (for consts, types, axms, thms
6933 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6934 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6935 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6936 long_names for fully qualified output names; NOTE: ML programs
6937 (special tactics, packages etc.) referring to internal names may have
6938 to be adapted to cope with fully qualified names; in case of severe
6939 backward campatibility problems try setting 'global_names' at compile
6940 time to have enrything declared within a flat name space; one may also
6941 fine tune name declarations in theories via the 'global' and 'local'
6944 * reimplemented the implicit simpset and claset using the new anytype
6945 data filed in signatures; references simpset:simpset ref etc. are
6946 replaced by functions simpset:unit->simpset and
6947 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6948 to patch your ML files accordingly;
6950 * HTML output now includes theory graph data for display with Java
6951 applet or isatool browser; data generated automatically via isatool
6952 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6954 * defs may now be conditional; improved rewrite_goals_tac to handle
6955 conditional equations;
6957 * defs now admits additional type arguments, using TYPE('a) syntax;
6959 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6960 creates a new theory node; implicit merge of thms' signatures is
6961 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6962 transfer:theory->thm->thm in (rare) cases;
6964 * improved handling of draft signatures / theories; draft thms (and
6965 ctyps, cterms) are automatically promoted to real ones;
6967 * slightly changed interfaces for oracles: admit many per theory, named
6968 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6970 * print_goals: optional output of const types (set show_consts and
6973 * improved output of warnings (###) and errors (***);
6975 * subgoal_tac displays a warning if the new subgoal has type variables;
6977 * removed old README and Makefiles;
6979 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6981 * removed obsolete init_pps and init_database;
6983 * deleted the obsolete tactical STATE, which was declared by
6984 fun STATE tacfun st = tacfun st st;
6986 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6987 (which abbreviates $HOME);
6989 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6990 use isatool fixseq to adapt your ML programs (this works for fully
6991 qualified references to the Sequence structure only!);
6993 * use_thy no longer requires writable current directory; it always
6994 reloads .ML *and* .thy file, if either one is out of date;
6997 *** Classical Reasoner ***
6999 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
7000 tactics that use classical reasoning to simplify a subgoal without
7001 splitting it into several subgoals;
7003 * Safe_tac: like safe_tac but uses the default claset;
7008 * added simplification meta rules:
7009 (asm_)(full_)simplify: simpset -> thm -> thm;
7011 * simplifier.ML no longer part of Pure -- has to be loaded by object
7014 * added prems argument to simplification procedures;
7016 * HOL, FOL, ZF: added infix function `addsplits':
7017 instead of `<simpset> setloop (split_tac <thms>)'
7018 you can simply write `<simpset> addsplits <thms>'
7023 * TYPE('a) syntax for type reflection terms;
7025 * no longer handles consts with name "" -- declare as 'syntax' instead;
7027 * pretty printer: changed order of mixfix annotation preference (again!);
7029 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7034 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7035 with `addloop' of the simplifier to faciliate case splitting in premises.
7037 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7039 * HOL/Auth: new protocol proofs including some for the Internet
7042 * HOL/Map: new theory of `maps' a la VDM;
7044 * HOL/simplifier: simplification procedures nat_cancel_sums for
7045 cancelling out common nat summands from =, <, <= (in)equalities, or
7046 differences; simplification procedures nat_cancel_factor for
7047 cancelling common factor from =, <, <= (in)equalities over natural
7048 sums; nat_cancel contains both kinds of procedures, it is installed by
7049 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7051 * HOL/simplifier: terms of the form
7052 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7054 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7055 and those of the form
7056 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7058 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7061 Each datatype `t' now comes with a theorem `split_t_case' of the form
7063 P(t_case f1 ... fn x) =
7064 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7066 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7069 and a theorem `split_t_case_asm' of the form
7071 P(t_case f1 ... fn x) =
7072 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7074 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7076 which can be added to a simpset via `addsplits'. The existing theorems
7077 expand_list_case and expand_option_case have been renamed to
7078 split_list_case and split_option_case.
7081 - `pred n' is automatically converted to `n-1'.
7082 Users are strongly encouraged not to use `pred' any longer,
7083 because it will disappear altogether at some point.
7084 - Users are strongly encouraged to write "0 < n" rather than
7085 "n ~= 0". Theorems and proof tools have been modified towards this
7089 the function "set_of_list" has been renamed "set" (and its theorems too);
7090 the function "nth" now takes its arguments in the reverse order and
7091 has acquired the infix notation "!" as in "xs!n".
7093 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7095 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7096 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7098 * HOL/record: extensible records with schematic structural subtyping
7099 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7100 still lacks various theorems and concrete record syntax;
7105 * removed "axioms" and "generated by" sections;
7107 * replaced "ops" section by extended "consts" section, which is capable of
7108 handling the continuous function space "->" directly;
7111 . proves theorems immediately and stores them in the theory,
7112 . creates hierachical name space,
7113 . now uses normal mixfix annotations (instead of cinfix...),
7114 . minor changes to some names and values (for consistency),
7115 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7116 . separator between mutual domain defs: changed "," to "and",
7117 . improved handling of sort constraints; now they have to
7118 appear on the left-hand side of the equations only;
7120 * fixed LAM <x,y,zs>.b syntax;
7122 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7123 adm (%x. P (t x)), where P is chainfinite and t continuous;
7128 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7129 with `addloop' of the simplifier to faciliate case splitting in premises.
7131 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7132 in HOL, they strip ALL and --> from proved theorems;
7136 New in Isabelle94-8 (May 1997)
7137 ------------------------------
7139 *** General Changes ***
7141 * new utilities to build / run / maintain Isabelle etc. (in parts
7142 still somewhat experimental); old Makefiles etc. still functional;
7144 * new 'Isabelle System Manual';
7146 * INSTALL text, together with ./configure and ./build scripts;
7148 * reimplemented type inference for greater efficiency, better error
7149 messages and clean internal interface;
7151 * prlim command for dealing with lots of subgoals (an easier way of
7152 setting goals_limit);
7157 * supports alternative (named) syntax tables (parser and pretty
7158 printer); internal interface is provided by add_modesyntax(_i);
7160 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7161 be used in conjunction with the Isabelle symbol font; uses the
7162 "symbols" syntax table;
7164 * added token_translation interface (may translate name tokens in
7165 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7166 the current print_mode); IMPORTANT: user print translation functions
7167 are responsible for marking newly introduced bounds
7168 (Syntax.mark_boundT);
7170 * token translations for modes "xterm" and "xterm_color" that display
7171 names in bold, underline etc. or colors (which requires a color
7174 * infixes may now be declared with names independent of their syntax;
7176 * added typed_print_translation (like print_translation, but may
7177 access type of constant);
7180 *** Classical Reasoner ***
7182 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7183 some limitations. Blast_tac...
7184 + ignores addss, addbefore, addafter; this restriction is intrinsic
7185 + ignores elimination rules that don't have the correct format
7186 (the conclusion MUST be a formula variable)
7187 + ignores types, which can make HOL proofs fail
7188 + rules must not require higher-order unification, e.g. apply_type in ZF
7189 [message "Function Var's argument not a bound variable" relates to this]
7190 + its proof strategy is more general but can actually be slower
7192 * substitution with equality assumptions no longer permutes other
7195 * minor changes in semantics of addafter (now called addaltern); renamed
7196 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7197 (and access functions for it);
7199 * improved combination of classical reasoner and simplifier:
7200 + functions for handling clasimpsets
7201 + improvement of addss: now the simplifier is called _after_ the
7203 + safe variant of addss called addSss: uses safe simplifications
7204 _during_ the safe steps. It is more complete as it allows multiple
7205 instantiations of unknowns (e.g. with slow_tac).
7209 * added interface for simplification procedures (functions that
7210 produce *proven* rewrite rules on the fly, depending on current
7213 * ordering on terms as parameter (used for ordered rewriting);
7215 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7217 * the solver is now split into a safe and an unsafe part.
7218 This should be invisible for the normal user, except that the
7219 functions setsolver and addsolver have been renamed to setSolver and
7220 addSolver; added safe_asm_full_simp_tac;
7225 * a generic induction tactic `induct_tac' which works for all datatypes and
7226 also for type `nat';
7228 * a generic case distinction tactic `exhaust_tac' which works for all
7229 datatypes and also for type `nat';
7231 * each datatype comes with a function `size';
7233 * patterns in case expressions allow tuple patterns as arguments to
7234 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7236 * primrec now also works with type nat;
7238 * recdef: a new declaration form, allows general recursive functions to be
7239 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7241 * the constant for negation has been renamed from "not" to "Not" to
7242 harmonize with FOL, ZF, LK, etc.;
7244 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7247 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7249 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7250 problems in commutative rings, using axiomatic type classes for + and *;
7252 * more examples in HOL/MiniML and HOL/Auth;
7254 * more default rewrite rules for quantifiers, union/intersection;
7256 * a new constant `arbitrary == @x.False';
7258 * HOLCF/IOA replaces old HOL/IOA;
7260 * HOLCF changes: derived all rules and arities
7261 + axiomatic type classes instead of classes
7262 + typedef instead of faking type definitions
7263 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7264 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7265 + eliminated the types void, one, tr
7266 + use unit lift and bool lift (with translations) instead of one and tr
7267 + eliminated blift from Lift3.thy (use Def instead of blift)
7268 all eliminated rules are derived as theorems --> no visible changes ;
7273 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7274 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7275 as ZF_cs addSIs [equalityI];
7279 New in Isabelle94-7 (November 96)
7280 ---------------------------------
7282 * allowing negative levels (as offsets) in prlev and choplev;
7284 * super-linear speedup for large simplifications;
7286 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7287 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7288 FAIL); can suppress it using the command Delsimps (ex_simps @
7289 all_simps); De Morgan laws are also now included, by default;
7291 * improved printing of ==> : ~:
7293 * new object-logic "Sequents" adds linear logic, while replacing LK
7294 and Modal (thanks to Sara Kalvala);
7296 * HOL/Auth: correctness proofs for authentication protocols;
7298 * HOL: new auto_tac combines rewriting and classical reasoning (many
7299 examples on HOL/Auth);
7301 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7302 the rewriter and classical reasoner simultaneously;
7304 * function uresult no longer returns theorems in "standard" format;
7305 regain previous version by: val uresult = standard o uresult;
7312 * oracles -- these establish an interface between Isabelle and trusted
7313 external reasoners, which may deliver results as theorems;
7315 * proof objects (in particular record all uses of oracles);
7317 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7319 * "constdefs" section in theory files;
7321 * "primrec" section (HOL) no longer requires names;
7323 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7330 * reduced space requirements;
7332 * automatic HTML generation from theories;
7334 * theory files no longer require "..." (quotes) around most types;
7336 * new examples, including two proofs of the Church-Rosser theorem;
7338 * non-curried (1994) version of HOL is no longer distributed;
7345 * greatly reduced space requirements;
7347 * theory files (.thy) no longer require \...\ escapes at line breaks;
7349 * searchable theorem database (see the section "Retrieving theorems" on
7350 page 8 of the Reference Manual);
7352 * new examples, including Grabczewski's monumental case study of the
7355 * The previous version of HOL renamed to Old_HOL;
7357 * The new version of HOL (previously called CHOL) uses a curried syntax
7358 for functions. Application looks like f a b instead of f(a,b);
7360 * Mutually recursive inductive definitions finally work in HOL;
7362 * In ZF, pattern-matching on tuples is now available in all abstractions and
7363 translates to the operator "split";
7370 * new infix operator, addss, allowing the classical reasoner to
7371 perform simplification at each step of its search. Example:
7372 fast_tac (cs addss ss)
7374 * a new logic, CHOL, the same as HOL, but with a curried syntax
7375 for functions. Application looks like f a b instead of f(a,b). Also pairs
7376 look like (a,b) instead of <a,b>;
7378 * PLEASE NOTE: CHOL will eventually replace HOL!
7380 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7381 It translates to the operator "split". A new theory of integers is available;
7383 * In ZF, integer numerals now denote two's-complement binary integers.
7384 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7386 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7387 of the Axiom of Choice;
7394 * Significantly faster resolution;
7396 * the different sections in a .thy file can now be mixed and repeated
7399 * Database of theorems for FOL, HOL and ZF. New
7400 commands including qed, qed_goal and bind_thm store theorems in the database.
7402 * Simple database queries: return a named theorem (get_thm) or all theorems of
7403 a given theory (thms_of), or find out what theory a theorem was proved in
7406 * Bugs fixed in the inductive definition and datatype packages;
7408 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7409 and HOL_dup_cs obsolete;
7411 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7414 * Simpler definition of function space in ZF;
7416 * new results about cardinal and ordinal arithmetic in ZF;
7418 * 'subtype' facility in HOL for introducing new types as subsets of existing
7421 :mode=text:wrap=hard:maxLineLen=72: