1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Explicit treatment of UTF8 sequences as Isabelle symbols, such that
10 a Unicode character is treated as a single symbol, not a sequence of
11 non-ASCII bytes as before. Since Isabelle/ML string literals may
12 contain symbols without further backslash escapes, Unicode can now be
13 used here as well. Recall that Symbol.explode in ML provides a
14 consistent view on symbols, while raw explode (or String.explode)
15 merely give a byte-oriented representation.
20 * Abolished symbol type names: "prod" and "sum" replace "*" and "+"
21 respectively. INCOMPATIBILITY.
23 * Constant "split" has been merged with constant "prod_case"; names
24 of ML functions, facts etc. involving split have been retained so far,
25 though. INCOMPATIBILITY.
27 * Dropped old infix syntax "mem" for List.member; use "in set"
28 instead. INCOMPATIBILITY.
30 * Refactoring of code-generation specific operations in List.thy
37 null_empty ~> null_def
39 INCOMPATIBILITY. Note that these were not suppossed to be used
40 regularly unless for striking reasons; their main purpose was code
43 * Some previously unqualified names have been qualified:
52 Pair ~> Product_Type.Pair
53 fst ~> Product_Type.fst
54 snd ~> Product_Type.snd
55 curry ~> Product_Type.curry
57 Collect ~> Set.Collect
61 * Removed simplifier congruence rule of "prod_case", as has for long
62 been the case with "split".
64 * Datatype package: theorems generated for executable equality
65 (class eq) carry proper names and are treated as default code
68 * List.thy: use various operations from the Haskell prelude when
69 generating Haskell code.
71 * code_simp.ML: simplification with rules determined by
74 * code generator: do not print function definitions for case
75 combinators any longer.
77 * Multivariate Analysis: Introduced a type class for euclidean space. Most
78 theorems are now stated in terms of euclidean spaces instead of finite
82 real ^ 'n ~> 'a::real_vector
83 ~> 'a::euclidean_space
84 ~> 'a::ordered_euclidean_space
85 (depends on your needs)
89 \<chi> x. _ ~> \<chi>\<chi> x. _
92 Also note that the indices are now natural numbers and not from some finite
93 type. Finite cartesian products of euclidean spaces, products of euclidean
94 spaces the real and complex numbers are instantiated to be euclidean_spaces.
98 * Inductive package: offers new command "inductive_simps" to automatically
99 derive instantiated and simplified equations for inductive predicates,
100 similar to inductive_cases.
103 New in Isabelle2009-2 (June 2010)
104 ---------------------------------
108 * Authentic syntax for *all* logical entities (type classes, type
109 constructors, term constants): provides simple and robust
110 correspondence between formal entities and concrete syntax. Within
111 the parse tree / AST representations, "constants" are decorated by
112 their category (class, type, const) and spelled out explicitly with
113 their full internal name.
115 Substantial INCOMPATIBILITY concerning low-level syntax declarations
116 and translations (translation rules and translation functions in ML).
117 Some hints on upgrading:
119 - Many existing uses of 'syntax' and 'translations' can be replaced
120 by more modern 'type_notation', 'notation' and 'abbreviation',
121 which are independent of this issue.
123 - 'translations' require markup within the AST; the term syntax
124 provides the following special forms:
126 CONST c -- produces syntax version of constant c from context
127 XCONST c -- literally c, checked as constant from context
128 c -- literally c, if declared by 'syntax'
130 Plain identifiers are treated as AST variables -- occasionally the
131 system indicates accidental variables via the error "rhs contains
134 Type classes and type constructors are marked according to their
135 concrete syntax. Some old translations rules need to be written
136 for the "type" category, using type constructor application
137 instead of pseudo-term application of the default category
140 - 'parse_translation' etc. in ML may use the following
143 @{class_syntax c} -- type class c within parse tree / AST
144 @{term_syntax c} -- type constructor c within parse tree / AST
145 @{const_syntax c} -- ML version of "CONST c" above
146 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
148 - Literal types within 'typed_print_translations', i.e. those *not*
149 represented as pseudo-terms are represented verbatim. Use @{class
150 c} or @{type_name c} here instead of the above syntax
153 Note that old non-authentic syntax was based on unqualified base
154 names, so all of the above "constant" names would coincide. Recall
155 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
156 diagnose syntax problems.
158 * Type constructors admit general mixfix syntax, not just infix.
160 * Concrete syntax may be attached to local entities without a proof
161 body, too. This works via regular mixfix annotations for 'fix',
162 'def', 'obtain' etc. or via the explicit 'write' command, which is
163 similar to the 'notation' command in theory specifications.
165 * Discontinued unnamed infix syntax (legacy feature for many years) --
166 need to specify constant name and syntax separately. Internal ML
167 datatype constructors have been renamed from InfixName to Infix etc.
168 Minor INCOMPATIBILITY.
170 * Schematic theorem statements need to be explicitly markup as such,
171 via commands 'schematic_lemma', 'schematic_theorem',
172 'schematic_corollary'. Thus the relevance of the proof is made
173 syntactically clear, which impacts performance in a parallel or
174 asynchronous interactive environment. Minor INCOMPATIBILITY.
176 * Use of cumulative prems via "!" in some proof methods has been
177 discontinued (old legacy feature).
179 * References 'trace_simp' and 'debug_simp' have been replaced by
180 configuration options stored in the context. Enabling tracing (the
181 case of debugging is similar) in proofs works via
183 using [[trace_simp = true]]
185 Tracing is then active for all invocations of the simplifier in
186 subsequent goal refinement steps. Tracing may also still be enabled or
187 disabled via the ProofGeneral settings menu.
189 * Separate commands 'hide_class', 'hide_type', 'hide_const',
190 'hide_fact' replace the former 'hide' KIND command. Minor
193 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
194 more efficient than combinations with -q1 or -q2.
199 * Proofterms record type-class reasoning explicitly, using the
200 "unconstrain" operation internally. This eliminates all sort
201 constraints from a theorem and proof, introducing explicit
202 OFCLASS-premises. On the proof term level, this operation is
203 automatically applied at theorem boundaries, such that closed proofs
204 are always free of sort constraints. INCOMPATIBILITY for tools that
207 * Local theory specifications may depend on extra type variables that
208 are not present in the result type -- arguments TYPE('a) :: 'a itself
209 are added internally. For example:
211 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
213 * Predicates of locales introduced by classes carry a mandatory
214 "class" prefix. INCOMPATIBILITY.
216 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
218 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
221 * Command 'code_reflect' allows to incorporate generated ML code into
222 runtime environment; replaces immature code_datatype antiquotation.
225 * Code generator: simple concept for abstract datatypes obeying
228 * Code generator: details of internal data cache have no impact on the
229 user space functionality any longer.
231 * Methods "unfold_locales" and "intro_locales" ignore non-locale
232 subgoals. This is more appropriate for interpretations with 'where'.
235 * Command 'example_proof' opens an empty proof body. This allows to
236 experiment with Isar, without producing any persistent result.
238 * Commands 'type_notation' and 'no_type_notation' declare type syntax
239 within a local theory context, with explicit checking of the
240 constructors involved (in contrast to the raw 'syntax' versions).
242 * Commands 'types' and 'typedecl' now work within a local theory
243 context -- without introducing dependencies on parameters or
244 assumptions, which is not possible in Isabelle/Pure.
246 * Command 'defaultsort' has been renamed to 'default_sort', it works
247 within a local theory context. Minor INCOMPATIBILITY.
252 * Command 'typedef' now works within a local theory context -- without
253 introducing dependencies on parameters or assumptions, which is not
254 possible in Isabelle/Pure/HOL. Note that the logical environment may
255 contain multiple interpretations of local typedefs (with different
256 non-emptiness proofs), even in a global theory context.
258 * New package for quotient types. Commands 'quotient_type' and
259 'quotient_definition' may be used for defining types and constants by
260 quotient constructions. An example is the type of integers created by
261 quotienting pairs of natural numbers:
264 intrel :: "(nat * nat) => (nat * nat) => bool"
266 "intrel (x, y) (u, v) = (x + v = u + y)"
268 quotient_type int = "nat * nat" / intrel
269 by (auto simp add: equivp_def expand_fun_eq)
272 "0::int" is "(0::nat, 0::nat)"
274 The method "lifting" can be used to lift of theorems from the
275 underlying "raw" type to the quotient type. The example
276 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
277 construction and provides a reasoning infrastructure for finite sets.
279 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
280 clash with new theory Quotient in Main HOL.
282 * Moved the SMT binding into the main HOL session, eliminating
283 separate HOL-SMT session.
285 * List membership infix mem operation is only an input abbreviation.
288 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
289 for future developements; former Library/Word.thy is still present in
290 the AFP entry RSAPPS.
292 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
293 longer shadowed. INCOMPATIBILITY.
295 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
298 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
301 * Dropped normalizing_semiring etc; use the facts in semiring classes
302 instead. INCOMPATIBILITY.
304 * Dropped several real-specific versions of lemmas about floor and
305 ceiling; use the generic lemmas from theory "Archimedean_Field"
306 instead. INCOMPATIBILITY.
308 floor_number_of_eq ~> floor_number_of
309 le_floor_eq_number_of ~> number_of_le_floor
310 le_floor_eq_zero ~> zero_le_floor
311 le_floor_eq_one ~> one_le_floor
312 floor_less_eq_number_of ~> floor_less_number_of
313 floor_less_eq_zero ~> floor_less_zero
314 floor_less_eq_one ~> floor_less_one
315 less_floor_eq_number_of ~> number_of_less_floor
316 less_floor_eq_zero ~> zero_less_floor
317 less_floor_eq_one ~> one_less_floor
318 floor_le_eq_number_of ~> floor_le_number_of
319 floor_le_eq_zero ~> floor_le_zero
320 floor_le_eq_one ~> floor_le_one
321 floor_subtract_number_of ~> floor_diff_number_of
322 floor_subtract_one ~> floor_diff_one
323 ceiling_number_of_eq ~> ceiling_number_of
324 ceiling_le_eq_number_of ~> ceiling_le_number_of
325 ceiling_le_zero_eq ~> ceiling_le_zero
326 ceiling_le_eq_one ~> ceiling_le_one
327 less_ceiling_eq_number_of ~> number_of_less_ceiling
328 less_ceiling_eq_zero ~> zero_less_ceiling
329 less_ceiling_eq_one ~> one_less_ceiling
330 ceiling_less_eq_number_of ~> ceiling_less_number_of
331 ceiling_less_eq_zero ~> ceiling_less_zero
332 ceiling_less_eq_one ~> ceiling_less_one
333 le_ceiling_eq_number_of ~> number_of_le_ceiling
334 le_ceiling_eq_zero ~> zero_le_ceiling
335 le_ceiling_eq_one ~> one_le_ceiling
336 ceiling_subtract_number_of ~> ceiling_diff_number_of
337 ceiling_subtract_one ~> ceiling_diff_one
339 * Theory "Finite_Set": various folding_XXX locales facilitate the
340 application of the various fold combinators on finite sets.
342 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
343 provides abstract red-black tree type which is backed by "RBT_Impl" as
344 implementation. INCOMPATIBILTY.
346 * Theory Library/Coinductive_List has been removed -- superseded by
347 AFP/thys/Coinductive.
349 * Theory PReal, including the type "preal" and related operations, has
350 been removed. INCOMPATIBILITY.
352 * Real: new development using Cauchy Sequences.
354 * Split off theory "Big_Operators" containing setsum, setprod,
355 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
357 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
358 "Int" etc. INCOMPATIBILITY.
360 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
362 * New set of rules "ac_simps" provides combined assoc / commute
363 rewrites for all interpretations of the appropriate generic locales.
365 * Renamed theory "OrderedGroup" to "Groups" and split theory
366 "Ring_and_Field" into theories "Rings" and "Fields"; for more
367 appropriate and more consistent names suitable for name prefixes
368 within the HOL theories. INCOMPATIBILITY.
370 * Some generic constants have been put to appropriate theories:
371 - less_eq, less: Orderings
372 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
373 - inverse, divide: Rings
376 * More consistent naming of type classes involving orderings (and
379 lower_semilattice ~> semilattice_inf
380 upper_semilattice ~> semilattice_sup
382 dense_linear_order ~> dense_linorder
384 pordered_ab_group_add ~> ordered_ab_group_add
385 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
386 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
387 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
388 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
389 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
390 pordered_cancel_semiring ~> ordered_cancel_semiring
391 pordered_comm_monoid_add ~> ordered_comm_monoid_add
392 pordered_comm_ring ~> ordered_comm_ring
393 pordered_comm_semiring ~> ordered_comm_semiring
394 pordered_ring ~> ordered_ring
395 pordered_ring_abs ~> ordered_ring_abs
396 pordered_semiring ~> ordered_semiring
398 ordered_ab_group_add ~> linordered_ab_group_add
399 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
400 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
401 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
402 ordered_field ~> linordered_field
403 ordered_field_no_lb ~> linordered_field_no_lb
404 ordered_field_no_ub ~> linordered_field_no_ub
405 ordered_field_dense_linear_order ~> dense_linordered_field
406 ordered_idom ~> linordered_idom
407 ordered_ring ~> linordered_ring
408 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
409 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
410 ordered_ring_strict ~> linordered_ring_strict
411 ordered_semidom ~> linordered_semidom
412 ordered_semiring ~> linordered_semiring
413 ordered_semiring_1 ~> linordered_semiring_1
414 ordered_semiring_1_strict ~> linordered_semiring_1_strict
415 ordered_semiring_strict ~> linordered_semiring_strict
417 The following slightly odd type classes have been moved to a
418 separate theory Library/Lattice_Algebras:
420 lordered_ab_group_add ~> lattice_ab_group_add
421 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
422 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
423 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
424 lordered_ring ~> lattice_ring
428 * Refined field classes:
429 - classes division_ring_inverse_zero, field_inverse_zero,
430 linordered_field_inverse_zero include rule inverse 0 = 0 --
431 subsumes former division_by_zero class;
432 - numerous lemmas have been ported from field to division_ring.
435 * Refined algebra theorem collections:
436 - dropped theorem group group_simps, use algebra_simps instead;
437 - dropped theorem group ring_simps, use field_simps instead;
438 - proper theorem collection field_simps subsumes former theorem
439 groups field_eq_simps and field_simps;
440 - dropped lemma eq_minus_self_iff which is a duplicate for
444 * Theory Finite_Set and List: some lemmas have been generalized from
447 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
448 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
449 inter_Inter_fold_inter ~> inf_Inf_fold_inf
450 union_Union_fold_union ~> sup_Sup_fold_sup
451 Inter_fold_inter ~> Inf_fold_inf
452 Union_fold_union ~> Sup_fold_sup
453 inter_INTER_fold_inter ~> inf_INFI_fold_inf
454 union_UNION_fold_union ~> sup_SUPR_fold_sup
455 INTER_fold_inter ~> INFI_fold_inf
456 UNION_fold_union ~> SUPR_fold_sup
458 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
459 replaced by the more convenient lemmas Inf_empty and Sup_empty.
460 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
461 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
462 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
463 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
465 * Reorganized theory Multiset: swapped notation of pointwise and
468 - pointwise ordering is instance of class order with standard syntax
470 - multiset ordering has syntax <=# and <#; partial order properties
471 are provided by means of interpretation with prefix
473 - less duplication, less historical organization of sections,
474 conversion from associations lists to multisets, rudimentary code
476 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
481 multiset_eq_conv_count_eq ~> multiset_ext_iff
482 multi_count_ext ~> multiset_ext
483 diff_union_inverse2 ~> diff_union_cancelR
487 * Theory Permutation: replaced local "remove" by List.remove1.
489 * Code generation: ML and OCaml code is decorated with signatures.
491 * Theory List: added transpose.
493 * Library/Nat_Bijection.thy is a collection of bijective functions
494 between nat and other types, which supersedes the older libraries
495 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
498 Nat_Int_Bij.nat2_to_nat ~> prod_encode
499 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
500 Nat_Int_Bij.int_to_nat_bij ~> int_encode
501 Nat_Int_Bij.nat_to_int_bij ~> int_decode
502 Countable.pair_encode ~> prod_encode
503 NatIso.prod2nat ~> prod_encode
504 NatIso.nat2prod ~> prod_decode
505 NatIso.sum2nat ~> sum_encode
506 NatIso.nat2sum ~> sum_decode
507 NatIso.list2nat ~> list_encode
508 NatIso.nat2list ~> list_decode
509 NatIso.set2nat ~> set_encode
510 NatIso.nat2set ~> set_decode
513 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
514 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
515 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
516 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
517 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
518 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
519 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
520 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
521 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
522 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
523 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
524 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
525 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
528 - Renamed ATP commands:
529 atp_info ~> sledgehammer running_atps
530 atp_kill ~> sledgehammer kill_atps
531 atp_messages ~> sledgehammer messages
532 atp_minimize ~> sledgehammer minimize
533 print_atps ~> sledgehammer available_atps
535 - Added user's manual ("isabelle doc sledgehammer").
536 - Added option syntax and "sledgehammer_params" to customize
537 Sledgehammer's behavior. See the manual for details.
538 - Modified the Isar proof reconstruction code so that it produces
539 direct proofs rather than proofs by contradiction. (This feature
540 is still experimental.)
541 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
543 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
546 - Added and implemented "binary_ints" and "bits" options.
547 - Added "std" option and implemented support for nonstandard models.
548 - Added and implemented "finitize" option to improve the precision
549 of infinite datatypes based on a monotonicity analysis.
550 - Added support for quotient types.
551 - Added support for "specification" and "ax_specification"
553 - Added support for local definitions (for "function" and
554 "termination" proofs).
555 - Added support for term postprocessors.
556 - Optimized "Multiset.multiset" and "FinFun.finfun".
557 - Improved efficiency of "destroy_constrs" optimization.
558 - Fixed soundness bugs related to "destroy_constrs" optimization and
560 - Fixed soundness bug related to higher-order constructors.
561 - Fixed soundness bug when "full_descrs" is enabled.
562 - Improved precision of set constructs.
563 - Added "atoms" option.
564 - Added cache to speed up repeated Kodkod invocations on the same
566 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
567 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
568 "SAT4J_Light". INCOMPATIBILITY.
569 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
570 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
571 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
573 * Method "induct" now takes instantiations of the form t, where t is not
574 a variable, as a shorthand for "x == t", where x is a fresh variable.
575 If this is not intended, t has to be enclosed in parentheses.
576 By default, the equalities generated by definitional instantiations
577 are pre-simplified, which may cause parameters of inductive cases
578 to disappear, or may even delete some of the inductive cases.
579 Use "induct (no_simp)" instead of "induct" to restore the old
580 behaviour. The (no_simp) option is also understood by the "cases"
581 and "nominal_induct" methods, which now perform pre-simplification, too.
587 * Variable names in lemmas generated by the domain package have
588 changed; the naming scheme is now consistent with the HOL datatype
589 package. Some proof scripts may be affected, INCOMPATIBILITY.
591 * The domain package no longer defines the function "foo_copy" for
592 recursive domain "foo". The reach lemma is now stated directly in
593 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
594 be reformulated in terms of "foo_take", INCOMPATIBILITY.
596 * Most definedness lemmas generated by the domain package (previously
597 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
598 like "foo$x = UU <-> x = UU", which works better as a simp rule.
599 Proofs that used definedness lemmas as intro rules may break,
600 potential INCOMPATIBILITY.
602 * Induction and casedist rules generated by the domain package now
603 declare proper case_names (one called "bottom", and one named for each
604 constructor). INCOMPATIBILITY.
606 * For mutually-recursive domains, separate "reach" and "take_lemma"
607 rules are generated for each domain, INCOMPATIBILITY.
609 foo_bar.reach ~> foo.reach bar.reach
610 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
612 * Some lemmas generated by the domain package have been renamed for
613 consistency with the datatype package, INCOMPATIBILITY.
615 foo.ind ~> foo.induct
616 foo.finite_ind ~> foo.finite_induct
617 foo.coind ~> foo.coinduct
618 foo.casedist ~> foo.exhaust
619 foo.exhaust ~> foo.nchotomy
621 * For consistency with other definition packages, the fixrec package
622 now generates qualified theorem names, INCOMPATIBILITY.
624 foo_simps ~> foo.simps
625 foo_unfold ~> foo.unfold
626 foo_induct ~> foo.induct
628 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
629 method and internal fixrec proofs now use the default simpset instead.
632 * The "contlub" predicate has been removed. Proof scripts should use
633 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
635 * The "admw" predicate has been removed, INCOMPATIBILITY.
637 * The constants cpair, cfst, and csnd have been removed in favor of
638 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
643 * Antiquotations for basic formal entities:
645 @{class NAME} -- type class
646 @{class_syntax NAME} -- syntax representation of the above
648 @{type_name NAME} -- logical type
649 @{type_abbrev NAME} -- type abbreviation
650 @{nonterminal NAME} -- type of concrete syntactic category
651 @{type_syntax NAME} -- syntax representation of any of the above
653 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
654 @{const_abbrev NAME} -- abbreviated constant
655 @{const_syntax NAME} -- syntax representation of any of the above
657 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
658 syntax constant (cf. 'syntax' command).
660 * Antiquotation @{make_string} inlines a function to print arbitrary
661 values similar to the ML toplevel. The result is compiler dependent
662 and may fall back on "?" in certain situations.
664 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
665 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
666 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
667 not work with the asynchronous Isar document model.
669 * Configuration options now admit dynamic default values, depending on
670 the context or even global references.
672 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
673 uses an efficient external library if available (for Poly/ML).
675 * Renamed some important ML structures, while keeping the old names
676 for some time as aliases within the structure Legacy:
678 OuterKeyword ~> Keyword
681 OuterSyntax ~> Outer_Syntax
682 PrintMode ~> Print_Mode
683 SpecParse ~> Parse_Spec
686 ThyOutput ~> Thy_Output
687 TypeInfer ~> Type_Infer
689 Note that "open Legacy" simplifies porting of sources, but forgetting
690 to remove it again will complicate porting again in the future.
692 * Most operations that refer to a global context are named
693 accordingly, e.g. Simplifier.global_context or
694 ProofContext.init_global. There are some situations where a global
695 context actually works, but under normal circumstances one needs to
696 pass the proper local context through the code!
698 * Discontinued old TheoryDataFun with its copy/init operation -- data
699 needs to be pure. Functor Theory_Data_PP retains the traditional
700 Pretty.pp argument to merge, which is absent in the standard
703 * Sorts.certify_sort and derived "cert" operations for types and terms
704 no longer minimize sorts. Thus certification at the boundary of the
705 inference kernel becomes invariant under addition of class relations,
706 which is an important monotonicity principle. Sorts are now minimized
707 in the syntax layer only, at the boundary between the end-user and the
708 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
709 explicitly in rare situations.
711 * Renamed old-style Drule.standard to Drule.export_without_context, to
712 emphasize that this is in no way a standard operation.
715 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
716 usual for resolution. Rare INCOMPATIBILITY.
718 * Renamed varify/unvarify operations to varify_global/unvarify_global
719 to emphasize that these only work in a global situation (which is
722 * Curried take and drop in library.ML; negative length is interpreted
723 as infinity (as in chop). Subtle INCOMPATIBILITY.
725 * Proof terms: type substitutions on proof constants now use canonical
726 order of type variables. INCOMPATIBILITY for tools working with proof
729 * Raw axioms/defs may no longer carry sort constraints, and raw defs
730 may no longer carry premises. User-level specifications are
731 transformed accordingly by Thm.add_axiom/add_def.
736 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
737 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
738 proof terms are enabled unconditionally in the new HOL-Proofs image.
740 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
741 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
744 * Old lib/scripts/polyml-platform is superseded by the
745 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
746 variant, even on a 64 bit machine. The following example setting
747 prefers 64 bit if available:
749 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
751 * The preliminary Isabelle/jEdit application demonstrates the emerging
752 Isabelle/Scala layer for advanced prover interaction and integration.
753 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
756 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
757 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
758 similar to the default assignment of the document preparation system
759 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
760 provides some operations for direct access to the font without asking
761 the user for manual installation.
765 New in Isabelle2009-1 (December 2009)
766 -------------------------------------
770 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
771 one backslash should be used, even in ML sources.
776 * Locale interpretation propagates mixins along the locale hierarchy.
777 The currently only available mixins are the equations used to map
778 local definitions to terms of the target domain of an interpretation.
780 * Reactivated diagnostic command 'print_interps'. Use "print_interps
781 loc" to print all interpretations of locale "loc" in the theory.
782 Interpretations in proofs are not shown.
784 * Thoroughly revised locales tutorial. New section on conditional
787 * On instantiation of classes, remaining undefined class parameters
788 are formally declared. INCOMPATIBILITY.
791 *** Document preparation ***
793 * New generalized style concept for printing terms: @{foo (style) ...}
794 instead of @{foo_style style ...} (old form is still retained for
795 backward compatibility). Styles can be also applied for
796 antiquotations prop, term_type and typeof.
801 * New proof method "smt" for a combination of first-order logic with
802 equality, linear and nonlinear (natural/integer/real) arithmetic, and
803 fixed-size bitvectors; there is also basic support for higher-order
804 features (esp. lambda abstractions). It is an incomplete decision
805 procedure based on external SMT solvers using the oracle mechanism;
806 for the SMT solver Z3, this method is proof-producing. Certificates
807 are provided to avoid calling the external solvers solely for
808 re-checking proofs. Due to a remote SMT service there is no need for
809 installing SMT solvers locally. See src/HOL/SMT.
811 * New commands to load and prove verification conditions generated by
812 the Boogie program verifier or derived systems (e.g. the Verifying C
813 Compiler (VCC) or Spec#). See src/HOL/Boogie.
815 * New counterexample generator tool 'nitpick' based on the Kodkod
816 relational model finder. See src/HOL/Tools/Nitpick and
817 src/HOL/Nitpick_Examples.
819 * New commands 'code_pred' and 'values' to invoke the predicate
820 compiler and to enumerate values of inductive predicates.
822 * A tabled implementation of the reflexive transitive closure.
824 * New implementation of quickcheck uses generic code generator;
825 default generators are provided for all suitable HOL types, records
826 and datatypes. Old quickcheck can be re-activated importing theory
827 Library/SML_Quickcheck.
829 * New testing tool Mirabelle for automated proof tools. Applies
830 several tools and tactics like sledgehammer, metis, or quickcheck, to
831 every proof step in a theory. To be used in batch mode via the
834 * New proof method "sos" (sum of squares) for nonlinear real
835 arithmetic (originally due to John Harison). It requires theory
836 Library/Sum_Of_Squares. It is not a complete decision procedure but
837 works well in practice on quantifier-free real arithmetic with +, -,
838 *, ^, =, <= and <, i.e. boolean combinations of equalities and
839 inequalities between polynomials. It makes use of external
840 semidefinite programming solvers. Method "sos" generates a
841 certificate that can be pasted into the proof thus avoiding the need
842 to call an external tool every time the proof is checked. See
843 src/HOL/Library/Sum_Of_Squares.
845 * New method "linarith" invokes existing linear arithmetic decision
848 * New command 'atp_minimal' reduces result produced by Sledgehammer.
850 * New Sledgehammer option "Full Types" in Proof General settings menu.
851 Causes full type information to be output to the ATPs. This slows
852 ATPs down considerably but eliminates a source of unsound "proofs"
855 * New method "metisFT": A version of metis that uses full type
856 information in order to avoid failures of proof reconstruction.
858 * New evaluator "approximate" approximates an real valued term using
859 the same method as the approximation method.
861 * Method "approximate" now supports arithmetic expressions as
862 boundaries of intervals and implements interval splitting and Taylor
865 * ML antiquotation @{code_datatype} inserts definition of a datatype
866 generated by the code generator; e.g. see src/HOL/Predicate.thy.
868 * New theory SupInf of the supremum and infimum operators for sets of
871 * New theory Probability, which contains a development of measure
872 theory, eventually leading to Lebesgue integration and probability.
874 * Extended Multivariate Analysis to include derivation and Brouwer's
877 * Reorganization of number theory, INCOMPATIBILITY:
878 - new number theory development for nat and int, in theories Divides
879 and GCD as well as in new session Number_Theory
880 - some constants and facts now suffixed with _nat and _int
882 - former session NumberTheory now named Old_Number_Theory, including
883 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
884 - moved theory Pocklington from src/HOL/Library to
885 src/HOL/Old_Number_Theory
887 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
888 lcm of finite and infinite sets. It is shown that they form a complete
891 * Class semiring_div requires superclass no_zero_divisors and proof of
892 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
893 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
894 generalized to class semiring_div, subsuming former theorems
895 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
896 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
899 * Refinements to lattice classes and sets:
900 - less default intro/elim rules in locale variant, more default
901 intro/elim rules in class variant: more uniformity
902 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
904 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
906 - renamed ACI to inf_sup_aci
907 - new class "boolean_algebra"
908 - class "complete_lattice" moved to separate theory
909 "Complete_Lattice"; corresponding constants (and abbreviations)
910 renamed and with authentic syntax:
911 Set.Inf ~> Complete_Lattice.Inf
912 Set.Sup ~> Complete_Lattice.Sup
913 Set.INFI ~> Complete_Lattice.INFI
914 Set.SUPR ~> Complete_Lattice.SUPR
915 Set.Inter ~> Complete_Lattice.Inter
916 Set.Union ~> Complete_Lattice.Union
917 Set.INTER ~> Complete_Lattice.INTER
918 Set.UNION ~> Complete_Lattice.UNION
919 - authentic syntax for
922 - mere abbreviations:
925 Set.inter (for inf, formerly Set.Int)
926 Set.union (for sup, formerly Set.Un)
927 Complete_Lattice.Inter (for Inf)
928 Complete_Lattice.Union (for Sup)
929 Complete_Lattice.INTER (for INFI)
930 Complete_Lattice.UNION (for SUPR)
931 - object-logic definitions as far as appropriate
933 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
934 Un_subset_iff are explicitly deleted as default simp rules; then also
935 their lattice counterparts le_inf_iff and le_sup_iff have to be
936 deleted to achieve the desired effect.
938 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
939 rules by default any longer; the same applies to min_max.inf_absorb1
940 etc. INCOMPATIBILITY.
942 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
943 pred_set_conv by default. INCOMPATIBILITY.
945 * Power operations on relations and functions are now one dedicated
946 constant "compow" with infix syntax "^^". Power operation on
947 multiplicative monoids retains syntax "^" and is now defined generic
948 in class power. INCOMPATIBILITY.
950 * Relation composition "R O S" now has a more standard argument order:
951 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
952 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
953 break, since the O_assoc rule was not rewritten like this. Fix using
954 O_assoc[symmetric]. The same applies to the curried version "R OO S".
956 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
957 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
960 * Most rules produced by inductive and datatype package have mandatory
961 prefixes. INCOMPATIBILITY.
963 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
964 the attribute of the same name. Each of the theorems in the list
965 DERIV_intros assumes composition with an additional function and
966 matches a variable to the derivative, which has to be solved by the
967 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
968 of most elementary terms. Former Maclauren.DERIV_tac and
969 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
972 * Code generator attributes follow the usual underscore convention:
973 code_unfold replaces code unfold
974 code_post replaces code post
979 sizechange -> size_change
980 induct_scheme -> induction_schema
983 * Discontinued abbreviation "arbitrary" of constant "undefined".
984 INCOMPATIBILITY, use "undefined" directly.
987 Suc_eq_add_numeral_1 -> Suc_eq_plus1
988 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
989 Suc_plus1 -> Suc_eq_plus1
990 *anti_sym -> *antisym*
991 vector_less_eq_def -> vector_le_def
994 * Added theorem List.map_map as [simp]. Removed List.map_compose.
997 * Removed predicate "M hassize n" (<--> card M = n & finite M).
1003 * Theory Representable defines a class "rep" of domains that are
1004 representable (via an ep-pair) in the universal domain type "udom".
1005 Instances are provided for all type constructors defined in HOLCF.
1007 * The 'new_domain' command is a purely definitional version of the
1008 domain package, for representable domains. Syntax is identical to the
1009 old domain package. The 'new_domain' package also supports indirect
1010 recursion using previously-defined type constructors. See
1011 src/HOLCF/ex/New_Domain.thy for examples.
1013 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
1014 on the left-hand side of an equation, and then performs
1015 simplification. Rewriting is done using rules declared with the
1016 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
1017 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
1019 * The pattern-match compiler in 'fixrec' can now handle constructors
1020 with HOL function types. Pattern-match combinators for the Pair
1021 constructor are pre-configured.
1023 * The 'fixrec' package now produces better fixed-point induction rules
1024 for mutually-recursive definitions: Induction rules have conclusions
1025 of the form "P foo bar" instead of "P <foo, bar>".
1027 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
1028 been renamed to "below". The name "below" now replaces "less" in many
1029 theorem names. (Legacy theorem names using "less" are still supported
1032 * The 'fixrec' package now supports "bottom patterns". Bottom
1033 patterns can be used to generate strictness rules, or to make
1034 functions more strict (much like the bang-patterns supported by the
1035 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
1041 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1042 errors and run-time exceptions, including detailed source positions.
1044 * Structure Name_Space (formerly NameSpace) now manages uniquely
1045 identified entries, with some additional information such as source
1046 position, logical grouping etc.
1048 * Theory and context data is now introduced by the simplified and
1049 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1050 to be pure, but the old TheoryDataFun for mutable data (with explicit
1051 copy operation) is still available for some time.
1053 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1054 provides a high-level programming interface to synchronized state
1055 variables with atomic update. This works via pure function
1056 application within a critical section -- its runtime should be as
1057 short as possible; beware of deadlocks if critical code is nested,
1058 either directly or indirectly via other synchronized variables!
1060 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1061 wraps raw ML references, explicitly indicating their non-thread-safe
1062 behaviour. The Isar toplevel keeps this structure open, to
1063 accommodate Proof General as well as quick and dirty interactive
1064 experiments with references.
1066 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1067 parallel tactical reasoning.
1069 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1070 are similar to SUBPROOF, but are slightly more flexible: only the
1071 specified parts of the subgoal are imported into the context, and the
1072 body tactic may introduce new subgoals and schematic variables.
1074 * Old tactical METAHYPS, which does not observe the proof context, has
1075 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1076 or Subgoal.FOCUS etc.
1078 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1079 functors have their own ML name space there is no point to mark them
1080 separately.) Minor INCOMPATIBILITY.
1082 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1084 * Renamed several structures FooBar to Foo_Bar. Occasional,
1087 * Operations of structure Skip_Proof no longer require quick_and_dirty
1088 mode, which avoids critical setmp.
1090 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1091 combinators for "args". INCOMPATIBILITY, need to use simplified
1092 Attrib/Method.setup introduced in Isabelle2009.
1094 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1095 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1096 last resort. INCOMPATIBILITY.
1098 * Display.pretty_thm now requires a proper context (cf. former
1099 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1100 or even Display.pretty_thm_without_context as last resort.
1103 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1104 Syntax.pretty_typ/term directly, preferably with proper context
1105 instead of global theory.
1110 * Further fine tuning of parallel proof checking, scales up to 8 cores
1111 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1114 * Support for additional "Isabelle components" via etc/components, see
1115 also the system manual.
1117 * The isabelle makeall tool now operates on all components with
1118 IsaMakefile, not just hardwired "logics".
1120 * Removed "compress" option from isabelle-process and isabelle usedir;
1121 this is always enabled.
1123 * Discontinued support for Poly/ML 4.x versions.
1125 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1126 on a given logic image. This requires the lighttpd webserver and is
1127 currently supported on Linux only.
1131 New in Isabelle2009 (April 2009)
1132 --------------------------------
1136 * Simplified main Isabelle executables, with less surprises on
1137 case-insensitive file-systems (such as Mac OS).
1139 - The main Isabelle tool wrapper is now called "isabelle" instead of
1142 - The former "isabelle" alias for "isabelle-process" has been
1143 removed (should rarely occur to regular users).
1145 - The former "isabelle-interface" and its alias "Isabelle" have been
1146 removed (interfaces are now regular Isabelle tools).
1148 Within scripts and make files, the Isabelle environment variables
1149 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1150 respectively. (The latter are still available as legacy feature.)
1152 The old isabelle-interface wrapper could react in confusing ways if
1153 the interface was uninstalled or changed otherwise. Individual
1154 interface tool configuration is now more explicit, see also the
1155 Isabelle system manual. In particular, Proof General is now available
1156 via "isabelle emacs".
1158 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1159 purge installed copies of Isabelle executables and re-run "isabelle
1160 install -p ...", or use symlinks.
1162 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1163 old ~/isabelle, which was slightly non-standard and apt to cause
1164 surprises on case-insensitive file-systems (such as Mac OS).
1166 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1167 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1168 care is required when using older releases of Isabelle. Note that
1169 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1170 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1172 * Proofs of fully specified statements are run in parallel on
1173 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1174 a regular 4-core machine, if the initial heap space is made reasonably
1175 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1177 * The main reference manuals ("isar-ref", "implementation", and
1178 "system") have been updated and extended. Formally checked references
1179 as hyperlinks are now available uniformly.
1184 * Complete re-implementation of locales. INCOMPATIBILITY in several
1185 respects. The most important changes are listed below. See the
1186 Tutorial on Locales ("locales" manual) for details.
1188 - In locale expressions, instantiation replaces renaming. Parameters
1189 must be declared in a for clause. To aid compatibility with previous
1190 parameter inheritance, in locale declarations, parameters that are not
1191 'touched' (instantiation position "_" or omitted) are implicitly added
1192 with their syntax at the beginning of the for clause.
1194 - Syntax from abbreviations and definitions in locales is available in
1195 locale expressions and context elements. The latter is particularly
1196 useful in locale declarations.
1198 - More flexible mechanisms to qualify names generated by locale
1199 expressions. Qualifiers (prefixes) may be specified in locale
1200 expressions, and can be marked as mandatory (syntax: "name!:") or
1201 optional (syntax "name?:"). The default depends for plain "name:"
1202 depends on the situation where a locale expression is used: in
1203 commands 'locale' and 'sublocale' prefixes are optional, in
1204 'interpretation' and 'interpret' prefixes are mandatory. The old
1205 implicit qualifiers derived from the parameter names of a locale are
1206 no longer generated.
1208 - Command "sublocale l < e" replaces "interpretation l < e". The
1209 instantiation clause in "interpretation" and "interpret" (square
1210 brackets) is no longer available. Use locale expressions.
1212 - When converting proof scripts, mandatory qualifiers in
1213 'interpretation' and 'interpret' should be retained by default, even
1214 if this is an INCOMPATIBILITY compared to former behavior. In the
1215 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1216 in locale expressions range over a single locale instance only.
1218 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1219 In existing theorem specifications replace the includes element by the
1220 respective context elements of the included locale, omitting those
1221 that are already present in the theorem specification. Multiple
1222 assume elements of a locale should be replaced by a single one
1223 involving the locale predicate. In the proof body, declarations (most
1224 notably theorems) may be regained by interpreting the respective
1225 locales in the proof context as required (command "interpret").
1227 If using "includes" in replacement of a target solely because the
1228 parameter types in the theorem are not as general as in the target,
1229 consider declaring a new locale with additional type constraints on
1230 the parameters (context element "constrains").
1232 - Discontinued "locale (open)". INCOMPATIBILITY.
1234 - Locale interpretation commands no longer attempt to simplify goal.
1235 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1236 methods intro_locales and unfold_locales to clarify.
1238 - Locale interpretation commands no longer accept interpretation
1239 attributes. INCOMPATIBILITY.
1241 * Class declaration: so-called "base sort" must not be given in import
1242 list any longer, but is inferred from the specification. Particularly
1249 class foo = type + ...
1251 * Class target: global versions of theorems stemming do not carry a
1252 parameter prefix any longer. INCOMPATIBILITY.
1254 * Class 'instance' command no longer accepts attached definitions.
1255 INCOMPATIBILITY, use proper 'instantiation' target instead.
1257 * Recovered hiding of consts, which was accidentally broken in
1258 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1259 makes c inaccessible; consider using ``hide (open) const c'' instead.
1261 * Slightly more coherent Pure syntax, with updated documentation in
1262 isar-ref manual. Removed locales meta_term_syntax and
1263 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1264 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1265 directly in regular applications.
1267 * There is a new syntactic category "float_const" for signed decimal
1268 fractions (e.g. 123.45 or -123.45).
1270 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1271 interface with 'setup' command instead.
1273 * Command 'local_setup' is similar to 'setup', but operates on a local
1276 * The 'axiomatization' command now only works within a global theory
1277 context. INCOMPATIBILITY.
1279 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1280 hypotheses. Sorts required in the course of reasoning need to be
1281 covered by the constraints in the initial statement, completed by the
1282 type instance information of the background theory. Non-trivial sort
1283 hypotheses, which rarely occur in practice, may be specified via
1284 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1286 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1288 The result contains an implicit sort hypotheses as before --
1289 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1292 * Generalized Isar history, with support for linear undo, direct state
1295 * Changed defaults for unify configuration options:
1297 unify_trace_bound = 50 (formerly 25)
1298 unify_search_bound = 60 (formerly 30)
1300 * Different bookkeeping for code equations (INCOMPATIBILITY):
1302 a) On theory merge, the last set of code equations for a particular
1303 constant is taken (in accordance with the policy applied by other
1304 parts of the code generator framework).
1306 b) Code equations stemming from explicit declarations (e.g. code
1307 attribute) gain priority over default code equations stemming
1308 from definition, primrec, fun etc.
1310 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1312 * Unified theorem tables for both code generators. Thus [code
1313 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1315 * Command 'find_consts' searches for constants based on type and name
1318 find_consts "_ => bool"
1320 By default, matching is against subtypes, but it may be restricted to
1321 the whole type. Searching by name is possible. Multiple queries are
1322 conjunctive and queries may be negated by prefixing them with a
1325 find_consts strict: "_ => bool" name: "Int" -"int => int"
1327 * New 'find_theorems' criterion "solves" matches theorems that
1328 directly solve the current goal (modulo higher-order unification).
1330 * Auto solve feature for main theorem statements: whenever a new goal
1331 is stated, "find_theorems solves" is called; any theorems that could
1332 solve the lemma directly are listed as part of the goal state.
1333 Cf. associated options in Proof General Isabelle settings menu,
1334 enabled by default, with reasonable timeout for pathological cases of
1335 higher-order unification.
1338 *** Document preparation ***
1340 * Antiquotation @{lemma} now imitates a regular terminal proof,
1341 demanding keyword 'by' and supporting the full method expression
1342 syntax just like the Isar command 'by'.
1347 * Integrated main parts of former image HOL-Complex with HOL. Entry
1348 points Main and Complex_Main remain as before.
1350 * Logic image HOL-Plain provides a minimal HOL with the most important
1351 tools available (inductive, datatype, primrec, ...). This facilitates
1352 experimentation and tool development. Note that user applications
1353 (and library theories) should never refer to anything below theory
1356 * Logic image HOL-Main stops at theory Main, and thus facilitates
1357 experimentation due to shorter build times.
1359 * Logic image HOL-NSA contains theories of nonstandard analysis which
1360 were previously part of former HOL-Complex. Entry point Hyperreal
1361 remains valid, but theories formerly using Complex_Main should now use
1362 new entry point Hypercomplex.
1364 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1365 Posix processes. Avoids potentially expensive forking of the ML
1366 process. New thread-based implementation also works on non-Unix
1367 platforms (Cygwin). Provers are no longer hardwired, but defined
1368 within the theory via plain ML wrapper functions. Basic Sledgehammer
1369 commands are covered in the isar-ref manual.
1371 * Wrapper scripts for remote SystemOnTPTP service allows to use
1372 sledgehammer without local ATP installation (Vampire etc.). Other
1373 provers may be included via suitable ML wrappers, see also
1374 src/HOL/ATP_Linkup.thy.
1376 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1379 * The metis method no longer fails because the theorem is too trivial
1380 (contains the empty clause).
1382 * The metis method now fails in the usual manner, rather than raising
1383 an exception, if it determines that it cannot prove the theorem.
1385 * Method "coherent" implements a prover for coherent logic (see also
1386 src/Tools/coherent.ML).
1388 * Constants "undefined" and "default" replace "arbitrary". Usually
1389 "undefined" is the right choice to replace "arbitrary", though
1390 logically there is no difference. INCOMPATIBILITY.
1392 * Command "value" now integrates different evaluation mechanisms. The
1393 result of the first successful evaluation mechanism is printed. In
1394 square brackets a particular named evaluation mechanisms may be
1395 specified (currently, [SML], [code] or [nbe]). See further
1396 src/HOL/ex/Eval_Examples.thy.
1398 * Normalization by evaluation now allows non-leftlinear equations.
1399 Declare with attribute [code nbe].
1401 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1402 as the structured Isar versions "cases" and "induct", cf. the
1403 corresponding "cases" and "induct" attributes. Mutual induction rules
1404 are now presented as a list of individual projections
1405 (e.g. foo_bar.inducts for types foo and bar); the old format with
1406 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1407 rare situations a different rule is selected --- notably nested tuple
1408 elimination instead of former prod.exhaust: use explicit (case_tac t
1409 rule: prod.exhaust) here.
1411 * Attributes "cases", "induct", "coinduct" support "del" option.
1413 * Removed fact "case_split_thm", which duplicates "case_split".
1415 * The option datatype has been moved to a new theory Option. Renamed
1416 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1418 * New predicate "strict_mono" classifies strict functions on partial
1419 orders. With strict functions on linear orders, reasoning about
1420 (in)equalities is facilitated by theorems "strict_mono_eq",
1421 "strict_mono_less_eq" and "strict_mono_less".
1423 * Some set operations are now proper qualified constants with
1424 authentic syntax. INCOMPATIBILITY:
1435 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1438 * Auxiliary class "itself" has disappeared -- classes without any
1439 parameter are treated as expected by the 'class' command.
1441 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1443 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1444 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1446 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1447 method "approximation". It proves formulas on real values by using
1448 interval arithmetic. In the formulas are also the transcendental
1449 functions sin, cos, tan, atan, ln, exp and the constant pi are
1450 allowed. For examples see
1451 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1453 * Theory "Reflection" now resides in HOL/Library.
1455 * Entry point to Word library now simply named "Word".
1458 * Made source layout more coherent with logical distribution
1461 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1462 src/HOL/Library/Code_Message.thy ~> src/HOL/
1463 src/HOL/Library/GCD.thy ~> src/HOL/
1464 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1465 src/HOL/Library/Parity.thy ~> src/HOL/
1466 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1467 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1468 src/HOL/Real/Lubs.thy ~> src/HOL/
1469 src/HOL/Real/PReal.thy ~> src/HOL/
1470 src/HOL/Real/Rational.thy ~> src/HOL/
1471 src/HOL/Real/RComplete.thy ~> src/HOL/
1472 src/HOL/Real/RealDef.thy ~> src/HOL/
1473 src/HOL/Real/RealPow.thy ~> src/HOL/
1474 src/HOL/Real/Real.thy ~> src/HOL/
1475 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1476 src/HOL/Complex/Complex.thy ~> src/HOL/
1477 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1478 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1479 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1480 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1481 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1482 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1483 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1484 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1485 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1486 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1487 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1488 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1489 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1490 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1491 src/HOL/Real/Float ~> src/HOL/Library/
1492 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1493 src/HOL/Real/RealVector.thy ~> src/HOL/
1495 src/HOL/arith_data.ML ~> src/HOL/Tools
1496 src/HOL/hologic.ML ~> src/HOL/Tools
1497 src/HOL/simpdata.ML ~> src/HOL/Tools
1498 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1499 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1500 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1501 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1502 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1503 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1504 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1506 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1507 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1508 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1509 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1510 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1511 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1513 * If methods "eval" and "evaluation" encounter a structured proof
1514 state with !!/==>, only the conclusion is evaluated to True (if
1515 possible), avoiding strange error messages.
1517 * Method "sizechange" automates termination proofs using (a
1518 modification of) the size-change principle. Requires SAT solver. See
1519 src/HOL/ex/Termination.thy for examples.
1521 * Simplifier: simproc for let expressions now unfolds if bound
1522 variable occurs at most once in let expression body. INCOMPATIBILITY.
1524 * Method "arith": Linear arithmetic now ignores all inequalities when
1525 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1527 * New attribute "arith" for facts that should always be used
1528 automatically by arithmetic. It is intended to be used locally in
1531 assumes [arith]: "x > 0"
1533 Global usage is discouraged because of possible performance impact.
1535 * New classes "top" and "bot" with corresponding operations "top" and
1536 "bot" in theory Orderings; instantiation of class "complete_lattice"
1537 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1539 * Changed definition lemma "less_fun_def" in order to provide an
1540 instance for preorders on functions; use lemma "less_le" instead.
1543 * Theory Orderings: class "wellorder" moved here, with explicit
1544 induction rule "less_induct" as assumption. For instantiation of
1545 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1548 * Theory Orderings: added class "preorder" as superclass of "order".
1549 INCOMPATIBILITY: Instantiation proofs for order, linorder
1550 etc. slightly changed. Some theorems named order_class.* now named
1553 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1556 * Theory Finite_Set: added a new fold combinator of type
1558 ('a => 'b => 'b) => 'b => 'a set => 'b
1560 Occasionally this is more convenient than the old fold combinator
1561 which is now defined in terms of the new one and renamed to
1564 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1565 and "ring_simps" have been replaced by "algebra_simps" (which can be
1566 extended with further lemmas!). At the moment both still exist but
1567 the former will disappear at some point.
1569 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1570 class recpower. Type-specific simp rules for various recpower types
1571 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1573 rat_power_0 -> power_0
1574 rat_power_Suc -> power_Suc
1575 realpow_0 -> power_0
1576 realpow_Suc -> power_Suc
1577 complexpow_0 -> power_0
1578 complexpow_Suc -> power_Suc
1579 power_poly_0 -> power_0
1580 power_poly_Suc -> power_Suc
1582 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1583 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1584 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1585 of lemmas from Divides has been generalized from nat to class
1586 semiring_div. INCOMPATIBILITY. This involves the following theorem
1587 renames resulting from duplicate elimination:
1589 dvd_def_mod ~> dvd_eq_mod_eq_0
1590 zero_dvd_iff ~> dvd_0_left_iff
1591 dvd_0 ~> dvd_0_right
1592 DIVISION_BY_ZERO_DIV ~> div_by_0
1593 DIVISION_BY_ZERO_MOD ~> mod_by_0
1594 mult_div ~> div_mult_self2_is_id
1595 mult_mod ~> mod_mult_self2_is_0
1597 * Theory IntDiv: removed many lemmas that are instances of class-based
1598 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1599 rename old lemmas as follows:
1601 dvd_diff -> nat_dvd_diff
1602 dvd_zminus_iff -> dvd_minus_iff
1603 mod_add1_eq -> mod_add_eq
1604 mod_mult1_eq -> mod_mult_right_eq
1605 mod_mult1_eq' -> mod_mult_left_eq
1606 mod_mult_distrib_mod -> mod_mult_eq
1607 nat_mod_add_left_eq -> mod_add_left_eq
1608 nat_mod_add_right_eq -> mod_add_right_eq
1609 nat_mod_div_trivial -> mod_div_trivial
1610 nat_mod_mod_trivial -> mod_mod_trivial
1611 zdiv_zadd_self1 -> div_add_self1
1612 zdiv_zadd_self2 -> div_add_self2
1613 zdiv_zmult_self1 -> div_mult_self2_is_id
1614 zdiv_zmult_self2 -> div_mult_self1_is_id
1615 zdvd_triv_left -> dvd_triv_left
1616 zdvd_triv_right -> dvd_triv_right
1617 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1618 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1619 zmod_zadd_left_eq -> mod_add_left_eq
1620 zmod_zadd_right_eq -> mod_add_right_eq
1621 zmod_zadd_self1 -> mod_add_self1
1622 zmod_zadd_self2 -> mod_add_self2
1623 zmod_zadd1_eq -> mod_add_eq
1624 zmod_zdiff1_eq -> mod_diff_eq
1625 zmod_zdvd_zmod -> mod_mod_cancel
1626 zmod_zmod_cancel -> mod_mod_cancel
1627 zmod_zmult_self1 -> mod_mult_self2_is_0
1628 zmod_zmult_self2 -> mod_mult_self1_is_0
1631 zdvd_abs1 -> abs_dvd_iff
1632 zdvd_abs2 -> dvd_abs_iff
1633 zdvd_refl -> dvd_refl
1634 zdvd_trans -> dvd_trans
1635 zdvd_zadd -> dvd_add
1636 zdvd_zdiff -> dvd_diff
1637 zdvd_zminus_iff -> dvd_minus_iff
1638 zdvd_zminus2_iff -> minus_dvd_iff
1639 zdvd_zmultD -> dvd_mult_right
1640 zdvd_zmultD2 -> dvd_mult_left
1641 zdvd_zmult_mono -> mult_dvd_mono
1642 zdvd_0_right -> dvd_0_right
1643 zdvd_0_left -> dvd_0_left_iff
1644 zdvd_1_left -> one_dvd
1645 zminus_dvd_iff -> minus_dvd_iff
1647 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1649 * The real numbers offer decimal input syntax: 12.34 is translated
1650 into 1234/10^2. This translation is not reversed upon output.
1652 * Theory Library/Polynomial defines an abstract type 'a poly of
1653 univariate polynomials with coefficients of type 'a. In addition to
1654 the standard ring operations, it also supports div and mod. Code
1655 generation is also supported, using list-style constructors.
1657 * Theory Library/Inner_Product defines a class of real_inner for real
1658 inner product spaces, with an overloaded operation inner :: 'a => 'a
1659 => real. Class real_inner is a subclass of real_normed_vector from
1662 * Theory Library/Product_Vector provides instances for the product
1663 type 'a * 'b of several classes from RealVector and Inner_Product.
1664 Definitions of addition, subtraction, scalar multiplication, norms,
1665 and inner products are included.
1667 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1668 addition to the field operations, numerals and case syntax are also
1671 * Theory Library/Diagonalize provides constructive version of Cantor's
1672 first diagonalization argument.
1674 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1675 zlcm (for int); carried together from various gcd/lcm developements in
1676 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1677 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1678 may recover tupled syntax as follows:
1680 hide (open) const gcd
1681 abbreviation gcd where
1682 "gcd == (%(a, b). GCD.gcd a b)"
1684 GCD.gcd ("gcd '(_, _')")
1686 The same works for lcm, zgcd, zlcm.
1688 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1689 instantiations for algebraic structures. Removed some duplicate
1690 theorems. Changes in simp rules. INCOMPATIBILITY.
1692 * ML antiquotation @{code} takes a constant as argument and generates
1693 corresponding code in background and inserts name of the corresponding
1694 resulting ML value/function/datatype constructor binding in place.
1695 All occurrences of @{code} with a single ML block are generated
1696 simultaneously. Provides a generic and safe interface for
1697 instrumentalizing code generation. See
1698 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1699 In future you ought to refrain from ad-hoc compiling generated SML
1700 code on the ML toplevel. Note that (for technical reasons) @{code}
1701 cannot refer to constants for which user-defined serializations are
1702 set. Refer to the corresponding ML counterpart directly in that
1705 * Command 'rep_datatype': instead of theorem names the command now
1706 takes a list of terms denoting the constructors of the type to be
1707 represented as datatype. The characteristic theorems have to be
1708 proven. INCOMPATIBILITY. Also observe that the following theorems
1709 have disappeared in favour of existing ones:
1711 unit_induct ~> unit.induct
1712 prod_induct ~> prod.induct
1713 sum_induct ~> sum.induct
1714 Suc_Suc_eq ~> nat.inject
1715 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1720 * New locales for orders and lattices where the equivalence relation
1721 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1722 locales use a record structure with field eq for the equivalence.
1724 * New theory of factorial domains.
1726 * Units_l_inv and Units_r_inv are now simp rules by default.
1727 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1728 and/or r_inv will now also require deletion of these lemmas.
1730 * Renamed the following theorems, INCOMPATIBILITY:
1732 UpperD ~> Upper_memD
1733 LowerD ~> Lower_memD
1734 least_carrier ~> least_closed
1735 greatest_carrier ~> greatest_closed
1736 greatest_Lower_above ~> greatest_Lower_below
1737 one_zero ~> carrier_one_zero
1738 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1743 * Nominal datatypes can now contain type-variables.
1745 * Commands 'nominal_inductive' and 'equivariance' work with local
1748 * Nominal primrec can now works with local theory targets and its
1749 specification syntax now conforms to the general format as seen in
1752 * Method "perm_simp" honours the standard simplifier attributes
1753 (no_asm), (no_asm_use) etc.
1755 * The new predicate #* is defined like freshness, except that on the
1756 left hand side can be a set or list of atoms.
1758 * Experimental command 'nominal_inductive2' derives strong induction
1759 principles for inductive definitions. In contrast to
1760 'nominal_inductive', which can only deal with a fixed number of
1761 binders, it can deal with arbitrary expressions standing for sets of
1762 atoms to be avoided. The only inductive definition we have at the
1763 moment that needs this generalisation is the typing rule for Lets in
1766 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1767 -----------------------------------------------------------------
1768 Gamma |- Let x be t1 in t2 : T2
1770 In this rule one wants to avoid all the binders that are introduced by
1771 "close Gamma T1". We are looking for other examples where this
1772 feature might be useful. Please let us know.
1777 * Reimplemented the simplification procedure for proving continuity
1778 subgoals. The new simproc is extensible; users can declare additional
1779 continuity introduction rules with the attribute [cont2cont].
1781 * The continuity simproc now uses a different introduction rule for
1782 solving continuity subgoals on terms with lambda abstractions. In
1783 some rare cases the new simproc may fail to solve subgoals that the
1784 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1785 Potential INCOMPATIBILITY.
1787 * Command 'fixrec': specification syntax now conforms to the general
1788 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1789 examples. INCOMPATIBILITY.
1794 * Proof of Zorn's Lemma for partial orders.
1799 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1800 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1801 depends on multithreading, so timouts will not work before Poly/ML
1804 * High-level support for concurrent ML programming, see
1805 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1806 particularly convenient to organize independent functional
1807 computations. The concept of "synchronized variables" provides a
1808 higher-order interface for components with shared state, avoiding the
1809 delicate details of mutexes and condition variables. (Requires
1810 Poly/ML 5.2.1 or later.)
1812 * ML bindings produced via Isar commands are stored within the Isar
1813 context (theory or proof). Consequently, commands like 'use' and 'ML'
1814 become thread-safe and work with undo as expected (concerning
1815 top-level bindings, not side-effects on global references).
1816 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1817 compiler at runtime; really global bindings need to be given outside a
1818 theory. (Requires Poly/ML 5.2 or later.)
1820 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1821 context. Top-level ML bindings are stored within the proof context in
1822 a purely sequential fashion, disregarding the nested proof structure.
1823 ML bindings introduced by 'ML_prf' are discarded at the end of the
1824 proof. (Requires Poly/ML 5.2 or later.)
1826 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1827 and Method.setup, as well as Isar commands 'attribute_setup' and
1828 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1829 existing code accordingly, or use plain 'setup' together with old
1832 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1833 to 'a -> thm, while results are always tagged with an authentic oracle
1834 name. The Isar command 'oracle' is now polymorphic, no argument type
1835 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1836 accordingly. Note that extra performance may be gained by producing
1837 the cterm carefully, avoiding slow Thm.cterm_of.
1839 * Simplified interface for defining document antiquotations via
1840 ThyOutput.antiquotation, ThyOutput.output, and optionally
1841 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1842 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1845 * More systematic treatment of long names, abstract name bindings, and
1846 name space operations. Basic operations on qualified names have been
1847 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1848 Long_Name.append. Old type bstring has been mostly replaced by
1849 abstract type binding (see structure Binding), which supports precise
1850 qualification by packages and local theory targets, as well as proper
1851 tracking of source positions. INCOMPATIBILITY, need to wrap old
1852 bstring values into Binding.name, or better pass through abstract
1853 bindings everywhere. See further src/Pure/General/long_name.ML,
1854 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1856 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1857 LocalTheory.note etc.) now refer to the *full* internal name, not the
1858 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1860 * Disposed old type and term read functions (Sign.read_def_typ,
1861 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1862 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1863 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1864 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1865 resort for legacy applications.
1867 * Disposed old declarations, tactics, tactic combinators that refer to
1868 the simpset or claset of an implicit theory (such as Addsimps,
1869 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1870 embedded ML text, or local_simpset_of with a proper context passed as
1871 explicit runtime argument.
1873 * Rules and tactics that read instantiations (read_instantiate,
1874 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1875 context, which is required for parsing and type-checking. Moreover,
1876 the variables are specified as plain indexnames, not string encodings
1877 thereof. INCOMPATIBILITY.
1879 * Generic Toplevel.add_hook interface allows to analyze the result of
1880 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1881 for theorem dependency output of transactions resulting in a new
1884 * ML antiquotations: block-structured compilation context indicated by
1885 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1887 @{binding name} - basic name binding
1888 @{let ?pat = term} - term abbreviation (HO matching)
1889 @{note name = fact} - fact abbreviation
1890 @{thm fact} - singleton fact (with attributes)
1891 @{thms fact} - general fact (with attributes)
1892 @{lemma prop by method} - singleton goal
1893 @{lemma prop by meth1 meth2} - singleton goal
1894 @{lemma prop1 ... propN by method} - general goal
1895 @{lemma prop1 ... propN by meth1 meth2} - general goal
1896 @{lemma (open) ...} - open derivation
1901 * The Isabelle "emacs" tool provides a specific interface to invoke
1902 Proof General / Emacs, with more explicit failure if that is not
1903 installed (the old isabelle-interface script silently falls back on
1904 isabelle-process). The PROOFGENERAL_HOME setting determines the
1905 installation location of the Proof General distribution.
1907 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1908 the Isabelle process into a JVM/Scala application. See
1909 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1910 process wrapper has been discontinued.)
1912 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1914 * Various status messages (with exact source position information) are
1915 emitted, if proper markup print mode is enabled. This allows
1916 user-interface components to provide detailed feedback on internal
1921 New in Isabelle2008 (June 2008)
1922 -------------------------------
1926 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1927 and updated, with formally checked references as hyperlinks.
1929 * Theory loader: use_thy (and similar operations) no longer set the
1930 implicit ML context, which was occasionally hard to predict and in
1931 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1932 provides a proper context already.
1934 * Theory loader: old-style ML proof scripts being *attached* to a thy
1935 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1936 'use' within a theory file will do the job.
1938 * Name space merge now observes canonical order, i.e. the second space
1939 is inserted into the first one, while existing entries in the first
1940 space take precedence. INCOMPATIBILITY in rare situations, may try to
1941 swap theory imports.
1943 * Syntax: symbol \<chi> is now considered a letter. Potential
1944 INCOMPATIBILITY in identifier syntax etc.
1946 * Outer syntax: string tokens no longer admit escaped white space,
1947 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1948 white space without escapes.
1950 * Outer syntax: string tokens may contain arbitrary character codes
1951 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1957 * Context-dependent token translations. Default setup reverts locally
1958 fixed variables, and adds hilite markup for undeclared frees.
1960 * Unused theorems can be found using the new command 'unused_thms'.
1961 There are three ways of invoking it:
1964 Only finds unused theorems in the current theory.
1966 (2) unused_thms thy_1 ... thy_n -
1967 Finds unused theorems in the current theory and all of its ancestors,
1968 excluding the theories thy_1 ... thy_n and all of their ancestors.
1970 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1971 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1972 their ancestors, excluding the theories thy_1 ... thy_n and all of
1975 In order to increase the readability of the list produced by
1976 unused_thms, theorems that have been created by a particular instance
1977 of a theory command such as 'inductive' or 'function' are considered
1978 to belong to the same "group", meaning that if at least one theorem in
1979 this group is used, the other theorems in the same group are no longer
1980 reported as unused. Moreover, if all theorems in the group are
1981 unused, only one theorem in the group is displayed.
1983 Note that proof objects have to be switched on in order for
1984 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1985 usually the case when using Proof General with the default settings).
1987 * Authentic naming of facts disallows ad-hoc overwriting of previous
1988 theorems within the same name space. INCOMPATIBILITY, need to remove
1989 duplicate fact bindings, or even accidental fact duplications. Note
1990 that tools may maintain dynamically scoped facts systematically, using
1991 PureThy.add_thms_dynamic.
1993 * Command 'hide' now allows to hide from "fact" name space as well.
1995 * Eliminated destructive theorem database, simpset, claset, and
1996 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1997 update of theories within ML code.
1999 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
2000 INCOMPATIBILITY, object-logics depending on former Pure require
2001 additional setup PureThy.old_appl_syntax_setup; object-logics
2002 depending on former CPure need to refer to Pure.
2004 * Commands 'use' and 'ML' are now purely functional, operating on
2005 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
2006 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
2009 * Command 'setup': discontinued implicit version with ML reference.
2011 * Instantiation target allows for simultaneous specification of class
2012 instance operations together with an instantiation proof.
2013 Type-checking phase allows to refer to class operations uniformly.
2014 See src/HOL/Complex/Complex.thy for an Isar example and
2015 src/HOL/Library/Eval.thy for an ML example.
2017 * Indexing of literal facts: be more serious about including only
2018 facts from the visible specification/proof context, but not the
2019 background context (locale etc.). Affects `prop` notation and method
2020 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
2023 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
2024 "(open)" option, which used to expose internal bound variables to the
2027 * Isar statements: removed obsolete case "rule_context".
2028 INCOMPATIBILITY, better use explicit fixes/assumes.
2030 * Locale proofs: default proof step now includes 'unfold_locales';
2031 hence 'proof' without argument may be used to unfold locale
2035 *** Document preparation ***
2037 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
2038 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
2039 obsolete thumbpdf setup (contemporary PDF viewers do this on the
2040 spot); renamed link color from "darkblue" to "linkcolor" (default
2041 value unchanged, can be redefined via \definecolor); no longer sets
2042 "a4paper" option (unnecessary or even intrusive).
2044 * Antiquotation @{lemma A method} proves proposition A by the given
2045 method (either a method name or a method name plus (optional) method
2046 arguments in parentheses) and prints A just like @{prop A}.
2051 * New primrec package. Specification syntax conforms in style to
2052 definition/function/.... No separate induction rule is provided. The
2053 "primrec" command distinguishes old-style and new-style specifications
2054 by syntax. The former primrec package is now named OldPrimrecPackage.
2055 When adjusting theories, beware: constants stemming from new-style
2056 primrec specifications have authentic syntax.
2058 * Metis prover is now an order of magnitude faster, and also works
2059 with multithreading.
2061 * Metis: the maximum number of clauses that can be produced from a
2062 theorem is now given by the attribute max_clauses. Theorems that
2063 exceed this number are ignored, with a warning printed.
2065 * Sledgehammer no longer produces structured proofs by default. To
2066 enable, declare [[sledgehammer_full = true]]. Attributes
2067 reconstruction_modulus, reconstruction_sorts renamed
2068 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2070 * Method "induct_scheme" derives user-specified induction rules
2071 from well-founded induction and completeness of patterns. This factors
2072 out some operations that are done internally by the function package
2073 and makes them available separately. See
2074 src/HOL/ex/Induction_Scheme.thy for examples.
2076 * More flexible generation of measure functions for termination
2077 proofs: Measure functions can be declared by proving a rule of the
2078 form "is_measure f" and giving it the [measure_function] attribute.
2079 The "is_measure" predicate is logically meaningless (always true), and
2080 just guides the heuristic. To find suitable measure functions, the
2081 termination prover sets up the goal "is_measure ?f" of the appropriate
2082 type and generates all solutions by prolog-style backwards proof using
2085 This setup also deals with rules like
2087 "is_measure f ==> is_measure (list_size f)"
2089 which accommodates nested datatypes that recurse through lists.
2090 Similar rules are predeclared for products and option types.
2092 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2096 - Definitions of overloaded constants on sets have to be replaced by
2097 definitions on => and bool.
2099 - Some definitions of overloaded operators on sets can now be proved
2100 using the definitions of the operators on => and bool. Therefore,
2101 the following theorems have been renamed:
2103 subset_def -> subset_eq
2104 psubset_def -> psubset_eq
2105 set_diff_def -> set_diff_eq
2106 Compl_def -> Compl_eq
2107 Sup_set_def -> Sup_set_eq
2108 Inf_set_def -> Inf_set_eq
2109 sup_set_def -> sup_set_eq
2110 inf_set_def -> inf_set_eq
2112 - Due to the incompleteness of the HO unification algorithm, some
2113 rules such as subst may require manual instantiation, if some of
2114 the unknowns in the rule is a set.
2116 - Higher order unification and forward proofs:
2119 have "P (S::'a set)" <...>
2120 then have "EX S. P S" ..
2122 no longer works (due to the incompleteness of the HO unification
2123 algorithm) and must be replaced by the pattern
2130 - Calculational reasoning with subst (or similar rules):
2133 have "P (S::'a set)" <...>
2134 also have "S = T" <...>
2135 finally have "P T" .
2137 no longer works (for similar reasons as the previous example) and
2138 must be replaced by something like
2140 have "P (S::'a set)" <...>
2141 moreover have "S = T" <...>
2142 ultimately have "P T" by simp
2144 - Tactics or packages written in ML code:
2145 Code performing pattern matching on types via
2147 Type ("set", [T]) => ...
2149 must be rewritten. Moreover, functions like strip_type or
2150 binder_types no longer return the right value when applied to a
2153 T1 => ... => Tn => U => bool
2157 T1 => ... => Tn => U set
2159 * Merged theories Wellfounded_Recursion, Accessible_Part and
2160 Wellfounded_Relations to theory Wellfounded.
2162 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2164 * Class finite no longer treats UNIV as class parameter. Use class
2165 enum from theory Library/Enum instead to achieve a similar effect.
2168 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2169 and "Cons". INCOMPATIBILITY.
2171 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2172 Potential INCOMPATIBILITY.
2174 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2175 injective_fst_snd removed, use split_eta and prod_eqI instead.
2176 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2178 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2179 the same name in theory Orderings:
2189 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2190 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2191 and different variable names.
2193 * Library/Option_ord.thy: Canonical order on option type.
2195 * Library/RBT.thy: Red-black trees, an efficient implementation of
2198 * Library/Countable.thy: Type class for countable types.
2200 * Theory Int: The representation of numerals has changed. The infix
2201 operator BIT and the bit datatype with constructors B0 and B1 have
2202 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2203 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2204 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2207 * Theory Nat: definition of <= and < on natural numbers no longer
2208 depend on well-founded relations. INCOMPATIBILITY. Definitions
2209 le_def and less_def have disappeared. Consider lemmas not_less
2210 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2212 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2213 (whose purpose mainly is for various fold_set functionals) have been
2214 abandoned in favor of the existing algebraic classes
2215 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2216 lower_semilattice (resp. upper_semilattice) and linorder.
2219 * Theory Transitive_Closure: induct and cases rules now declare proper
2220 case_names ("base" and "step"). INCOMPATIBILITY.
2222 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2223 lattices. The form set-specific version is available as
2224 Inductive.lfp_ordinal_induct_set.
2226 * Renamed theorems "power.simps" to "power_int.simps".
2229 * Class semiring_div provides basic abstract properties of semirings
2230 with division and modulo operations. Subsumes former class dvd_mod.
2232 * Merged theories IntDef, Numeral and IntArith into unified theory
2233 Int. INCOMPATIBILITY.
2235 * Theory Library/Code_Index: type "index" now represents natural
2236 numbers rather than integers. INCOMPATIBILITY.
2238 * New class "uminus" with operation "uminus" (split of from class
2239 "minus" which now only has operation "minus", binary).
2242 * Constants "card", "internal_split", "option_map" now with authentic
2243 syntax. INCOMPATIBILITY.
2245 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2246 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2247 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2248 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2249 Sup_set_def, le_def, less_def, option_map_def now with object
2250 equality. INCOMPATIBILITY.
2252 * Records. Removed K_record, and replaced it by pure lambda term
2253 %x. c. The simplifier setup is now more robust against eta expansion.
2254 INCOMPATIBILITY: in cases explicitly referring to K_record.
2256 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2258 * Library/ListVector: new theory of arithmetic vector operations.
2260 * Library/Order_Relation: new theory of various orderings as sets of
2261 pairs. Defines preorders, partial orders, linear orders and
2262 well-orders on sets and on types.
2267 * Renamed some theories to allow to loading both ZF and HOL in the
2270 Datatype -> Datatype_ZF
2271 Inductive -> Inductive_ZF
2278 INCOMPATIBILITY: ZF theories that import individual theories below
2279 Main might need to be adapted. Regular theory Main is still
2280 available, as trivial extension of Main_ZF.
2285 * ML within Isar: antiquotation @{const name} or @{const
2286 name(typargs)} produces statically-checked Const term.
2288 * Functor NamedThmsFun: data is available to the user as dynamic fact
2289 (of the same name). Removed obsolete print command.
2291 * Removed obsolete "use_legacy_bindings" function.
2293 * The ``print mode'' is now a thread-local value derived from a global
2294 template (the former print_mode reference), thus access becomes
2295 non-critical. The global print_mode reference is for session
2296 management only; user-code should use print_mode_value,
2297 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2299 * Functions system/system_out provide a robust way to invoke external
2300 shell commands, with propagation of interrupts (requires Poly/ML
2301 5.2.1). Do not use OS.Process.system etc. from the basis library!
2306 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2307 in accordance with Proof General 3.7, which prefers GNU emacs.
2309 * isatool tty runs Isabelle process with plain tty interaction;
2310 optional line editor may be specified via ISABELLE_LINE_EDITOR
2311 setting, the default settings attempt to locate "ledit" and "rlwrap".
2313 * isatool browser now works with Cygwin as well, using general
2314 "javapath" function defined in Isabelle process environment.
2316 * YXML notation provides a simple and efficient alternative to
2317 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2318 isatool yxml as described in the Isabelle system manual.
2320 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2321 provides general wrapper for managing an Isabelle process in a robust
2322 fashion, with ``cooked'' output from stdin/stderr.
2324 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2325 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2327 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2328 way of changing the user's settings is via
2329 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2332 * Multithreading.max_threads := 0 refers to the number of actual CPU
2333 cores of the underlying machine, which is a good starting point for
2334 optimal performance tuning. The corresponding usedir option -M allows
2335 "max" as an alias for "0". WARNING: does not work on certain versions
2336 of Mac OS (with Poly/ML 5.1).
2338 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2339 adverse effect of Isabelle flooding interactive front-ends (notably
2340 ProofGeneral / XEmacs).
2344 New in Isabelle2007 (November 2007)
2345 -----------------------------------
2349 * More uniform information about legacy features, notably a
2350 warning/error of "Legacy feature: ...", depending on the state of the
2351 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2352 legacy features will disappear eventually.
2354 * Theory syntax: the header format ``theory A = B + C:'' has been
2355 discontinued in favour of ``theory A imports B C begin''. Use isatool
2356 fixheaders to convert existing theory files. INCOMPATIBILITY.
2358 * Theory syntax: the old non-Isar theory file format has been
2359 discontinued altogether. Note that ML proof scripts may still be used
2360 with Isar theories; migration is usually quite simple with the ML
2361 function use_legacy_bindings. INCOMPATIBILITY.
2363 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2364 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2367 * Theory loader: be more serious about observing the static theory
2368 header specifications (including optional directories), but not the
2369 accidental file locations of previously successful loads. The strict
2370 update policy of former update_thy is now already performed by
2371 use_thy, so the former has been removed; use_thys updates several
2372 theories simultaneously, just as 'imports' within a theory header
2373 specification, but without merging the results. Potential
2374 INCOMPATIBILITY: may need to refine theory headers and commands
2375 ROOT.ML which depend on load order.
2377 * Theory loader: optional support for content-based file
2378 identification, instead of the traditional scheme of full physical
2379 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2380 (cf. the system manual). The new scheme allows to work with
2381 non-finished theories in persistent session images, such that source
2382 files may be moved later on without requiring reloads.
2384 * Theory loader: old-style ML proof scripts being *attached* to a thy
2385 file (with the same base name as the theory) are considered a legacy
2386 feature, which will disappear eventually. Even now, the theory loader
2387 no longer maintains dependencies on such files.
2389 * Syntax: the scope for resolving ambiguities via type-inference is
2390 now limited to individual terms, instead of whole simultaneous
2391 specifications as before. This greatly reduces the complexity of the
2392 syntax module and improves flexibility by separating parsing and
2393 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2394 'fixes' etc.) are required in rare situations.
2396 * Syntax: constants introduced by new-style packages ('definition',
2397 'abbreviation' etc.) are passed through the syntax module in
2398 ``authentic mode''. This means that associated mixfix annotations
2399 really stick to such constants, independently of potential name space
2400 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2401 trees are represented slightly differently, may need to adapt syntax
2402 translations accordingly. Use CONST marker in 'translations' and
2403 @{const_syntax} antiquotation in 'parse_translation' etc.
2405 * Legacy goal package: reduced interface to the bare minimum required
2406 to keep existing proof scripts running. Most other user-level
2407 functions are now part of the OldGoals structure, which is *not* open
2408 by default (consider isatool expandshort before open OldGoals).
2409 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2410 these tend to cause confusion about the actual goal (!) context being
2411 used here, which is not necessarily the same as the_context().
2413 * Command 'find_theorems': supports "*" wild-card in "name:"
2414 criterion; "with_dups" option. Certain ProofGeneral versions might
2415 support a specific search form (see ProofGeneral/CHANGES).
2417 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2418 by default, which means that "prems" (and also "fixed variables") are
2419 suppressed from proof state output. Note that the ProofGeneral
2420 settings mechanism allows to change and save options persistently, but
2421 older versions of Isabelle will fail to start up if a negative prems
2424 * Local theory targets may be specified by non-nested blocks of
2425 ``context/locale/class ... begin'' followed by ``end''. The body may
2426 contain definitions, theorems etc., including any derived mechanism
2427 that has been implemented on top of these primitives. This concept
2428 generalizes the existing ``theorem (in ...)'' towards more versatility
2431 * Proof General interface: proper undo of final 'end' command;
2432 discontinued Isabelle/classic mode (ML proof scripts).
2435 *** Document preparation ***
2437 * Added antiquotation @{theory name} which prints the given name,
2438 after checking that it refers to a valid ancestor theory in the
2441 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2442 check the given source text as ML type/structure, printing verbatim.
2444 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2445 "c args == rhs" given in the current context. (Any number of
2446 arguments may be given on the LHS.)
2451 * The 'class' package offers a combination of axclass and locale to
2452 achieve Haskell-like type classes in Isabelle. Definitions and
2453 theorems within a class context produce both relative results (with
2454 implicit parameters according to the locale context), and polymorphic
2455 constants with qualified polymorphism (according to the class
2456 context). Within the body context of a 'class' target, a separate
2457 syntax layer ("user space type system") takes care of converting
2458 between global polymorphic consts and internal locale representation.
2459 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2460 "isatool doc classes" provides a tutorial.
2462 * Generic code generator framework allows to generate executable
2463 code for ML and Haskell (including Isabelle classes). A short usage
2466 internal compilation:
2467 export_code <list of constants (term syntax)> in SML
2468 writing SML code to a file:
2469 export_code <list of constants (term syntax)> in SML <filename>
2470 writing OCaml code to a file:
2471 export_code <list of constants (term syntax)> in OCaml <filename>
2472 writing Haskell code to a bunch of files:
2473 export_code <list of constants (term syntax)> in Haskell <filename>
2475 evaluating closed propositions to True/False using code generation:
2478 Reasonable default setup of framework in HOL.
2480 Theorem attributs for selecting and transforming function equations theorems:
2482 [code fun]: select a theorem as function equation for a specific constant
2483 [code fun del]: deselect a theorem as function equation for a specific constant
2484 [code inline]: select an equation theorem for unfolding (inlining) in place
2485 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2487 User-defined serializations (target in {SML, OCaml, Haskell}):
2489 code_const <and-list of constants (term syntax)>
2490 {(target) <and-list of const target syntax>}+
2492 code_type <and-list of type constructors>
2493 {(target) <and-list of type target syntax>}+
2495 code_instance <and-list of instances>
2497 where instance ::= <type constructor> :: <class>
2499 code_class <and_list of classes>
2500 {(target) <and-list of class target syntax>}+
2501 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2503 code_instance and code_class only are effective to target Haskell.
2505 For example usage see src/HOL/ex/Codegenerator.thy and
2506 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2507 generation from Isabelle/HOL theories is available via "isatool doc
2510 * Code generator: consts in 'consts_code' Isar commands are now
2511 referred to by usual term syntax (including optional type
2514 * Command 'no_translations' removes translation rules from theory
2517 * Overloaded definitions are now actually checked for acyclic
2518 dependencies. The overloading scheme is slightly more general than
2519 that of Haskell98, although Isabelle does not demand an exact
2520 correspondence to type class and instance declarations.
2521 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2522 exotic versions of overloading -- at the discretion of the user!
2524 Polymorphic constants are represented via type arguments, i.e. the
2525 instantiation that matches an instance against the most general
2526 declaration given in the signature. For example, with the declaration
2527 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2528 as c(nat). Overloading is essentially simultaneous structural
2529 recursion over such type arguments. Incomplete specification patterns
2530 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2531 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2532 Command 'print_theory' outputs the normalized system of recursive
2533 equations, see section "definitions".
2535 * Configuration options are maintained within the theory or proof
2536 context (with name and type bool/int/string), providing a very simple
2537 interface to a poor-man's version of general context data. Tools may
2538 declare options in ML (e.g. using Attrib.config_int) and then refer to
2539 these values using Config.get etc. Users may change options via an
2540 associated attribute of the same name. This form of context
2541 declaration works particularly well with commands 'declare' or
2542 'using', for example ``declare [[foo = 42]]''. Thus it has become
2543 very easy to avoid global references, which would not observe Isar
2544 toplevel undo/redo and fail to work with multithreading.
2546 Various global ML references of Pure and HOL have been turned into
2547 configuration options:
2549 Unify.search_bound unify_search_bound
2550 Unify.trace_bound unify_trace_bound
2551 Unify.trace_simp unify_trace_simp
2552 Unify.trace_types unify_trace_types
2553 Simplifier.simp_depth_limit simp_depth_limit
2554 Blast.depth_limit blast_depth_limit
2555 DatatypeProp.dtK datatype_distinctness_limit
2556 fast_arith_neq_limit fast_arith_neq_limit
2557 fast_arith_split_limit fast_arith_split_limit
2559 * Named collections of theorems may be easily installed as context
2560 data using the functor NamedThmsFun (see also
2561 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2562 attributes; there is also a toplevel print command. This facility is
2563 just a common case of general context data, which is the preferred way
2564 for anything more complex than just a list of facts in canonical
2567 * Isar: command 'declaration' augments a local theory by generic
2568 declaration functions written in ML. This enables arbitrary content
2569 being added to the context, depending on a morphism that tells the
2570 difference of the original declaration context wrt. the application
2571 context encountered later on.
2573 * Isar: proper interfaces for simplification procedures. Command
2574 'simproc_setup' declares named simprocs (with match patterns, and body
2575 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2576 context. ML antiquotation @{simproc name} retrieves named simprocs.
2578 * Isar: an extra pair of brackets around attribute declarations
2579 abbreviates a theorem reference involving an internal dummy fact,
2580 which will be ignored later --- only the effect of the attribute on
2581 the background context will persist. This form of in-place
2582 declarations is particularly useful with commands like 'declare' and
2583 'using', for example ``have A using [[simproc a]] by simp''.
2585 * Isar: method "assumption" (and implicit closing of subproofs) now
2586 takes simple non-atomic goal assumptions into account: after applying
2587 an assumption as a rule the resulting subgoals are solved by atomic
2588 assumption steps. This is particularly useful to finish 'obtain'
2589 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2590 without referring to the original premise "!!x. P x ==> thesis" in the
2591 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2594 * Isar: implicit use of prems from the Isar proof context is
2595 considered a legacy feature. Common applications like ``have A .''
2596 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2597 referencing facts explicitly here improves readability and
2598 maintainability of proof texts.
2600 * Isar: improper proof element 'guess' is like 'obtain', but derives
2601 the obtained context from the course of reasoning! For example:
2603 assume "EX x y. A x & B y" -- "any previous fact"
2604 then guess x and y by clarify
2606 This technique is potentially adventurous, depending on the facts and
2607 proof tools being involved here.
2609 * Isar: known facts from the proof context may be specified as literal
2610 propositions, using ASCII back-quote syntax. This works wherever
2611 named facts used to be allowed so far, in proof commands, proof
2612 methods, attributes etc. Literal facts are retrieved from the context
2613 according to unification of type and term parameters. For example,
2614 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2615 theorems in the current context, then these are valid literal facts:
2616 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2618 There is also a proof method "fact" which does the same composition
2619 for explicit goal states, e.g. the following proof texts coincide with
2620 certain special cases of literal facts:
2622 have "A" by fact == note `A`
2623 have "A ==> B" by fact == note `A ==> B`
2624 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2625 have "P a ==> Q a" by fact == note `P a ==> Q a`
2627 * Isar: ":" (colon) is no longer a symbolic identifier character in
2628 outer syntax. Thus symbolic identifiers may be used without
2629 additional white space in declarations like this: ``assume *: A''.
2631 * Isar: 'print_facts' prints all local facts of the current context,
2632 both named and unnamed ones.
2634 * Isar: 'def' now admits simultaneous definitions, e.g.:
2636 def x == "t" and y == "u"
2638 * Isar: added command 'unfolding', which is structurally similar to
2639 'using', but affects both the goal state and facts by unfolding given
2640 rewrite rules. Thus many occurrences of the 'unfold' method or
2641 'unfolded' attribute may be replaced by first-class proof text.
2643 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2644 and command 'unfolding' now all support object-level equalities
2645 (potentially conditional). The underlying notion of rewrite rule is
2646 analogous to the 'rule_format' attribute, but *not* that of the
2647 Simplifier (which is usually more generous).
2649 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2650 premises of a theorem by n. Useful in conjunction with drule.
2652 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2653 method expression within a sandbox consisting of the first N
2654 sub-goals, which need to exist. For example, ``simp_all [3]''
2655 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2656 simplifies all new goals that emerge from applying rule foo to the
2657 originally first one.
2659 * Isar: schematic goals are no longer restricted to higher-order
2660 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2663 * Isar: the conclusion of a long theorem statement is now either
2664 'shows' (a simultaneous conjunction, as before), or 'obtains'
2665 (essentially a disjunction of cases with local parameters and
2666 assumptions). The latter allows to express general elimination rules
2667 adequately; in this notation common elimination rules look like this:
2669 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2671 obtains x where "P x"
2673 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2677 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2683 The subsequent classical rules even refer to the formal "thesis"
2686 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2689 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2690 obtains "thesis ==> something"
2692 The actual proof of an 'obtains' statement is analogous to that of the
2693 Isar proof element 'obtain', only that there may be several cases.
2694 Optional case names may be specified in parentheses; these will be
2695 available both in the present proof and as annotations in the
2696 resulting rule, for later use with the 'cases' method (cf. attribute
2699 * Isar: the assumptions of a long theorem statement are available as
2700 "assms" fact in the proof context. This is more appropriate than the
2701 (historical) "prems", which refers to all assumptions of the current
2702 context, including those from the target locale, proof body etc.
2704 * Isar: 'print_statement' prints theorems from the current theory or
2705 proof context in long statement form, according to the syntax of a
2708 * Isar: 'obtain' takes an optional case name for the local context
2709 introduction rule (default "that").
2711 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2712 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2715 * Pure: syntax "CONST name" produces a fully internalized constant
2716 according to the current context. This is particularly useful for
2717 syntax translations that should refer to internal constant
2718 representations independently of name spaces.
2720 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2721 instead of "FOO ". This allows multiple binder declarations to coexist
2722 in the same context. INCOMPATIBILITY.
2724 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2725 primitive that also works in a locale context (both for constants and
2726 fixed variables). Type declaration and internal syntactic representation
2727 of given constants retrieved from the context. Likewise, the
2728 'no_notation' command allows to remove given syntax annotations from the
2731 * Isar/locales: new derived specification elements 'axiomatization',
2732 'definition', 'abbreviation', which support type-inference, admit
2733 object-level specifications (equality, equivalence). See also the
2734 isar-ref manual. Examples:
2737 eq (infix "===" 50) where
2738 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2740 definition "f x y = x + y + 1"
2741 definition g where "g x = f x x"
2744 neq (infix "=!=" 50) where
2745 "x =!= y == ~ (x === y)"
2747 These specifications may be also used in a locale context. Then the
2748 constants being introduced depend on certain fixed parameters, and the
2749 constant name is qualified by the locale base name. An internal
2750 abbreviation takes care for convenient input and output, making the
2751 parameters implicit and using the original short name. See also
2752 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2753 entities from a monomorphic theory.
2755 Presently, abbreviations are only available 'in' a target locale, but
2756 not inherited by general import expressions. Also note that
2757 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2758 'translations' in common applications. The "no_abbrevs" print mode
2759 prevents folding of abbreviations in term output.
2761 Concrete syntax is attached to specified constants in internal form,
2762 independently of name spaces. The parse tree representation is
2763 slightly different -- use 'notation' instead of raw 'syntax', and
2764 'translations' with explicit "CONST" markup to accommodate this.
2766 * Pure/Isar: unified syntax for new-style specification mechanisms
2767 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2768 full type inference and dummy patterns ("_"). For example:
2770 definition "K x _ = x"
2772 inductive conj for A B
2773 where "A ==> B ==> conj A B"
2775 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2776 the current context. Print mode "no_abbrevs" prevents inversion of
2777 abbreviations on output.
2779 * Isar/locales: improved parameter handling: use of locales "var" and
2780 "struct" no longer necessary; - parameter renamings are no longer
2781 required to be injective. For example, this allows to define
2782 endomorphisms as locale endom = homom mult mult h.
2784 * Isar/locales: changed the way locales with predicates are defined.
2785 Instead of accumulating the specification, the imported expression is
2786 now an interpretation. INCOMPATIBILITY: different normal form of
2787 locale expressions. In particular, in interpretations of locales with
2788 predicates, goals repesenting already interpreted fragments are not
2789 removed automatically. Use methods `intro_locales' and
2790 `unfold_locales'; see below.
2792 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2793 provide backward reasoning on locales predicates. The methods are
2794 aware of interpretations and discharge corresponding goals.
2795 `intro_locales' is less aggressive then `unfold_locales' and does not
2796 unfold predicates to assumptions.
2798 * Isar/locales: the order in which locale fragments are accumulated
2799 has changed. This enables to override declarations from fragments due
2800 to interpretations -- for example, unwanted simp rules.
2802 * Isar/locales: interpretation in theories and proof contexts has been
2803 extended. One may now specify (and prove) equations, which are
2804 unfolded in interpreted theorems. This is useful for replacing
2805 defined concepts (constants depending on locale parameters) by
2806 concepts already existing in the target context. Example:
2808 interpretation partial_order ["op <= :: [int, int] => bool"]
2809 where "partial_order.less (op <=) (x::int) y = (x < y)"
2811 Typically, the constant `partial_order.less' is created by a
2812 definition specification element in the context of locale
2815 * Method "induct": improved internal context management to support
2816 local fixes and defines on-the-fly. Thus explicit meta-level
2817 connectives !! and ==> are rarely required anymore in inductive goals
2818 (using object-logic connectives for this purpose has been long
2819 obsolete anyway). Common proof patterns are explained in
2820 src/HOL/Induct/Common_Patterns.thy, see also
2821 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2824 * Method "induct": improved handling of simultaneous goals. Instead of
2825 introducing object-level conjunction, the statement is now split into
2826 several conclusions, while the corresponding symbolic cases are nested
2827 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2828 see src/HOL/Induct/Common_Patterns.thy, for example.
2830 * Method "induct": mutual induction rules are now specified as a list
2831 of rule sharing the same induction cases. HOL packages usually provide
2832 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2833 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2834 mutual induction rules differently, i.e. like this:
2836 (induct rule: foo_bar.inducts)
2837 (induct set: foo bar)
2838 (induct pred: foo bar)
2839 (induct type: foo bar)
2841 The ML function ProjectRule.projections turns old-style rules into the
2844 * Method "coinduct": dual of induction, see
2845 src/HOL/Library/Coinductive_List.thy for various examples.
2847 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2848 considered a legacy feature.
2850 * Attribute "symmetric" produces result with standardized schematic
2851 variables (index 0). Potential INCOMPATIBILITY.
2853 * Simplifier: by default the simplifier trace only shows top level
2854 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2855 default. Thus there is less danger of being flooded by the trace. The
2856 trace indicates where parts have been suppressed.
2858 * Provers/classical: removed obsolete classical version of elim_format
2859 attribute; classical elim/dest rules are now treated uniformly when
2860 manipulating the claset.
2862 * Provers/classical: stricter checks to ensure that supplied intro,
2863 dest and elim rules are well-formed; dest and elim rules must have at
2866 * Provers/classical: attributes dest/elim/intro take an optional
2867 weight argument for the rule (just as the Pure versions). Weights are
2868 ignored by automated tools, but determine the search order of single
2871 * Syntax: input syntax now supports dummy variable binding "%_. b",
2872 where the body does not mention the bound variable. Note that dummy
2873 patterns implicitly depend on their context of bounds, which makes
2874 "{_. _}" match any set comprehension as expected. Potential
2875 INCOMPATIBILITY -- parse translations need to cope with syntactic
2876 constant "_idtdummy" in the binding position.
2878 * Syntax: removed obsolete syntactic constant "_K" and its associated
2879 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2880 for example "A -> B" => "Pi A (%_. B)".
2882 * Pure: 'class_deps' command visualizes the subclass relation, using
2883 the graph browser tool.
2885 * Pure: 'print_theory' now suppresses certain internal declarations by
2886 default; use '!' option for full details.
2891 * Method "metis" proves goals by applying the Metis general-purpose
2892 resolution prover (see also http://gilith.com/software/metis/).
2893 Examples are in the directory MetisExamples. WARNING: the
2894 Isabelle/HOL-Metis integration does not yet work properly with
2897 * Command 'sledgehammer' invokes external automatic theorem provers as
2898 background processes. It generates calls to the "metis" method if
2899 successful. These can be pasted into the proof. Users do not have to
2900 wait for the automatic provers to return. WARNING: does not really
2901 work with multi-threading.
2903 * New "auto_quickcheck" feature tests outermost goal statements for
2904 potential counter-examples. Controlled by ML references
2905 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2906 5000 milliseconds). Fails silently if statements is outside of
2907 executable fragment, or any other codgenerator problem occurs.
2909 * New constant "undefined" with axiom "undefined x = undefined".
2911 * Added class "HOL.eq", allowing for code generation with polymorphic
2914 * Some renaming of class constants due to canonical name prefixing in
2915 the new 'class' package:
2917 HOL.abs ~> HOL.abs_class.abs
2918 HOL.divide ~> HOL.divide_class.divide
2919 0 ~> HOL.zero_class.zero
2920 1 ~> HOL.one_class.one
2921 op + ~> HOL.plus_class.plus
2922 op - ~> HOL.minus_class.minus
2923 uminus ~> HOL.minus_class.uminus
2924 op * ~> HOL.times_class.times
2925 op < ~> HOL.ord_class.less
2926 op <= > HOL.ord_class.less_eq
2927 Nat.power ~> Power.power_class.power
2928 Nat.size ~> Nat.size_class.size
2929 Numeral.number_of ~> Numeral.number_class.number_of
2930 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2931 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2932 Orderings.min ~> Orderings.ord_class.min
2933 Orderings.max ~> Orderings.ord_class.max
2934 Divides.op div ~> Divides.div_class.div
2935 Divides.op mod ~> Divides.div_class.mod
2936 Divides.op dvd ~> Divides.div_class.dvd
2938 INCOMPATIBILITY. Adaptions may be required in the following cases:
2940 a) User-defined constants using any of the names "plus", "minus",
2941 "times", "less" or "less_eq". The standard syntax translations for
2942 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2945 b) Variables named "plus", "minus", "times", "less", "less_eq"
2946 INCOMPATIBILITY: use more specific names.
2948 c) Permutative equations (e.g. "a + b = b + a")
2949 Since the change of names also changes the order of terms, permutative
2950 rewrite rules may get applied in a different order. Experience shows
2951 that this is rarely the case (only two adaptions in the whole Isabelle
2952 distribution). INCOMPATIBILITY: rewrite proofs
2954 d) ML code directly refering to constant names
2955 This in general only affects hand-written proof tactics, simprocs and
2956 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2957 Consider using @{const_name} antiquotation.
2959 * New class "default" with associated constant "default".
2961 * Function "sgn" is now overloaded and available on int, real, complex
2962 (and other numeric types), using class "sgn". Two possible defs of
2963 sgn are given as equational assumptions in the classes sgn_if and
2964 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2967 * Locale "partial_order" now unified with class "order" (cf. theory
2968 Orderings), added parameter "less". INCOMPATIBILITY.
2970 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2971 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2972 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2974 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2975 changed order of proof goals in instance proofs.
2977 * The transitivity reasoner for partial and linear orders is set up
2978 for classes "order" and "linorder". Instances of the reasoner are available
2979 in all contexts importing or interpreting the corresponding locales.
2980 Method "order" invokes the reasoner separately; the reasoner
2981 is also integrated with the Simplifier as a solver. Diagnostic
2982 command 'print_orders' shows the available instances of the reasoner
2983 in the current context.
2985 * Localized monotonicity predicate in theory "Orderings"; integrated
2986 lemmas max_of_mono and min_of_mono with this predicate.
2989 * Formulation of theorem "dense" changed slightly due to integration
2990 with new class dense_linear_order.
2992 * Uniform lattice theory development in HOL.
2994 constants "meet" and "join" now named "inf" and "sup"
2995 constant "Meet" now named "Inf"
2997 classes "meet_semilorder" and "join_semilorder" now named
2998 "lower_semilattice" and "upper_semilattice"
2999 class "lorder" now named "lattice"
3000 class "comp_lat" now named "complete_lattice"
3002 Instantiation of lattice classes allows explicit definitions
3003 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
3005 INCOMPATIBILITY. Theorem renames:
3007 meet_left_le ~> inf_le1
3008 meet_right_le ~> inf_le2
3009 join_left_le ~> sup_ge1
3010 join_right_le ~> sup_ge2
3011 meet_join_le ~> inf_sup_ord
3014 le_meet ~> le_inf_iff
3015 le_join ~> ge_sup_conv
3016 meet_idempotent ~> inf_idem
3017 join_idempotent ~> sup_idem
3018 meet_comm ~> inf_commute
3019 join_comm ~> sup_commute
3020 meet_leI1 ~> le_infI1
3021 meet_leI2 ~> le_infI2
3022 le_joinI1 ~> le_supI1
3023 le_joinI2 ~> le_supI2
3024 meet_assoc ~> inf_assoc
3025 join_assoc ~> sup_assoc
3026 meet_left_comm ~> inf_left_commute
3027 meet_left_idempotent ~> inf_left_idem
3028 join_left_comm ~> sup_left_commute
3029 join_left_idempotent ~> sup_left_idem
3032 le_def_meet ~> le_iff_inf
3033 le_def_join ~> le_iff_sup
3034 join_absorp2 ~> sup_absorb2
3035 join_absorp1 ~> sup_absorb1
3036 meet_absorp1 ~> inf_absorb1
3037 meet_absorp2 ~> inf_absorb2
3038 meet_join_absorp ~> inf_sup_absorb
3039 join_meet_absorp ~> sup_inf_absorb
3040 distrib_join_le ~> distrib_sup_le
3041 distrib_meet_le ~> distrib_inf_le
3043 add_meet_distrib_left ~> add_inf_distrib_left
3044 add_join_distrib_left ~> add_sup_distrib_left
3045 is_join_neg_meet ~> is_join_neg_inf
3046 is_meet_neg_join ~> is_meet_neg_sup
3047 add_meet_distrib_right ~> add_inf_distrib_right
3048 add_join_distrib_right ~> add_sup_distrib_right
3049 add_meet_join_distribs ~> add_sup_inf_distribs
3050 join_eq_neg_meet ~> sup_eq_neg_inf
3051 meet_eq_neg_join ~> inf_eq_neg_sup
3052 add_eq_meet_join ~> add_eq_inf_sup
3053 meet_0_imp_0 ~> inf_0_imp_0
3054 join_0_imp_0 ~> sup_0_imp_0
3055 meet_0_eq_0 ~> inf_0_eq_0
3056 join_0_eq_0 ~> sup_0_eq_0
3057 neg_meet_eq_join ~> neg_inf_eq_sup
3058 neg_join_eq_meet ~> neg_sup_eq_inf
3059 join_eq_if ~> sup_eq_if
3061 mono_meet ~> mono_inf
3062 mono_join ~> mono_sup
3063 meet_bool_eq ~> inf_bool_eq
3064 join_bool_eq ~> sup_bool_eq
3065 meet_fun_eq ~> inf_fun_eq
3066 join_fun_eq ~> sup_fun_eq
3067 meet_set_eq ~> inf_set_eq
3068 join_set_eq ~> sup_set_eq
3069 meet1_iff ~> inf1_iff
3070 meet2_iff ~> inf2_iff
3079 join1_iff ~> sup1_iff
3080 join2_iff ~> sup2_iff
3090 is_meet_Meet ~> is_meet_Inf
3091 Meet_bool_def ~> Inf_bool_def
3092 Meet_fun_def ~> Inf_fun_def
3093 Meet_greatest ~> Inf_greatest
3094 Meet_lower ~> Inf_lower
3095 Meet_set_def ~> Inf_set_def
3098 Sup_bool_eq ~> Sup_bool_def
3099 Sup_fun_eq ~> Sup_fun_def
3100 Sup_set_eq ~> Sup_set_def
3102 listsp_meetI ~> listsp_infI
3103 listsp_meet_eq ~> listsp_inf_eq
3108 * Added syntactic class "size"; overloaded constant "size" now has
3109 type "'a::size ==> bool"
3111 * Internal reorganisation of `size' of datatypes: size theorems
3112 "foo.size" are no longer subsumed by "foo.simps" (but are still
3113 simplification rules by default!); theorems "prod.size" now named
3116 * Class "div" now inherits from class "times" rather than "type".
3119 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3120 Linorder etc. have disappeared; operations defined in terms of
3121 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3123 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3125 * HOL-Word: New extensive library and type for generic, fixed size
3126 machine words, with arithemtic, bit-wise, shifting and rotating
3127 operations, reflection into int, nat, and bool lists, automation for
3128 linear arithmetic (by automatic reflection into nat or int), including
3129 lemmas on overflow and monotonicity. Instantiated to all appropriate
3130 arithmetic type classes, supporting automatic simplification of
3131 numerals on all operations.
3133 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3135 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3137 * Code generator library theories:
3138 - Code_Integer represents HOL integers by big integer literals in target
3140 - Code_Char represents HOL characters by character literals in target
3142 - Code_Char_chr like Code_Char, but also offers treatment of character
3143 codes; includes Code_Integer.
3144 - Executable_Set allows to generate code for finite sets using lists.
3145 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3147 - Executable_Real implements a subset of real numbers, namly those
3148 representable by rational numbers.
3149 - Efficient_Nat implements natural numbers by integers, which in general will
3150 result in higher efficency; pattern matching with 0/Suc is eliminated;
3151 includes Code_Integer.
3152 - Code_Index provides an additional datatype index which is mapped to
3153 target-language built-in integers.
3154 - Code_Message provides an additional datatype message_string which is isomorphic to
3155 strings; messages are mapped to target-language strings.
3157 * New package for inductive predicates
3159 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3162 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3163 for z_1 :: U_1 and ... and z_n :: U_m
3165 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3168 with full support for type-inference, rather than
3170 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3172 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3173 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3175 inductive "s z_1 ... z_m"
3177 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3180 For backward compatibility, there is a wrapper allowing inductive
3181 sets to be defined with the new package via
3184 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3185 for z_1 :: U_1 and ... and z_n :: U_m
3187 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3193 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3194 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3195 for z_1 :: U_1 and ... and z_n :: U_m
3197 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3198 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3201 if the additional syntax "p ..." is required.
3203 Numerous examples can be found in the subdirectories src/HOL/Auth,
3204 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3208 - Since declaration and definition of inductive sets or predicates
3209 is no longer separated, abbreviations involving the newly
3210 introduced sets or predicates must be specified together with the
3211 introduction rules after the 'where' keyword (see above), rather
3212 than before the actual inductive definition.
3214 - The variables in induction and elimination rules are now
3215 quantified in the order of their occurrence in the introduction
3216 rules, rather than in alphabetical order. Since this may break
3217 some proofs, these proofs either have to be repaired, e.g. by
3218 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3219 statements of the form
3221 case (rule_i a_i_1 ... a_i_{k_i})
3223 or the old order of quantification has to be restored by explicitly adding
3224 meta-level quantifiers in the introduction rules, i.e.
3226 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3228 - The format of the elimination rules is now
3230 p z_1 ... z_m x_1 ... x_n ==>
3231 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3236 (x_1, ..., x_n) : s z_1 ... z_m ==>
3237 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3240 for sets rather than
3242 x : s z_1 ... z_m ==>
3243 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3246 This may require terms in goals to be expanded to n-tuples
3247 (e.g. using case_tac or simplification with the split_paired_all
3248 rule) before the above elimination rule is applicable.
3250 - The elimination or case analysis rules for (mutually) inductive
3251 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3252 list of rules "p_1_..._p_k.elims" is no longer available.
3254 * New package "function"/"fun" for general recursive functions,
3255 supporting mutual and nested recursion, definitions in local contexts,
3256 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3257 for small examples, and the separate tutorial on the function
3258 package. The old recdef "package" is still available as before, but
3259 users are encouraged to use the new package.
3261 * Method "lexicographic_order" automatically synthesizes termination
3262 relations as lexicographic combinations of size measures.
3264 * Case-expressions allow arbitrary constructor-patterns (including
3265 "_") and take their order into account, like in functional
3266 programming. Internally, this is translated into nested
3267 case-expressions; missing cases are added and mapped to the predefined
3268 constant "undefined". In complicated cases printing may no longer show
3269 the original input but the internal form. Lambda-abstractions allow
3270 the same form of pattern matching: "% pat1 => e1 | ..." is an
3271 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3274 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3275 is an abbreviation for "of_nat :: nat => int". The simplification
3276 rules for "of_nat" have been changed to work like "int" did
3277 previously. Potential INCOMPATIBILITY:
3278 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3279 - of_nat_diff and of_nat_mult are no longer default simp rules
3281 * Method "algebra" solves polynomial equations over (semi)rings using
3282 Groebner bases. The (semi)ring structure is defined by locales and the
3283 tool setup depends on that generic context. Installing the method for
3284 a specific type involves instantiating the locale and possibly adding
3285 declarations for computation on the coefficients. The method is
3286 already instantiated for natural numbers and for the axiomatic class
3287 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3288 CALCULEMUS 2007 for the general principles underlying this
3289 architecture of context-aware proof-tools.
3291 * Method "ferrack" implements quantifier elimination over
3292 special-purpose dense linear orders using locales (analogous to
3293 "algebra"). The method is already installed for class
3294 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3297 * Former constant "List.op @" now named "List.append". Use ML
3298 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3299 circumvent possible incompatibilities when working on ML level.
3301 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3303 * New function listsum :: 'a list => 'a for arbitrary monoids.
3304 Special syntax: "SUM x <- xs. f x" (and latex variants)
3306 * New syntax for Haskell-like list comprehension (input only), eg.
3307 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3309 * The special syntax for function "filter" has changed from [x :
3310 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3311 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3313 * [a..b] is now defined for arbitrary linear orders. It used to be
3314 defined on nat only, as an abbreviation for [a..<Suc b]
3317 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3319 * New functions "sorted" and "sort" in src/HOL/List.thy.
3321 * New lemma collection field_simps (an extension of ring_simps) for
3322 manipulating (in)equations involving division. Multiplies with all
3323 denominators that can be proved to be non-zero (in equations) or
3324 positive/negative (in inequations).
3326 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3327 have been improved and renamed to ring_simps, group_simps and
3328 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3329 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3331 * Theory Library/Commutative_Ring: switched from recdef to function
3332 package; constants add, mul, pow now curried. Infix syntax for
3333 algebraic operations.
3335 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3338 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3341 * HOL/records: generalised field-update to take a function on the
3342 field rather than the new value: r(|A := x|) is translated to A_update
3343 (K x) r The K-combinator that is internally used is called K_record.
3344 INCOMPATIBILITY: Usage of the plain update functions has to be
3347 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3348 * x = 0, which are required for a semiring. Richer structures do not
3349 inherit from semiring_0 anymore, because this property is a theorem
3350 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3351 there is more to prove, but this is mostly trivial.
3353 * Class "recpower" is generalized to arbitrary monoids, not just
3354 commutative semirings. INCOMPATIBILITY: may need to incorporate
3355 commutativity or semiring properties additionally.
3357 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3358 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3359 better use 'abbreviation'.
3361 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3363 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3364 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3365 significant changes for setting up numeral syntax for types:
3366 - New constants Numeral.pred and Numeral.succ instead
3367 of former Numeral.bin_pred and Numeral.bin_succ.
3368 - Use integer operations instead of bin_add, bin_mult and so on.
3369 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3370 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3372 See src/HOL/Integ/IntArith.thy for an example setup.
3374 * Command 'normal_form' computes the normal form of a term that may
3375 contain free variables. For example ``normal_form "rev [a, b, c]"''
3376 produces ``[b, c, a]'' (without proof). This command is suitable for
3377 heavy-duty computations because the functions are compiled to ML
3378 first. Correspondingly, a method "normalization" is provided. See
3379 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3381 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3382 25 like -->); output depends on the "iff" print_mode, the default is
3383 "A = B" (with priority 50).
3385 * Relations less (<) and less_eq (<=) are also available on type bool.
3386 Modified syntax to disallow nesting without explicit parentheses,
3387 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3390 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3392 * Relation composition operator "op O" now has precedence 75 and binds
3393 stronger than union and intersection. INCOMPATIBILITY.
3395 * The old set interval syntax "{m..n(}" (and relatives) has been
3396 removed. Use "{m..<n}" (and relatives) instead.
3398 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3399 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3400 ``declare [[simproc del: neq]]''.
3402 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3405 * Theorem Cons_eq_map_conv no longer declared as "simp".
3407 * Theorem setsum_mult renamed to setsum_right_distrib.
3409 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3412 * Reimplemented methods "sat" and "satx", with several improvements:
3413 goals no longer need to be stated as "<prems> ==> False", equivalences
3414 (i.e. "=" on type bool) are handled, variable names of the form
3415 "lit_<n>" are no longer reserved, significant speedup.
3417 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3418 zChaff is still supported as well.
3420 * 'inductive' and 'datatype': provide projections of mutual rules,
3421 bundled as foo_bar.inducts;
3423 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3426 * Library: moved theory Accessible_Part to main HOL.
3428 * Library: added theory Coinductive_List of potentially infinite lists
3429 as greatest fixed-point.
3431 * Library: added theory AssocList which implements (finite) maps as
3434 * Method "evaluation" solves goals (i.e. a boolean expression)
3435 efficiently by compiling it to ML. The goal is "proved" (via an
3436 oracle) if it evaluates to True.
3438 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3439 also when invoked by the simplifier. This results in the Simplifier
3440 being more powerful on arithmetic goals. INCOMPATIBILITY.
3441 Configuration option fast_arith_split_limit=0 recovers the old
3444 * Support for hex (0x20) and binary (0b1001) numerals.
3446 * New method: reify eqs (t), where eqs are equations for an
3447 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3448 parameter, computes a term s::'b and a list xs::'a list and proves the
3449 theorem I xs s = t. This is also known as reification or quoting. The
3450 resulting theorem is applied to the subgoal to substitute t with I xs
3451 s. If t is omitted, the subgoal itself is reified.
3453 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3454 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3455 where f is supposed to be a computable function (in the sense of code
3456 generattion). The method uses reify to compute s and xs as above then
3457 applies corr_thm and uses normalization by evaluation to "prove" f s =
3458 r and finally gets the theorem t = r, which is again applied to the
3459 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3461 * Reflection: Automatic reification now handels binding, an example is
3462 available in src/HOL/ex/ReflectionEx.thy
3464 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3465 command 'statespace' that is similar to 'record', but introduces an
3466 abstract specification based on the locale infrastructure instead of
3467 HOL types. This leads to extra flexibility in composing state spaces,
3468 in particular multiple inheritance and renaming of components.
3473 * Hyperreal: Functions root and sqrt are now defined on negative real
3474 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3475 Nonnegativity side conditions have been removed from many lemmas, so
3476 that more subgoals may now be solved by simplification; potential
3479 * Real: new type classes formalize real normed vector spaces and
3480 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3481 and norm :: 'a => real.
3483 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3484 reals into other types. The overloaded constant Reals :: 'a set is now
3485 defined as range of_real; potential INCOMPATIBILITY.
3487 * Real: proper support for ML code generation, including 'quickcheck'.
3488 Reals are implemented as arbitrary precision rationals.
3490 * Hyperreal: Several constants that previously worked only for the
3491 reals have been generalized, so they now work over arbitrary vector
3492 spaces. Type annotations may need to be added in some cases; potential
3495 Infinitesimal :: ('a::real_normed_vector) star set
3496 HFinite :: ('a::real_normed_vector) star set
3497 HInfinite :: ('a::real_normed_vector) star set
3498 approx :: ('a::real_normed_vector) star => 'a star => bool
3499 monad :: ('a::real_normed_vector) star => 'a star set
3500 galaxy :: ('a::real_normed_vector) star => 'a star set
3501 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3502 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3503 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3504 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3505 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3506 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3507 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3508 sgn :: 'a::real_normed_vector => 'a
3509 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3511 * Complex: Some complex-specific constants are now abbreviations for
3512 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3513 hnorm. Other constants have been entirely removed in favor of the
3514 polymorphic versions (INCOMPATIBILITY):
3518 HInfinite <-- CInfinite
3519 Infinitesimal <-- CInfinitesimal
3522 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3523 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3524 (ns)deriv <-- (ns)cderiv
3529 * Formalisation of ideals and the quotient construction over rings.
3531 * Order and lattice theory no longer based on records.
3534 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3535 greatest_closed. INCOMPATIBILITY.
3537 * Method algebra is now set up via an attribute. For examples see
3538 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3539 of algebraic structures.
3541 * Renamed theory CRing to Ring.
3546 * Substantial, yet incomplete support for nominal datatypes (binding
3547 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3548 src/HOL/Nominal/Examples. Prospective users should consult
3549 http://isabelle.in.tum.de/nominal/
3554 * ML basics: just one true type int, which coincides with IntInf.int
3557 * ML within Isar: antiquotations allow to embed statically-checked
3558 formal entities in the source, referring to the context available at
3559 compile-time. For example:
3561 ML {* @{sort "{zero,one}"} *}
3562 ML {* @{typ "'a => 'b"} *}
3563 ML {* @{term "%x. x"} *}
3564 ML {* @{prop "x == y"} *}
3565 ML {* @{ctyp "'a => 'b"} *}
3566 ML {* @{cterm "%x. x"} *}
3567 ML {* @{cprop "x == y"} *}
3568 ML {* @{thm asm_rl} *}
3569 ML {* @{thms asm_rl} *}
3570 ML {* @{type_name c} *}
3571 ML {* @{type_syntax c} *}
3572 ML {* @{const_name c} *}
3573 ML {* @{const_syntax c} *}
3576 ML {* @{theory Pure} *}
3577 ML {* @{theory_ref} *}
3578 ML {* @{theory_ref Pure} *}
3581 ML {* @{clasimpset} *}
3583 The same works for sources being ``used'' within an Isar context.
3585 * ML in Isar: improved error reporting; extra verbosity with
3586 ML_Context.trace enabled.
3588 * Pure/General/table.ML: the join operations now works via exceptions
3589 DUP/SAME instead of type option. This is simpler in simple cases, and
3590 admits slightly more efficient complex applications.
3592 * Pure: 'advanced' translation functions (parse_translation etc.) now
3593 use Context.generic instead of just theory.
3595 * Pure: datatype Context.generic joins theory/Proof.context and
3596 provides some facilities for code that works in either kind of
3597 context, notably GenericDataFun for uniform theory and proof data.
3599 * Pure: simplified internal attribute type, which is now always
3600 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3601 local (Proof.context) attributes have been discontinued, while
3602 minimizing code duplication. Thm.rule_attribute and
3603 Thm.declaration_attribute build canonical attributes; see also structure
3604 Context for further operations on Context.generic, notably
3605 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3606 declarations and definitions.
3608 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3609 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3610 init only required for impure data. INCOMPATIBILITY: empty really need
3611 to be empty (no dependencies on theory content!)
3613 * Pure/kernel: consts certification ignores sort constraints given in
3614 signature declarations. (This information is not relevant to the
3615 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3616 potential INCOMPATIBILITY.
3618 * Pure: axiomatic type classes are now purely definitional, with
3619 explicit proofs of class axioms and super class relations performed
3620 internally. See Pure/axclass.ML for the main internal interfaces --
3621 notably AxClass.define_class supercedes AxClass.add_axclass, and
3622 AxClass.axiomatize_class/classrel/arity supersede
3623 Sign.add_classes/classrel/arities.
3625 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3626 global/local versions on theory vs. Proof.context have been
3627 discontinued; Attrib.syntax and Method.syntax have been adapted
3628 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3629 attributes, methods, etc.
3631 * Pure: several functions of signature "... -> theory -> theory * ..."
3632 have been reoriented to "... -> theory -> ... * theory" in order to
3633 allow natural usage in combination with the ||>, ||>>, |-> and
3634 fold_map combinators.
3636 * Pure: official theorem names (closed derivations) and additional
3637 comments (tags) are now strictly separate. Name hints -- which are
3638 maintained as tags -- may be attached any time without affecting the
3641 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3642 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3643 achieve the old behaviour.
3645 * Pure: the "Goal" constant is now called "prop", supporting a
3646 slightly more general idea of ``protecting'' meta-level rule
3649 * Pure: Logic.(un)varify only works in a global context, which is now
3650 enforced instead of silently assumed. INCOMPATIBILITY, may use
3651 Logic.legacy_(un)varify as temporary workaround.
3653 * Pure: structure Name provides scalable operations for generating
3654 internal variable names, notably Name.variants etc. This replaces
3655 some popular functions from term.ML:
3657 Term.variant -> Name.variant
3658 Term.variantlist -> Name.variant_list
3659 Term.invent_names -> Name.invent_list
3661 Note that low-level renaming rarely occurs in new code -- operations
3662 from structure Variable are used instead (see below).
3664 * Pure: structure Variable provides fundamental operations for proper
3665 treatment of fixed/schematic variables in a context. For example,
3666 Variable.import introduces fixes for schematics of given facts and
3667 Variable.export reverses the effect (up to renaming) -- this replaces
3668 various freeze_thaw operations.
3670 * Pure: structure Goal provides simple interfaces for
3671 init/conclude/finish and tactical prove operations (replacing former
3672 Tactic.prove). Goal.prove is the canonical way to prove results
3673 within a given context; Goal.prove_global is a degraded version for
3674 theory level goals, including a global Drule.standard. Note that
3675 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3676 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3677 in a locale context).
3679 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3680 and type checking (Syntax.check_term etc.), with common combinations
3681 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3682 which are considered legacy and await removal.
3684 * Pure/Syntax: generic interfaces for type unchecking
3685 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3686 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3687 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3688 available for convenience, but refer to the very same operations using
3689 a mere theory instead of a full context.
3691 * Isar: simplified treatment of user-level errors, using exception
3692 ERROR of string uniformly. Function error now merely raises ERROR,
3693 without any side effect on output channels. The Isar toplevel takes
3694 care of proper display of ERROR exceptions. ML code may use plain
3695 handle/can/try; cat_error may be used to concatenate errors like this:
3697 ... handle ERROR msg => cat_error msg "..."
3699 Toplevel ML code (run directly or through the Isar toplevel) may be
3700 embedded into the Isar toplevel with exception display/debug like
3703 Isar.toplevel (fn () => ...)
3705 INCOMPATIBILITY, removed special transform_error facilities, removed
3706 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3707 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3708 -- use plain ERROR instead.
3710 * Isar: theory setup now has type (theory -> theory), instead of a
3711 list. INCOMPATIBILITY, may use #> to compose setup functions.
3713 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3714 ProofContext.debug/verbose flags.
3716 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3717 theory before entering a proof state. Transactions now always see a
3718 quasi-functional intermediate checkpoint, both in interactive and
3721 * Isar: simplified interfaces for outer syntax. Renamed
3722 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3723 OuterSyntax.add_parsers -- this functionality is now included in
3724 OuterSyntax.command etc. INCOMPATIBILITY.
3726 * Simplifier: the simpset of a running simplification process now
3727 contains a proof context (cf. Simplifier.the_context), which is the
3728 very context that the initial simpset has been retrieved from (by
3729 simpset_of/local_simpset_of). Consequently, all plug-in components
3730 (solver, looper etc.) may depend on arbitrary proof data.
3732 * Simplifier.inherit_context inherits the proof context (plus the
3733 local bounds) of the current simplification process; any simproc
3734 etc. that calls the Simplifier recursively should do this! Removed
3735 former Simplifier.inherit_bounds, which is already included here --
3736 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3737 specify an explicit context using Simplifier.context/theory_context.
3739 * Simplifier/Classical Reasoner: more abstract interfaces
3740 change_simpset/claset for modifying the simpset/claset reference of a
3741 theory; raw versions simpset/claset_ref etc. have been discontinued --
3744 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3750 * settings: the default heap location within ISABELLE_HOME_USER now
3751 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3752 Isabelle installations.
3754 * isabelle-process: option -S (secure mode) disables some critical
3755 operations, notably runtime compilation and evaluation of ML source
3758 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3760 * Support for parallel execution, using native multicore support of
3761 Poly/ML 5.1. The theory loader exploits parallelism when processing
3762 independent theories, according to the given theory header
3763 specifications. The maximum number of worker threads is specified via
3764 usedir option -M or the "max-threads" setting in Proof General. A
3765 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3766 to 6 on a 8-core machine. User-code needs to observe certain
3767 guidelines for thread-safe programming, see appendix A in the Isar
3768 Implementation manual.
3772 New in Isabelle2005 (October 2005)
3773 ----------------------------------
3777 * Theory headers: the new header syntax for Isar theories is
3780 imports <theory1> ... <theoryN>
3781 uses <file1> ... <fileM>
3784 where the 'uses' part is optional. The previous syntax
3786 theory <name> = <theory1> + ... + <theoryN>:
3788 will disappear in the next release. Use isatool fixheaders to convert
3789 existing theory files. Note that there is no change in ancient
3790 non-Isar theories now, but these will disappear soon.
3792 * Theory loader: parent theories can now also be referred to via
3793 relative and absolute paths.
3795 * Command 'find_theorems' searches for a list of criteria instead of a
3796 list of constants. Known criteria are: intro, elim, dest, name:string,
3797 simp:term, and any term. Criteria can be preceded by '-' to select
3798 theorems that do not match. Intro, elim, dest select theorems that
3799 match the current goal, name:s selects theorems whose fully qualified
3800 name contain s, and simp:term selects all simplification rules whose
3801 lhs match term. Any other term is interpreted as pattern and selects
3802 all theorems matching the pattern. Available in ProofGeneral under
3803 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3805 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3807 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3808 matching the current goal as introduction rule and not having "HOL."
3809 in their name (i.e. not being defined in theory HOL).
3811 * Command 'thms_containing' has been discontinued in favour of
3812 'find_theorems'; INCOMPATIBILITY.
3814 * Communication with Proof General is now 8bit clean, which means that
3815 Unicode text in UTF-8 encoding may be used within theory texts (both
3816 formal and informal parts). Cf. option -U of the Isabelle Proof
3817 General interface. Here are some simple examples (cf. src/HOL/ex):
3819 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3820 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3822 * Improved efficiency of the Simplifier and, to a lesser degree, the
3823 Classical Reasoner. Typical big applications run around 2 times
3827 *** Document preparation ***
3829 * Commands 'display_drafts' and 'print_drafts' perform simple output
3830 of raw sources. Only those symbols that do not require additional
3831 LaTeX packages (depending on comments in isabellesym.sty) are
3832 displayed properly, everything else is left verbatim. isatool display
3833 and isatool print are used as front ends (these are subject to the
3834 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3836 * Command tags control specific markup of certain regions of text,
3837 notably folding and hiding. Predefined tags include "theory" (for
3838 theory begin and end), "proof" for proof commands, and "ML" for
3839 commands involving ML code; the additional tags "visible" and
3840 "invisible" are unused by default. Users may give explicit tag
3841 specifications in the text, e.g. ''by %invisible (auto)''. The
3842 interpretation of tags is determined by the LaTeX job during document
3843 preparation: see option -V of isatool usedir, or options -n and -t of
3844 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3847 Several document versions may be produced at the same time via isatool
3848 usedir (the generated index.html will link all of them). Typical
3849 specifications include ''-V document=theory,proof,ML'' to present
3850 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3851 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3852 these parts without any formal replacement text. The Isabelle site
3853 default settings produce ''document'' and ''outline'' versions as
3856 * Several new antiquotations:
3858 @{term_type term} prints a term with its type annotated;
3860 @{typeof term} prints the type of a term;
3862 @{const const} is the same as @{term const}, but checks that the
3863 argument is a known logical constant;
3865 @{term_style style term} and @{thm_style style thm} print a term or
3866 theorem applying a "style" to it
3870 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3871 definitions, equations, inequations etc., 'concl' printing only the
3872 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3873 to print the specified premise. TermStyle.add_style provides an ML
3874 interface for introducing further styles. See also the "LaTeX Sugar"
3875 document practical applications. The ML antiquotation prints
3876 type-checked ML expressions verbatim.
3878 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3879 and 'text' support optional locale specification '(in loc)', which
3880 specifies the default context for interpreting antiquotations. For
3881 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3883 * Option 'locale=NAME' of antiquotations specifies an alternative
3884 context interpreting the subsequent argument. For example: @{thm
3885 [locale=lattice] inf_assoc}.
3887 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3890 * Proper output of antiquotations for theory commands involving a
3891 proof context (such as 'locale' or 'theorem (in loc) ...').
3893 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3894 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3896 * isatool usedir: new option -C (default true) controls whether option
3897 -D should include a copy of the original document directory; -C false
3898 prevents unwanted effects such as copying of administrative CVS data.
3903 * Considerably improved version of 'constdefs' command. Now performs
3904 automatic type-inference of declared constants; additional support for
3905 local structure declarations (cf. locales and HOL records), see also
3906 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3907 sequential dependencies of definitions within a single 'constdefs'
3908 section; moreover, the declared name needs to be an identifier. If
3909 all fails, consider to fall back on 'consts' and 'defs' separately.
3911 * Improved indexed syntax and implicit structures. First of all,
3912 indexed syntax provides a notational device for subscripted
3913 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3914 expressions. Secondly, in a local context with structure
3915 declarations, number indexes \<^sub>n or the empty index (default
3916 number 1) refer to a certain fixed variable implicitly; option
3917 show_structs controls printing of implicit structures. Typical
3918 applications of these concepts involve record types and locales.
3920 * New command 'no_syntax' removes grammar declarations (and
3921 translations) resulting from the given syntax specification, which is
3922 interpreted in the same manner as for the 'syntax' command.
3924 * 'Advanced' translation functions (parse_translation etc.) may depend
3925 on the signature of the theory context being presently used for
3926 parsing/printing, see also isar-ref manual.
3928 * Improved 'oracle' command provides a type-safe interface to turn an
3929 ML expression of type theory -> T -> term into a primitive rule of
3930 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3931 is already included here); see also FOL/ex/IffExample.thy;
3934 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3935 before); "cI" is no longer bound, use "c.intro" instead.
3936 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3937 axclasses vs. locales.
3939 * Improved internal renaming of symbolic identifiers -- attach primes
3940 instead of base 26 numbers.
3942 * New flag show_question_marks controls printing of leading question
3943 marks in schematic variable names.
3945 * In schematic variable names, *any* symbol following \<^isub> or
3946 \<^isup> is now treated as part of the base name. For example, the
3947 following works without printing of awkward ".0" indexes:
3949 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3952 * Inner syntax includes (*(*nested*) comments*).
3954 * Pretty printer now supports unbreakable blocks, specified in mixfix
3955 annotations as "(00...)".
3957 * Clear separation of logical types and nonterminals, where the latter
3958 may only occur in 'syntax' specifications or type abbreviations.
3959 Before that distinction was only partially implemented via type class
3960 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3961 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3962 exotic syntax specifications may require further adaption
3963 (e.g. Cube/Cube.thy).
3965 * Removed obsolete type class "logic", use the top sort {} instead.
3966 Note that non-logical types should be declared as 'nonterminals'
3967 rather than 'types'. INCOMPATIBILITY for new object-logic
3970 * Attributes 'induct' and 'cases': type or set names may now be
3971 locally fixed variables as well.
3973 * Simplifier: can now control the depth to which conditional rewriting
3974 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3977 * Simplifier: simplification procedures may now take the current
3978 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3979 interface), which is very useful for calling the Simplifier
3980 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3981 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3982 low-level mk_simproc no longer applies Logic.varify internally, to
3983 allow for use in a context of fixed variables.
3985 * thin_tac now works even if the assumption being deleted contains !!
3986 or ==>. More generally, erule now works even if the major premise of
3987 the elimination rule contains !! or ==>.
3989 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3991 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3992 from Pure, which contains all common declarations already. Both
3993 theories are defined via plain Isabelle/Isar .thy files.
3994 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3995 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3996 use isatool fixcpure to adapt your theory and ML sources.
3998 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3999 selections of theorems in named facts via index ranges.
4001 * 'print_theorems': in theory mode, really print the difference
4002 wrt. the last state (works for interactive theory development only),
4003 in proof mode print all local facts (cf. 'print_facts');
4005 * 'hide': option '(open)' hides only base names.
4007 * More efficient treatment of intermediate checkpoints in interactive
4010 * Code generator is now invoked via code_module (incremental code
4011 generation) and code_library (modular code generation, ML structures
4012 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
4013 must be quoted when used as identifiers.
4015 * New 'value' command for reading, evaluating and printing terms using
4016 the code generator. INCOMPATIBILITY: command keyword 'value' must be
4017 quoted when used as identifier.
4022 * New commands for the interpretation of locale expressions in
4023 theories (1), locales (2) and proof contexts (3). These generate
4024 proof obligations from the expression specification. After the
4025 obligations have been discharged, theorems of the expression are added
4026 to the theory, target locale or proof context. The synopsis of the
4027 commands is a follows:
4029 (1) interpretation expr inst
4030 (2) interpretation target < expr
4031 (3) interpret expr inst
4033 Interpretation in theories and proof contexts require a parameter
4034 instantiation of terms from the current context. This is applied to
4035 specifications and theorems of the interpreted expression.
4036 Interpretation in locales only permits parameter renaming through the
4037 locale expression. Interpretation is smart in that interpretations
4038 that are active already do not occur in proof obligations, neither are
4039 instantiated theorems stored in duplicate. Use 'print_interps' to
4040 inspect active interpretations of a particular locale. For details,
4041 see the Isar Reference manual. Examples can be found in
4042 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4044 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4045 'interpret' instead.
4047 * New context element 'constrains' for adding type constraints to
4050 * Context expressions: renaming of parameters with syntax
4053 * Locale declaration: 'includes' disallowed.
4055 * Proper static binding of attribute syntax -- i.e. types / terms /
4056 facts mentioned as arguments are always those of the locale definition
4057 context, independently of the context of later invocations. Moreover,
4058 locale operations (renaming and type / term instantiation) are applied
4059 to attribute arguments as expected.
4061 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4062 actual attributes; rare situations may require Attrib.attribute to
4063 embed those attributes into Attrib.src that lack concrete syntax.
4064 Attribute implementations need to cooperate properly with the static
4065 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4066 Attrib.XXX_thm etc. already do the right thing without further
4067 intervention. Only unusual applications -- such as "where" or "of"
4068 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4069 on the context and the facts involved -- may have to assign parsed
4070 values to argument tokens explicitly.
4072 * Changed parameter management in theorem generation for long goal
4073 statements with 'includes'. INCOMPATIBILITY: produces a different
4074 theorem statement in rare situations.
4076 * Locale inspection command 'print_locale' omits notes elements. Use
4077 'print_locale!' to have them included in the output.
4082 * Provers/hypsubst.ML: improved version of the subst method, for
4083 single-step rewriting: it now works in bound variable contexts. New is
4084 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4085 rewrite a different subterm than the original subst method, which is
4086 still available as 'simplesubst'.
4088 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4091 * Provers/trancl.ML: new transitivity reasoner for transitive and
4092 reflexive-transitive closure of relations.
4094 * Provers/blast.ML: new reference depth_limit to make blast's depth
4095 limit (previously hard-coded with a value of 20) user-definable.
4097 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4098 is peformed already. Object-logics merely need to finish their
4099 initial simpset configuration as before. INCOMPATIBILITY.
4104 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4107 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4109 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4110 and x-symbol; use option '-m epsilon' to get it actually printed.
4111 Moreover, the mathematically important symbolic identifier \<epsilon>
4112 becomes available as variable, constant etc. INCOMPATIBILITY,
4114 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4115 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4116 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4117 support corresponding Isar calculations.
4119 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4122 * theory SetInterval: changed the syntax for open intervals:
4131 The old syntax is still supported but will disappear in the next
4132 release. For conversion use the following Emacs search and replace
4133 patterns (these are not perfect but work quite well):
4135 {)\([^\.]*\)\.\. -> {\1<\.\.}
4136 \.\.\([^(}]*\)(} -> \.\.<\1}
4138 * Theory Commutative_Ring (in Library): method comm_ring for proving
4139 equalities in commutative rings; method 'algebra' provides a generic
4142 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4143 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4144 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4147 Some new syntax forms are available:
4149 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4150 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4151 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4152 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4154 The latter form "\<Sum>x < k. e" used to be based on a separate
4155 function "Summation", which has been discontinued.
4157 * theory Finite_Set: in structured induction proofs, the insert case
4158 is now 'case (insert x F)' instead of the old counterintuitive 'case
4161 * The 'refute' command has been extended to support a much larger
4162 fragment of HOL, including axiomatic type classes, constdefs and
4163 typedefs, inductive datatypes and recursion.
4165 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4166 Requires zChaff with proof generation to be installed. See
4167 HOL/ex/SAT_Examples.thy for examples.
4169 * Datatype induction via method 'induct' now preserves the name of the
4170 induction variable. For example, when proving P(xs::'a list) by
4171 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4172 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4173 in unstructured proof scripts.
4175 * Reworked implementation of records. Improved scalability for
4176 records with many fields, avoiding performance problems for type
4177 inference. Records are no longer composed of nested field types, but
4178 of nested extension types. Therefore the record type only grows linear
4179 in the number of extensions and not in the number of fields. The
4180 top-level (users) view on records is preserved. Potential
4181 INCOMPATIBILITY only in strange cases, where the theory depends on the
4182 old record representation. The type generated for a record is called
4183 <record_name>_ext_type.
4185 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4186 proofs triggered by a record definition or a simproc (if
4187 quick_and_dirty is enabled). Definitions of large records can take
4190 New simproc record_upd_simproc for simplification of multiple record
4191 updates enabled by default. Moreover, trivial updates are also
4192 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4193 occasionally, since simplification is more powerful by default.
4195 * typedef: proper support for polymorphic sets, which contain extra
4196 type-variables in the term.
4198 * Simplifier: automatically reasons about transitivity chains
4199 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4200 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4201 old proofs break occasionally as simplification may now solve more
4202 goals than previously.
4204 * Simplifier: converts x <= y into x = y if assumption y <= x is
4205 present. Works for all partial orders (class "order"), in particular
4206 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4209 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4210 bound variable or a constant then the let is unfolded. Otherwise
4211 first a is simplified to b, and then f b is simplified to g. If
4212 possible we abstract b from g arriving at "let x = b in h x",
4213 otherwise we unfold the let and arrive at g. The simproc can be
4214 enabled/disabled by the reference use_let_simproc. Potential
4215 INCOMPATIBILITY since simplification is more powerful by default.
4217 * Classical reasoning: the meson method now accepts theorems as arguments.
4219 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4220 jobs to provide advice on the provability of subgoals.
4222 * Theory OrderedGroup and Ring_and_Field: various additions and
4223 improvements to faciliate calculations involving equalities and
4226 The following theorems have been eliminated or modified
4229 abs_eq now named abs_of_nonneg
4230 abs_of_ge_0 now named abs_of_nonneg
4231 abs_minus_eq now named abs_of_nonpos
4232 imp_abs_id now named abs_of_nonneg
4233 imp_abs_neg_id now named abs_of_nonpos
4234 mult_pos now named mult_pos_pos
4235 mult_pos_le now named mult_nonneg_nonneg
4236 mult_pos_neg_le now named mult_nonneg_nonpos
4237 mult_pos_neg2_le now named mult_nonneg_nonpos2
4238 mult_neg now named mult_neg_neg
4239 mult_neg_le now named mult_nonpos_nonpos
4241 * The following lemmas in Ring_and_Field have been added to the simplifier:
4244 not_square_less_zero
4246 The following lemmas have been deleted from Real/RealPow:
4256 * Theory Parity: added rules for simplifying exponents.
4260 The following theorems have been eliminated or modified
4263 list_all_Nil now named list_all.simps(1)
4264 list_all_Cons now named list_all.simps(2)
4265 list_all_conv now named list_all_iff
4266 set_mem_eq now named mem_iff
4268 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4269 asymptotic "big O" calculations. See the notes in BigO.thy.
4274 * Theory RealDef: better support for embedding natural numbers and
4275 integers in the reals.
4277 The following theorems have been eliminated or modified
4280 exp_ge_add_one_self now requires no hypotheses
4281 real_of_int_add reversed direction of equality (use [symmetric])
4282 real_of_int_minus reversed direction of equality (use [symmetric])
4283 real_of_int_diff reversed direction of equality (use [symmetric])
4284 real_of_int_mult reversed direction of equality (use [symmetric])
4286 * Theory RComplete: expanded support for floor and ceiling functions.
4288 * Theory Ln is new, with properties of the natural logarithm
4290 * Hyperreal: There is a new type constructor "star" for making
4291 nonstandard types. The old type names are now type synonyms:
4295 hcomplex = complex star
4297 * Hyperreal: Many groups of similarly-defined constants have been
4298 replaced by polymorphic versions (INCOMPATIBILITY):
4300 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4302 starset <-- starsetNat, starsetC
4303 *s* <-- *sNat*, *sc*
4304 starset_n <-- starsetNat_n, starsetC_n
4305 *sn* <-- *sNatn*, *scn*
4306 InternalSets <-- InternalNatSets, InternalCSets
4308 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4309 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4310 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4311 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4312 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4314 * Hyperreal: Many type-specific theorems have been removed in favor of
4315 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4317 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4318 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4319 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4320 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4321 right_minus <-- hypreal_add_minus
4322 left_minus <-- {hypreal,hcomplex}_add_minus_left
4323 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4324 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4325 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4326 mult_1_right <-- hcomplex_mult_one_right
4327 mult_zero_left <-- hcomplex_mult_zero_left
4328 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4329 right_distrib <-- hypnat_add_mult_distrib2
4330 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4331 right_inverse <-- hypreal_mult_inverse
4332 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4333 order_refl <-- {hypreal,hypnat}_le_refl
4334 order_trans <-- {hypreal,hypnat}_le_trans
4335 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4336 order_less_le <-- {hypreal,hypnat}_less_le
4337 linorder_linear <-- {hypreal,hypnat}_le_linear
4338 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4339 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4340 add_nonneg_nonneg <-- hypreal_le_add_order
4342 * Hyperreal: Separate theorems having to do with type-specific
4343 versions of constants have been merged into theorems that apply to the
4344 new polymorphic constants (INCOMPATIBILITY):
4346 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4347 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4348 STAR_Un <-- {STAR,NatStar,STARC}_Un
4349 STAR_Int <-- {STAR,NatStar,STARC}_Int
4350 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4351 STAR_subset <-- {STAR,NatStar,STARC}_subset
4352 STAR_mem <-- {STAR,NatStar,STARC}_mem
4353 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4354 STAR_diff <-- {STAR,STARC}_diff
4355 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4356 STARC_hcomplex_of_complex}_image_subset
4357 starset_n_Un <-- starset{Nat,C}_n_Un
4358 starset_n_Int <-- starset{Nat,C}_n_Int
4359 starset_n_Compl <-- starset{Nat,C}_n_Compl
4360 starset_n_diff <-- starset{Nat,C}_n_diff
4361 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4362 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4363 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4364 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4365 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4366 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4367 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4368 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4369 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4370 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4371 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4372 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4373 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4374 starfun_diff <-- starfun{C,RC,CR}_diff
4375 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4376 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4377 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4378 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4379 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4380 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4381 starfun_Id <-- starfunC_Id
4382 starfun_approx <-- starfun{Nat,CR}_approx
4383 starfun_capprox <-- starfun{C,RC}_capprox
4384 starfun_abs <-- starfunNat_rabs
4385 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4386 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4387 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4388 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4389 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4390 starfun_add_approx <-- starfunCR_add_approx
4391 starfun_inverse_inverse <-- starfunC_inverse_inverse
4392 starfun_divide <-- starfun{C,CR,RC}_divide
4393 starfun_n <-- starfun{Nat,C}_n
4394 starfun_n_mult <-- starfun{Nat,C}_n_mult
4395 starfun_n_add <-- starfun{Nat,C}_n_add
4396 starfun_n_add_minus <-- starfunNat_n_add_minus
4397 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4398 starfun_n_minus <-- starfun{Nat,C}_n_minus
4399 starfun_n_eq <-- starfun{Nat,C}_n_eq
4401 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4402 star_n_minus <-- {hypreal,hcomplex}_minus
4403 star_n_diff <-- {hypreal,hcomplex}_diff
4404 star_n_mult <-- {hypreal,hcomplex}_mult
4405 star_n_inverse <-- {hypreal,hcomplex}_inverse
4406 star_n_le <-- {hypreal,hypnat}_le
4407 star_n_less <-- {hypreal,hypnat}_less
4408 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4409 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4410 star_n_abs <-- hypreal_hrabs
4411 star_n_divide <-- hcomplex_divide
4413 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4414 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4415 star_of_diff <-- hypreal_of_real_diff
4416 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4417 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4418 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4419 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4420 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4421 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4422 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4423 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4424 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4425 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4426 star_of_number_of <-- {hypreal,hcomplex}_number_of
4427 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4428 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4429 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4430 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4431 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4432 star_of_power <-- hypreal_of_real_power
4433 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4435 * Hyperreal: new method "transfer" that implements the transfer
4436 principle of nonstandard analysis. With a subgoal that mentions
4437 nonstandard types like "'a star", the command "apply transfer"
4438 replaces it with an equivalent one that mentions only standard types.
4439 To be successful, all free variables must have standard types; non-
4440 standard variables must have explicit universal quantifiers.
4442 * Hyperreal: A theory of Taylor series.
4447 * Discontinued special version of 'constdefs' (which used to support
4448 continuous functions) in favor of the general Pure one with full
4451 * New simplification procedure for solving continuity conditions; it
4452 is much faster on terms with many nested lambda abstractions (cubic
4453 instead of exponential time).
4455 * New syntax for domain package: selector names are now optional.
4456 Parentheses should be omitted unless argument is lazy, for example:
4458 domain 'a stream = cons "'a" (lazy "'a stream")
4460 * New command 'fixrec' for defining recursive functions with pattern
4461 matching; defining multiple functions with mutual recursion is also
4462 supported. Patterns may include the constants cpair, spair, up, sinl,
4463 sinr, or any data constructor defined by the domain package. The given
4464 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4465 syntax and examples.
4467 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4468 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4469 but the proof obligation additionally includes an admissibility
4470 requirement. The packages generate instances of class cpo or pcpo,
4471 with continuity and strictness theorems for Rep and Abs.
4473 * HOLCF: Many theorems have been renamed according to a more standard naming
4474 scheme (INCOMPATIBILITY):
4476 foo_inject: "foo$x = foo$y ==> x = y"
4477 foo_eq: "(foo$x = foo$y) = (x = y)"
4478 foo_less: "(foo$x << foo$y) = (x << y)"
4479 foo_strict: "foo$UU = UU"
4480 foo_defined: "... ==> foo$x ~= UU"
4481 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4486 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4487 including the First Isomorphism Theorem (on quotienting by the kernel
4490 * ZF/Simplifier: install second copy of type solver that actually
4491 makes use of TC rules declared to Isar proof contexts (or locales);
4492 the old version is still required for ML proof scripts.
4497 * Converted to Isar theory format; use locales instead of axiomatic
4503 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4506 * Pure/library.ML no longer defines its own option datatype, but uses
4507 that of the SML basis, which has constructors NONE and SOME instead of
4508 None and Some, as well as exception Option.Option instead of OPTION.
4509 The functions the, if_none, is_some, is_none have been adapted
4510 accordingly, while Option.map replaces apsome.
4512 * Pure/library.ML: the exception LIST has been given up in favour of
4513 the standard exceptions Empty and Subscript, as well as
4514 Library.UnequalLengths. Function like Library.hd and Library.tl are
4515 superceded by the standard hd and tl functions etc.
4517 A number of basic list functions are no longer exported to the ML
4518 toplevel, as they are variants of predefined functions. The following
4519 suggests how one can translate existing code:
4521 rev_append xs ys = List.revAppend (xs, ys)
4522 nth_elem (i, xs) = List.nth (xs, i)
4523 last_elem xs = List.last xs
4524 flat xss = List.concat xss
4525 seq fs = List.app fs
4526 partition P xs = List.partition P xs
4527 mapfilter f xs = List.mapPartial f xs
4529 * Pure/library.ML: several combinators for linear functional
4530 transformations, notably reverse application and composition:
4533 (x, y) |-> f f #-> g
4535 * Pure/library.ML: introduced/changed precedence of infix operators:
4537 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4539 infix 3 o oo ooo oooo;
4540 infix 4 ~~ upto downto;
4542 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4545 * Pure/library.ML: natural list combinators fold, fold_rev, and
4546 fold_map support linear functional transformations and nesting. For
4549 fold f [x1, ..., xN] y =
4550 y |> f x1 |> ... |> f xN
4552 (fold o fold) f [xs1, ..., xsN] y =
4553 y |> fold f xs1 |> ... |> fold f xsN
4555 fold f [x1, ..., xN] =
4558 (fold o fold) f [xs1, ..., xsN] =
4559 fold f xs1 #> ... #> fold f xsN
4561 * Pure/library.ML: the following selectors on type 'a option are
4564 the: 'a option -> 'a (*partial*)
4565 these: 'a option -> 'a where 'a = 'b list
4566 the_default: 'a -> 'a option -> 'a
4567 the_list: 'a option -> 'a list
4569 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4570 basic operations for association lists, following natural argument
4571 order; moreover the explicit equality predicate passed here avoids
4572 potentially expensive polymorphic runtime equality checks.
4573 The old functions may be expressed as follows:
4575 assoc = uncurry (AList.lookup (op =))
4576 assocs = these oo AList.lookup (op =)
4577 overwrite = uncurry (AList.update (op =)) o swap
4579 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4581 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4582 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4584 replacing make_keylist and keyfilter (occassionally used)
4587 make_keylist = AList.make
4588 keyfilter = AList.find (op =)
4590 * eq_fst and eq_snd now take explicit equality parameter, thus
4591 avoiding eqtypes. Naive rewrites:
4593 eq_fst = eq_fst (op =)
4594 eq_snd = eq_snd (op =)
4596 * Removed deprecated apl and apr (rarely used).
4599 apl (n, op) =>>= curry op n
4600 apr (op, m) =>>= fn n => op (n, m)
4602 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4603 provides a reasonably efficient light-weight implementation of sets as
4606 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4607 few new operations; existing lookup and update are now curried to
4608 follow natural argument order (for use with fold etc.);
4609 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4611 * Pure/General: output via the Isabelle channels of
4612 writeln/warning/error etc. is now passed through Output.output, with a
4613 hook for arbitrary transformations depending on the print_mode
4614 (cf. Output.add_mode -- the first active mode that provides a output
4615 function wins). Already formatted output may be embedded into further
4616 text via Output.raw; the result of Pretty.string_of/str_of and derived
4617 functions (string_of_term/cterm/thm etc.) is already marked raw to
4618 accommodate easy composition of diagnostic messages etc. Programmers
4619 rarely need to care about Output.output or Output.raw at all, with
4620 some notable exceptions: Output.output is required when bypassing the
4621 standard channels (writeln etc.), or in token translations to produce
4622 properly formatted results; Output.raw is required when capturing
4623 already output material that will eventually be presented to the user
4624 a second time. For the default print mode, both Output.output and
4625 Output.raw have no effect.
4627 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4628 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4629 cumulative results are displayed at the end of a batch session.
4631 * Pure/General: File.sysify_path and File.quote_sysify path have been
4632 replaced by File.platform_path and File.shell_path (with appropriate
4633 hooks). This provides a clean interface for unusual systems where the
4634 internal and external process view of file names are different.
4636 * Pure: more efficient orders for basic syntactic entities: added
4637 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4638 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4639 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4640 orders now -- potential INCOMPATIBILITY for code that depends on a
4641 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4642 Library.sort_strings on result).
4644 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4645 fold_types traverse types/terms from left to right, observing natural
4646 argument order. Supercedes previous foldl_XXX versions, add_frees,
4647 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4649 * Pure: name spaces have been refined, with significant changes of the
4650 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4651 to extern(_table). The plain name entry path is superceded by a
4652 general 'naming' context, which also includes the 'policy' to produce
4653 a fully qualified name and external accesses of a fully qualified
4654 name; NameSpace.extend is superceded by context dependent
4655 Sign.declare_name. Several theory and proof context operations modify
4656 the naming context. Especially note Theory.restore_naming and
4657 ProofContext.restore_naming to get back to a sane state; note that
4658 Theory.add_path is no longer sufficient to recover from
4659 Theory.absolute_path in particular.
4661 * Pure: new flags short_names (default false) and unique_names
4662 (default true) for controlling output of qualified names. If
4663 short_names is set, names are printed unqualified. If unique_names is
4664 reset, the name prefix is reduced to the minimum required to achieve
4665 the original result when interning again, even if there is an overlap
4666 with earlier declarations.
4668 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4669 now 'extend', and 'merge' gets an additional Pretty.pp argument
4670 (useful for printing error messages). INCOMPATIBILITY.
4672 * Pure: major reorganization of the theory context. Type Sign.sg and
4673 Theory.theory are now identified, referring to the universal
4674 Context.theory (see Pure/context.ML). Actual signature and theory
4675 content is managed as theory data. The old code and interfaces were
4676 spread over many files and structures; the new arrangement introduces
4677 considerable INCOMPATIBILITY to gain more clarity:
4679 Context -- theory management operations (name, identity, inclusion,
4680 parents, ancestors, merge, etc.), plus generic theory data;
4682 Sign -- logical signature and syntax operations (declaring consts,
4683 types, etc.), plus certify/read for common entities;
4685 Theory -- logical theory operations (stating axioms, definitions,
4686 oracles), plus a copy of logical signature operations (consts,
4687 types, etc.); also a few basic management operations (Theory.copy,
4690 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4691 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4692 for convenience -- they merely return the theory.
4694 * Pure: type Type.tsig is superceded by theory in most interfaces.
4696 * Pure: the Isar proof context type is already defined early in Pure
4697 as Context.proof (note that ProofContext.context and Proof.context are
4698 aliases, where the latter is the preferred name). This enables other
4699 Isabelle components to refer to that type even before Isar is present.
4701 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4702 typeK, constK, axiomK, oracleK), but provide explicit operations for
4703 any of these kinds. For example, Sign.intern typeK is now
4704 Sign.intern_type, Theory.hide_space Sign.typeK is now
4705 Theory.hide_types. Also note that former
4706 Theory.hide_classes/types/consts are now
4707 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4708 internalize their arguments! INCOMPATIBILITY.
4710 * Pure: get_thm interface (of PureThy and ProofContext) expects
4711 datatype thmref (with constructors Name and NameSelection) instead of
4712 plain string -- INCOMPATIBILITY;
4714 * Pure: cases produced by proof methods specify options, where NONE
4715 means to remove case bindings -- INCOMPATIBILITY in
4718 * Pure: the following operations retrieve axioms or theorems from a
4719 theory node or theory hierarchy, respectively:
4721 Theory.axioms_of: theory -> (string * term) list
4722 Theory.all_axioms_of: theory -> (string * term) list
4723 PureThy.thms_of: theory -> (string * thm) list
4724 PureThy.all_thms_of: theory -> (string * thm) list
4726 * Pure: print_tac now outputs the goal through the trace channel.
4728 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4729 Reference Toplevel.debug (default false) controls detailed printing
4730 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4731 controls execution profiling -- set to 1 for time and 2 for space
4732 (both increase the runtime).
4734 * Isar session: The initial use of ROOT.ML is now always timed,
4735 i.e. the log will show the actual process times, in contrast to the
4736 elapsed wall-clock time that the outer shell wrapper produces.
4738 * Simplifier: improved handling of bound variables (nameless
4739 representation, avoid allocating new strings). Simprocs that invoke
4740 the Simplifier recursively should use Simplifier.inherit_bounds to
4741 avoid local name clashes. Failure to do so produces warnings
4742 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4743 for further details.
4745 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4746 bindings for all theorems stored within a given theory; this may help
4747 in porting non-Isar theories to Isar ones, while keeping ML proof
4748 scripts for the time being.
4750 * ML operator HTML.with_charset specifies the charset begin used for
4751 generated HTML files. For example:
4753 HTML.with_charset "utf-8" use_thy "Hebrew";
4754 HTML.with_charset "utf-8" use_thy "Chinese";
4759 * Allow symlinks to all proper Isabelle executables (Isabelle,
4760 isabelle, isatool etc.).
4762 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4763 isatool doc, isatool mkdir, display_drafts etc.).
4765 * isatool usedir: option -f allows specification of the ML file to be
4766 used by Isabelle; default is ROOT.ML.
4768 * New isatool version outputs the version identifier of the Isabelle
4769 distribution being used.
4771 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4772 (containing Boolean satisfiability problems) into Isabelle/HOL
4777 New in Isabelle2004 (April 2004)
4778 --------------------------------
4782 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4783 Replaces linorder.ML.
4785 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4786 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4787 (\<a>...\<z>), are now considered normal letters, and can therefore
4788 be used anywhere where an ASCII letter (a...zA...Z) has until
4789 now. COMPATIBILITY: This obviously changes the parsing of some
4790 terms, especially where a symbol has been used as a binder, say
4791 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4792 as an identifier. Fix it by inserting a space around former
4793 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4794 existing theory and ML files.
4796 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4798 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4799 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4800 a normal (but invisible) letter. For multiple letter subscripts repeat
4801 \<^isub> like this: x\<^isub>1\<^isub>2.
4803 * Pure: There are now sub-/superscripts that can span more than one
4804 character. Text between \<^bsub> and \<^esub> is set in subscript in
4805 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4806 superscript. The new control characters are not identifier parts.
4808 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4809 content of "..." to the latex file instead of \isacntrl... . The "..."
4810 may consist of any printable characters excluding the end bracket >.
4812 * Pure: Using new Isar command "finalconsts" (or the ML functions
4813 Theory.add_finals or Theory.add_finals_i) it is now possible to
4814 declare constants "final", which prevents their being given a definition
4815 later. It is useful for constants whose behaviour is fixed axiomatically
4816 rather than definitionally, such as the meta-logic connectives.
4818 * Pure: 'instance' now handles general arities with general sorts
4819 (i.e. intersections of classes),
4821 * Presentation: generated HTML now uses a CSS style sheet to make layout
4822 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4823 It can be changed to alter the colors/layout of generated pages.
4828 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4829 cut_tac, subgoal_tac and thin_tac:
4830 - Now understand static (Isar) contexts. As a consequence, users of Isar
4831 locales are no longer forced to write Isar proof scripts.
4832 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4834 - INCOMPATIBILITY: names of variables to be instantiated may no
4835 longer be enclosed in quotes. Instead, precede variable name with `?'.
4836 This is consistent with the instantiation attribute "where".
4838 * Attributes "where" and "of":
4839 - Now take type variables of instantiated theorem into account when reading
4840 the instantiation string. This fixes a bug that caused instantiated
4841 theorems to have too special types in some circumstances.
4842 - "where" permits explicit instantiations of type variables.
4844 * Calculation commands "moreover" and "also" no longer interfere with
4845 current facts ("this"), admitting arbitrary combinations with "then"
4849 - Goal statements involving the context element "includes" no longer
4850 generate theorems with internal delta predicates (those ending on
4851 "_axioms") in the premise.
4852 Resolve particular premise with <locale>.intro to obtain old form.
4853 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4854 specification and "includes" elements in goal statement.
4855 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4856 [intro?] and [elim?] (respectively) by default.
4857 - Experimental command for instantiation of locales in proof contexts:
4858 instantiate <label>[<attrs>]: <loc>
4859 Instantiates locale <loc> and adds all its theorems to the current context
4860 taking into account their attributes. Label and attrs are optional
4861 modifiers, like in theorem declarations. If present, names of
4862 instantiated theorems are qualified with <label>, and the attributes
4863 <attrs> are applied after any attributes these theorems might have already.
4864 If the locale has assumptions, a chained fact of the form
4865 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4866 are derived. The command does not support old-style locales declared
4867 with "locale (open)".
4868 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4870 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4876 * Proof import: new image HOL4 contains the imported library from
4877 the HOL4 system with about 2500 theorems. It is imported by
4878 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4879 can be used like any other Isabelle image. See
4880 HOL/Import/HOL/README for more information.
4883 - Much improved handling of linear and partial orders.
4884 Reasoners for linear and partial orders are set up for type classes
4885 "linorder" and "order" respectively, and are added to the default simpset
4886 as solvers. This means that the simplifier can build transitivity chains
4887 to solve goals from the assumptions.
4888 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4889 of blast or auto after simplification become unnecessary because the goal
4890 is solved by simplification already.
4892 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4893 all proved in axiomatic type classes for semirings, rings and fields.
4896 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4897 now formalized using the Ring_and_Field theory mentioned above.
4898 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4899 than before, because now they are set up once in a generic manner.
4900 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4901 Look for the general versions in Ring_and_Field (and Power if they concern
4904 * Type "rat" of the rational numbers is now available in HOL-Complex.
4907 - Record types are now by default printed with their type abbreviation
4908 instead of the list of all field types. This can be configured via
4909 the reference "print_record_type_abbr".
4910 - Simproc "record_upd_simproc" for simplification of multiple updates added
4911 (not enabled by default).
4912 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4913 EX x. x = sel r to True (not enabled by default).
4914 - Tactic "record_split_simp_tac" to split and simplify records added.
4916 * 'specification' command added, allowing for definition by
4917 specification. There is also an 'ax_specification' command that
4918 introduces the new constants axiomatically.
4920 * arith(_tac) is now able to generate counterexamples for reals as well.
4922 * HOL-Algebra: new locale "ring" for non-commutative rings.
4924 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4925 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4927 * HOL-Matrix: a first theory for matrices in HOL with an application of
4928 matrix theory to linear programming.
4930 * Unions and Intersections:
4931 The latex output syntax of UN and INT has been changed
4932 from "\Union x \in A. B" to "\Union_{x \in A} B"
4933 i.e. the index formulae has become a subscript.
4934 Similarly for "\Union x. B", and for \Inter instead of \Union.
4936 * Unions and Intersections over Intervals:
4937 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4938 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4939 like in normal math, and corresponding versions for < and for intersection.
4941 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4942 lexicographic dictonary ordering has been added as "lexord".
4944 * ML: the legacy theory structures Int and List have been removed. They had
4945 conflicted with ML Basis Library structures having the same names.
4947 * 'refute' command added to search for (finite) countermodels. Only works
4948 for a fragment of HOL. The installation of an external SAT solver is
4949 highly recommended. See "HOL/Refute.thy" for details.
4951 * 'quickcheck' command: Allows to find counterexamples by evaluating
4952 formulae under an assignment of free variables to random values.
4953 In contrast to 'refute', it can deal with inductive datatypes,
4954 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4960 * Streams now come with concatenation and are part of the HOLCF image
4964 New in Isabelle2003 (May 2003)
4965 ------------------------------
4969 * Provers/simplifier:
4971 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4972 Assumptions are now subject to complete mutual simplification,
4973 not just from left to right. The simplifier now preserves
4974 the order of assumptions.
4976 Potential INCOMPATIBILITY:
4978 -- simp sometimes diverges where the old version did
4979 not, e.g. invoking simp on the goal
4981 [| P (f x); y = x; f x = f y |] ==> Q
4983 now gives rise to the infinite reduction sequence
4985 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4987 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4990 -- Tactics combining classical reasoner and simplification (such as auto)
4991 are also affected by this change, because many of them rely on
4992 simp. They may sometimes diverge as well or yield a different numbers
4993 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4994 in case of problems. Sometimes subsequent calls to the classical
4995 reasoner will fail because a preceeding call to the simplifier too
4996 eagerly simplified the goal, e.g. deleted redundant premises.
4998 - The simplifier trace now shows the names of the applied rewrite rules
5000 - You can limit the number of recursive invocations of the simplifier
5001 during conditional rewriting (where the simplifie tries to solve the
5002 conditions before applying the rewrite rule):
5003 ML "simp_depth_limit := n"
5004 where n is an integer. Thus you can force termination where previously
5005 the simplifier would diverge.
5007 - Accepts free variables as head terms in congruence rules. Useful in Isar.
5009 - No longer aborts on failed congruence proof. Instead, the
5010 congruence is ignored.
5012 * Pure: New generic framework for extracting programs from constructive
5013 proofs. See HOL/Extraction.thy for an example instantiation, as well
5014 as HOL/Extraction for some case studies.
5016 * Pure: The main goal of the proof state is no longer shown by default, only
5017 the subgoals. This behaviour is controlled by a new flag.
5018 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
5019 (ML: Proof.show_main_goal).
5021 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
5022 rules whose conclusion matches subgoal 1:
5023 PG menu: Isabelle/Isar -> Show me -> matching rules
5024 The rules are ordered by how closely they match the subgoal.
5025 In particular, rules that solve a subgoal outright are displayed first
5026 (or rather last, the way they are printed).
5027 (ML: ProofGeneral.print_intros())
5029 * Pure: New flag trace_unify_fail causes unification to print
5030 diagnostic information (PG: in trace buffer) when it fails. This is
5031 useful for figuring out why single step proofs like rule, erule or
5034 * Pure: Locale specifications now produce predicate definitions
5035 according to the body of text (covering assumptions modulo local
5036 definitions); predicate "loc_axioms" covers newly introduced text,
5037 while "loc" is cumulative wrt. all included locale expressions; the
5038 latter view is presented only on export into the global theory
5039 context; potential INCOMPATIBILITY, use "(open)" option to fall back
5040 on the old view without predicates;
5042 * Pure: predefined locales "var" and "struct" are useful for sharing
5043 parameters (as in CASL, for example); just specify something like
5044 ``var x + var y + struct M'' as import;
5046 * Pure: improved thms_containing: proper indexing of facts instead of
5047 raw theorems; check validity of results wrt. current name space;
5048 include local facts of proof configuration (also covers active
5049 locales), cover fixed variables in index; may use "_" in term
5050 specification; an optional limit for the number of printed facts may
5051 be given (the default is 40);
5053 * Pure: disallow duplicate fact bindings within new-style theory files
5056 * Provers: improved induct method: assumptions introduced by case
5057 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5058 the goal statement); "foo" still refers to all facts collectively;
5060 * Provers: the function blast.overloaded has been removed: all constants
5061 are regarded as potentially overloaded, which improves robustness in exchange
5062 for slight decrease in efficiency;
5064 * Provers/linorder: New generic prover for transitivity reasoning over
5065 linear orders. Note: this prover is not efficient!
5067 * Isar: preview of problems to finish 'show' now produce an error
5068 rather than just a warning (in interactive mode);
5075 - Produces a counter example if it cannot prove a goal.
5076 Note that the counter example may be spurious if the goal is not a formula
5077 of quantifier-free linear arithmetic.
5078 In ProofGeneral the counter example appears in the trace buffer.
5080 - Knows about div k and mod k where k is a numeral of type nat or int.
5082 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5083 linear arithmetic fails. This takes account of quantifiers and divisibility.
5084 Presburger arithmetic can also be called explicitly via presburger(_tac).
5086 * simp's arithmetic capabilities have been enhanced a bit: it now
5087 takes ~= in premises into account (by performing a case split);
5089 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5090 are distributed over a sum of terms;
5092 * New tactic "trans_tac" and method "trans" instantiate
5093 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5096 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5097 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5099 * 'typedef' command has new option "open" to suppress the set
5102 * functions Min and Max on finite sets have been introduced (theory
5105 * attribute [symmetric] now works for relations as well; it turns
5106 (x,y) : R^-1 into (y,x) : R, and vice versa;
5108 * induct over a !!-quantified statement (say !!x1..xn):
5109 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5111 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5112 %x. None. Warning: empty_def now refers to the previously hidden definition
5115 * Algebra: formalization of classical algebra. Intended as base for
5116 any algebraic development in Isabelle. Currently covers group theory
5117 (up to Sylow's theorem) and ring theory (Universal Property of
5118 Univariate Polynomials). Contributions welcome;
5120 * GroupTheory: deleted, since its material has been moved to Algebra;
5122 * Complex: new directory of the complex numbers with numeric constants,
5123 nonstandard complex numbers, and some complex analysis, standard and
5124 nonstandard (Jacques Fleuriot);
5126 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5128 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5131 * Real/HahnBanach: updated and adapted to locales;
5133 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5136 * UNITY: added the Meier-Sanders theory of progress sets;
5138 * MicroJava: bytecode verifier and lightweight bytecode verifier
5139 as abstract algorithms, instantiated to the JVM;
5141 * Bali: Java source language formalization. Type system, operational
5142 semantics, axiomatic semantics. Supported language features:
5143 classes, interfaces, objects,virtual methods, static methods,
5144 static/instance fields, arrays, access modifiers, definite
5145 assignment, exceptions.
5150 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5153 * Main ZF: virtually all theories converted to new-style format;
5158 * Pure: Tactic.prove provides sane interface for internal proofs;
5159 omits the infamous "standard" operation, so this is more appropriate
5160 than prove_goalw_cterm in many situations (e.g. in simprocs);
5162 * Pure: improved error reporting of simprocs;
5164 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5168 *** Document preparation ***
5170 * uses \par instead of \\ for line breaks in theory text. This may
5171 shift some page breaks in large documents. To get the old behaviour
5172 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5174 * minimized dependencies of isabelle.sty and isabellesym.sty on
5177 * \<euro> now needs package babel/greek instead of marvosym (which
5180 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5185 New in Isabelle2002 (March 2002)
5186 --------------------------------
5188 *** Document preparation ***
5190 * greatly simplified document preparation setup, including more
5191 graceful interpretation of isatool usedir -i/-d/-D options, and more
5192 instructive isatool mkdir; users should basically be able to get
5193 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5194 users may run a separate document processing stage manually like this:
5195 "isatool usedir -D output HOL Test && isatool document Test/output";
5197 * theory dependency graph may now be incorporated into documents;
5198 isatool usedir -g true will produce session_graph.eps/.pdf for use
5199 with \includegraphics of LaTeX;
5201 * proper spacing of consecutive markup elements, especially text
5202 blocks after section headings;
5204 * support bold style (for single symbols only), input syntax is like
5205 this: "\<^bold>\<alpha>" or "\<^bold>A";
5207 * \<bullet> is now output as bold \cdot by default, which looks much
5208 better in printed text;
5210 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5211 note that these symbols are currently unavailable in Proof General /
5212 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5214 * isatool latex no longer depends on changed TEXINPUTS, instead
5215 isatool document copies the Isabelle style files to the target
5221 * Pure/Provers: improved proof by cases and induction;
5222 - 'case' command admits impromptu naming of parameters (such as
5224 - 'induct' method divinates rule instantiation from the inductive
5225 claim; no longer requires excessive ?P bindings for proper
5226 instantiation of cases;
5227 - 'induct' method properly enumerates all possibilities of set/type
5228 rules; as a consequence facts may be also passed through *type*
5229 rules without further ado;
5230 - 'induct' method now derives symbolic cases from the *rulified*
5231 rule (before it used to rulify cases stemming from the internal
5232 atomized version); this means that the context of a non-atomic
5233 statement becomes is included in the hypothesis, avoiding the
5234 slightly cumbersome show "PROP ?case" form;
5235 - 'induct' may now use elim-style induction rules without chaining
5236 facts, using ``missing'' premises from the goal state; this allows
5237 rules stemming from inductive sets to be applied in unstructured
5238 scripts, while still benefitting from proper handling of non-atomic
5239 statements; NB: major inductive premises need to be put first, all
5240 the rest of the goal is passed through the induction;
5241 - 'induct' proper support for mutual induction involving non-atomic
5242 rule statements (uses the new concept of simultaneous goals, see
5244 - append all possible rule selections, but only use the first
5245 success (no backtracking);
5246 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5247 - undeclared rule case names default to numbers 1, 2, 3, ...;
5248 - added 'print_induct_rules' (covered by help item in recent Proof
5250 - moved induct/cases attributes to Pure, methods to Provers;
5251 - generic method setup instantiated for FOL and HOL;
5253 * Pure: support multiple simultaneous goal statements, for example
5254 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5255 meta-level mechanism, this acts as if several individual goals had
5256 been stated separately; in particular common proof methods need to be
5257 repeated in order to cover all claims; note that a single elimination
5258 step is *not* sufficient to establish the two conjunctions, so this
5261 assume "A & B" then have A and B .. (*".." fails*)
5263 better use "obtain" in situations as above; alternative refer to
5264 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5266 * Pure: proper integration with ``locales''; unlike the original
5267 version by Florian Kammller, Isar locales package high-level proof
5268 contexts rather than raw logical ones (e.g. we admit to include
5269 attributes everywhere); operations on locales include merge and
5270 rename; support for implicit arguments (``structures''); simultaneous
5271 type-inference over imports and text; see also HOL/ex/Locales.thy for
5274 * Pure: the following commands have been ``localized'', supporting a
5275 target locale specification "(in name)": 'lemma', 'theorem',
5276 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5277 stored both within the locale and at the theory level (exported and
5278 qualified by the locale name);
5280 * Pure: theory goals may now be specified in ``long'' form, with
5281 ad-hoc contexts consisting of arbitrary locale elements. for example
5282 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5283 definitions may be given, too); the result is a meta-level rule with
5284 the context elements being discharged in the obvious way;
5286 * Pure: new proof command 'using' allows to augment currently used
5287 facts after a goal statement ('using' is syntactically analogous to
5288 'apply', but acts on the goal's facts only); this allows chained facts
5289 to be separated into parts given before and after a claim, as in
5290 ``from a and b have C using d and e <proof>'';
5292 * Pure: renamed "antecedent" case to "rule_context";
5294 * Pure: new 'judgment' command records explicit information about the
5295 object-logic embedding (used by several tools internally); no longer
5296 use hard-wired "Trueprop";
5298 * Pure: added 'corollary' command;
5300 * Pure: fixed 'token_translation' command;
5302 * Pure: removed obsolete 'exported' attribute;
5304 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5305 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5306 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5308 * Pure: method 'atomize' presents local goal premises as object-level
5309 statements (atomic meta-level propositions); setup controlled via
5310 rewrite rules declarations of 'atomize' attribute; example
5311 application: 'induct' method with proper rule statements in improper
5314 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5315 now consider the syntactic context of assumptions, giving a better
5316 chance to get type-inference of the arguments right (this is
5317 especially important for locales);
5319 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5322 * Pure/obtain: the formal conclusion "thesis", being marked as
5323 ``internal'', may no longer be reference directly in the text;
5324 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5327 * Pure: generic 'sym' attribute which declares a rule both as pure
5328 'elim?' and for the 'symmetric' operation;
5330 * Pure: marginal comments ``--'' may now occur just anywhere in the
5331 text; the fixed correlation with particular command syntax has been
5334 * Pure: new method 'rules' is particularly well-suited for proof
5335 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5336 but often produces more compact proof terms with less detours;
5338 * Pure/Provers/classical: simplified integration with pure rule
5339 attributes and methods; the classical "intro?/elim?/dest?"
5340 declarations coincide with the pure ones; the "rule" method no longer
5341 includes classically swapped intros; "intro" and "elim" methods no
5342 longer pick rules from the context; also got rid of ML declarations
5343 AddXIs/AddXEs/AddXDs; all of this has some potential for
5346 * Provers/classical: attribute 'swapped' produces classical inversions
5347 of introduction rules;
5349 * Provers/simplifier: 'simplified' attribute may refer to explicit
5350 rules instead of full simplifier context; 'iff' attribute handles
5353 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5355 * HOL: 'recdef' now fails on unfinished automated proofs, use
5356 "(permissive)" option to recover old behavior;
5358 * HOL: 'inductive' no longer features separate (collective) attributes
5359 for 'intros' (was found too confusing);
5361 * HOL: properly declared induction rules less_induct and
5367 * HOL: moved over to sane numeral syntax; the new policy is as
5370 - 0 and 1 are polymorphic constants, which are defined on any
5371 numeric type (nat, int, real etc.);
5373 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5374 binary representation internally;
5376 - type nat has special constructor Suc, and generally prefers Suc 0
5377 over 1::nat and Suc (Suc 0) over 2::nat;
5379 This change may cause significant problems of INCOMPATIBILITY; here
5380 are some hints on converting existing sources:
5382 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5383 entities, so expressions involving "-" (unary or binary minus) need
5384 to be spaced properly;
5386 - existing occurrences of "1" may need to be constraint "1::nat" or
5387 even replaced by Suc 0; similar for old "2";
5389 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5391 - remove all special provisions on numerals in proofs;
5393 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5394 representation (depends on bin_arith_simps in the default context);
5396 * HOL: symbolic syntax for x^2 (numeral 2);
5398 * HOL: the class of all HOL types is now called "type" rather than
5399 "term"; INCOMPATIBILITY, need to adapt references to this type class
5400 in axclass/classes, instance/arities, and (usually rare) occurrences
5401 in typings (of consts etc.); internally the class is called
5402 "HOL.type", ML programs should refer to HOLogic.typeS;
5404 * HOL/record package improvements:
5405 - new derived operations "fields" to build a partial record section,
5406 "extend" to promote a fixed record to a record scheme, and
5407 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5408 declared as simp by default;
5409 - shared operations ("more", "fields", etc.) now need to be always
5410 qualified) --- potential INCOMPATIBILITY;
5411 - removed "make_scheme" operations (use "make" with "extend") --
5413 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5414 - provides cases/induct rules for use with corresponding Isar
5415 methods (for concrete records, record schemes, concrete more
5416 parts, and schematic more parts -- in that order);
5417 - internal definitions directly based on a light-weight abstract
5418 theory of product types over typedef rather than datatype;
5420 * HOL: generic code generator for generating executable ML code from
5421 specifications; specific support for HOL constructs such as inductive
5422 datatypes and sets, as well as recursive functions; can be invoked
5423 via 'generate_code' theory section;
5425 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5427 * HOL: consolidated and renamed several theories. In particular:
5428 Ord.thy has been absorbed into HOL.thy
5429 String.thy has been absorbed into List.thy
5431 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5432 (beware of argument permutation!);
5434 * HOL: linorder_less_split superseded by linorder_cases;
5436 * HOL/List: "nodups" renamed to "distinct";
5438 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5439 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5440 - Ex_def has changed, now need to use some_eq_ex
5442 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5443 in this (rare) case use:
5445 delSWrapper "split_all_tac"
5446 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5448 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5451 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5452 Isabelle's type classes, ^ on functions and relations has too general
5453 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5454 necessary to attach explicit type constraints;
5456 * HOL/Relation: the prefix name of the infix "O" has been changed from
5457 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5458 renamed accordingly (eg "compI" -> "rel_compI").
5460 * HOL: syntax translations now work properly with numerals and records
5463 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5464 of "lam" -- INCOMPATIBILITY;
5466 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5467 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5468 renamed "Product_Type.unit";
5470 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5472 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5473 the "cases" method);
5475 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5478 * HOL/IMP: updated and converted to new-style theory format; several
5479 parts turned into readable document, with proper Isar proof texts and
5480 some explanations (by Gerwin Klein);
5482 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5484 * HOL-Hyperreal is now a logic image;
5489 * Isar: consts/constdefs supports mixfix syntax for continuous
5492 * Isar: domain package adapted to new-style theory format, e.g. see
5495 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5496 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5497 lift.induct_tac, always use UU instead of Undef;
5499 * HOLCF/IMP: updated and converted to new-style theory;
5504 * Isar: proper integration of logic-specific tools and packages,
5505 including theory commands '(co)inductive', '(co)datatype',
5506 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5507 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5509 * theory Main no longer includes AC; for the Axiom of Choice, base
5510 your theory on Main_ZFC;
5512 * the integer library now covers quotients and remainders, with many
5513 laws relating division to addition, multiplication, etc.;
5515 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5516 typeless version of the formalism;
5518 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5521 * ZF/Induct: new directory for examples of inductive definitions,
5522 including theory Multiset for multiset orderings; converted to
5523 new-style theory format;
5525 * ZF: many new theorems about lists, ordinals, etc.;
5530 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5531 variable proof controls level of detail: 0 = no proofs (only oracle
5532 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5533 also ref manual for further ML interfaces;
5535 * Pure/axclass: removed obsolete ML interface
5536 goal_subclass/goal_arity;
5538 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5539 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5540 separate tokens, so expressions involving minus need to be spaced
5543 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5544 rather than "infixl" or "infixr";
5546 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5547 sort constraint specifications in type inference; e.g. "x::_::foo"
5548 ensures that the type of "x" is of sort "foo" (but not necessarily a
5551 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5552 control output of nested => (types); the default behavior is
5555 * Pure/syntax: builtin parse translation for "_constify" turns valued
5556 tokens into AST constants;
5558 * Pure/syntax: prefer later declarations of translations and print
5559 translation functions; potential INCOMPATIBILITY: need to reverse
5560 multiple declarations for same syntax element constant;
5562 * Pure/show_hyps reset by default (in accordance to existing Isar
5565 * Provers/classical: renamed addaltern to addafter, addSaltern to
5568 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5571 * system: tested support for MacOS X; should be able to get Isabelle +
5572 Proof General to work in a plain Terminal after installing Poly/ML
5573 (e.g. from the Isabelle distribution area) and GNU bash alone
5574 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5575 support requires further installations, e.g. from
5576 http://fink.sourceforge.net/);
5578 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5580 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5581 of 40 MB), cf. ML_OPTIONS;
5583 * system: Proof General keywords specification is now part of the
5584 Isabelle distribution (see etc/isar-keywords.el);
5586 * system: support for persistent Proof General sessions (refrain from
5587 outdating all loaded theories on startup); user may create writable
5588 logic images like this: ``isabelle -q HOL Test'';
5590 * system: smart selection of Isabelle process versus Isabelle
5591 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5592 run both "isabelle" and "Isabelle" even if file names are badly
5593 damaged (executable inspects the case of the first letter of its own
5594 name); added separate "isabelle-process" and "isabelle-interface";
5596 * system: refrain from any attempt at filtering input streams; no
5597 longer support ``8bit'' encoding of old isabelle font, instead proper
5598 iso-latin characters may now be used; the related isatools
5599 "symbolinput" and "nonascii" have disappeared as well;
5601 * system: removed old "xterm" interface (the print modes "xterm" and
5602 "xterm_color" are still available for direct use in a suitable
5607 New in Isabelle99-2 (February 2001)
5608 -----------------------------------
5610 *** Overview of INCOMPATIBILITIES ***
5612 * HOL: please note that theories in the Library and elsewhere often use the
5613 new-style (Isar) format; to refer to their theorems in an ML script you must
5614 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5616 * HOL: inductive package no longer splits induction rule aggressively,
5617 but only as far as specified by the introductions given; the old
5618 format may be recovered via ML function complete_split_rule or attribute
5619 'split_rule (complete)';
5621 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5622 gfp_Tarski to gfp_unfold;
5624 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5626 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5627 relation); infix "^^" has been renamed "``"; infix "``" has been
5628 renamed "`"; "univalent" has been renamed "single_valued";
5630 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5633 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5635 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5637 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5638 consequence, it is no longer monotonic wrt. the local goal context
5639 (which is now passed through the inductive cases);
5641 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5642 \<gg> to \<ggreater>;
5645 *** Document preparation ***
5647 * \isabellestyle{NAME} selects version of Isabelle output (currently
5648 available: are "it" for near math-mode best-style output, "sl" for
5649 slanted text style, and "tt" for plain type-writer; if no
5650 \isabellestyle command is given, output is according to slanted
5653 * support sub/super scripts (for single symbols only), input syntax is
5654 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5656 * some more standard symbols; see Appendix A of the system manual for
5657 the complete list of symbols defined in isabellesym.sty;
5659 * improved isabelle style files; more abstract symbol implementation
5660 (should now use \isamath{...} and \isatext{...} in custom symbol
5663 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5664 state; Note that presentation of goal states does not conform to
5665 actual human-readable proof documents. Please do not include goal
5666 states into document output unless you really know what you are doing!
5668 * proper indentation of antiquoted output with proportional LaTeX
5671 * no_document ML operator temporarily disables LaTeX document
5674 * isatool unsymbolize tunes sources for plain ASCII communication;
5679 * Pure: Isar now suffers initial goal statements to contain unbound
5680 schematic variables (this does not conform to actual readable proof
5681 documents, due to unpredictable outcome and non-compositional proof
5682 checking); users who know what they are doing may use schematic goals
5683 for Prolog-style synthesis of proven results;
5685 * Pure: assumption method (an implicit finishing) now handles actual
5688 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5689 initial goal, declare "that" only as Pure intro (only for single
5690 steps); the "that" rule assumption may now be involved in implicit
5691 finishing, thus ".." becomes a feasible for trivial obtains;
5693 * Pure: default proof step now includes 'intro_classes'; thus trivial
5694 instance proofs may be performed by "..";
5696 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5699 * Pure: more robust selection of calculational rules;
5701 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5702 rule (as well as the assumption rule);
5704 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5705 lemmas, using the graph browser tool;
5707 * Pure: predict failure of "show" in interactive mode;
5709 * Pure: 'thms_containing' now takes actual terms as arguments;
5711 * HOL: improved method 'induct' --- now handles non-atomic goals
5712 (potential INCOMPATIBILITY); tuned error handling;
5714 * HOL: cases and induct rules now provide explicit hints about the
5715 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5716 any remaining facts are inserted into the goal verbatim;
5718 * HOL: local contexts (aka cases) may now contain term bindings as
5719 well; the 'cases' and 'induct' methods new provide a ?case binding for
5720 the result to be shown in each case;
5722 * HOL: added 'recdef_tc' command;
5724 * isatool convert assists in eliminating legacy ML scripts;
5729 * HOL/Library: a collection of generic theories to be used together
5730 with main HOL; the theory loader path already includes this directory
5731 by default; the following existing theories have been moved here:
5732 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5733 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5735 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5736 modelling and verification task performed in Isabelle/HOL +
5737 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5739 * HOL/Algebra: special summation operator SUM no longer exists, it has
5740 been replaced by setsum; infix 'assoc' now has priority 50 (like
5741 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5742 'domain', this makes the theory consistent with mathematical
5745 * HOL basics: added overloaded operations "inverse" and "divide"
5746 (infix "/"), syntax for generic "abs" operation, generic summation
5749 * HOL/typedef: simplified package, provide more useful rules (see also
5752 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5753 now expressed as a proper nested rule (old-style tactic scripts may
5754 require atomize_strip_tac to cope with non-atomic premises);
5756 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5757 to "split_conv" (old name still available for compatibility);
5759 * HOL: improved concrete syntax for strings (e.g. allows translation
5760 rules with string literals);
5762 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5763 and Fleuriot's mechanization of analysis, including the transcendental
5764 functions for the reals;
5766 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5771 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5772 "lam" is displayed as TWO lambda-symbols
5774 * CTT: theory Main now available, containing everything (that is, Bool
5780 * Pure: the Simplifier has been implemented properly as a derived rule
5781 outside of the actual kernel (at last!); the overall performance
5782 penalty in practical applications is about 50%, while reliability of
5783 the Isabelle inference kernel has been greatly improved;
5785 * print modes "brackets" and "no_brackets" control output of nested =>
5786 (types) and ==> (props); the default behaviour is "brackets";
5788 * Provers: fast_tac (and friends) now handle actual object-logic rules
5789 as assumptions as well;
5791 * system: support Poly/ML 4.0;
5793 * system: isatool install handles KDE version 1 or 2;
5797 New in Isabelle99-1 (October 2000)
5798 ----------------------------------
5800 *** Overview of INCOMPATIBILITIES ***
5802 * HOL: simplification of natural numbers is much changed; to partly
5803 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5804 issue the following ML commands:
5806 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5807 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5809 * HOL: simplification no longer dives into case-expressions; this is
5810 controlled by "t.weak_case_cong" for each datatype t;
5812 * HOL: nat_less_induct renamed to less_induct;
5814 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5815 fixsome to patch .thy and .ML sources automatically;
5817 select_equality -> some_equality
5818 select_eq_Ex -> some_eq_ex
5819 selectI2EX -> someI2_ex
5822 select1_equality -> some1_equality
5823 Eps_sym_eq -> some_sym_eq_trivial
5824 Eps_eq -> some_eq_trivial
5826 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5828 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5831 * HOL: the recursion equations generated by 'recdef' are now called
5832 f.simps instead of f.rules;
5834 * HOL: qed_spec_mp now also handles bounded ALL as well;
5836 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5837 sometimes be needed;
5839 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5841 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5843 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5844 product is now "<*>" instead of "Times"; the lexicographic product is
5845 now "<*lex*>" instead of "**";
5847 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5848 of main HOL, but was unused); better use HOL's datatype package;
5850 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5851 the old syntax may be recovered as follows:
5854 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5855 (infixl "\\<oplus>" 100)
5857 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5859 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5860 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5863 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5864 changed from A/r to A//r;
5866 * ZF: new treatment of arithmetic (nat & int) may break some old
5869 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5870 rulify -> rule_format, elimify -> elim_format, ...);
5872 * Isar/Provers: intro/elim/dest attributes changed; renamed
5873 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5874 should have to change intro!! to intro? only); replaced "delrule" by
5877 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5879 * Provers: strengthened force_tac by using new first_best_tac;
5881 * LaTeX document preparation: several changes of isabelle.sty (see
5885 *** Document preparation ***
5887 * formal comments (text blocks etc.) in new-style theories may now
5888 contain antiquotations of thm/prop/term/typ/text to be presented
5889 according to latex print mode; concrete syntax is like this:
5890 @{term[show_types] "f(x) = a + x"};
5892 * isatool mkdir provides easy setup of Isabelle session directories,
5893 including proper document sources;
5895 * generated LaTeX sources are now deleted after successful run
5896 (isatool document -c); may retain a copy somewhere else via -D option
5899 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5900 style files, achieving self-contained LaTeX sources and simplifying
5903 * old-style theories now produce (crude) LaTeX output as well;
5905 * browser info session directories are now self-contained (may be put
5906 on WWW server seperately); improved graphs of nested sessions; removed
5907 graph for 'all sessions';
5909 * several improvements in isabelle style files; \isabellestyle{it}
5910 produces fake math mode output; \isamarkupheader is now \section by
5911 default; see lib/texinputs/isabelle.sty etc.;
5916 * Isar/Pure: local results and corresponding term bindings are now
5917 subject to Hindley-Milner polymorphism (similar to ML); this
5918 accommodates incremental type-inference very nicely;
5920 * Isar/Pure: new derived language element 'obtain' supports
5921 generalized existence reasoning;
5923 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5924 support accumulation of results, without applying any rules yet;
5925 useful to collect intermediate results without explicit name
5926 references, and for use with transitivity rules with more than 2
5929 * Isar/Pure: scalable support for case-analysis type proofs: new
5930 'case' language element refers to local contexts symbolically, as
5931 produced by certain proof methods; internally, case names are attached
5932 to theorems as "tags";
5934 * Isar/Pure: theory command 'hide' removes declarations from
5935 class/type/const name spaces;
5937 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5938 indicate potential overloading;
5940 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5942 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5943 "{a,b,c}" instead of {a,b,c};
5945 * Isar/Pure now provides its own version of intro/elim/dest
5946 attributes; useful for building new logics, but beware of confusion
5947 with the version in Provers/classical;
5949 * Isar/Pure: the local context of (non-atomic) goals is provided via
5950 case name 'antecedent';
5952 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5953 to the current context is now done automatically);
5955 * Isar/Pure: theory command 'method_setup' provides a simple interface
5956 for definining proof methods in ML;
5958 * Isar/Provers: intro/elim/dest attributes changed; renamed
5959 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5960 most cases, one should have to change intro!! to intro? only);
5961 replaced "delrule" by "rule del";
5963 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5964 'symmetric' attribute (the latter supercedes [RS sym]);
5966 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5967 method modifier); 'simp' method: 'only:' modifier removes loopers as
5968 well (including splits);
5970 * Isar/Provers: Simplifier and Classical methods now support all kind
5971 of modifiers used in the past, including 'cong', 'iff', etc.
5973 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5974 of Simplifier and Classical reasoner);
5976 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5977 now support named cases; major packages (inductive, datatype, primrec,
5978 recdef) support case names and properly name parameters;
5980 * Isar/HOL: new transitivity rules for substitution in inequalities --
5981 monotonicity conditions are extracted to be proven at end of
5984 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5987 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5988 split_if split_if_asm; datatype package provides theorems foo.splits =
5989 foo.split foo.split_asm for each datatype;
5991 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5992 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5993 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5994 use "(cases (simplified))" method in proper proof texts);
5996 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5998 * Isar: names of theorems etc. may be natural numbers as well;
6000 * Isar: 'pr' command: optional arguments for goals_limit and
6001 ProofContext.prems_limit; no longer prints theory contexts, but only
6004 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
6005 additional print modes to be specified; e.g. "pr(latex)" will print
6006 proof state according to the Isabelle LaTeX style;
6008 * Isar: improved support for emulating tactic scripts, including proof
6009 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
6010 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
6011 (for HOL datatypes);
6013 * Isar: simplified (more robust) goal selection of proof methods: 1st
6014 goal, all goals, or explicit goal specifier (tactic emulation); thus
6015 'proof method scripts' have to be in depth-first order;
6017 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
6019 * Isar: removed 'help' command, which hasn't been too helpful anyway;
6020 should instead use individual commands for printing items
6021 (print_commands, print_methods etc.);
6023 * Isar: added 'nothing' --- the empty list of theorems;
6028 * HOL/MicroJava: formalization of a fragment of Java, together with a
6029 corresponding virtual machine and a specification of its bytecode
6030 verifier and a lightweight bytecode verifier, including proofs of
6031 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
6032 Cornelia Pusch (see also the homepage of project Bali at
6033 http://isabelle.in.tum.de/Bali/);
6035 * HOL/Algebra: new theory of rings and univariate polynomials, by
6038 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
6039 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6042 * HOL/Lattice: fundamental concepts of lattice theory and order
6043 structures, including duals, properties of bounds versus algebraic
6044 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6045 Theorem for complete lattices etc.; may also serve as a demonstration
6046 for abstract algebraic reasoning using axiomatic type classes, and
6047 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6049 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6052 * HOL/IMPP: extension of IMP with local variables and mutually
6053 recursive procedures, by David von Oheimb;
6055 * HOL/Lambda: converted into new-style theory and document;
6057 * HOL/ex/Multiquote: example of multiple nested quotations and
6058 anti-quotations -- basically a generalized version of de-Bruijn
6059 representation; very useful in avoiding lifting of operations;
6061 * HOL/record: added general record equality rule to simpset; fixed
6062 select-update simplification procedure to handle extended records as
6063 well; admit "r" as field name;
6065 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6066 other numeric types and also as the identity of groups, rings, etc.;
6068 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6069 Types nat and int belong to this axclass;
6071 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6072 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6073 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6074 two terms #m*u and #n*u are replaced by #(m+n)*u
6075 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6076 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6077 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6079 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6080 powerful prover for predicate logic but knows nothing of clasets; see
6081 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6083 * HOL: new version of "case_tac" subsumes both boolean case split and
6084 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6085 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6087 * HOL: simplification no longer dives into case-expressions: only the
6088 selector expression is simplified, but not the remaining arms; to
6089 enable full simplification of case-expressions for datatype t, you may
6090 remove t.weak_case_cong from the simpset, either globally (Delcongs
6091 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6093 * HOL/recdef: the recursion equations generated by 'recdef' for
6094 function 'f' are now called f.simps instead of f.rules; if all
6095 termination conditions are proved automatically, these simplification
6096 rules are added to the simpset, as in primrec; rules may be named
6097 individually as well, resulting in a separate list of theorems for
6100 * HOL/While is a new theory that provides a while-combinator. It
6101 permits the definition of tail-recursive functions without the
6102 provision of a termination measure. The latter is necessary once the
6103 invariant proof rule for while is applied.
6105 * HOL: new (overloaded) notation for the set of elements below/above
6106 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6108 * HOL: theorems impI, allI, ballI bound as "strip";
6110 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6111 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6112 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6114 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6116 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6117 main HOL, but was unused);
6119 * HOL: fewer consts declared as global (e.g. have to refer to
6120 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6122 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6123 in case of overlap with user translations (e.g. judgements over
6124 tuples); (note that the underlying logical represenation is still
6130 * ZF: simplification automatically cancels common terms in arithmetic
6131 expressions over nat and int;
6133 * ZF: new treatment of nat to minimize type-checking: all operators
6134 coerce their operands to a natural number using the function natify,
6135 making the algebraic laws unconditional;
6137 * ZF: as above, for int: operators coerce their operands to an integer
6138 using the function intify;
6140 * ZF: the integer library now contains many of the usual laws for the
6141 orderings, including $<=, and monotonicity laws for $+ and $*;
6143 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6146 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6147 to the simplifier and classical reasoner simultaneously;
6152 * Provers: blast_tac now handles actual object-logic rules as
6153 assumptions; note that auto_tac uses blast_tac internally as well;
6155 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6156 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6158 * Provers: delrules now handles destruct rules as well (no longer need
6159 explicit make_elim);
6161 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6162 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6163 use instead the strong form,
6164 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6165 in HOL, FOL and ZF the function cla_make_elim will create such rules
6166 from destruct-rules;
6168 * Provers: Simplifier.easy_setup provides a fast path to basic
6169 Simplifier setup for new object-logics;
6171 * Pure: AST translation rules no longer require constant head on LHS;
6173 * Pure: improved name spaces: ambiguous output is qualified; support
6174 for hiding of names;
6176 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6177 XSYMBOL_HOME; no longer need to do manual configuration in most
6180 * system: compression of ML heaps images may now be controlled via -c
6181 option of isabelle and isatool usedir (currently only observed by
6184 * system: isatool installfonts may handle X-Symbol fonts as well (very
6185 useful for remote X11);
6187 * system: provide TAGS file for Isabelle sources;
6189 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6192 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6193 timing flag supersedes proof_timing and Toplevel.trace;
6195 * ML: new combinators |>> and |>>> for incremental transformations
6196 with secondary results (e.g. certain theory extensions):
6198 * ML: PureThy.add_defs gets additional argument to indicate potential
6199 overloading (usually false);
6201 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6206 New in Isabelle99 (October 1999)
6207 --------------------------------
6209 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6211 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6212 are no longer simplified. (This allows the simplifier to unfold recursive
6213 functional programs.) To restore the old behaviour, declare
6215 Delcongs [if_weak_cong];
6217 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6220 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6222 * HOL/datatype: mutual_induct_tac no longer exists --
6223 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6225 * HOL/typedef: fixed type inference for representing set; type
6226 arguments now have to occur explicitly on the rhs as type constraints;
6228 * ZF: The con_defs part of an inductive definition may no longer refer
6229 to constants declared in the same theory;
6231 * HOL, ZF: the function mk_cases, generated by the inductive
6232 definition package, has lost an argument. To simplify its result, it
6233 uses the default simpset instead of a supplied list of theorems.
6235 * HOL/List: the constructors of type list are now Nil and Cons;
6237 * Simplifier: the type of the infix ML functions
6238 setSSolver addSSolver setSolver addSolver
6239 is now simpset * solver -> simpset where `solver' is a new abstract type
6240 for packaging solvers. A solver is created via
6241 mk_solver: string -> (thm list -> int -> tactic) -> solver
6242 where the string argument is only a comment.
6247 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6248 decision procedure for linear arithmetic. Currently it is used for
6249 types `nat', `int', and `real' in HOL (see below); it can, should and
6250 will be instantiated for other types and logics as well.
6252 * The simplifier now accepts rewrite rules with flexible heads, eg
6253 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6254 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6260 * New Isabelle/Isar subsystem provides an alternative to traditional
6261 tactical theorem proving; together with the ProofGeneral/isar user
6262 interface it offers an interactive environment for developing human
6263 readable proof documents (Isar == Intelligible semi-automated
6264 reasoning); for further information see isatool doc isar-ref,
6265 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6267 * improved and simplified presentation of theories: better HTML markup
6268 (including colors), graph views in several sizes; isatool usedir now
6269 provides a proper interface for user theories (via -P option); actual
6270 document preparation based on (PDF)LaTeX is available as well (for
6271 new-style theories only); see isatool doc system for more information;
6273 * native support for Proof General, both for classic Isabelle and
6276 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6277 using the graph browser tool;
6279 * Isabelle manuals now also available as PDF;
6281 * theory loader rewritten from scratch (may not be fully
6282 bug-compatible); old loadpath variable has been replaced by show_path,
6283 add_path, del_path, reset_path functions; new operations such as
6284 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6287 * improved isatool install: option -k creates KDE application icon,
6288 option -p DIR installs standalone binaries;
6290 * added ML_PLATFORM setting (useful for cross-platform installations);
6291 more robust handling of platform specific ML images for SML/NJ;
6293 * the settings environment is now statically scoped, i.e. it is never
6294 created again in sub-processes invoked from isabelle, isatool, or
6297 * path element specification '~~' refers to '$ISABELLE_HOME';
6299 * in locales, the "assumes" and "defines" parts may be omitted if
6302 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6305 * new print_mode "HTML";
6307 * new flag show_tags controls display of tags of theorems (which are
6308 basically just comments that may be attached by some tools);
6310 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6311 mode and goal output format:
6313 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6315 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6317 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6318 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6320 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6322 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6324 * function bind_thms stores lists of theorems (cf. bind_thm);
6326 * new shorthand tactics ftac, eatac, datac, fatac;
6328 * qed (and friends) now accept "" as result name; in that case the
6329 theorem is not stored, but proper checks and presentation of the
6332 * theorem database now also indexes constants "Trueprop", "all",
6333 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6338 ** HOL arithmetic **
6340 * There are now decision procedures for linear arithmetic over nat and
6343 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6344 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6345 are treated as atomic; subformulae not involving type `nat' or `int'
6346 are ignored; quantified subformulae are ignored unless they are
6347 positive universal or negative existential. The tactic has to be
6348 invoked by hand and can be a little bit slow. In particular, the
6349 running time is exponential in the number of occurrences of `min' and
6350 `max', and `-' on `nat'.
6352 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6353 (negated) (in)equalities among the premises and the conclusion into
6354 account (i.e. no compound formulae) and does not know about `min' and
6355 `max', and `-' on `nat'. It is fast and is used automatically by the
6358 NB: At the moment, these decision procedures do not cope with mixed
6359 nat/int formulae where the two parts interact, such as `m < n ==>
6362 * HOL/Numeral provides a generic theory of numerals (encoded
6363 efficiently as bit strings); setup for types nat/int/real is in place;
6364 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6365 int, existing theories and proof scripts may require a few additional
6368 * integer division and remainder can now be performed on constant
6371 * many properties of integer multiplication, division and remainder
6374 * An interface to the Stanford Validity Checker (SVC) is available through the
6375 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6376 are proved automatically. SVC must be installed separately, and its results
6377 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6378 invocation of the underlying oracle). For SVC see
6379 http://verify.stanford.edu/SVC
6381 * IsaMakefile: the HOL-Real target now builds an actual image;
6386 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6387 (in Isabelle/Isar) -- by Gertrud Bauer;
6389 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6390 analysis for assembly languages with subtypes;
6392 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6393 -- avoids syntactic ambiguities and treats state, transition, and
6394 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6395 changed syntax and (many) tactics;
6397 * HOL/inductive: Now also handles more general introduction rules such
6398 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6399 theorems are now maintained within the theory (maintained via the
6402 * HOL/datatype: Now also handles arbitrarily branching datatypes
6403 (using function types) such as
6405 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6407 * HOL/record: record_simproc (part of the default simpset) takes care
6408 of selectors applied to updated records; record_split_tac is no longer
6409 part of the default claset; update_defs may now be removed from the
6410 simpset in many cases; COMPATIBILITY: old behavior achieved by
6412 claset_ref () := claset() addSWrapper record_split_wrapper;
6413 Delsimprocs [record_simproc]
6415 * HOL/typedef: fixed type inference for representing set; type
6416 arguments now have to occur explicitly on the rhs as type constraints;
6418 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6419 names rather than an ML expression;
6421 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6422 supplied later. Program schemes can be defined, such as
6423 "While B C s = (if B s then While B C (C s) else s)"
6424 where the well-founded relation can be chosen after B and C have been given.
6426 * HOL/List: the constructors of type list are now Nil and Cons;
6427 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6428 course, ML tools referring to List.list.op # etc. have to be adapted;
6430 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6431 disabled by default; run isabelle with option -m HOL to get back to
6432 the original Gordon/HOL-style output;
6434 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6435 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6437 * HOL basic syntax simplified (more orthogonal): all variants of
6438 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6439 Eps operator is provided as well: "SOME x. P[x]";
6441 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6443 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6444 thus available for user theories;
6446 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6447 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6450 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6451 several times and then mp;
6456 * the notation <<...>> is now available as a notation for sequences of
6459 * the simplifier is now installed
6461 * the axiom system has been generalized (thanks to Soren Heilmann)
6463 * the classical reasoner now has a default rule database
6468 * new primrec section allows primitive recursive functions to be given
6469 directly (as in HOL) over datatypes and the natural numbers;
6471 * new tactics induct_tac and exhaust_tac for induction (or case
6472 analysis) over datatypes and the natural numbers;
6474 * the datatype declaration of type T now defines the recursor T_rec;
6476 * simplification automatically does freeness reasoning for datatype
6479 * automatic type-inference, with AddTCs command to insert new
6480 type-checking rules;
6482 * datatype introduction rules are now added as Safe Introduction rules
6485 * the syntax "if P then x else y" is now available in addition to
6489 *** Internal programming interfaces ***
6491 * tuned simplifier trace output; new flag debug_simp;
6493 * structures Vartab / Termtab (instances of TableFun) offer efficient
6494 tables indexed by indexname_ord / term_ord (compatible with aconv);
6496 * AxClass.axclass_tac lost the theory argument;
6498 * tuned current_goals_markers semantics: begin / end goal avoids
6499 printing empty lines;
6501 * removed prs and prs_fn hook, which was broken because it did not
6502 include \n in its semantics, forcing writeln to add one
6503 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6504 string -> unit if you really want to output text without newline;
6506 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6507 plain output, interface builders may have to enable 'isabelle_font'
6508 mode to get Isabelle font glyphs as before;
6510 * refined token_translation interface; INCOMPATIBILITY: output length
6511 now of type real instead of int;
6513 * theory loader actions may be traced via new ThyInfo.add_hook
6514 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6515 your own database of information attached to *whole* theories -- as
6516 opposed to intra-theory data slots offered via TheoryDataFun;
6518 * proper handling of dangling sort hypotheses (at last!);
6519 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6520 extra sort hypotheses that can be witnessed from the type signature;
6521 the force_strip_shyps flag is gone, any remaining shyps are simply
6522 left in the theorem (with a warning issued by strip_shyps_warning);
6526 New in Isabelle98-1 (October 1998)
6527 ----------------------------------
6529 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6531 * several changes of automated proof tools;
6533 * HOL: major changes to the inductive and datatype packages, including
6534 some minor incompatibilities of theory syntax;
6536 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6539 * HOL: removed duplicate thms in Arith:
6540 less_imp_add_less should be replaced by trans_less_add1
6541 le_imp_add_le should be replaced by trans_le_add1
6543 * HOL: unary minus is now overloaded (new type constraints may be
6546 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6547 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6548 now taken as an integer constant.
6550 * Pure: ML function 'theory_of' renamed to 'theory';
6556 1. Asm_full_simp_tac is now more aggressive.
6557 1. It will sometimes reorient premises if that increases their power to
6559 2. It does no longer proceed strictly from left to right but may also
6560 rotate premises to achieve further simplification.
6561 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6562 old Asm_full_simp_tac in that it does not rotate premises.
6563 2. The simplifier now knows a little bit about nat-arithmetic.
6565 * Classical reasoner: wrapper mechanism for the classical reasoner now
6566 allows for selected deletion of wrappers, by introduction of names for
6567 wrapper functionals. This implies that addbefore, addSbefore,
6568 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6569 and that adding two tactics with the same name overwrites the first
6570 one (emitting a warning).
6571 type wrapper = (int -> tactic) -> (int -> tactic)
6572 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6573 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6574 delWrapper, delSWrapper: claset * string -> claset
6575 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6577 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6578 semantics; addbefore now affects only the unsafe part of step_tac
6579 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6580 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6583 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6584 compWrapper; added safe wrapper (and access functions for it);
6586 * HOL/split_all_tac is now much faster and fails if there is nothing
6587 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6588 and the names of the automatically generated variables have changed.
6589 split_all_tac has moved within claset() from unsafe wrappers to safe
6590 wrappers, which means that !!-bound variables are split much more
6591 aggressively, and safe_tac and clarify_tac now split such variables.
6592 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6593 Note: the same holds for record_split_tac, which does the job of
6594 split_all_tac for record fields.
6596 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6597 permanently to the default simpset using Addsplits just like
6598 Addsimps. They can be removed via Delsplits just like
6599 Delsimps. Lower-case versions are also available.
6601 * HOL/Simplifier: The rule split_if is now part of the default
6602 simpset. This means that the simplifier will eliminate all occurrences
6603 of if-then-else in the conclusion of a goal. To prevent this, you can
6604 either remove split_if completely from the default simpset by
6605 `Delsplits [split_if]' or remove it in a specific call of the
6606 simplifier using `... delsplits [split_if]'. You can also add/delete
6607 other case splitting rules to/from the default simpset: every datatype
6608 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6609 t is the name of the datatype).
6611 * Classical reasoner / Simplifier combination: new force_tac (and
6612 derivatives Force_tac, force) combines rewriting and classical
6613 reasoning (and whatever other tools) similarly to auto_tac, but is
6614 aimed to solve the given subgoal completely.
6619 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6620 and `goalw': the theory is no longer needed as an explicit argument -
6621 the current theory context is used; assumptions are no longer returned
6622 at the ML-level unless one of them starts with ==> or !!; it is
6623 recommended to convert to these new commands using isatool fixgoal
6624 (backup your sources first!);
6626 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6627 the current theory context, and 'theory' to lookup stored theories;
6629 * new theory section 'locale' for declaring constants, assumptions and
6630 definitions that have local scope;
6632 * new theory section 'nonterminals' for purely syntactic types;
6634 * new theory section 'setup' for generic ML setup functions
6635 (e.g. package initialization);
6637 * the distribution now includes Isabelle icons: see
6638 lib/logo/isabelle-{small,tiny}.xpm;
6640 * isatool install - install binaries with absolute references to
6643 * isatool logo -- create instances of the Isabelle logo (as EPS);
6645 * print mode 'emacs' reserved for Isamode;
6647 * support multiple print (ast) translations per constant name;
6649 * theorems involving oracles are now printed with a suffixed [!];
6654 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6656 * HOL/inductive package reorganized and improved: now supports mutual
6662 oddI "n : EVEN ==> Suc n : ODD"
6663 evenI "n : ODD ==> Suc n : EVEN"
6665 new theorem list "elims" contains an elimination rule for each of the
6666 recursive sets; inductive definitions now handle disjunctive premises
6667 correctly (also ZF);
6669 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6670 "mutual_induct" no longer exists - the induction rule is always
6671 contained in "induct";
6674 * HOL/datatype package re-implemented and greatly improved: now
6675 supports mutually recursive datatypes such as
6678 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6679 | SUM ('a aexp) ('a aexp)
6680 | DIFF ('a aexp) ('a aexp)
6683 'a bexp = LESS ('a aexp) ('a aexp)
6684 | AND ('a bexp) ('a bexp)
6685 | OR ('a bexp) ('a bexp)
6687 as well as indirectly recursive datatypes such as
6690 ('a, 'b) term = Var 'a
6691 | App 'b ((('a, 'b) term) list)
6693 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6694 induction on mutually / indirectly recursive datatypes.
6696 Primrec equations are now stored in theory and can be accessed via
6697 <function_name>.simps.
6701 - Theories using datatypes must now have theory Datatype as an
6703 - The specific <typename>.induct_tac no longer exists - use the
6704 generic induct_tac instead.
6705 - natE has been renamed to nat.exhaust - use exhaust_tac
6706 instead of res_inst_tac ... natE. Note that the variable
6707 names in nat.exhaust differ from the names in natE, this
6708 may cause some "fragile" proofs to fail.
6709 - The theorems split_<typename>_case and split_<typename>_case_asm
6710 have been renamed to <typename>.split and <typename>.split_asm.
6711 - Since default sorts of type variables are now handled correctly,
6712 some datatype definitions may have to be annotated with explicit
6714 - Primrec definitions no longer require function name and type
6715 of recursive argument.
6717 Consider using isatool fixdatatype to adapt your theories and proof
6718 scripts to the new package (backup your sources first!).
6721 * HOL/record package: considerably improved implementation; now
6722 includes concrete syntax for record types, terms, updates; theorems
6723 for surjective pairing and splitting !!-bound record variables; proof
6724 support is as follows:
6726 1) standard conversions (selectors or updates applied to record
6727 constructor terms) are part of the standard simpset;
6729 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6730 made part of standard simpset and claset via addIffs;
6732 3) a tactic for record field splitting (record_split_tac) is part of
6733 the standard claset (addSWrapper);
6735 To get a better idea about these rules you may retrieve them via
6736 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6737 the name of your record type.
6739 The split tactic 3) conceptually simplifies by the following rule:
6741 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6743 Thus any record variable that is bound by meta-all will automatically
6744 blow up into some record constructor term, consequently the
6745 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6746 solve record problems automatically.
6749 * reorganized the main HOL image: HOL/Integ and String loaded by
6750 default; theory Main includes everything;
6752 * automatic simplification of integer sums and comparisons, using cancellation;
6754 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6756 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6758 * many new identities for unions, intersections, set difference, etc.;
6760 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6761 called split_if, split_split, split_sum_case and split_nat_case (to go
6762 with add/delsplits);
6764 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6765 (?x::unit) = (); this is made part of the default simpset, which COULD
6766 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6767 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6768 unit_abs_eta_conv is added in order to counter the effect of
6769 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6772 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6775 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6776 It and 'sym RS equals0D' are now in the default claset, giving automatic
6777 disjointness reasoning but breaking a few old proofs.
6779 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6780 to 'converse' from 'inverse' (for compatibility with ZF and some
6783 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6784 the well-founded relation;
6786 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6787 Compl A. The "Compl" syntax remains available as input syntax for this
6790 * HOL/Update: new theory of function updates:
6791 f(a:=b) == %x. if x=a then b else f x
6792 may also be iterated as in f(a:=b,c:=d,...);
6794 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6797 - new function list_update written xs[i:=v] that updates the i-th
6798 list position. May also be iterated as in xs[i:=a,j:=b,...].
6799 - new function `upt' written [i..j(] which generates the list
6800 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6801 bound write [i..j], which is a shorthand for [i..j+1(].
6802 - new lexicographic orderings and corresponding wellfoundedness theorems.
6805 - removed 'pred' (predecessor) function;
6806 - generalized some theorems about n-1;
6807 - many new laws about "div" and "mod";
6808 - new laws about greatest common divisors (see theory ex/Primes);
6810 * HOL/Relation: renamed the relational operator r^-1 "converse"
6811 instead of "inverse";
6813 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6814 of the multiset ordering;
6816 * directory HOL/Real: a construction of the reals using Dedekind cuts
6817 (not included by default);
6819 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6821 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6822 programs, i.e. different program variables may have different types.
6824 * calling (stac rew i) now fails if "rew" has no effect on the goal
6825 [previously, this check worked only if the rewrite rule was unconditional]
6826 Now rew can involve either definitions or equalities (either == or =).
6831 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6832 only the theorems proved on ZF.ML;
6834 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6835 It and 'sym RS equals0D' are now in the default claset, giving automatic
6836 disjointness reasoning but breaking a few old proofs.
6838 * ZF/Update: new theory of function updates
6839 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6840 may also be iterated as in f(a:=b,c:=d,...);
6842 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6844 * calling (stac rew i) now fails if "rew" has no effect on the goal
6845 [previously, this check worked only if the rewrite rule was unconditional]
6846 Now rew can involve either definitions or equalities (either == or =).
6848 * case_tac provided for compatibility with HOL
6849 (like the old excluded_middle_tac, but with subgoals swapped)
6852 *** Internal programming interfaces ***
6854 * Pure: several new basic modules made available for general use, see
6855 also src/Pure/README;
6857 * improved the theory data mechanism to support encapsulation (data
6858 kind name replaced by private Object.kind, acting as authorization
6859 key); new type-safe user interface via functor TheoryDataFun; generic
6860 print_data function becomes basically useless;
6862 * removed global_names compatibility flag -- all theory declarations
6863 are qualified by default;
6865 * module Pure/Syntax now offers quote / antiquote translation
6866 functions (useful for Hoare logic etc. with implicit dependencies);
6867 see HOL/ex/Antiquote for an example use;
6869 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6872 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6875 * Display.print_goals function moved to Locale.print_goals;
6877 * standard print function for goals supports current_goals_markers
6878 variable for marking begin of proof, end of proof, start of goal; the
6879 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6880 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6885 New in Isabelle98 (January 1998)
6886 --------------------------------
6888 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6890 * changed lexical syntax of terms / types: dots made part of long
6891 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6893 * simpset (and claset) reference variable replaced by functions
6894 simpset / simpset_ref;
6896 * no longer supports theory aliases (via merge) and non-trivial
6897 implicit merge of thms' signatures;
6899 * most internal names of constants changed due to qualified names;
6901 * changed Pure/Sequence interface (see Pure/seq.ML);
6904 *** General Changes ***
6906 * hierachically structured name spaces (for consts, types, axms, thms
6907 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6908 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6909 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6910 long_names for fully qualified output names; NOTE: ML programs
6911 (special tactics, packages etc.) referring to internal names may have
6912 to be adapted to cope with fully qualified names; in case of severe
6913 backward campatibility problems try setting 'global_names' at compile
6914 time to have enrything declared within a flat name space; one may also
6915 fine tune name declarations in theories via the 'global' and 'local'
6918 * reimplemented the implicit simpset and claset using the new anytype
6919 data filed in signatures; references simpset:simpset ref etc. are
6920 replaced by functions simpset:unit->simpset and
6921 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6922 to patch your ML files accordingly;
6924 * HTML output now includes theory graph data for display with Java
6925 applet or isatool browser; data generated automatically via isatool
6926 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6928 * defs may now be conditional; improved rewrite_goals_tac to handle
6929 conditional equations;
6931 * defs now admits additional type arguments, using TYPE('a) syntax;
6933 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6934 creates a new theory node; implicit merge of thms' signatures is
6935 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6936 transfer:theory->thm->thm in (rare) cases;
6938 * improved handling of draft signatures / theories; draft thms (and
6939 ctyps, cterms) are automatically promoted to real ones;
6941 * slightly changed interfaces for oracles: admit many per theory, named
6942 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6944 * print_goals: optional output of const types (set show_consts and
6947 * improved output of warnings (###) and errors (***);
6949 * subgoal_tac displays a warning if the new subgoal has type variables;
6951 * removed old README and Makefiles;
6953 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6955 * removed obsolete init_pps and init_database;
6957 * deleted the obsolete tactical STATE, which was declared by
6958 fun STATE tacfun st = tacfun st st;
6960 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6961 (which abbreviates $HOME);
6963 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6964 use isatool fixseq to adapt your ML programs (this works for fully
6965 qualified references to the Sequence structure only!);
6967 * use_thy no longer requires writable current directory; it always
6968 reloads .ML *and* .thy file, if either one is out of date;
6971 *** Classical Reasoner ***
6973 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6974 tactics that use classical reasoning to simplify a subgoal without
6975 splitting it into several subgoals;
6977 * Safe_tac: like safe_tac but uses the default claset;
6982 * added simplification meta rules:
6983 (asm_)(full_)simplify: simpset -> thm -> thm;
6985 * simplifier.ML no longer part of Pure -- has to be loaded by object
6988 * added prems argument to simplification procedures;
6990 * HOL, FOL, ZF: added infix function `addsplits':
6991 instead of `<simpset> setloop (split_tac <thms>)'
6992 you can simply write `<simpset> addsplits <thms>'
6997 * TYPE('a) syntax for type reflection terms;
6999 * no longer handles consts with name "" -- declare as 'syntax' instead;
7001 * pretty printer: changed order of mixfix annotation preference (again!);
7003 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
7008 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
7009 with `addloop' of the simplifier to faciliate case splitting in premises.
7011 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
7013 * HOL/Auth: new protocol proofs including some for the Internet
7016 * HOL/Map: new theory of `maps' a la VDM;
7018 * HOL/simplifier: simplification procedures nat_cancel_sums for
7019 cancelling out common nat summands from =, <, <= (in)equalities, or
7020 differences; simplification procedures nat_cancel_factor for
7021 cancelling common factor from =, <, <= (in)equalities over natural
7022 sums; nat_cancel contains both kinds of procedures, it is installed by
7023 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
7025 * HOL/simplifier: terms of the form
7026 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
7028 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
7029 and those of the form
7030 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
7032 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
7035 Each datatype `t' now comes with a theorem `split_t_case' of the form
7037 P(t_case f1 ... fn x) =
7038 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
7040 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7043 and a theorem `split_t_case_asm' of the form
7045 P(t_case f1 ... fn x) =
7046 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7048 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7050 which can be added to a simpset via `addsplits'. The existing theorems
7051 expand_list_case and expand_option_case have been renamed to
7052 split_list_case and split_option_case.
7055 - `pred n' is automatically converted to `n-1'.
7056 Users are strongly encouraged not to use `pred' any longer,
7057 because it will disappear altogether at some point.
7058 - Users are strongly encouraged to write "0 < n" rather than
7059 "n ~= 0". Theorems and proof tools have been modified towards this
7063 the function "set_of_list" has been renamed "set" (and its theorems too);
7064 the function "nth" now takes its arguments in the reverse order and
7065 has acquired the infix notation "!" as in "xs!n".
7067 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7069 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7070 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7072 * HOL/record: extensible records with schematic structural subtyping
7073 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7074 still lacks various theorems and concrete record syntax;
7079 * removed "axioms" and "generated by" sections;
7081 * replaced "ops" section by extended "consts" section, which is capable of
7082 handling the continuous function space "->" directly;
7085 . proves theorems immediately and stores them in the theory,
7086 . creates hierachical name space,
7087 . now uses normal mixfix annotations (instead of cinfix...),
7088 . minor changes to some names and values (for consistency),
7089 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7090 . separator between mutual domain defs: changed "," to "and",
7091 . improved handling of sort constraints; now they have to
7092 appear on the left-hand side of the equations only;
7094 * fixed LAM <x,y,zs>.b syntax;
7096 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7097 adm (%x. P (t x)), where P is chainfinite and t continuous;
7102 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7103 with `addloop' of the simplifier to faciliate case splitting in premises.
7105 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7106 in HOL, they strip ALL and --> from proved theorems;
7110 New in Isabelle94-8 (May 1997)
7111 ------------------------------
7113 *** General Changes ***
7115 * new utilities to build / run / maintain Isabelle etc. (in parts
7116 still somewhat experimental); old Makefiles etc. still functional;
7118 * new 'Isabelle System Manual';
7120 * INSTALL text, together with ./configure and ./build scripts;
7122 * reimplemented type inference for greater efficiency, better error
7123 messages and clean internal interface;
7125 * prlim command for dealing with lots of subgoals (an easier way of
7126 setting goals_limit);
7131 * supports alternative (named) syntax tables (parser and pretty
7132 printer); internal interface is provided by add_modesyntax(_i);
7134 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7135 be used in conjunction with the Isabelle symbol font; uses the
7136 "symbols" syntax table;
7138 * added token_translation interface (may translate name tokens in
7139 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7140 the current print_mode); IMPORTANT: user print translation functions
7141 are responsible for marking newly introduced bounds
7142 (Syntax.mark_boundT);
7144 * token translations for modes "xterm" and "xterm_color" that display
7145 names in bold, underline etc. or colors (which requires a color
7148 * infixes may now be declared with names independent of their syntax;
7150 * added typed_print_translation (like print_translation, but may
7151 access type of constant);
7154 *** Classical Reasoner ***
7156 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7157 some limitations. Blast_tac...
7158 + ignores addss, addbefore, addafter; this restriction is intrinsic
7159 + ignores elimination rules that don't have the correct format
7160 (the conclusion MUST be a formula variable)
7161 + ignores types, which can make HOL proofs fail
7162 + rules must not require higher-order unification, e.g. apply_type in ZF
7163 [message "Function Var's argument not a bound variable" relates to this]
7164 + its proof strategy is more general but can actually be slower
7166 * substitution with equality assumptions no longer permutes other
7169 * minor changes in semantics of addafter (now called addaltern); renamed
7170 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7171 (and access functions for it);
7173 * improved combination of classical reasoner and simplifier:
7174 + functions for handling clasimpsets
7175 + improvement of addss: now the simplifier is called _after_ the
7177 + safe variant of addss called addSss: uses safe simplifications
7178 _during_ the safe steps. It is more complete as it allows multiple
7179 instantiations of unknowns (e.g. with slow_tac).
7183 * added interface for simplification procedures (functions that
7184 produce *proven* rewrite rules on the fly, depending on current
7187 * ordering on terms as parameter (used for ordered rewriting);
7189 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7191 * the solver is now split into a safe and an unsafe part.
7192 This should be invisible for the normal user, except that the
7193 functions setsolver and addsolver have been renamed to setSolver and
7194 addSolver; added safe_asm_full_simp_tac;
7199 * a generic induction tactic `induct_tac' which works for all datatypes and
7200 also for type `nat';
7202 * a generic case distinction tactic `exhaust_tac' which works for all
7203 datatypes and also for type `nat';
7205 * each datatype comes with a function `size';
7207 * patterns in case expressions allow tuple patterns as arguments to
7208 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7210 * primrec now also works with type nat;
7212 * recdef: a new declaration form, allows general recursive functions to be
7213 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7215 * the constant for negation has been renamed from "not" to "Not" to
7216 harmonize with FOL, ZF, LK, etc.;
7218 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7221 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7223 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7224 problems in commutative rings, using axiomatic type classes for + and *;
7226 * more examples in HOL/MiniML and HOL/Auth;
7228 * more default rewrite rules for quantifiers, union/intersection;
7230 * a new constant `arbitrary == @x.False';
7232 * HOLCF/IOA replaces old HOL/IOA;
7234 * HOLCF changes: derived all rules and arities
7235 + axiomatic type classes instead of classes
7236 + typedef instead of faking type definitions
7237 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7238 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7239 + eliminated the types void, one, tr
7240 + use unit lift and bool lift (with translations) instead of one and tr
7241 + eliminated blift from Lift3.thy (use Def instead of blift)
7242 all eliminated rules are derived as theorems --> no visible changes ;
7247 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7248 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7249 as ZF_cs addSIs [equalityI];
7253 New in Isabelle94-7 (November 96)
7254 ---------------------------------
7256 * allowing negative levels (as offsets) in prlev and choplev;
7258 * super-linear speedup for large simplifications;
7260 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7261 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7262 FAIL); can suppress it using the command Delsimps (ex_simps @
7263 all_simps); De Morgan laws are also now included, by default;
7265 * improved printing of ==> : ~:
7267 * new object-logic "Sequents" adds linear logic, while replacing LK
7268 and Modal (thanks to Sara Kalvala);
7270 * HOL/Auth: correctness proofs for authentication protocols;
7272 * HOL: new auto_tac combines rewriting and classical reasoning (many
7273 examples on HOL/Auth);
7275 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7276 the rewriter and classical reasoner simultaneously;
7278 * function uresult no longer returns theorems in "standard" format;
7279 regain previous version by: val uresult = standard o uresult;
7286 * oracles -- these establish an interface between Isabelle and trusted
7287 external reasoners, which may deliver results as theorems;
7289 * proof objects (in particular record all uses of oracles);
7291 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7293 * "constdefs" section in theory files;
7295 * "primrec" section (HOL) no longer requires names;
7297 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7304 * reduced space requirements;
7306 * automatic HTML generation from theories;
7308 * theory files no longer require "..." (quotes) around most types;
7310 * new examples, including two proofs of the Church-Rosser theorem;
7312 * non-curried (1994) version of HOL is no longer distributed;
7319 * greatly reduced space requirements;
7321 * theory files (.thy) no longer require \...\ escapes at line breaks;
7323 * searchable theorem database (see the section "Retrieving theorems" on
7324 page 8 of the Reference Manual);
7326 * new examples, including Grabczewski's monumental case study of the
7329 * The previous version of HOL renamed to Old_HOL;
7331 * The new version of HOL (previously called CHOL) uses a curried syntax
7332 for functions. Application looks like f a b instead of f(a,b);
7334 * Mutually recursive inductive definitions finally work in HOL;
7336 * In ZF, pattern-matching on tuples is now available in all abstractions and
7337 translates to the operator "split";
7344 * new infix operator, addss, allowing the classical reasoner to
7345 perform simplification at each step of its search. Example:
7346 fast_tac (cs addss ss)
7348 * a new logic, CHOL, the same as HOL, but with a curried syntax
7349 for functions. Application looks like f a b instead of f(a,b). Also pairs
7350 look like (a,b) instead of <a,b>;
7352 * PLEASE NOTE: CHOL will eventually replace HOL!
7354 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7355 It translates to the operator "split". A new theory of integers is available;
7357 * In ZF, integer numerals now denote two's-complement binary integers.
7358 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7360 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7361 of the Axiom of Choice;
7368 * Significantly faster resolution;
7370 * the different sections in a .thy file can now be mixed and repeated
7373 * Database of theorems for FOL, HOL and ZF. New
7374 commands including qed, qed_goal and bind_thm store theorems in the database.
7376 * Simple database queries: return a named theorem (get_thm) or all theorems of
7377 a given theory (thms_of), or find out what theory a theorem was proved in
7380 * Bugs fixed in the inductive definition and datatype packages;
7382 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7383 and HOL_dup_cs obsolete;
7385 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7388 * Simpler definition of function space in ZF;
7390 * new results about cardinal and ordinal arithmetic in ZF;
7392 * 'subtype' facility in HOL for introducing new types as subsets of existing
7395 :mode=text:wrap=hard:maxLineLen=72: