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 * Constant "split" has been merged with constant "prod_case"; names
21 of ML functions, facts etc. involving split have been retained so far,
22 though. INCOMPATIBILITY.
24 * Some previously unqualified names have been qualified:
35 Pair ~> Product_Type.Pair
36 fst ~> Product_Type.fst
37 snd ~> Product_Type.snd
38 split ~> Product_Type.split
39 curry ~> Product_Type.curry
43 * Removed simplifier congruence rule of "prod_case", as has for long
44 been the case with "split".
46 * Datatype package: theorems generated for executable equality
47 (class eq) carry proper names and are treated as default code
50 * List.thy: use various operations from the Haskell prelude when
51 generating Haskell code.
53 * code_simp.ML: simplification with rules determined by
56 * code generator: do not print function definitions for case
57 combinators any longer.
61 New in Isabelle2009-2 (June 2010)
62 ---------------------------------
66 * Authentic syntax for *all* logical entities (type classes, type
67 constructors, term constants): provides simple and robust
68 correspondence between formal entities and concrete syntax. Within
69 the parse tree / AST representations, "constants" are decorated by
70 their category (class, type, const) and spelled out explicitly with
71 their full internal name.
73 Substantial INCOMPATIBILITY concerning low-level syntax declarations
74 and translations (translation rules and translation functions in ML).
75 Some hints on upgrading:
77 - Many existing uses of 'syntax' and 'translations' can be replaced
78 by more modern 'type_notation', 'notation' and 'abbreviation',
79 which are independent of this issue.
81 - 'translations' require markup within the AST; the term syntax
82 provides the following special forms:
84 CONST c -- produces syntax version of constant c from context
85 XCONST c -- literally c, checked as constant from context
86 c -- literally c, if declared by 'syntax'
88 Plain identifiers are treated as AST variables -- occasionally the
89 system indicates accidental variables via the error "rhs contains
92 Type classes and type constructors are marked according to their
93 concrete syntax. Some old translations rules need to be written
94 for the "type" category, using type constructor application
95 instead of pseudo-term application of the default category
98 - 'parse_translation' etc. in ML may use the following
101 @{class_syntax c} -- type class c within parse tree / AST
102 @{term_syntax c} -- type constructor c within parse tree / AST
103 @{const_syntax c} -- ML version of "CONST c" above
104 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
106 - Literal types within 'typed_print_translations', i.e. those *not*
107 represented as pseudo-terms are represented verbatim. Use @{class
108 c} or @{type_name c} here instead of the above syntax
111 Note that old non-authentic syntax was based on unqualified base
112 names, so all of the above "constant" names would coincide. Recall
113 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
114 diagnose syntax problems.
116 * Type constructors admit general mixfix syntax, not just infix.
118 * Concrete syntax may be attached to local entities without a proof
119 body, too. This works via regular mixfix annotations for 'fix',
120 'def', 'obtain' etc. or via the explicit 'write' command, which is
121 similar to the 'notation' command in theory specifications.
123 * Discontinued unnamed infix syntax (legacy feature for many years) --
124 need to specify constant name and syntax separately. Internal ML
125 datatype constructors have been renamed from InfixName to Infix etc.
126 Minor INCOMPATIBILITY.
128 * Schematic theorem statements need to be explicitly markup as such,
129 via commands 'schematic_lemma', 'schematic_theorem',
130 'schematic_corollary'. Thus the relevance of the proof is made
131 syntactically clear, which impacts performance in a parallel or
132 asynchronous interactive environment. Minor INCOMPATIBILITY.
134 * Use of cumulative prems via "!" in some proof methods has been
135 discontinued (old legacy feature).
137 * References 'trace_simp' and 'debug_simp' have been replaced by
138 configuration options stored in the context. Enabling tracing (the
139 case of debugging is similar) in proofs works via
141 using [[trace_simp = true]]
143 Tracing is then active for all invocations of the simplifier in
144 subsequent goal refinement steps. Tracing may also still be enabled or
145 disabled via the ProofGeneral settings menu.
147 * Separate commands 'hide_class', 'hide_type', 'hide_const',
148 'hide_fact' replace the former 'hide' KIND command. Minor
151 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
152 more efficient than combinations with -q1 or -q2.
157 * Proofterms record type-class reasoning explicitly, using the
158 "unconstrain" operation internally. This eliminates all sort
159 constraints from a theorem and proof, introducing explicit
160 OFCLASS-premises. On the proof term level, this operation is
161 automatically applied at theorem boundaries, such that closed proofs
162 are always free of sort constraints. INCOMPATIBILITY for tools that
165 * Local theory specifications may depend on extra type variables that
166 are not present in the result type -- arguments TYPE('a) :: 'a itself
167 are added internally. For example:
169 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
171 * Predicates of locales introduced by classes carry a mandatory
172 "class" prefix. INCOMPATIBILITY.
174 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
176 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
179 * Command 'code_reflect' allows to incorporate generated ML code into
180 runtime environment; replaces immature code_datatype antiquotation.
183 * Code generator: simple concept for abstract datatypes obeying
186 * Code generator: details of internal data cache have no impact on the
187 user space functionality any longer.
189 * Methods "unfold_locales" and "intro_locales" ignore non-locale
190 subgoals. This is more appropriate for interpretations with 'where'.
193 * Command 'example_proof' opens an empty proof body. This allows to
194 experiment with Isar, without producing any persistent result.
196 * Commands 'type_notation' and 'no_type_notation' declare type syntax
197 within a local theory context, with explicit checking of the
198 constructors involved (in contrast to the raw 'syntax' versions).
200 * Commands 'types' and 'typedecl' now work within a local theory
201 context -- without introducing dependencies on parameters or
202 assumptions, which is not possible in Isabelle/Pure.
204 * Command 'defaultsort' has been renamed to 'default_sort', it works
205 within a local theory context. Minor INCOMPATIBILITY.
210 * Command 'typedef' now works within a local theory context -- without
211 introducing dependencies on parameters or assumptions, which is not
212 possible in Isabelle/Pure/HOL. Note that the logical environment may
213 contain multiple interpretations of local typedefs (with different
214 non-emptiness proofs), even in a global theory context.
216 * New package for quotient types. Commands 'quotient_type' and
217 'quotient_definition' may be used for defining types and constants by
218 quotient constructions. An example is the type of integers created by
219 quotienting pairs of natural numbers:
222 intrel :: "(nat * nat) => (nat * nat) => bool"
224 "intrel (x, y) (u, v) = (x + v = u + y)"
226 quotient_type int = "nat * nat" / intrel
227 by (auto simp add: equivp_def expand_fun_eq)
230 "0::int" is "(0::nat, 0::nat)"
232 The method "lifting" can be used to lift of theorems from the
233 underlying "raw" type to the quotient type. The example
234 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
235 construction and provides a reasoning infrastructure for finite sets.
237 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
238 clash with new theory Quotient in Main HOL.
240 * Moved the SMT binding into the main HOL session, eliminating
241 separate HOL-SMT session.
243 * List membership infix mem operation is only an input abbreviation.
246 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
247 for future developements; former Library/Word.thy is still present in
248 the AFP entry RSAPPS.
250 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
251 longer shadowed. INCOMPATIBILITY.
253 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
256 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
259 * Dropped normalizing_semiring etc; use the facts in semiring classes
260 instead. INCOMPATIBILITY.
262 * Dropped several real-specific versions of lemmas about floor and
263 ceiling; use the generic lemmas from theory "Archimedean_Field"
264 instead. INCOMPATIBILITY.
266 floor_number_of_eq ~> floor_number_of
267 le_floor_eq_number_of ~> number_of_le_floor
268 le_floor_eq_zero ~> zero_le_floor
269 le_floor_eq_one ~> one_le_floor
270 floor_less_eq_number_of ~> floor_less_number_of
271 floor_less_eq_zero ~> floor_less_zero
272 floor_less_eq_one ~> floor_less_one
273 less_floor_eq_number_of ~> number_of_less_floor
274 less_floor_eq_zero ~> zero_less_floor
275 less_floor_eq_one ~> one_less_floor
276 floor_le_eq_number_of ~> floor_le_number_of
277 floor_le_eq_zero ~> floor_le_zero
278 floor_le_eq_one ~> floor_le_one
279 floor_subtract_number_of ~> floor_diff_number_of
280 floor_subtract_one ~> floor_diff_one
281 ceiling_number_of_eq ~> ceiling_number_of
282 ceiling_le_eq_number_of ~> ceiling_le_number_of
283 ceiling_le_zero_eq ~> ceiling_le_zero
284 ceiling_le_eq_one ~> ceiling_le_one
285 less_ceiling_eq_number_of ~> number_of_less_ceiling
286 less_ceiling_eq_zero ~> zero_less_ceiling
287 less_ceiling_eq_one ~> one_less_ceiling
288 ceiling_less_eq_number_of ~> ceiling_less_number_of
289 ceiling_less_eq_zero ~> ceiling_less_zero
290 ceiling_less_eq_one ~> ceiling_less_one
291 le_ceiling_eq_number_of ~> number_of_le_ceiling
292 le_ceiling_eq_zero ~> zero_le_ceiling
293 le_ceiling_eq_one ~> one_le_ceiling
294 ceiling_subtract_number_of ~> ceiling_diff_number_of
295 ceiling_subtract_one ~> ceiling_diff_one
297 * Theory "Finite_Set": various folding_XXX locales facilitate the
298 application of the various fold combinators on finite sets.
300 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
301 provides abstract red-black tree type which is backed by "RBT_Impl" as
302 implementation. INCOMPATIBILTY.
304 * Theory Library/Coinductive_List has been removed -- superseded by
305 AFP/thys/Coinductive.
307 * Theory PReal, including the type "preal" and related operations, has
308 been removed. INCOMPATIBILITY.
310 * Real: new development using Cauchy Sequences.
312 * Split off theory "Big_Operators" containing setsum, setprod,
313 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
315 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
316 "Int" etc. INCOMPATIBILITY.
318 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
320 * New set of rules "ac_simps" provides combined assoc / commute
321 rewrites for all interpretations of the appropriate generic locales.
323 * Renamed theory "OrderedGroup" to "Groups" and split theory
324 "Ring_and_Field" into theories "Rings" and "Fields"; for more
325 appropriate and more consistent names suitable for name prefixes
326 within the HOL theories. INCOMPATIBILITY.
328 * Some generic constants have been put to appropriate theories:
329 - less_eq, less: Orderings
330 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
331 - inverse, divide: Rings
334 * More consistent naming of type classes involving orderings (and
337 lower_semilattice ~> semilattice_inf
338 upper_semilattice ~> semilattice_sup
340 dense_linear_order ~> dense_linorder
342 pordered_ab_group_add ~> ordered_ab_group_add
343 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
344 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
345 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
346 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
347 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
348 pordered_cancel_semiring ~> ordered_cancel_semiring
349 pordered_comm_monoid_add ~> ordered_comm_monoid_add
350 pordered_comm_ring ~> ordered_comm_ring
351 pordered_comm_semiring ~> ordered_comm_semiring
352 pordered_ring ~> ordered_ring
353 pordered_ring_abs ~> ordered_ring_abs
354 pordered_semiring ~> ordered_semiring
356 ordered_ab_group_add ~> linordered_ab_group_add
357 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
358 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
359 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
360 ordered_field ~> linordered_field
361 ordered_field_no_lb ~> linordered_field_no_lb
362 ordered_field_no_ub ~> linordered_field_no_ub
363 ordered_field_dense_linear_order ~> dense_linordered_field
364 ordered_idom ~> linordered_idom
365 ordered_ring ~> linordered_ring
366 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
367 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
368 ordered_ring_strict ~> linordered_ring_strict
369 ordered_semidom ~> linordered_semidom
370 ordered_semiring ~> linordered_semiring
371 ordered_semiring_1 ~> linordered_semiring_1
372 ordered_semiring_1_strict ~> linordered_semiring_1_strict
373 ordered_semiring_strict ~> linordered_semiring_strict
375 The following slightly odd type classes have been moved to a
376 separate theory Library/Lattice_Algebras:
378 lordered_ab_group_add ~> lattice_ab_group_add
379 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
380 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
381 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
382 lordered_ring ~> lattice_ring
386 * Refined field classes:
387 - classes division_ring_inverse_zero, field_inverse_zero,
388 linordered_field_inverse_zero include rule inverse 0 = 0 --
389 subsumes former division_by_zero class;
390 - numerous lemmas have been ported from field to division_ring.
393 * Refined algebra theorem collections:
394 - dropped theorem group group_simps, use algebra_simps instead;
395 - dropped theorem group ring_simps, use field_simps instead;
396 - proper theorem collection field_simps subsumes former theorem
397 groups field_eq_simps and field_simps;
398 - dropped lemma eq_minus_self_iff which is a duplicate for
402 * Theory Finite_Set and List: some lemmas have been generalized from
405 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
406 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
407 inter_Inter_fold_inter ~> inf_Inf_fold_inf
408 union_Union_fold_union ~> sup_Sup_fold_sup
409 Inter_fold_inter ~> Inf_fold_inf
410 Union_fold_union ~> Sup_fold_sup
411 inter_INTER_fold_inter ~> inf_INFI_fold_inf
412 union_UNION_fold_union ~> sup_SUPR_fold_sup
413 INTER_fold_inter ~> INFI_fold_inf
414 UNION_fold_union ~> SUPR_fold_sup
416 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
417 replaced by the more convenient lemmas Inf_empty and Sup_empty.
418 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
419 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
420 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
421 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
423 * Reorganized theory Multiset: swapped notation of pointwise and
426 - pointwise ordering is instance of class order with standard syntax
428 - multiset ordering has syntax <=# and <#; partial order properties
429 are provided by means of interpretation with prefix
431 - less duplication, less historical organization of sections,
432 conversion from associations lists to multisets, rudimentary code
434 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
439 multiset_eq_conv_count_eq ~> multiset_ext_iff
440 multi_count_ext ~> multiset_ext
441 diff_union_inverse2 ~> diff_union_cancelR
445 * Theory Permutation: replaced local "remove" by List.remove1.
447 * Code generation: ML and OCaml code is decorated with signatures.
449 * Theory List: added transpose.
451 * Library/Nat_Bijection.thy is a collection of bijective functions
452 between nat and other types, which supersedes the older libraries
453 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
456 Nat_Int_Bij.nat2_to_nat ~> prod_encode
457 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
458 Nat_Int_Bij.int_to_nat_bij ~> int_encode
459 Nat_Int_Bij.nat_to_int_bij ~> int_decode
460 Countable.pair_encode ~> prod_encode
461 NatIso.prod2nat ~> prod_encode
462 NatIso.nat2prod ~> prod_decode
463 NatIso.sum2nat ~> sum_encode
464 NatIso.nat2sum ~> sum_decode
465 NatIso.list2nat ~> list_encode
466 NatIso.nat2list ~> list_decode
467 NatIso.set2nat ~> set_encode
468 NatIso.nat2set ~> set_decode
471 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
472 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
473 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
474 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
475 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
476 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
477 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
478 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
479 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
480 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
481 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
482 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
483 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
486 - Renamed ATP commands:
487 atp_info ~> sledgehammer running_atps
488 atp_kill ~> sledgehammer kill_atps
489 atp_messages ~> sledgehammer messages
490 atp_minimize ~> sledgehammer minimize
491 print_atps ~> sledgehammer available_atps
493 - Added user's manual ("isabelle doc sledgehammer").
494 - Added option syntax and "sledgehammer_params" to customize
495 Sledgehammer's behavior. See the manual for details.
496 - Modified the Isar proof reconstruction code so that it produces
497 direct proofs rather than proofs by contradiction. (This feature
498 is still experimental.)
499 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
501 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
504 - Added and implemented "binary_ints" and "bits" options.
505 - Added "std" option and implemented support for nonstandard models.
506 - Added and implemented "finitize" option to improve the precision
507 of infinite datatypes based on a monotonicity analysis.
508 - Added support for quotient types.
509 - Added support for "specification" and "ax_specification"
511 - Added support for local definitions (for "function" and
512 "termination" proofs).
513 - Added support for term postprocessors.
514 - Optimized "Multiset.multiset" and "FinFun.finfun".
515 - Improved efficiency of "destroy_constrs" optimization.
516 - Fixed soundness bugs related to "destroy_constrs" optimization and
518 - Fixed soundness bug related to higher-order constructors.
519 - Fixed soundness bug when "full_descrs" is enabled.
520 - Improved precision of set constructs.
521 - Added "atoms" option.
522 - Added cache to speed up repeated Kodkod invocations on the same
524 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
525 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
526 "SAT4J_Light". INCOMPATIBILITY.
527 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
528 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
529 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
531 * Method "induct" now takes instantiations of the form t, where t is not
532 a variable, as a shorthand for "x == t", where x is a fresh variable.
533 If this is not intended, t has to be enclosed in parentheses.
534 By default, the equalities generated by definitional instantiations
535 are pre-simplified, which may cause parameters of inductive cases
536 to disappear, or may even delete some of the inductive cases.
537 Use "induct (no_simp)" instead of "induct" to restore the old
538 behaviour. The (no_simp) option is also understood by the "cases"
539 and "nominal_induct" methods, which now perform pre-simplification, too.
545 * Variable names in lemmas generated by the domain package have
546 changed; the naming scheme is now consistent with the HOL datatype
547 package. Some proof scripts may be affected, INCOMPATIBILITY.
549 * The domain package no longer defines the function "foo_copy" for
550 recursive domain "foo". The reach lemma is now stated directly in
551 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
552 be reformulated in terms of "foo_take", INCOMPATIBILITY.
554 * Most definedness lemmas generated by the domain package (previously
555 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
556 like "foo$x = UU <-> x = UU", which works better as a simp rule.
557 Proofs that used definedness lemmas as intro rules may break,
558 potential INCOMPATIBILITY.
560 * Induction and casedist rules generated by the domain package now
561 declare proper case_names (one called "bottom", and one named for each
562 constructor). INCOMPATIBILITY.
564 * For mutually-recursive domains, separate "reach" and "take_lemma"
565 rules are generated for each domain, INCOMPATIBILITY.
567 foo_bar.reach ~> foo.reach bar.reach
568 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
570 * Some lemmas generated by the domain package have been renamed for
571 consistency with the datatype package, INCOMPATIBILITY.
573 foo.ind ~> foo.induct
574 foo.finite_ind ~> foo.finite_induct
575 foo.coind ~> foo.coinduct
576 foo.casedist ~> foo.exhaust
577 foo.exhaust ~> foo.nchotomy
579 * For consistency with other definition packages, the fixrec package
580 now generates qualified theorem names, INCOMPATIBILITY.
582 foo_simps ~> foo.simps
583 foo_unfold ~> foo.unfold
584 foo_induct ~> foo.induct
586 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
587 method and internal fixrec proofs now use the default simpset instead.
590 * The "contlub" predicate has been removed. Proof scripts should use
591 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
593 * The "admw" predicate has been removed, INCOMPATIBILITY.
595 * The constants cpair, cfst, and csnd have been removed in favor of
596 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
601 * Antiquotations for basic formal entities:
603 @{class NAME} -- type class
604 @{class_syntax NAME} -- syntax representation of the above
606 @{type_name NAME} -- logical type
607 @{type_abbrev NAME} -- type abbreviation
608 @{nonterminal NAME} -- type of concrete syntactic category
609 @{type_syntax NAME} -- syntax representation of any of the above
611 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
612 @{const_abbrev NAME} -- abbreviated constant
613 @{const_syntax NAME} -- syntax representation of any of the above
615 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
616 syntax constant (cf. 'syntax' command).
618 * Antiquotation @{make_string} inlines a function to print arbitrary
619 values similar to the ML toplevel. The result is compiler dependent
620 and may fall back on "?" in certain situations.
622 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
623 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
624 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
625 not work with the asynchronous Isar document model.
627 * Configuration options now admit dynamic default values, depending on
628 the context or even global references.
630 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
631 uses an efficient external library if available (for Poly/ML).
633 * Renamed some important ML structures, while keeping the old names
634 for some time as aliases within the structure Legacy:
636 OuterKeyword ~> Keyword
639 OuterSyntax ~> Outer_Syntax
640 PrintMode ~> Print_Mode
641 SpecParse ~> Parse_Spec
644 ThyOutput ~> Thy_Output
645 TypeInfer ~> Type_Infer
647 Note that "open Legacy" simplifies porting of sources, but forgetting
648 to remove it again will complicate porting again in the future.
650 * Most operations that refer to a global context are named
651 accordingly, e.g. Simplifier.global_context or
652 ProofContext.init_global. There are some situations where a global
653 context actually works, but under normal circumstances one needs to
654 pass the proper local context through the code!
656 * Discontinued old TheoryDataFun with its copy/init operation -- data
657 needs to be pure. Functor Theory_Data_PP retains the traditional
658 Pretty.pp argument to merge, which is absent in the standard
661 * Sorts.certify_sort and derived "cert" operations for types and terms
662 no longer minimize sorts. Thus certification at the boundary of the
663 inference kernel becomes invariant under addition of class relations,
664 which is an important monotonicity principle. Sorts are now minimized
665 in the syntax layer only, at the boundary between the end-user and the
666 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
667 explicitly in rare situations.
669 * Renamed old-style Drule.standard to Drule.export_without_context, to
670 emphasize that this is in no way a standard operation.
673 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
674 usual for resolution. Rare INCOMPATIBILITY.
676 * Renamed varify/unvarify operations to varify_global/unvarify_global
677 to emphasize that these only work in a global situation (which is
680 * Curried take and drop in library.ML; negative length is interpreted
681 as infinity (as in chop). Subtle INCOMPATIBILITY.
683 * Proof terms: type substitutions on proof constants now use canonical
684 order of type variables. INCOMPATIBILITY for tools working with proof
687 * Raw axioms/defs may no longer carry sort constraints, and raw defs
688 may no longer carry premises. User-level specifications are
689 transformed accordingly by Thm.add_axiom/add_def.
694 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
695 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
696 proof terms are enabled unconditionally in the new HOL-Proofs image.
698 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
699 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
702 * Old lib/scripts/polyml-platform is superseded by the
703 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
704 variant, even on a 64 bit machine. The following example setting
705 prefers 64 bit if available:
707 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
709 * The preliminary Isabelle/jEdit application demonstrates the emerging
710 Isabelle/Scala layer for advanced prover interaction and integration.
711 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
714 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
715 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
716 similar to the default assignment of the document preparation system
717 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
718 provides some operations for direct access to the font without asking
719 the user for manual installation.
723 New in Isabelle2009-1 (December 2009)
724 -------------------------------------
728 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
729 one backslash should be used, even in ML sources.
734 * Locale interpretation propagates mixins along the locale hierarchy.
735 The currently only available mixins are the equations used to map
736 local definitions to terms of the target domain of an interpretation.
738 * Reactivated diagnostic command 'print_interps'. Use "print_interps
739 loc" to print all interpretations of locale "loc" in the theory.
740 Interpretations in proofs are not shown.
742 * Thoroughly revised locales tutorial. New section on conditional
745 * On instantiation of classes, remaining undefined class parameters
746 are formally declared. INCOMPATIBILITY.
749 *** Document preparation ***
751 * New generalized style concept for printing terms: @{foo (style) ...}
752 instead of @{foo_style style ...} (old form is still retained for
753 backward compatibility). Styles can be also applied for
754 antiquotations prop, term_type and typeof.
759 * New proof method "smt" for a combination of first-order logic with
760 equality, linear and nonlinear (natural/integer/real) arithmetic, and
761 fixed-size bitvectors; there is also basic support for higher-order
762 features (esp. lambda abstractions). It is an incomplete decision
763 procedure based on external SMT solvers using the oracle mechanism;
764 for the SMT solver Z3, this method is proof-producing. Certificates
765 are provided to avoid calling the external solvers solely for
766 re-checking proofs. Due to a remote SMT service there is no need for
767 installing SMT solvers locally. See src/HOL/SMT.
769 * New commands to load and prove verification conditions generated by
770 the Boogie program verifier or derived systems (e.g. the Verifying C
771 Compiler (VCC) or Spec#). See src/HOL/Boogie.
773 * New counterexample generator tool 'nitpick' based on the Kodkod
774 relational model finder. See src/HOL/Tools/Nitpick and
775 src/HOL/Nitpick_Examples.
777 * New commands 'code_pred' and 'values' to invoke the predicate
778 compiler and to enumerate values of inductive predicates.
780 * A tabled implementation of the reflexive transitive closure.
782 * New implementation of quickcheck uses generic code generator;
783 default generators are provided for all suitable HOL types, records
784 and datatypes. Old quickcheck can be re-activated importing theory
785 Library/SML_Quickcheck.
787 * New testing tool Mirabelle for automated proof tools. Applies
788 several tools and tactics like sledgehammer, metis, or quickcheck, to
789 every proof step in a theory. To be used in batch mode via the
792 * New proof method "sos" (sum of squares) for nonlinear real
793 arithmetic (originally due to John Harison). It requires theory
794 Library/Sum_Of_Squares. It is not a complete decision procedure but
795 works well in practice on quantifier-free real arithmetic with +, -,
796 *, ^, =, <= and <, i.e. boolean combinations of equalities and
797 inequalities between polynomials. It makes use of external
798 semidefinite programming solvers. Method "sos" generates a
799 certificate that can be pasted into the proof thus avoiding the need
800 to call an external tool every time the proof is checked. See
801 src/HOL/Library/Sum_Of_Squares.
803 * New method "linarith" invokes existing linear arithmetic decision
806 * New command 'atp_minimal' reduces result produced by Sledgehammer.
808 * New Sledgehammer option "Full Types" in Proof General settings menu.
809 Causes full type information to be output to the ATPs. This slows
810 ATPs down considerably but eliminates a source of unsound "proofs"
813 * New method "metisFT": A version of metis that uses full type
814 information in order to avoid failures of proof reconstruction.
816 * New evaluator "approximate" approximates an real valued term using
817 the same method as the approximation method.
819 * Method "approximate" now supports arithmetic expressions as
820 boundaries of intervals and implements interval splitting and Taylor
823 * ML antiquotation @{code_datatype} inserts definition of a datatype
824 generated by the code generator; e.g. see src/HOL/Predicate.thy.
826 * New theory SupInf of the supremum and infimum operators for sets of
829 * New theory Probability, which contains a development of measure
830 theory, eventually leading to Lebesgue integration and probability.
832 * Extended Multivariate Analysis to include derivation and Brouwer's
835 * Reorganization of number theory, INCOMPATIBILITY:
836 - new number theory development for nat and int, in theories Divides
837 and GCD as well as in new session Number_Theory
838 - some constants and facts now suffixed with _nat and _int
840 - former session NumberTheory now named Old_Number_Theory, including
841 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
842 - moved theory Pocklington from src/HOL/Library to
843 src/HOL/Old_Number_Theory
845 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
846 lcm of finite and infinite sets. It is shown that they form a complete
849 * Class semiring_div requires superclass no_zero_divisors and proof of
850 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
851 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
852 generalized to class semiring_div, subsuming former theorems
853 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
854 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
857 * Refinements to lattice classes and sets:
858 - less default intro/elim rules in locale variant, more default
859 intro/elim rules in class variant: more uniformity
860 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
862 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
864 - renamed ACI to inf_sup_aci
865 - new class "boolean_algebra"
866 - class "complete_lattice" moved to separate theory
867 "Complete_Lattice"; corresponding constants (and abbreviations)
868 renamed and with authentic syntax:
869 Set.Inf ~> Complete_Lattice.Inf
870 Set.Sup ~> Complete_Lattice.Sup
871 Set.INFI ~> Complete_Lattice.INFI
872 Set.SUPR ~> Complete_Lattice.SUPR
873 Set.Inter ~> Complete_Lattice.Inter
874 Set.Union ~> Complete_Lattice.Union
875 Set.INTER ~> Complete_Lattice.INTER
876 Set.UNION ~> Complete_Lattice.UNION
877 - authentic syntax for
880 - mere abbreviations:
883 Set.inter (for inf, formerly Set.Int)
884 Set.union (for sup, formerly Set.Un)
885 Complete_Lattice.Inter (for Inf)
886 Complete_Lattice.Union (for Sup)
887 Complete_Lattice.INTER (for INFI)
888 Complete_Lattice.UNION (for SUPR)
889 - object-logic definitions as far as appropriate
891 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
892 Un_subset_iff are explicitly deleted as default simp rules; then also
893 their lattice counterparts le_inf_iff and le_sup_iff have to be
894 deleted to achieve the desired effect.
896 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
897 rules by default any longer; the same applies to min_max.inf_absorb1
898 etc. INCOMPATIBILITY.
900 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
901 pred_set_conv by default. INCOMPATIBILITY.
903 * Power operations on relations and functions are now one dedicated
904 constant "compow" with infix syntax "^^". Power operation on
905 multiplicative monoids retains syntax "^" and is now defined generic
906 in class power. INCOMPATIBILITY.
908 * Relation composition "R O S" now has a more standard argument order:
909 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
910 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
911 break, since the O_assoc rule was not rewritten like this. Fix using
912 O_assoc[symmetric]. The same applies to the curried version "R OO S".
914 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
915 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
918 * Most rules produced by inductive and datatype package have mandatory
919 prefixes. INCOMPATIBILITY.
921 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
922 the attribute of the same name. Each of the theorems in the list
923 DERIV_intros assumes composition with an additional function and
924 matches a variable to the derivative, which has to be solved by the
925 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
926 of most elementary terms. Former Maclauren.DERIV_tac and
927 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
930 * Code generator attributes follow the usual underscore convention:
931 code_unfold replaces code unfold
932 code_post replaces code post
937 sizechange -> size_change
938 induct_scheme -> induction_schema
941 * Discontinued abbreviation "arbitrary" of constant "undefined".
942 INCOMPATIBILITY, use "undefined" directly.
945 Suc_eq_add_numeral_1 -> Suc_eq_plus1
946 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
947 Suc_plus1 -> Suc_eq_plus1
948 *anti_sym -> *antisym*
949 vector_less_eq_def -> vector_le_def
952 * Added theorem List.map_map as [simp]. Removed List.map_compose.
955 * Removed predicate "M hassize n" (<--> card M = n & finite M).
961 * Theory Representable defines a class "rep" of domains that are
962 representable (via an ep-pair) in the universal domain type "udom".
963 Instances are provided for all type constructors defined in HOLCF.
965 * The 'new_domain' command is a purely definitional version of the
966 domain package, for representable domains. Syntax is identical to the
967 old domain package. The 'new_domain' package also supports indirect
968 recursion using previously-defined type constructors. See
969 src/HOLCF/ex/New_Domain.thy for examples.
971 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
972 on the left-hand side of an equation, and then performs
973 simplification. Rewriting is done using rules declared with the
974 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
975 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
977 * The pattern-match compiler in 'fixrec' can now handle constructors
978 with HOL function types. Pattern-match combinators for the Pair
979 constructor are pre-configured.
981 * The 'fixrec' package now produces better fixed-point induction rules
982 for mutually-recursive definitions: Induction rules have conclusions
983 of the form "P foo bar" instead of "P <foo, bar>".
985 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
986 been renamed to "below". The name "below" now replaces "less" in many
987 theorem names. (Legacy theorem names using "less" are still supported
990 * The 'fixrec' package now supports "bottom patterns". Bottom
991 patterns can be used to generate strictness rules, or to make
992 functions more strict (much like the bang-patterns supported by the
993 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
999 * Support for Poly/ML 5.3.0, with improved reporting of compiler
1000 errors and run-time exceptions, including detailed source positions.
1002 * Structure Name_Space (formerly NameSpace) now manages uniquely
1003 identified entries, with some additional information such as source
1004 position, logical grouping etc.
1006 * Theory and context data is now introduced by the simplified and
1007 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1008 to be pure, but the old TheoryDataFun for mutable data (with explicit
1009 copy operation) is still available for some time.
1011 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1012 provides a high-level programming interface to synchronized state
1013 variables with atomic update. This works via pure function
1014 application within a critical section -- its runtime should be as
1015 short as possible; beware of deadlocks if critical code is nested,
1016 either directly or indirectly via other synchronized variables!
1018 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1019 wraps raw ML references, explicitly indicating their non-thread-safe
1020 behaviour. The Isar toplevel keeps this structure open, to
1021 accommodate Proof General as well as quick and dirty interactive
1022 experiments with references.
1024 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1025 parallel tactical reasoning.
1027 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1028 are similar to SUBPROOF, but are slightly more flexible: only the
1029 specified parts of the subgoal are imported into the context, and the
1030 body tactic may introduce new subgoals and schematic variables.
1032 * Old tactical METAHYPS, which does not observe the proof context, has
1033 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1034 or Subgoal.FOCUS etc.
1036 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1037 functors have their own ML name space there is no point to mark them
1038 separately.) Minor INCOMPATIBILITY.
1040 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1042 * Renamed several structures FooBar to Foo_Bar. Occasional,
1045 * Operations of structure Skip_Proof no longer require quick_and_dirty
1046 mode, which avoids critical setmp.
1048 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1049 combinators for "args". INCOMPATIBILITY, need to use simplified
1050 Attrib/Method.setup introduced in Isabelle2009.
1052 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1053 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1054 last resort. INCOMPATIBILITY.
1056 * Display.pretty_thm now requires a proper context (cf. former
1057 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1058 or even Display.pretty_thm_without_context as last resort.
1061 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1062 Syntax.pretty_typ/term directly, preferably with proper context
1063 instead of global theory.
1068 * Further fine tuning of parallel proof checking, scales up to 8 cores
1069 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1072 * Support for additional "Isabelle components" via etc/components, see
1073 also the system manual.
1075 * The isabelle makeall tool now operates on all components with
1076 IsaMakefile, not just hardwired "logics".
1078 * Removed "compress" option from isabelle-process and isabelle usedir;
1079 this is always enabled.
1081 * Discontinued support for Poly/ML 4.x versions.
1083 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1084 on a given logic image. This requires the lighttpd webserver and is
1085 currently supported on Linux only.
1089 New in Isabelle2009 (April 2009)
1090 --------------------------------
1094 * Simplified main Isabelle executables, with less surprises on
1095 case-insensitive file-systems (such as Mac OS).
1097 - The main Isabelle tool wrapper is now called "isabelle" instead of
1100 - The former "isabelle" alias for "isabelle-process" has been
1101 removed (should rarely occur to regular users).
1103 - The former "isabelle-interface" and its alias "Isabelle" have been
1104 removed (interfaces are now regular Isabelle tools).
1106 Within scripts and make files, the Isabelle environment variables
1107 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1108 respectively. (The latter are still available as legacy feature.)
1110 The old isabelle-interface wrapper could react in confusing ways if
1111 the interface was uninstalled or changed otherwise. Individual
1112 interface tool configuration is now more explicit, see also the
1113 Isabelle system manual. In particular, Proof General is now available
1114 via "isabelle emacs".
1116 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1117 purge installed copies of Isabelle executables and re-run "isabelle
1118 install -p ...", or use symlinks.
1120 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1121 old ~/isabelle, which was slightly non-standard and apt to cause
1122 surprises on case-insensitive file-systems (such as Mac OS).
1124 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1125 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1126 care is required when using older releases of Isabelle. Note that
1127 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1128 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1130 * Proofs of fully specified statements are run in parallel on
1131 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1132 a regular 4-core machine, if the initial heap space is made reasonably
1133 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1135 * The main reference manuals ("isar-ref", "implementation", and
1136 "system") have been updated and extended. Formally checked references
1137 as hyperlinks are now available uniformly.
1142 * Complete re-implementation of locales. INCOMPATIBILITY in several
1143 respects. The most important changes are listed below. See the
1144 Tutorial on Locales ("locales" manual) for details.
1146 - In locale expressions, instantiation replaces renaming. Parameters
1147 must be declared in a for clause. To aid compatibility with previous
1148 parameter inheritance, in locale declarations, parameters that are not
1149 'touched' (instantiation position "_" or omitted) are implicitly added
1150 with their syntax at the beginning of the for clause.
1152 - Syntax from abbreviations and definitions in locales is available in
1153 locale expressions and context elements. The latter is particularly
1154 useful in locale declarations.
1156 - More flexible mechanisms to qualify names generated by locale
1157 expressions. Qualifiers (prefixes) may be specified in locale
1158 expressions, and can be marked as mandatory (syntax: "name!:") or
1159 optional (syntax "name?:"). The default depends for plain "name:"
1160 depends on the situation where a locale expression is used: in
1161 commands 'locale' and 'sublocale' prefixes are optional, in
1162 'interpretation' and 'interpret' prefixes are mandatory. The old
1163 implicit qualifiers derived from the parameter names of a locale are
1164 no longer generated.
1166 - Command "sublocale l < e" replaces "interpretation l < e". The
1167 instantiation clause in "interpretation" and "interpret" (square
1168 brackets) is no longer available. Use locale expressions.
1170 - When converting proof scripts, mandatory qualifiers in
1171 'interpretation' and 'interpret' should be retained by default, even
1172 if this is an INCOMPATIBILITY compared to former behavior. In the
1173 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1174 in locale expressions range over a single locale instance only.
1176 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1177 In existing theorem specifications replace the includes element by the
1178 respective context elements of the included locale, omitting those
1179 that are already present in the theorem specification. Multiple
1180 assume elements of a locale should be replaced by a single one
1181 involving the locale predicate. In the proof body, declarations (most
1182 notably theorems) may be regained by interpreting the respective
1183 locales in the proof context as required (command "interpret").
1185 If using "includes" in replacement of a target solely because the
1186 parameter types in the theorem are not as general as in the target,
1187 consider declaring a new locale with additional type constraints on
1188 the parameters (context element "constrains").
1190 - Discontinued "locale (open)". INCOMPATIBILITY.
1192 - Locale interpretation commands no longer attempt to simplify goal.
1193 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1194 methods intro_locales and unfold_locales to clarify.
1196 - Locale interpretation commands no longer accept interpretation
1197 attributes. INCOMPATIBILITY.
1199 * Class declaration: so-called "base sort" must not be given in import
1200 list any longer, but is inferred from the specification. Particularly
1207 class foo = type + ...
1209 * Class target: global versions of theorems stemming do not carry a
1210 parameter prefix any longer. INCOMPATIBILITY.
1212 * Class 'instance' command no longer accepts attached definitions.
1213 INCOMPATIBILITY, use proper 'instantiation' target instead.
1215 * Recovered hiding of consts, which was accidentally broken in
1216 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1217 makes c inaccessible; consider using ``hide (open) const c'' instead.
1219 * Slightly more coherent Pure syntax, with updated documentation in
1220 isar-ref manual. Removed locales meta_term_syntax and
1221 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1222 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1223 directly in regular applications.
1225 * There is a new syntactic category "float_const" for signed decimal
1226 fractions (e.g. 123.45 or -123.45).
1228 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1229 interface with 'setup' command instead.
1231 * Command 'local_setup' is similar to 'setup', but operates on a local
1234 * The 'axiomatization' command now only works within a global theory
1235 context. INCOMPATIBILITY.
1237 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1238 hypotheses. Sorts required in the course of reasoning need to be
1239 covered by the constraints in the initial statement, completed by the
1240 type instance information of the background theory. Non-trivial sort
1241 hypotheses, which rarely occur in practice, may be specified via
1242 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1244 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1246 The result contains an implicit sort hypotheses as before --
1247 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1250 * Generalized Isar history, with support for linear undo, direct state
1253 * Changed defaults for unify configuration options:
1255 unify_trace_bound = 50 (formerly 25)
1256 unify_search_bound = 60 (formerly 30)
1258 * Different bookkeeping for code equations (INCOMPATIBILITY):
1260 a) On theory merge, the last set of code equations for a particular
1261 constant is taken (in accordance with the policy applied by other
1262 parts of the code generator framework).
1264 b) Code equations stemming from explicit declarations (e.g. code
1265 attribute) gain priority over default code equations stemming
1266 from definition, primrec, fun etc.
1268 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1270 * Unified theorem tables for both code generators. Thus [code
1271 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1273 * Command 'find_consts' searches for constants based on type and name
1276 find_consts "_ => bool"
1278 By default, matching is against subtypes, but it may be restricted to
1279 the whole type. Searching by name is possible. Multiple queries are
1280 conjunctive and queries may be negated by prefixing them with a
1283 find_consts strict: "_ => bool" name: "Int" -"int => int"
1285 * New 'find_theorems' criterion "solves" matches theorems that
1286 directly solve the current goal (modulo higher-order unification).
1288 * Auto solve feature for main theorem statements: whenever a new goal
1289 is stated, "find_theorems solves" is called; any theorems that could
1290 solve the lemma directly are listed as part of the goal state.
1291 Cf. associated options in Proof General Isabelle settings menu,
1292 enabled by default, with reasonable timeout for pathological cases of
1293 higher-order unification.
1296 *** Document preparation ***
1298 * Antiquotation @{lemma} now imitates a regular terminal proof,
1299 demanding keyword 'by' and supporting the full method expression
1300 syntax just like the Isar command 'by'.
1305 * Integrated main parts of former image HOL-Complex with HOL. Entry
1306 points Main and Complex_Main remain as before.
1308 * Logic image HOL-Plain provides a minimal HOL with the most important
1309 tools available (inductive, datatype, primrec, ...). This facilitates
1310 experimentation and tool development. Note that user applications
1311 (and library theories) should never refer to anything below theory
1314 * Logic image HOL-Main stops at theory Main, and thus facilitates
1315 experimentation due to shorter build times.
1317 * Logic image HOL-NSA contains theories of nonstandard analysis which
1318 were previously part of former HOL-Complex. Entry point Hyperreal
1319 remains valid, but theories formerly using Complex_Main should now use
1320 new entry point Hypercomplex.
1322 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1323 Posix processes. Avoids potentially expensive forking of the ML
1324 process. New thread-based implementation also works on non-Unix
1325 platforms (Cygwin). Provers are no longer hardwired, but defined
1326 within the theory via plain ML wrapper functions. Basic Sledgehammer
1327 commands are covered in the isar-ref manual.
1329 * Wrapper scripts for remote SystemOnTPTP service allows to use
1330 sledgehammer without local ATP installation (Vampire etc.). Other
1331 provers may be included via suitable ML wrappers, see also
1332 src/HOL/ATP_Linkup.thy.
1334 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1337 * The metis method no longer fails because the theorem is too trivial
1338 (contains the empty clause).
1340 * The metis method now fails in the usual manner, rather than raising
1341 an exception, if it determines that it cannot prove the theorem.
1343 * Method "coherent" implements a prover for coherent logic (see also
1344 src/Tools/coherent.ML).
1346 * Constants "undefined" and "default" replace "arbitrary". Usually
1347 "undefined" is the right choice to replace "arbitrary", though
1348 logically there is no difference. INCOMPATIBILITY.
1350 * Command "value" now integrates different evaluation mechanisms. The
1351 result of the first successful evaluation mechanism is printed. In
1352 square brackets a particular named evaluation mechanisms may be
1353 specified (currently, [SML], [code] or [nbe]). See further
1354 src/HOL/ex/Eval_Examples.thy.
1356 * Normalization by evaluation now allows non-leftlinear equations.
1357 Declare with attribute [code nbe].
1359 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1360 as the structured Isar versions "cases" and "induct", cf. the
1361 corresponding "cases" and "induct" attributes. Mutual induction rules
1362 are now presented as a list of individual projections
1363 (e.g. foo_bar.inducts for types foo and bar); the old format with
1364 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1365 rare situations a different rule is selected --- notably nested tuple
1366 elimination instead of former prod.exhaust: use explicit (case_tac t
1367 rule: prod.exhaust) here.
1369 * Attributes "cases", "induct", "coinduct" support "del" option.
1371 * Removed fact "case_split_thm", which duplicates "case_split".
1373 * The option datatype has been moved to a new theory Option. Renamed
1374 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1376 * New predicate "strict_mono" classifies strict functions on partial
1377 orders. With strict functions on linear orders, reasoning about
1378 (in)equalities is facilitated by theorems "strict_mono_eq",
1379 "strict_mono_less_eq" and "strict_mono_less".
1381 * Some set operations are now proper qualified constants with
1382 authentic syntax. INCOMPATIBILITY:
1393 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1396 * Auxiliary class "itself" has disappeared -- classes without any
1397 parameter are treated as expected by the 'class' command.
1399 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1401 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1402 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1404 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1405 method "approximation". It proves formulas on real values by using
1406 interval arithmetic. In the formulas are also the transcendental
1407 functions sin, cos, tan, atan, ln, exp and the constant pi are
1408 allowed. For examples see
1409 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1411 * Theory "Reflection" now resides in HOL/Library.
1413 * Entry point to Word library now simply named "Word".
1416 * Made source layout more coherent with logical distribution
1419 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1420 src/HOL/Library/Code_Message.thy ~> src/HOL/
1421 src/HOL/Library/GCD.thy ~> src/HOL/
1422 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1423 src/HOL/Library/Parity.thy ~> src/HOL/
1424 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1425 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1426 src/HOL/Real/Lubs.thy ~> src/HOL/
1427 src/HOL/Real/PReal.thy ~> src/HOL/
1428 src/HOL/Real/Rational.thy ~> src/HOL/
1429 src/HOL/Real/RComplete.thy ~> src/HOL/
1430 src/HOL/Real/RealDef.thy ~> src/HOL/
1431 src/HOL/Real/RealPow.thy ~> src/HOL/
1432 src/HOL/Real/Real.thy ~> src/HOL/
1433 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1434 src/HOL/Complex/Complex.thy ~> src/HOL/
1435 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1436 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1437 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1438 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1439 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1440 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1441 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1442 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1443 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1444 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1445 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1446 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1447 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1448 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1449 src/HOL/Real/Float ~> src/HOL/Library/
1450 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1451 src/HOL/Real/RealVector.thy ~> src/HOL/
1453 src/HOL/arith_data.ML ~> src/HOL/Tools
1454 src/HOL/hologic.ML ~> src/HOL/Tools
1455 src/HOL/simpdata.ML ~> src/HOL/Tools
1456 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1457 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1458 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1459 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1460 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1461 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1462 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1464 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1465 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1466 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1467 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1468 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1469 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1471 * If methods "eval" and "evaluation" encounter a structured proof
1472 state with !!/==>, only the conclusion is evaluated to True (if
1473 possible), avoiding strange error messages.
1475 * Method "sizechange" automates termination proofs using (a
1476 modification of) the size-change principle. Requires SAT solver. See
1477 src/HOL/ex/Termination.thy for examples.
1479 * Simplifier: simproc for let expressions now unfolds if bound
1480 variable occurs at most once in let expression body. INCOMPATIBILITY.
1482 * Method "arith": Linear arithmetic now ignores all inequalities when
1483 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1485 * New attribute "arith" for facts that should always be used
1486 automatically by arithmetic. It is intended to be used locally in
1489 assumes [arith]: "x > 0"
1491 Global usage is discouraged because of possible performance impact.
1493 * New classes "top" and "bot" with corresponding operations "top" and
1494 "bot" in theory Orderings; instantiation of class "complete_lattice"
1495 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1497 * Changed definition lemma "less_fun_def" in order to provide an
1498 instance for preorders on functions; use lemma "less_le" instead.
1501 * Theory Orderings: class "wellorder" moved here, with explicit
1502 induction rule "less_induct" as assumption. For instantiation of
1503 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1506 * Theory Orderings: added class "preorder" as superclass of "order".
1507 INCOMPATIBILITY: Instantiation proofs for order, linorder
1508 etc. slightly changed. Some theorems named order_class.* now named
1511 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1514 * Theory Finite_Set: added a new fold combinator of type
1516 ('a => 'b => 'b) => 'b => 'a set => 'b
1518 Occasionally this is more convenient than the old fold combinator
1519 which is now defined in terms of the new one and renamed to
1522 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1523 and "ring_simps" have been replaced by "algebra_simps" (which can be
1524 extended with further lemmas!). At the moment both still exist but
1525 the former will disappear at some point.
1527 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1528 class recpower. Type-specific simp rules for various recpower types
1529 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1531 rat_power_0 -> power_0
1532 rat_power_Suc -> power_Suc
1533 realpow_0 -> power_0
1534 realpow_Suc -> power_Suc
1535 complexpow_0 -> power_0
1536 complexpow_Suc -> power_Suc
1537 power_poly_0 -> power_0
1538 power_poly_Suc -> power_Suc
1540 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1541 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1542 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1543 of lemmas from Divides has been generalized from nat to class
1544 semiring_div. INCOMPATIBILITY. This involves the following theorem
1545 renames resulting from duplicate elimination:
1547 dvd_def_mod ~> dvd_eq_mod_eq_0
1548 zero_dvd_iff ~> dvd_0_left_iff
1549 dvd_0 ~> dvd_0_right
1550 DIVISION_BY_ZERO_DIV ~> div_by_0
1551 DIVISION_BY_ZERO_MOD ~> mod_by_0
1552 mult_div ~> div_mult_self2_is_id
1553 mult_mod ~> mod_mult_self2_is_0
1555 * Theory IntDiv: removed many lemmas that are instances of class-based
1556 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1557 rename old lemmas as follows:
1559 dvd_diff -> nat_dvd_diff
1560 dvd_zminus_iff -> dvd_minus_iff
1561 mod_add1_eq -> mod_add_eq
1562 mod_mult1_eq -> mod_mult_right_eq
1563 mod_mult1_eq' -> mod_mult_left_eq
1564 mod_mult_distrib_mod -> mod_mult_eq
1565 nat_mod_add_left_eq -> mod_add_left_eq
1566 nat_mod_add_right_eq -> mod_add_right_eq
1567 nat_mod_div_trivial -> mod_div_trivial
1568 nat_mod_mod_trivial -> mod_mod_trivial
1569 zdiv_zadd_self1 -> div_add_self1
1570 zdiv_zadd_self2 -> div_add_self2
1571 zdiv_zmult_self1 -> div_mult_self2_is_id
1572 zdiv_zmult_self2 -> div_mult_self1_is_id
1573 zdvd_triv_left -> dvd_triv_left
1574 zdvd_triv_right -> dvd_triv_right
1575 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1576 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1577 zmod_zadd_left_eq -> mod_add_left_eq
1578 zmod_zadd_right_eq -> mod_add_right_eq
1579 zmod_zadd_self1 -> mod_add_self1
1580 zmod_zadd_self2 -> mod_add_self2
1581 zmod_zadd1_eq -> mod_add_eq
1582 zmod_zdiff1_eq -> mod_diff_eq
1583 zmod_zdvd_zmod -> mod_mod_cancel
1584 zmod_zmod_cancel -> mod_mod_cancel
1585 zmod_zmult_self1 -> mod_mult_self2_is_0
1586 zmod_zmult_self2 -> mod_mult_self1_is_0
1589 zdvd_abs1 -> abs_dvd_iff
1590 zdvd_abs2 -> dvd_abs_iff
1591 zdvd_refl -> dvd_refl
1592 zdvd_trans -> dvd_trans
1593 zdvd_zadd -> dvd_add
1594 zdvd_zdiff -> dvd_diff
1595 zdvd_zminus_iff -> dvd_minus_iff
1596 zdvd_zminus2_iff -> minus_dvd_iff
1597 zdvd_zmultD -> dvd_mult_right
1598 zdvd_zmultD2 -> dvd_mult_left
1599 zdvd_zmult_mono -> mult_dvd_mono
1600 zdvd_0_right -> dvd_0_right
1601 zdvd_0_left -> dvd_0_left_iff
1602 zdvd_1_left -> one_dvd
1603 zminus_dvd_iff -> minus_dvd_iff
1605 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1607 * The real numbers offer decimal input syntax: 12.34 is translated
1608 into 1234/10^2. This translation is not reversed upon output.
1610 * Theory Library/Polynomial defines an abstract type 'a poly of
1611 univariate polynomials with coefficients of type 'a. In addition to
1612 the standard ring operations, it also supports div and mod. Code
1613 generation is also supported, using list-style constructors.
1615 * Theory Library/Inner_Product defines a class of real_inner for real
1616 inner product spaces, with an overloaded operation inner :: 'a => 'a
1617 => real. Class real_inner is a subclass of real_normed_vector from
1620 * Theory Library/Product_Vector provides instances for the product
1621 type 'a * 'b of several classes from RealVector and Inner_Product.
1622 Definitions of addition, subtraction, scalar multiplication, norms,
1623 and inner products are included.
1625 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1626 addition to the field operations, numerals and case syntax are also
1629 * Theory Library/Diagonalize provides constructive version of Cantor's
1630 first diagonalization argument.
1632 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1633 zlcm (for int); carried together from various gcd/lcm developements in
1634 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1635 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1636 may recover tupled syntax as follows:
1638 hide (open) const gcd
1639 abbreviation gcd where
1640 "gcd == (%(a, b). GCD.gcd a b)"
1642 GCD.gcd ("gcd '(_, _')")
1644 The same works for lcm, zgcd, zlcm.
1646 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1647 instantiations for algebraic structures. Removed some duplicate
1648 theorems. Changes in simp rules. INCOMPATIBILITY.
1650 * ML antiquotation @{code} takes a constant as argument and generates
1651 corresponding code in background and inserts name of the corresponding
1652 resulting ML value/function/datatype constructor binding in place.
1653 All occurrences of @{code} with a single ML block are generated
1654 simultaneously. Provides a generic and safe interface for
1655 instrumentalizing code generation. See
1656 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1657 In future you ought to refrain from ad-hoc compiling generated SML
1658 code on the ML toplevel. Note that (for technical reasons) @{code}
1659 cannot refer to constants for which user-defined serializations are
1660 set. Refer to the corresponding ML counterpart directly in that
1663 * Command 'rep_datatype': instead of theorem names the command now
1664 takes a list of terms denoting the constructors of the type to be
1665 represented as datatype. The characteristic theorems have to be
1666 proven. INCOMPATIBILITY. Also observe that the following theorems
1667 have disappeared in favour of existing ones:
1669 unit_induct ~> unit.induct
1670 prod_induct ~> prod.induct
1671 sum_induct ~> sum.induct
1672 Suc_Suc_eq ~> nat.inject
1673 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1678 * New locales for orders and lattices where the equivalence relation
1679 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1680 locales use a record structure with field eq for the equivalence.
1682 * New theory of factorial domains.
1684 * Units_l_inv and Units_r_inv are now simp rules by default.
1685 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1686 and/or r_inv will now also require deletion of these lemmas.
1688 * Renamed the following theorems, INCOMPATIBILITY:
1690 UpperD ~> Upper_memD
1691 LowerD ~> Lower_memD
1692 least_carrier ~> least_closed
1693 greatest_carrier ~> greatest_closed
1694 greatest_Lower_above ~> greatest_Lower_below
1695 one_zero ~> carrier_one_zero
1696 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1701 * Nominal datatypes can now contain type-variables.
1703 * Commands 'nominal_inductive' and 'equivariance' work with local
1706 * Nominal primrec can now works with local theory targets and its
1707 specification syntax now conforms to the general format as seen in
1710 * Method "perm_simp" honours the standard simplifier attributes
1711 (no_asm), (no_asm_use) etc.
1713 * The new predicate #* is defined like freshness, except that on the
1714 left hand side can be a set or list of atoms.
1716 * Experimental command 'nominal_inductive2' derives strong induction
1717 principles for inductive definitions. In contrast to
1718 'nominal_inductive', which can only deal with a fixed number of
1719 binders, it can deal with arbitrary expressions standing for sets of
1720 atoms to be avoided. The only inductive definition we have at the
1721 moment that needs this generalisation is the typing rule for Lets in
1724 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1725 -----------------------------------------------------------------
1726 Gamma |- Let x be t1 in t2 : T2
1728 In this rule one wants to avoid all the binders that are introduced by
1729 "close Gamma T1". We are looking for other examples where this
1730 feature might be useful. Please let us know.
1735 * Reimplemented the simplification procedure for proving continuity
1736 subgoals. The new simproc is extensible; users can declare additional
1737 continuity introduction rules with the attribute [cont2cont].
1739 * The continuity simproc now uses a different introduction rule for
1740 solving continuity subgoals on terms with lambda abstractions. In
1741 some rare cases the new simproc may fail to solve subgoals that the
1742 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1743 Potential INCOMPATIBILITY.
1745 * Command 'fixrec': specification syntax now conforms to the general
1746 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1747 examples. INCOMPATIBILITY.
1752 * Proof of Zorn's Lemma for partial orders.
1757 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1758 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1759 depends on multithreading, so timouts will not work before Poly/ML
1762 * High-level support for concurrent ML programming, see
1763 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1764 particularly convenient to organize independent functional
1765 computations. The concept of "synchronized variables" provides a
1766 higher-order interface for components with shared state, avoiding the
1767 delicate details of mutexes and condition variables. (Requires
1768 Poly/ML 5.2.1 or later.)
1770 * ML bindings produced via Isar commands are stored within the Isar
1771 context (theory or proof). Consequently, commands like 'use' and 'ML'
1772 become thread-safe and work with undo as expected (concerning
1773 top-level bindings, not side-effects on global references).
1774 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1775 compiler at runtime; really global bindings need to be given outside a
1776 theory. (Requires Poly/ML 5.2 or later.)
1778 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1779 context. Top-level ML bindings are stored within the proof context in
1780 a purely sequential fashion, disregarding the nested proof structure.
1781 ML bindings introduced by 'ML_prf' are discarded at the end of the
1782 proof. (Requires Poly/ML 5.2 or later.)
1784 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1785 and Method.setup, as well as Isar commands 'attribute_setup' and
1786 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1787 existing code accordingly, or use plain 'setup' together with old
1790 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1791 to 'a -> thm, while results are always tagged with an authentic oracle
1792 name. The Isar command 'oracle' is now polymorphic, no argument type
1793 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1794 accordingly. Note that extra performance may be gained by producing
1795 the cterm carefully, avoiding slow Thm.cterm_of.
1797 * Simplified interface for defining document antiquotations via
1798 ThyOutput.antiquotation, ThyOutput.output, and optionally
1799 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1800 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1803 * More systematic treatment of long names, abstract name bindings, and
1804 name space operations. Basic operations on qualified names have been
1805 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1806 Long_Name.append. Old type bstring has been mostly replaced by
1807 abstract type binding (see structure Binding), which supports precise
1808 qualification by packages and local theory targets, as well as proper
1809 tracking of source positions. INCOMPATIBILITY, need to wrap old
1810 bstring values into Binding.name, or better pass through abstract
1811 bindings everywhere. See further src/Pure/General/long_name.ML,
1812 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1814 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1815 LocalTheory.note etc.) now refer to the *full* internal name, not the
1816 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1818 * Disposed old type and term read functions (Sign.read_def_typ,
1819 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1820 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1821 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1822 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1823 resort for legacy applications.
1825 * Disposed old declarations, tactics, tactic combinators that refer to
1826 the simpset or claset of an implicit theory (such as Addsimps,
1827 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1828 embedded ML text, or local_simpset_of with a proper context passed as
1829 explicit runtime argument.
1831 * Rules and tactics that read instantiations (read_instantiate,
1832 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1833 context, which is required for parsing and type-checking. Moreover,
1834 the variables are specified as plain indexnames, not string encodings
1835 thereof. INCOMPATIBILITY.
1837 * Generic Toplevel.add_hook interface allows to analyze the result of
1838 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1839 for theorem dependency output of transactions resulting in a new
1842 * ML antiquotations: block-structured compilation context indicated by
1843 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1845 @{binding name} - basic name binding
1846 @{let ?pat = term} - term abbreviation (HO matching)
1847 @{note name = fact} - fact abbreviation
1848 @{thm fact} - singleton fact (with attributes)
1849 @{thms fact} - general fact (with attributes)
1850 @{lemma prop by method} - singleton goal
1851 @{lemma prop by meth1 meth2} - singleton goal
1852 @{lemma prop1 ... propN by method} - general goal
1853 @{lemma prop1 ... propN by meth1 meth2} - general goal
1854 @{lemma (open) ...} - open derivation
1859 * The Isabelle "emacs" tool provides a specific interface to invoke
1860 Proof General / Emacs, with more explicit failure if that is not
1861 installed (the old isabelle-interface script silently falls back on
1862 isabelle-process). The PROOFGENERAL_HOME setting determines the
1863 installation location of the Proof General distribution.
1865 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1866 the Isabelle process into a JVM/Scala application. See
1867 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1868 process wrapper has been discontinued.)
1870 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1872 * Various status messages (with exact source position information) are
1873 emitted, if proper markup print mode is enabled. This allows
1874 user-interface components to provide detailed feedback on internal
1879 New in Isabelle2008 (June 2008)
1880 -------------------------------
1884 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1885 and updated, with formally checked references as hyperlinks.
1887 * Theory loader: use_thy (and similar operations) no longer set the
1888 implicit ML context, which was occasionally hard to predict and in
1889 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1890 provides a proper context already.
1892 * Theory loader: old-style ML proof scripts being *attached* to a thy
1893 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1894 'use' within a theory file will do the job.
1896 * Name space merge now observes canonical order, i.e. the second space
1897 is inserted into the first one, while existing entries in the first
1898 space take precedence. INCOMPATIBILITY in rare situations, may try to
1899 swap theory imports.
1901 * Syntax: symbol \<chi> is now considered a letter. Potential
1902 INCOMPATIBILITY in identifier syntax etc.
1904 * Outer syntax: string tokens no longer admit escaped white space,
1905 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1906 white space without escapes.
1908 * Outer syntax: string tokens may contain arbitrary character codes
1909 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1915 * Context-dependent token translations. Default setup reverts locally
1916 fixed variables, and adds hilite markup for undeclared frees.
1918 * Unused theorems can be found using the new command 'unused_thms'.
1919 There are three ways of invoking it:
1922 Only finds unused theorems in the current theory.
1924 (2) unused_thms thy_1 ... thy_n -
1925 Finds unused theorems in the current theory and all of its ancestors,
1926 excluding the theories thy_1 ... thy_n and all of their ancestors.
1928 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1929 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1930 their ancestors, excluding the theories thy_1 ... thy_n and all of
1933 In order to increase the readability of the list produced by
1934 unused_thms, theorems that have been created by a particular instance
1935 of a theory command such as 'inductive' or 'function' are considered
1936 to belong to the same "group", meaning that if at least one theorem in
1937 this group is used, the other theorems in the same group are no longer
1938 reported as unused. Moreover, if all theorems in the group are
1939 unused, only one theorem in the group is displayed.
1941 Note that proof objects have to be switched on in order for
1942 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1943 usually the case when using Proof General with the default settings).
1945 * Authentic naming of facts disallows ad-hoc overwriting of previous
1946 theorems within the same name space. INCOMPATIBILITY, need to remove
1947 duplicate fact bindings, or even accidental fact duplications. Note
1948 that tools may maintain dynamically scoped facts systematically, using
1949 PureThy.add_thms_dynamic.
1951 * Command 'hide' now allows to hide from "fact" name space as well.
1953 * Eliminated destructive theorem database, simpset, claset, and
1954 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1955 update of theories within ML code.
1957 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1958 INCOMPATIBILITY, object-logics depending on former Pure require
1959 additional setup PureThy.old_appl_syntax_setup; object-logics
1960 depending on former CPure need to refer to Pure.
1962 * Commands 'use' and 'ML' are now purely functional, operating on
1963 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1964 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1967 * Command 'setup': discontinued implicit version with ML reference.
1969 * Instantiation target allows for simultaneous specification of class
1970 instance operations together with an instantiation proof.
1971 Type-checking phase allows to refer to class operations uniformly.
1972 See src/HOL/Complex/Complex.thy for an Isar example and
1973 src/HOL/Library/Eval.thy for an ML example.
1975 * Indexing of literal facts: be more serious about including only
1976 facts from the visible specification/proof context, but not the
1977 background context (locale etc.). Affects `prop` notation and method
1978 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1981 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1982 "(open)" option, which used to expose internal bound variables to the
1985 * Isar statements: removed obsolete case "rule_context".
1986 INCOMPATIBILITY, better use explicit fixes/assumes.
1988 * Locale proofs: default proof step now includes 'unfold_locales';
1989 hence 'proof' without argument may be used to unfold locale
1993 *** Document preparation ***
1995 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1996 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1997 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1998 spot); renamed link color from "darkblue" to "linkcolor" (default
1999 value unchanged, can be redefined via \definecolor); no longer sets
2000 "a4paper" option (unnecessary or even intrusive).
2002 * Antiquotation @{lemma A method} proves proposition A by the given
2003 method (either a method name or a method name plus (optional) method
2004 arguments in parentheses) and prints A just like @{prop A}.
2009 * New primrec package. Specification syntax conforms in style to
2010 definition/function/.... No separate induction rule is provided. The
2011 "primrec" command distinguishes old-style and new-style specifications
2012 by syntax. The former primrec package is now named OldPrimrecPackage.
2013 When adjusting theories, beware: constants stemming from new-style
2014 primrec specifications have authentic syntax.
2016 * Metis prover is now an order of magnitude faster, and also works
2017 with multithreading.
2019 * Metis: the maximum number of clauses that can be produced from a
2020 theorem is now given by the attribute max_clauses. Theorems that
2021 exceed this number are ignored, with a warning printed.
2023 * Sledgehammer no longer produces structured proofs by default. To
2024 enable, declare [[sledgehammer_full = true]]. Attributes
2025 reconstruction_modulus, reconstruction_sorts renamed
2026 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2028 * Method "induct_scheme" derives user-specified induction rules
2029 from well-founded induction and completeness of patterns. This factors
2030 out some operations that are done internally by the function package
2031 and makes them available separately. See
2032 src/HOL/ex/Induction_Scheme.thy for examples.
2034 * More flexible generation of measure functions for termination
2035 proofs: Measure functions can be declared by proving a rule of the
2036 form "is_measure f" and giving it the [measure_function] attribute.
2037 The "is_measure" predicate is logically meaningless (always true), and
2038 just guides the heuristic. To find suitable measure functions, the
2039 termination prover sets up the goal "is_measure ?f" of the appropriate
2040 type and generates all solutions by prolog-style backwards proof using
2043 This setup also deals with rules like
2045 "is_measure f ==> is_measure (list_size f)"
2047 which accommodates nested datatypes that recurse through lists.
2048 Similar rules are predeclared for products and option types.
2050 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2054 - Definitions of overloaded constants on sets have to be replaced by
2055 definitions on => and bool.
2057 - Some definitions of overloaded operators on sets can now be proved
2058 using the definitions of the operators on => and bool. Therefore,
2059 the following theorems have been renamed:
2061 subset_def -> subset_eq
2062 psubset_def -> psubset_eq
2063 set_diff_def -> set_diff_eq
2064 Compl_def -> Compl_eq
2065 Sup_set_def -> Sup_set_eq
2066 Inf_set_def -> Inf_set_eq
2067 sup_set_def -> sup_set_eq
2068 inf_set_def -> inf_set_eq
2070 - Due to the incompleteness of the HO unification algorithm, some
2071 rules such as subst may require manual instantiation, if some of
2072 the unknowns in the rule is a set.
2074 - Higher order unification and forward proofs:
2077 have "P (S::'a set)" <...>
2078 then have "EX S. P S" ..
2080 no longer works (due to the incompleteness of the HO unification
2081 algorithm) and must be replaced by the pattern
2088 - Calculational reasoning with subst (or similar rules):
2091 have "P (S::'a set)" <...>
2092 also have "S = T" <...>
2093 finally have "P T" .
2095 no longer works (for similar reasons as the previous example) and
2096 must be replaced by something like
2098 have "P (S::'a set)" <...>
2099 moreover have "S = T" <...>
2100 ultimately have "P T" by simp
2102 - Tactics or packages written in ML code:
2103 Code performing pattern matching on types via
2105 Type ("set", [T]) => ...
2107 must be rewritten. Moreover, functions like strip_type or
2108 binder_types no longer return the right value when applied to a
2111 T1 => ... => Tn => U => bool
2115 T1 => ... => Tn => U set
2117 * Merged theories Wellfounded_Recursion, Accessible_Part and
2118 Wellfounded_Relations to theory Wellfounded.
2120 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2122 * Class finite no longer treats UNIV as class parameter. Use class
2123 enum from theory Library/Enum instead to achieve a similar effect.
2126 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2127 and "Cons". INCOMPATIBILITY.
2129 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2130 Potential INCOMPATIBILITY.
2132 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2133 injective_fst_snd removed, use split_eta and prod_eqI instead.
2134 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2136 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2137 the same name in theory Orderings:
2147 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2148 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2149 and different variable names.
2151 * Library/Option_ord.thy: Canonical order on option type.
2153 * Library/RBT.thy: Red-black trees, an efficient implementation of
2156 * Library/Countable.thy: Type class for countable types.
2158 * Theory Int: The representation of numerals has changed. The infix
2159 operator BIT and the bit datatype with constructors B0 and B1 have
2160 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2161 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2162 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2165 * Theory Nat: definition of <= and < on natural numbers no longer
2166 depend on well-founded relations. INCOMPATIBILITY. Definitions
2167 le_def and less_def have disappeared. Consider lemmas not_less
2168 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2170 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2171 (whose purpose mainly is for various fold_set functionals) have been
2172 abandoned in favor of the existing algebraic classes
2173 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2174 lower_semilattice (resp. upper_semilattice) and linorder.
2177 * Theory Transitive_Closure: induct and cases rules now declare proper
2178 case_names ("base" and "step"). INCOMPATIBILITY.
2180 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2181 lattices. The form set-specific version is available as
2182 Inductive.lfp_ordinal_induct_set.
2184 * Renamed theorems "power.simps" to "power_int.simps".
2187 * Class semiring_div provides basic abstract properties of semirings
2188 with division and modulo operations. Subsumes former class dvd_mod.
2190 * Merged theories IntDef, Numeral and IntArith into unified theory
2191 Int. INCOMPATIBILITY.
2193 * Theory Library/Code_Index: type "index" now represents natural
2194 numbers rather than integers. INCOMPATIBILITY.
2196 * New class "uminus" with operation "uminus" (split of from class
2197 "minus" which now only has operation "minus", binary).
2200 * Constants "card", "internal_split", "option_map" now with authentic
2201 syntax. INCOMPATIBILITY.
2203 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2204 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2205 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2206 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2207 Sup_set_def, le_def, less_def, option_map_def now with object
2208 equality. INCOMPATIBILITY.
2210 * Records. Removed K_record, and replaced it by pure lambda term
2211 %x. c. The simplifier setup is now more robust against eta expansion.
2212 INCOMPATIBILITY: in cases explicitly referring to K_record.
2214 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2216 * Library/ListVector: new theory of arithmetic vector operations.
2218 * Library/Order_Relation: new theory of various orderings as sets of
2219 pairs. Defines preorders, partial orders, linear orders and
2220 well-orders on sets and on types.
2225 * Renamed some theories to allow to loading both ZF and HOL in the
2228 Datatype -> Datatype_ZF
2229 Inductive -> Inductive_ZF
2236 INCOMPATIBILITY: ZF theories that import individual theories below
2237 Main might need to be adapted. Regular theory Main is still
2238 available, as trivial extension of Main_ZF.
2243 * ML within Isar: antiquotation @{const name} or @{const
2244 name(typargs)} produces statically-checked Const term.
2246 * Functor NamedThmsFun: data is available to the user as dynamic fact
2247 (of the same name). Removed obsolete print command.
2249 * Removed obsolete "use_legacy_bindings" function.
2251 * The ``print mode'' is now a thread-local value derived from a global
2252 template (the former print_mode reference), thus access becomes
2253 non-critical. The global print_mode reference is for session
2254 management only; user-code should use print_mode_value,
2255 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2257 * Functions system/system_out provide a robust way to invoke external
2258 shell commands, with propagation of interrupts (requires Poly/ML
2259 5.2.1). Do not use OS.Process.system etc. from the basis library!
2264 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2265 in accordance with Proof General 3.7, which prefers GNU emacs.
2267 * isatool tty runs Isabelle process with plain tty interaction;
2268 optional line editor may be specified via ISABELLE_LINE_EDITOR
2269 setting, the default settings attempt to locate "ledit" and "rlwrap".
2271 * isatool browser now works with Cygwin as well, using general
2272 "javapath" function defined in Isabelle process environment.
2274 * YXML notation provides a simple and efficient alternative to
2275 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2276 isatool yxml as described in the Isabelle system manual.
2278 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2279 provides general wrapper for managing an Isabelle process in a robust
2280 fashion, with ``cooked'' output from stdin/stderr.
2282 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2283 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2285 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2286 way of changing the user's settings is via
2287 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2290 * Multithreading.max_threads := 0 refers to the number of actual CPU
2291 cores of the underlying machine, which is a good starting point for
2292 optimal performance tuning. The corresponding usedir option -M allows
2293 "max" as an alias for "0". WARNING: does not work on certain versions
2294 of Mac OS (with Poly/ML 5.1).
2296 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2297 adverse effect of Isabelle flooding interactive front-ends (notably
2298 ProofGeneral / XEmacs).
2302 New in Isabelle2007 (November 2007)
2303 -----------------------------------
2307 * More uniform information about legacy features, notably a
2308 warning/error of "Legacy feature: ...", depending on the state of the
2309 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2310 legacy features will disappear eventually.
2312 * Theory syntax: the header format ``theory A = B + C:'' has been
2313 discontinued in favour of ``theory A imports B C begin''. Use isatool
2314 fixheaders to convert existing theory files. INCOMPATIBILITY.
2316 * Theory syntax: the old non-Isar theory file format has been
2317 discontinued altogether. Note that ML proof scripts may still be used
2318 with Isar theories; migration is usually quite simple with the ML
2319 function use_legacy_bindings. INCOMPATIBILITY.
2321 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2322 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2325 * Theory loader: be more serious about observing the static theory
2326 header specifications (including optional directories), but not the
2327 accidental file locations of previously successful loads. The strict
2328 update policy of former update_thy is now already performed by
2329 use_thy, so the former has been removed; use_thys updates several
2330 theories simultaneously, just as 'imports' within a theory header
2331 specification, but without merging the results. Potential
2332 INCOMPATIBILITY: may need to refine theory headers and commands
2333 ROOT.ML which depend on load order.
2335 * Theory loader: optional support for content-based file
2336 identification, instead of the traditional scheme of full physical
2337 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2338 (cf. the system manual). The new scheme allows to work with
2339 non-finished theories in persistent session images, such that source
2340 files may be moved later on without requiring reloads.
2342 * Theory loader: old-style ML proof scripts being *attached* to a thy
2343 file (with the same base name as the theory) are considered a legacy
2344 feature, which will disappear eventually. Even now, the theory loader
2345 no longer maintains dependencies on such files.
2347 * Syntax: the scope for resolving ambiguities via type-inference is
2348 now limited to individual terms, instead of whole simultaneous
2349 specifications as before. This greatly reduces the complexity of the
2350 syntax module and improves flexibility by separating parsing and
2351 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2352 'fixes' etc.) are required in rare situations.
2354 * Syntax: constants introduced by new-style packages ('definition',
2355 'abbreviation' etc.) are passed through the syntax module in
2356 ``authentic mode''. This means that associated mixfix annotations
2357 really stick to such constants, independently of potential name space
2358 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2359 trees are represented slightly differently, may need to adapt syntax
2360 translations accordingly. Use CONST marker in 'translations' and
2361 @{const_syntax} antiquotation in 'parse_translation' etc.
2363 * Legacy goal package: reduced interface to the bare minimum required
2364 to keep existing proof scripts running. Most other user-level
2365 functions are now part of the OldGoals structure, which is *not* open
2366 by default (consider isatool expandshort before open OldGoals).
2367 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2368 these tend to cause confusion about the actual goal (!) context being
2369 used here, which is not necessarily the same as the_context().
2371 * Command 'find_theorems': supports "*" wild-card in "name:"
2372 criterion; "with_dups" option. Certain ProofGeneral versions might
2373 support a specific search form (see ProofGeneral/CHANGES).
2375 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2376 by default, which means that "prems" (and also "fixed variables") are
2377 suppressed from proof state output. Note that the ProofGeneral
2378 settings mechanism allows to change and save options persistently, but
2379 older versions of Isabelle will fail to start up if a negative prems
2382 * Local theory targets may be specified by non-nested blocks of
2383 ``context/locale/class ... begin'' followed by ``end''. The body may
2384 contain definitions, theorems etc., including any derived mechanism
2385 that has been implemented on top of these primitives. This concept
2386 generalizes the existing ``theorem (in ...)'' towards more versatility
2389 * Proof General interface: proper undo of final 'end' command;
2390 discontinued Isabelle/classic mode (ML proof scripts).
2393 *** Document preparation ***
2395 * Added antiquotation @{theory name} which prints the given name,
2396 after checking that it refers to a valid ancestor theory in the
2399 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2400 check the given source text as ML type/structure, printing verbatim.
2402 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2403 "c args == rhs" given in the current context. (Any number of
2404 arguments may be given on the LHS.)
2409 * The 'class' package offers a combination of axclass and locale to
2410 achieve Haskell-like type classes in Isabelle. Definitions and
2411 theorems within a class context produce both relative results (with
2412 implicit parameters according to the locale context), and polymorphic
2413 constants with qualified polymorphism (according to the class
2414 context). Within the body context of a 'class' target, a separate
2415 syntax layer ("user space type system") takes care of converting
2416 between global polymorphic consts and internal locale representation.
2417 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2418 "isatool doc classes" provides a tutorial.
2420 * Generic code generator framework allows to generate executable
2421 code for ML and Haskell (including Isabelle classes). A short usage
2424 internal compilation:
2425 export_code <list of constants (term syntax)> in SML
2426 writing SML code to a file:
2427 export_code <list of constants (term syntax)> in SML <filename>
2428 writing OCaml code to a file:
2429 export_code <list of constants (term syntax)> in OCaml <filename>
2430 writing Haskell code to a bunch of files:
2431 export_code <list of constants (term syntax)> in Haskell <filename>
2433 evaluating closed propositions to True/False using code generation:
2436 Reasonable default setup of framework in HOL.
2438 Theorem attributs for selecting and transforming function equations theorems:
2440 [code fun]: select a theorem as function equation for a specific constant
2441 [code fun del]: deselect a theorem as function equation for a specific constant
2442 [code inline]: select an equation theorem for unfolding (inlining) in place
2443 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2445 User-defined serializations (target in {SML, OCaml, Haskell}):
2447 code_const <and-list of constants (term syntax)>
2448 {(target) <and-list of const target syntax>}+
2450 code_type <and-list of type constructors>
2451 {(target) <and-list of type target syntax>}+
2453 code_instance <and-list of instances>
2455 where instance ::= <type constructor> :: <class>
2457 code_class <and_list of classes>
2458 {(target) <and-list of class target syntax>}+
2459 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2461 code_instance and code_class only are effective to target Haskell.
2463 For example usage see src/HOL/ex/Codegenerator.thy and
2464 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2465 generation from Isabelle/HOL theories is available via "isatool doc
2468 * Code generator: consts in 'consts_code' Isar commands are now
2469 referred to by usual term syntax (including optional type
2472 * Command 'no_translations' removes translation rules from theory
2475 * Overloaded definitions are now actually checked for acyclic
2476 dependencies. The overloading scheme is slightly more general than
2477 that of Haskell98, although Isabelle does not demand an exact
2478 correspondence to type class and instance declarations.
2479 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2480 exotic versions of overloading -- at the discretion of the user!
2482 Polymorphic constants are represented via type arguments, i.e. the
2483 instantiation that matches an instance against the most general
2484 declaration given in the signature. For example, with the declaration
2485 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2486 as c(nat). Overloading is essentially simultaneous structural
2487 recursion over such type arguments. Incomplete specification patterns
2488 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2489 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2490 Command 'print_theory' outputs the normalized system of recursive
2491 equations, see section "definitions".
2493 * Configuration options are maintained within the theory or proof
2494 context (with name and type bool/int/string), providing a very simple
2495 interface to a poor-man's version of general context data. Tools may
2496 declare options in ML (e.g. using Attrib.config_int) and then refer to
2497 these values using Config.get etc. Users may change options via an
2498 associated attribute of the same name. This form of context
2499 declaration works particularly well with commands 'declare' or
2500 'using', for example ``declare [[foo = 42]]''. Thus it has become
2501 very easy to avoid global references, which would not observe Isar
2502 toplevel undo/redo and fail to work with multithreading.
2504 Various global ML references of Pure and HOL have been turned into
2505 configuration options:
2507 Unify.search_bound unify_search_bound
2508 Unify.trace_bound unify_trace_bound
2509 Unify.trace_simp unify_trace_simp
2510 Unify.trace_types unify_trace_types
2511 Simplifier.simp_depth_limit simp_depth_limit
2512 Blast.depth_limit blast_depth_limit
2513 DatatypeProp.dtK datatype_distinctness_limit
2514 fast_arith_neq_limit fast_arith_neq_limit
2515 fast_arith_split_limit fast_arith_split_limit
2517 * Named collections of theorems may be easily installed as context
2518 data using the functor NamedThmsFun (see also
2519 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2520 attributes; there is also a toplevel print command. This facility is
2521 just a common case of general context data, which is the preferred way
2522 for anything more complex than just a list of facts in canonical
2525 * Isar: command 'declaration' augments a local theory by generic
2526 declaration functions written in ML. This enables arbitrary content
2527 being added to the context, depending on a morphism that tells the
2528 difference of the original declaration context wrt. the application
2529 context encountered later on.
2531 * Isar: proper interfaces for simplification procedures. Command
2532 'simproc_setup' declares named simprocs (with match patterns, and body
2533 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2534 context. ML antiquotation @{simproc name} retrieves named simprocs.
2536 * Isar: an extra pair of brackets around attribute declarations
2537 abbreviates a theorem reference involving an internal dummy fact,
2538 which will be ignored later --- only the effect of the attribute on
2539 the background context will persist. This form of in-place
2540 declarations is particularly useful with commands like 'declare' and
2541 'using', for example ``have A using [[simproc a]] by simp''.
2543 * Isar: method "assumption" (and implicit closing of subproofs) now
2544 takes simple non-atomic goal assumptions into account: after applying
2545 an assumption as a rule the resulting subgoals are solved by atomic
2546 assumption steps. This is particularly useful to finish 'obtain'
2547 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2548 without referring to the original premise "!!x. P x ==> thesis" in the
2549 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2552 * Isar: implicit use of prems from the Isar proof context is
2553 considered a legacy feature. Common applications like ``have A .''
2554 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2555 referencing facts explicitly here improves readability and
2556 maintainability of proof texts.
2558 * Isar: improper proof element 'guess' is like 'obtain', but derives
2559 the obtained context from the course of reasoning! For example:
2561 assume "EX x y. A x & B y" -- "any previous fact"
2562 then guess x and y by clarify
2564 This technique is potentially adventurous, depending on the facts and
2565 proof tools being involved here.
2567 * Isar: known facts from the proof context may be specified as literal
2568 propositions, using ASCII back-quote syntax. This works wherever
2569 named facts used to be allowed so far, in proof commands, proof
2570 methods, attributes etc. Literal facts are retrieved from the context
2571 according to unification of type and term parameters. For example,
2572 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2573 theorems in the current context, then these are valid literal facts:
2574 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2576 There is also a proof method "fact" which does the same composition
2577 for explicit goal states, e.g. the following proof texts coincide with
2578 certain special cases of literal facts:
2580 have "A" by fact == note `A`
2581 have "A ==> B" by fact == note `A ==> B`
2582 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2583 have "P a ==> Q a" by fact == note `P a ==> Q a`
2585 * Isar: ":" (colon) is no longer a symbolic identifier character in
2586 outer syntax. Thus symbolic identifiers may be used without
2587 additional white space in declarations like this: ``assume *: A''.
2589 * Isar: 'print_facts' prints all local facts of the current context,
2590 both named and unnamed ones.
2592 * Isar: 'def' now admits simultaneous definitions, e.g.:
2594 def x == "t" and y == "u"
2596 * Isar: added command 'unfolding', which is structurally similar to
2597 'using', but affects both the goal state and facts by unfolding given
2598 rewrite rules. Thus many occurrences of the 'unfold' method or
2599 'unfolded' attribute may be replaced by first-class proof text.
2601 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2602 and command 'unfolding' now all support object-level equalities
2603 (potentially conditional). The underlying notion of rewrite rule is
2604 analogous to the 'rule_format' attribute, but *not* that of the
2605 Simplifier (which is usually more generous).
2607 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2608 premises of a theorem by n. Useful in conjunction with drule.
2610 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2611 method expression within a sandbox consisting of the first N
2612 sub-goals, which need to exist. For example, ``simp_all [3]''
2613 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2614 simplifies all new goals that emerge from applying rule foo to the
2615 originally first one.
2617 * Isar: schematic goals are no longer restricted to higher-order
2618 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2621 * Isar: the conclusion of a long theorem statement is now either
2622 'shows' (a simultaneous conjunction, as before), or 'obtains'
2623 (essentially a disjunction of cases with local parameters and
2624 assumptions). The latter allows to express general elimination rules
2625 adequately; in this notation common elimination rules look like this:
2627 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2629 obtains x where "P x"
2631 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2635 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2641 The subsequent classical rules even refer to the formal "thesis"
2644 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2647 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2648 obtains "thesis ==> something"
2650 The actual proof of an 'obtains' statement is analogous to that of the
2651 Isar proof element 'obtain', only that there may be several cases.
2652 Optional case names may be specified in parentheses; these will be
2653 available both in the present proof and as annotations in the
2654 resulting rule, for later use with the 'cases' method (cf. attribute
2657 * Isar: the assumptions of a long theorem statement are available as
2658 "assms" fact in the proof context. This is more appropriate than the
2659 (historical) "prems", which refers to all assumptions of the current
2660 context, including those from the target locale, proof body etc.
2662 * Isar: 'print_statement' prints theorems from the current theory or
2663 proof context in long statement form, according to the syntax of a
2666 * Isar: 'obtain' takes an optional case name for the local context
2667 introduction rule (default "that").
2669 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2670 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2673 * Pure: syntax "CONST name" produces a fully internalized constant
2674 according to the current context. This is particularly useful for
2675 syntax translations that should refer to internal constant
2676 representations independently of name spaces.
2678 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2679 instead of "FOO ". This allows multiple binder declarations to coexist
2680 in the same context. INCOMPATIBILITY.
2682 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2683 primitive that also works in a locale context (both for constants and
2684 fixed variables). Type declaration and internal syntactic representation
2685 of given constants retrieved from the context. Likewise, the
2686 'no_notation' command allows to remove given syntax annotations from the
2689 * Isar/locales: new derived specification elements 'axiomatization',
2690 'definition', 'abbreviation', which support type-inference, admit
2691 object-level specifications (equality, equivalence). See also the
2692 isar-ref manual. Examples:
2695 eq (infix "===" 50) where
2696 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2698 definition "f x y = x + y + 1"
2699 definition g where "g x = f x x"
2702 neq (infix "=!=" 50) where
2703 "x =!= y == ~ (x === y)"
2705 These specifications may be also used in a locale context. Then the
2706 constants being introduced depend on certain fixed parameters, and the
2707 constant name is qualified by the locale base name. An internal
2708 abbreviation takes care for convenient input and output, making the
2709 parameters implicit and using the original short name. See also
2710 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2711 entities from a monomorphic theory.
2713 Presently, abbreviations are only available 'in' a target locale, but
2714 not inherited by general import expressions. Also note that
2715 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2716 'translations' in common applications. The "no_abbrevs" print mode
2717 prevents folding of abbreviations in term output.
2719 Concrete syntax is attached to specified constants in internal form,
2720 independently of name spaces. The parse tree representation is
2721 slightly different -- use 'notation' instead of raw 'syntax', and
2722 'translations' with explicit "CONST" markup to accommodate this.
2724 * Pure/Isar: unified syntax for new-style specification mechanisms
2725 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2726 full type inference and dummy patterns ("_"). For example:
2728 definition "K x _ = x"
2730 inductive conj for A B
2731 where "A ==> B ==> conj A B"
2733 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2734 the current context. Print mode "no_abbrevs" prevents inversion of
2735 abbreviations on output.
2737 * Isar/locales: improved parameter handling: use of locales "var" and
2738 "struct" no longer necessary; - parameter renamings are no longer
2739 required to be injective. For example, this allows to define
2740 endomorphisms as locale endom = homom mult mult h.
2742 * Isar/locales: changed the way locales with predicates are defined.
2743 Instead of accumulating the specification, the imported expression is
2744 now an interpretation. INCOMPATIBILITY: different normal form of
2745 locale expressions. In particular, in interpretations of locales with
2746 predicates, goals repesenting already interpreted fragments are not
2747 removed automatically. Use methods `intro_locales' and
2748 `unfold_locales'; see below.
2750 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2751 provide backward reasoning on locales predicates. The methods are
2752 aware of interpretations and discharge corresponding goals.
2753 `intro_locales' is less aggressive then `unfold_locales' and does not
2754 unfold predicates to assumptions.
2756 * Isar/locales: the order in which locale fragments are accumulated
2757 has changed. This enables to override declarations from fragments due
2758 to interpretations -- for example, unwanted simp rules.
2760 * Isar/locales: interpretation in theories and proof contexts has been
2761 extended. One may now specify (and prove) equations, which are
2762 unfolded in interpreted theorems. This is useful for replacing
2763 defined concepts (constants depending on locale parameters) by
2764 concepts already existing in the target context. Example:
2766 interpretation partial_order ["op <= :: [int, int] => bool"]
2767 where "partial_order.less (op <=) (x::int) y = (x < y)"
2769 Typically, the constant `partial_order.less' is created by a
2770 definition specification element in the context of locale
2773 * Method "induct": improved internal context management to support
2774 local fixes and defines on-the-fly. Thus explicit meta-level
2775 connectives !! and ==> are rarely required anymore in inductive goals
2776 (using object-logic connectives for this purpose has been long
2777 obsolete anyway). Common proof patterns are explained in
2778 src/HOL/Induct/Common_Patterns.thy, see also
2779 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2782 * Method "induct": improved handling of simultaneous goals. Instead of
2783 introducing object-level conjunction, the statement is now split into
2784 several conclusions, while the corresponding symbolic cases are nested
2785 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2786 see src/HOL/Induct/Common_Patterns.thy, for example.
2788 * Method "induct": mutual induction rules are now specified as a list
2789 of rule sharing the same induction cases. HOL packages usually provide
2790 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2791 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2792 mutual induction rules differently, i.e. like this:
2794 (induct rule: foo_bar.inducts)
2795 (induct set: foo bar)
2796 (induct pred: foo bar)
2797 (induct type: foo bar)
2799 The ML function ProjectRule.projections turns old-style rules into the
2802 * Method "coinduct": dual of induction, see
2803 src/HOL/Library/Coinductive_List.thy for various examples.
2805 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2806 considered a legacy feature.
2808 * Attribute "symmetric" produces result with standardized schematic
2809 variables (index 0). Potential INCOMPATIBILITY.
2811 * Simplifier: by default the simplifier trace only shows top level
2812 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2813 default. Thus there is less danger of being flooded by the trace. The
2814 trace indicates where parts have been suppressed.
2816 * Provers/classical: removed obsolete classical version of elim_format
2817 attribute; classical elim/dest rules are now treated uniformly when
2818 manipulating the claset.
2820 * Provers/classical: stricter checks to ensure that supplied intro,
2821 dest and elim rules are well-formed; dest and elim rules must have at
2824 * Provers/classical: attributes dest/elim/intro take an optional
2825 weight argument for the rule (just as the Pure versions). Weights are
2826 ignored by automated tools, but determine the search order of single
2829 * Syntax: input syntax now supports dummy variable binding "%_. b",
2830 where the body does not mention the bound variable. Note that dummy
2831 patterns implicitly depend on their context of bounds, which makes
2832 "{_. _}" match any set comprehension as expected. Potential
2833 INCOMPATIBILITY -- parse translations need to cope with syntactic
2834 constant "_idtdummy" in the binding position.
2836 * Syntax: removed obsolete syntactic constant "_K" and its associated
2837 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2838 for example "A -> B" => "Pi A (%_. B)".
2840 * Pure: 'class_deps' command visualizes the subclass relation, using
2841 the graph browser tool.
2843 * Pure: 'print_theory' now suppresses certain internal declarations by
2844 default; use '!' option for full details.
2849 * Method "metis" proves goals by applying the Metis general-purpose
2850 resolution prover (see also http://gilith.com/software/metis/).
2851 Examples are in the directory MetisExamples. WARNING: the
2852 Isabelle/HOL-Metis integration does not yet work properly with
2855 * Command 'sledgehammer' invokes external automatic theorem provers as
2856 background processes. It generates calls to the "metis" method if
2857 successful. These can be pasted into the proof. Users do not have to
2858 wait for the automatic provers to return. WARNING: does not really
2859 work with multi-threading.
2861 * New "auto_quickcheck" feature tests outermost goal statements for
2862 potential counter-examples. Controlled by ML references
2863 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2864 5000 milliseconds). Fails silently if statements is outside of
2865 executable fragment, or any other codgenerator problem occurs.
2867 * New constant "undefined" with axiom "undefined x = undefined".
2869 * Added class "HOL.eq", allowing for code generation with polymorphic
2872 * Some renaming of class constants due to canonical name prefixing in
2873 the new 'class' package:
2875 HOL.abs ~> HOL.abs_class.abs
2876 HOL.divide ~> HOL.divide_class.divide
2877 0 ~> HOL.zero_class.zero
2878 1 ~> HOL.one_class.one
2879 op + ~> HOL.plus_class.plus
2880 op - ~> HOL.minus_class.minus
2881 uminus ~> HOL.minus_class.uminus
2882 op * ~> HOL.times_class.times
2883 op < ~> HOL.ord_class.less
2884 op <= > HOL.ord_class.less_eq
2885 Nat.power ~> Power.power_class.power
2886 Nat.size ~> Nat.size_class.size
2887 Numeral.number_of ~> Numeral.number_class.number_of
2888 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2889 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2890 Orderings.min ~> Orderings.ord_class.min
2891 Orderings.max ~> Orderings.ord_class.max
2892 Divides.op div ~> Divides.div_class.div
2893 Divides.op mod ~> Divides.div_class.mod
2894 Divides.op dvd ~> Divides.div_class.dvd
2896 INCOMPATIBILITY. Adaptions may be required in the following cases:
2898 a) User-defined constants using any of the names "plus", "minus",
2899 "times", "less" or "less_eq". The standard syntax translations for
2900 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2903 b) Variables named "plus", "minus", "times", "less", "less_eq"
2904 INCOMPATIBILITY: use more specific names.
2906 c) Permutative equations (e.g. "a + b = b + a")
2907 Since the change of names also changes the order of terms, permutative
2908 rewrite rules may get applied in a different order. Experience shows
2909 that this is rarely the case (only two adaptions in the whole Isabelle
2910 distribution). INCOMPATIBILITY: rewrite proofs
2912 d) ML code directly refering to constant names
2913 This in general only affects hand-written proof tactics, simprocs and
2914 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2915 Consider using @{const_name} antiquotation.
2917 * New class "default" with associated constant "default".
2919 * Function "sgn" is now overloaded and available on int, real, complex
2920 (and other numeric types), using class "sgn". Two possible defs of
2921 sgn are given as equational assumptions in the classes sgn_if and
2922 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2925 * Locale "partial_order" now unified with class "order" (cf. theory
2926 Orderings), added parameter "less". INCOMPATIBILITY.
2928 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2929 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2930 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2932 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2933 changed order of proof goals in instance proofs.
2935 * The transitivity reasoner for partial and linear orders is set up
2936 for classes "order" and "linorder". Instances of the reasoner are available
2937 in all contexts importing or interpreting the corresponding locales.
2938 Method "order" invokes the reasoner separately; the reasoner
2939 is also integrated with the Simplifier as a solver. Diagnostic
2940 command 'print_orders' shows the available instances of the reasoner
2941 in the current context.
2943 * Localized monotonicity predicate in theory "Orderings"; integrated
2944 lemmas max_of_mono and min_of_mono with this predicate.
2947 * Formulation of theorem "dense" changed slightly due to integration
2948 with new class dense_linear_order.
2950 * Uniform lattice theory development in HOL.
2952 constants "meet" and "join" now named "inf" and "sup"
2953 constant "Meet" now named "Inf"
2955 classes "meet_semilorder" and "join_semilorder" now named
2956 "lower_semilattice" and "upper_semilattice"
2957 class "lorder" now named "lattice"
2958 class "comp_lat" now named "complete_lattice"
2960 Instantiation of lattice classes allows explicit definitions
2961 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2963 INCOMPATIBILITY. Theorem renames:
2965 meet_left_le ~> inf_le1
2966 meet_right_le ~> inf_le2
2967 join_left_le ~> sup_ge1
2968 join_right_le ~> sup_ge2
2969 meet_join_le ~> inf_sup_ord
2972 le_meet ~> le_inf_iff
2973 le_join ~> ge_sup_conv
2974 meet_idempotent ~> inf_idem
2975 join_idempotent ~> sup_idem
2976 meet_comm ~> inf_commute
2977 join_comm ~> sup_commute
2978 meet_leI1 ~> le_infI1
2979 meet_leI2 ~> le_infI2
2980 le_joinI1 ~> le_supI1
2981 le_joinI2 ~> le_supI2
2982 meet_assoc ~> inf_assoc
2983 join_assoc ~> sup_assoc
2984 meet_left_comm ~> inf_left_commute
2985 meet_left_idempotent ~> inf_left_idem
2986 join_left_comm ~> sup_left_commute
2987 join_left_idempotent ~> sup_left_idem
2990 le_def_meet ~> le_iff_inf
2991 le_def_join ~> le_iff_sup
2992 join_absorp2 ~> sup_absorb2
2993 join_absorp1 ~> sup_absorb1
2994 meet_absorp1 ~> inf_absorb1
2995 meet_absorp2 ~> inf_absorb2
2996 meet_join_absorp ~> inf_sup_absorb
2997 join_meet_absorp ~> sup_inf_absorb
2998 distrib_join_le ~> distrib_sup_le
2999 distrib_meet_le ~> distrib_inf_le
3001 add_meet_distrib_left ~> add_inf_distrib_left
3002 add_join_distrib_left ~> add_sup_distrib_left
3003 is_join_neg_meet ~> is_join_neg_inf
3004 is_meet_neg_join ~> is_meet_neg_sup
3005 add_meet_distrib_right ~> add_inf_distrib_right
3006 add_join_distrib_right ~> add_sup_distrib_right
3007 add_meet_join_distribs ~> add_sup_inf_distribs
3008 join_eq_neg_meet ~> sup_eq_neg_inf
3009 meet_eq_neg_join ~> inf_eq_neg_sup
3010 add_eq_meet_join ~> add_eq_inf_sup
3011 meet_0_imp_0 ~> inf_0_imp_0
3012 join_0_imp_0 ~> sup_0_imp_0
3013 meet_0_eq_0 ~> inf_0_eq_0
3014 join_0_eq_0 ~> sup_0_eq_0
3015 neg_meet_eq_join ~> neg_inf_eq_sup
3016 neg_join_eq_meet ~> neg_sup_eq_inf
3017 join_eq_if ~> sup_eq_if
3019 mono_meet ~> mono_inf
3020 mono_join ~> mono_sup
3021 meet_bool_eq ~> inf_bool_eq
3022 join_bool_eq ~> sup_bool_eq
3023 meet_fun_eq ~> inf_fun_eq
3024 join_fun_eq ~> sup_fun_eq
3025 meet_set_eq ~> inf_set_eq
3026 join_set_eq ~> sup_set_eq
3027 meet1_iff ~> inf1_iff
3028 meet2_iff ~> inf2_iff
3037 join1_iff ~> sup1_iff
3038 join2_iff ~> sup2_iff
3048 is_meet_Meet ~> is_meet_Inf
3049 Meet_bool_def ~> Inf_bool_def
3050 Meet_fun_def ~> Inf_fun_def
3051 Meet_greatest ~> Inf_greatest
3052 Meet_lower ~> Inf_lower
3053 Meet_set_def ~> Inf_set_def
3056 Sup_bool_eq ~> Sup_bool_def
3057 Sup_fun_eq ~> Sup_fun_def
3058 Sup_set_eq ~> Sup_set_def
3060 listsp_meetI ~> listsp_infI
3061 listsp_meet_eq ~> listsp_inf_eq
3066 * Added syntactic class "size"; overloaded constant "size" now has
3067 type "'a::size ==> bool"
3069 * Internal reorganisation of `size' of datatypes: size theorems
3070 "foo.size" are no longer subsumed by "foo.simps" (but are still
3071 simplification rules by default!); theorems "prod.size" now named
3074 * Class "div" now inherits from class "times" rather than "type".
3077 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3078 Linorder etc. have disappeared; operations defined in terms of
3079 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3081 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3083 * HOL-Word: New extensive library and type for generic, fixed size
3084 machine words, with arithemtic, bit-wise, shifting and rotating
3085 operations, reflection into int, nat, and bool lists, automation for
3086 linear arithmetic (by automatic reflection into nat or int), including
3087 lemmas on overflow and monotonicity. Instantiated to all appropriate
3088 arithmetic type classes, supporting automatic simplification of
3089 numerals on all operations.
3091 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3093 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3095 * Code generator library theories:
3096 - Code_Integer represents HOL integers by big integer literals in target
3098 - Code_Char represents HOL characters by character literals in target
3100 - Code_Char_chr like Code_Char, but also offers treatment of character
3101 codes; includes Code_Integer.
3102 - Executable_Set allows to generate code for finite sets using lists.
3103 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3105 - Executable_Real implements a subset of real numbers, namly those
3106 representable by rational numbers.
3107 - Efficient_Nat implements natural numbers by integers, which in general will
3108 result in higher efficency; pattern matching with 0/Suc is eliminated;
3109 includes Code_Integer.
3110 - Code_Index provides an additional datatype index which is mapped to
3111 target-language built-in integers.
3112 - Code_Message provides an additional datatype message_string which is isomorphic to
3113 strings; messages are mapped to target-language strings.
3115 * New package for inductive predicates
3117 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3120 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3121 for z_1 :: U_1 and ... and z_n :: U_m
3123 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3126 with full support for type-inference, rather than
3128 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3130 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3131 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3133 inductive "s z_1 ... z_m"
3135 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3138 For backward compatibility, there is a wrapper allowing inductive
3139 sets to be defined with the new package via
3142 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3143 for z_1 :: U_1 and ... and z_n :: U_m
3145 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3151 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3152 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3153 for z_1 :: U_1 and ... and z_n :: U_m
3155 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3156 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3159 if the additional syntax "p ..." is required.
3161 Numerous examples can be found in the subdirectories src/HOL/Auth,
3162 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3166 - Since declaration and definition of inductive sets or predicates
3167 is no longer separated, abbreviations involving the newly
3168 introduced sets or predicates must be specified together with the
3169 introduction rules after the 'where' keyword (see above), rather
3170 than before the actual inductive definition.
3172 - The variables in induction and elimination rules are now
3173 quantified in the order of their occurrence in the introduction
3174 rules, rather than in alphabetical order. Since this may break
3175 some proofs, these proofs either have to be repaired, e.g. by
3176 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3177 statements of the form
3179 case (rule_i a_i_1 ... a_i_{k_i})
3181 or the old order of quantification has to be restored by explicitly adding
3182 meta-level quantifiers in the introduction rules, i.e.
3184 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3186 - The format of the elimination rules is now
3188 p z_1 ... z_m x_1 ... x_n ==>
3189 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3194 (x_1, ..., x_n) : s z_1 ... z_m ==>
3195 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3198 for sets rather than
3200 x : s z_1 ... z_m ==>
3201 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3204 This may require terms in goals to be expanded to n-tuples
3205 (e.g. using case_tac or simplification with the split_paired_all
3206 rule) before the above elimination rule is applicable.
3208 - The elimination or case analysis rules for (mutually) inductive
3209 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3210 list of rules "p_1_..._p_k.elims" is no longer available.
3212 * New package "function"/"fun" for general recursive functions,
3213 supporting mutual and nested recursion, definitions in local contexts,
3214 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3215 for small examples, and the separate tutorial on the function
3216 package. The old recdef "package" is still available as before, but
3217 users are encouraged to use the new package.
3219 * Method "lexicographic_order" automatically synthesizes termination
3220 relations as lexicographic combinations of size measures.
3222 * Case-expressions allow arbitrary constructor-patterns (including
3223 "_") and take their order into account, like in functional
3224 programming. Internally, this is translated into nested
3225 case-expressions; missing cases are added and mapped to the predefined
3226 constant "undefined". In complicated cases printing may no longer show
3227 the original input but the internal form. Lambda-abstractions allow
3228 the same form of pattern matching: "% pat1 => e1 | ..." is an
3229 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3232 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3233 is an abbreviation for "of_nat :: nat => int". The simplification
3234 rules for "of_nat" have been changed to work like "int" did
3235 previously. Potential INCOMPATIBILITY:
3236 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3237 - of_nat_diff and of_nat_mult are no longer default simp rules
3239 * Method "algebra" solves polynomial equations over (semi)rings using
3240 Groebner bases. The (semi)ring structure is defined by locales and the
3241 tool setup depends on that generic context. Installing the method for
3242 a specific type involves instantiating the locale and possibly adding
3243 declarations for computation on the coefficients. The method is
3244 already instantiated for natural numbers and for the axiomatic class
3245 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3246 CALCULEMUS 2007 for the general principles underlying this
3247 architecture of context-aware proof-tools.
3249 * Method "ferrack" implements quantifier elimination over
3250 special-purpose dense linear orders using locales (analogous to
3251 "algebra"). The method is already installed for class
3252 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3255 * Former constant "List.op @" now named "List.append". Use ML
3256 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3257 circumvent possible incompatibilities when working on ML level.
3259 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3261 * New function listsum :: 'a list => 'a for arbitrary monoids.
3262 Special syntax: "SUM x <- xs. f x" (and latex variants)
3264 * New syntax for Haskell-like list comprehension (input only), eg.
3265 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3267 * The special syntax for function "filter" has changed from [x :
3268 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3269 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3271 * [a..b] is now defined for arbitrary linear orders. It used to be
3272 defined on nat only, as an abbreviation for [a..<Suc b]
3275 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3277 * New functions "sorted" and "sort" in src/HOL/List.thy.
3279 * New lemma collection field_simps (an extension of ring_simps) for
3280 manipulating (in)equations involving division. Multiplies with all
3281 denominators that can be proved to be non-zero (in equations) or
3282 positive/negative (in inequations).
3284 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3285 have been improved and renamed to ring_simps, group_simps and
3286 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3287 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3289 * Theory Library/Commutative_Ring: switched from recdef to function
3290 package; constants add, mul, pow now curried. Infix syntax for
3291 algebraic operations.
3293 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3296 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3299 * HOL/records: generalised field-update to take a function on the
3300 field rather than the new value: r(|A := x|) is translated to A_update
3301 (K x) r The K-combinator that is internally used is called K_record.
3302 INCOMPATIBILITY: Usage of the plain update functions has to be
3305 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3306 * x = 0, which are required for a semiring. Richer structures do not
3307 inherit from semiring_0 anymore, because this property is a theorem
3308 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3309 there is more to prove, but this is mostly trivial.
3311 * Class "recpower" is generalized to arbitrary monoids, not just
3312 commutative semirings. INCOMPATIBILITY: may need to incorporate
3313 commutativity or semiring properties additionally.
3315 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3316 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3317 better use 'abbreviation'.
3319 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3321 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3322 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3323 significant changes for setting up numeral syntax for types:
3324 - New constants Numeral.pred and Numeral.succ instead
3325 of former Numeral.bin_pred and Numeral.bin_succ.
3326 - Use integer operations instead of bin_add, bin_mult and so on.
3327 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3328 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3330 See src/HOL/Integ/IntArith.thy for an example setup.
3332 * Command 'normal_form' computes the normal form of a term that may
3333 contain free variables. For example ``normal_form "rev [a, b, c]"''
3334 produces ``[b, c, a]'' (without proof). This command is suitable for
3335 heavy-duty computations because the functions are compiled to ML
3336 first. Correspondingly, a method "normalization" is provided. See
3337 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3339 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3340 25 like -->); output depends on the "iff" print_mode, the default is
3341 "A = B" (with priority 50).
3343 * Relations less (<) and less_eq (<=) are also available on type bool.
3344 Modified syntax to disallow nesting without explicit parentheses,
3345 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3348 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3350 * Relation composition operator "op O" now has precedence 75 and binds
3351 stronger than union and intersection. INCOMPATIBILITY.
3353 * The old set interval syntax "{m..n(}" (and relatives) has been
3354 removed. Use "{m..<n}" (and relatives) instead.
3356 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3357 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3358 ``declare [[simproc del: neq]]''.
3360 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3363 * Theorem Cons_eq_map_conv no longer declared as "simp".
3365 * Theorem setsum_mult renamed to setsum_right_distrib.
3367 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3370 * Reimplemented methods "sat" and "satx", with several improvements:
3371 goals no longer need to be stated as "<prems> ==> False", equivalences
3372 (i.e. "=" on type bool) are handled, variable names of the form
3373 "lit_<n>" are no longer reserved, significant speedup.
3375 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3376 zChaff is still supported as well.
3378 * 'inductive' and 'datatype': provide projections of mutual rules,
3379 bundled as foo_bar.inducts;
3381 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3384 * Library: moved theory Accessible_Part to main HOL.
3386 * Library: added theory Coinductive_List of potentially infinite lists
3387 as greatest fixed-point.
3389 * Library: added theory AssocList which implements (finite) maps as
3392 * Method "evaluation" solves goals (i.e. a boolean expression)
3393 efficiently by compiling it to ML. The goal is "proved" (via an
3394 oracle) if it evaluates to True.
3396 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3397 also when invoked by the simplifier. This results in the Simplifier
3398 being more powerful on arithmetic goals. INCOMPATIBILITY.
3399 Configuration option fast_arith_split_limit=0 recovers the old
3402 * Support for hex (0x20) and binary (0b1001) numerals.
3404 * New method: reify eqs (t), where eqs are equations for an
3405 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3406 parameter, computes a term s::'b and a list xs::'a list and proves the
3407 theorem I xs s = t. This is also known as reification or quoting. The
3408 resulting theorem is applied to the subgoal to substitute t with I xs
3409 s. If t is omitted, the subgoal itself is reified.
3411 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3412 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3413 where f is supposed to be a computable function (in the sense of code
3414 generattion). The method uses reify to compute s and xs as above then
3415 applies corr_thm and uses normalization by evaluation to "prove" f s =
3416 r and finally gets the theorem t = r, which is again applied to the
3417 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3419 * Reflection: Automatic reification now handels binding, an example is
3420 available in src/HOL/ex/ReflectionEx.thy
3422 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3423 command 'statespace' that is similar to 'record', but introduces an
3424 abstract specification based on the locale infrastructure instead of
3425 HOL types. This leads to extra flexibility in composing state spaces,
3426 in particular multiple inheritance and renaming of components.
3431 * Hyperreal: Functions root and sqrt are now defined on negative real
3432 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3433 Nonnegativity side conditions have been removed from many lemmas, so
3434 that more subgoals may now be solved by simplification; potential
3437 * Real: new type classes formalize real normed vector spaces and
3438 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3439 and norm :: 'a => real.
3441 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3442 reals into other types. The overloaded constant Reals :: 'a set is now
3443 defined as range of_real; potential INCOMPATIBILITY.
3445 * Real: proper support for ML code generation, including 'quickcheck'.
3446 Reals are implemented as arbitrary precision rationals.
3448 * Hyperreal: Several constants that previously worked only for the
3449 reals have been generalized, so they now work over arbitrary vector
3450 spaces. Type annotations may need to be added in some cases; potential
3453 Infinitesimal :: ('a::real_normed_vector) star set
3454 HFinite :: ('a::real_normed_vector) star set
3455 HInfinite :: ('a::real_normed_vector) star set
3456 approx :: ('a::real_normed_vector) star => 'a star => bool
3457 monad :: ('a::real_normed_vector) star => 'a star set
3458 galaxy :: ('a::real_normed_vector) star => 'a star set
3459 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3460 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3461 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3462 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3463 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3464 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3465 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3466 sgn :: 'a::real_normed_vector => 'a
3467 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3469 * Complex: Some complex-specific constants are now abbreviations for
3470 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3471 hnorm. Other constants have been entirely removed in favor of the
3472 polymorphic versions (INCOMPATIBILITY):
3476 HInfinite <-- CInfinite
3477 Infinitesimal <-- CInfinitesimal
3480 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3481 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3482 (ns)deriv <-- (ns)cderiv
3487 * Formalisation of ideals and the quotient construction over rings.
3489 * Order and lattice theory no longer based on records.
3492 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3493 greatest_closed. INCOMPATIBILITY.
3495 * Method algebra is now set up via an attribute. For examples see
3496 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3497 of algebraic structures.
3499 * Renamed theory CRing to Ring.
3504 * Substantial, yet incomplete support for nominal datatypes (binding
3505 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3506 src/HOL/Nominal/Examples. Prospective users should consult
3507 http://isabelle.in.tum.de/nominal/
3512 * ML basics: just one true type int, which coincides with IntInf.int
3515 * ML within Isar: antiquotations allow to embed statically-checked
3516 formal entities in the source, referring to the context available at
3517 compile-time. For example:
3519 ML {* @{sort "{zero,one}"} *}
3520 ML {* @{typ "'a => 'b"} *}
3521 ML {* @{term "%x. x"} *}
3522 ML {* @{prop "x == y"} *}
3523 ML {* @{ctyp "'a => 'b"} *}
3524 ML {* @{cterm "%x. x"} *}
3525 ML {* @{cprop "x == y"} *}
3526 ML {* @{thm asm_rl} *}
3527 ML {* @{thms asm_rl} *}
3528 ML {* @{type_name c} *}
3529 ML {* @{type_syntax c} *}
3530 ML {* @{const_name c} *}
3531 ML {* @{const_syntax c} *}
3534 ML {* @{theory Pure} *}
3535 ML {* @{theory_ref} *}
3536 ML {* @{theory_ref Pure} *}
3539 ML {* @{clasimpset} *}
3541 The same works for sources being ``used'' within an Isar context.
3543 * ML in Isar: improved error reporting; extra verbosity with
3544 ML_Context.trace enabled.
3546 * Pure/General/table.ML: the join operations now works via exceptions
3547 DUP/SAME instead of type option. This is simpler in simple cases, and
3548 admits slightly more efficient complex applications.
3550 * Pure: 'advanced' translation functions (parse_translation etc.) now
3551 use Context.generic instead of just theory.
3553 * Pure: datatype Context.generic joins theory/Proof.context and
3554 provides some facilities for code that works in either kind of
3555 context, notably GenericDataFun for uniform theory and proof data.
3557 * Pure: simplified internal attribute type, which is now always
3558 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3559 local (Proof.context) attributes have been discontinued, while
3560 minimizing code duplication. Thm.rule_attribute and
3561 Thm.declaration_attribute build canonical attributes; see also structure
3562 Context for further operations on Context.generic, notably
3563 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3564 declarations and definitions.
3566 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3567 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3568 init only required for impure data. INCOMPATIBILITY: empty really need
3569 to be empty (no dependencies on theory content!)
3571 * Pure/kernel: consts certification ignores sort constraints given in
3572 signature declarations. (This information is not relevant to the
3573 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3574 potential INCOMPATIBILITY.
3576 * Pure: axiomatic type classes are now purely definitional, with
3577 explicit proofs of class axioms and super class relations performed
3578 internally. See Pure/axclass.ML for the main internal interfaces --
3579 notably AxClass.define_class supercedes AxClass.add_axclass, and
3580 AxClass.axiomatize_class/classrel/arity supersede
3581 Sign.add_classes/classrel/arities.
3583 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3584 global/local versions on theory vs. Proof.context have been
3585 discontinued; Attrib.syntax and Method.syntax have been adapted
3586 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3587 attributes, methods, etc.
3589 * Pure: several functions of signature "... -> theory -> theory * ..."
3590 have been reoriented to "... -> theory -> ... * theory" in order to
3591 allow natural usage in combination with the ||>, ||>>, |-> and
3592 fold_map combinators.
3594 * Pure: official theorem names (closed derivations) and additional
3595 comments (tags) are now strictly separate. Name hints -- which are
3596 maintained as tags -- may be attached any time without affecting the
3599 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3600 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3601 achieve the old behaviour.
3603 * Pure: the "Goal" constant is now called "prop", supporting a
3604 slightly more general idea of ``protecting'' meta-level rule
3607 * Pure: Logic.(un)varify only works in a global context, which is now
3608 enforced instead of silently assumed. INCOMPATIBILITY, may use
3609 Logic.legacy_(un)varify as temporary workaround.
3611 * Pure: structure Name provides scalable operations for generating
3612 internal variable names, notably Name.variants etc. This replaces
3613 some popular functions from term.ML:
3615 Term.variant -> Name.variant
3616 Term.variantlist -> Name.variant_list
3617 Term.invent_names -> Name.invent_list
3619 Note that low-level renaming rarely occurs in new code -- operations
3620 from structure Variable are used instead (see below).
3622 * Pure: structure Variable provides fundamental operations for proper
3623 treatment of fixed/schematic variables in a context. For example,
3624 Variable.import introduces fixes for schematics of given facts and
3625 Variable.export reverses the effect (up to renaming) -- this replaces
3626 various freeze_thaw operations.
3628 * Pure: structure Goal provides simple interfaces for
3629 init/conclude/finish and tactical prove operations (replacing former
3630 Tactic.prove). Goal.prove is the canonical way to prove results
3631 within a given context; Goal.prove_global is a degraded version for
3632 theory level goals, including a global Drule.standard. Note that
3633 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3634 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3635 in a locale context).
3637 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3638 and type checking (Syntax.check_term etc.), with common combinations
3639 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3640 which are considered legacy and await removal.
3642 * Pure/Syntax: generic interfaces for type unchecking
3643 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3644 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3645 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3646 available for convenience, but refer to the very same operations using
3647 a mere theory instead of a full context.
3649 * Isar: simplified treatment of user-level errors, using exception
3650 ERROR of string uniformly. Function error now merely raises ERROR,
3651 without any side effect on output channels. The Isar toplevel takes
3652 care of proper display of ERROR exceptions. ML code may use plain
3653 handle/can/try; cat_error may be used to concatenate errors like this:
3655 ... handle ERROR msg => cat_error msg "..."
3657 Toplevel ML code (run directly or through the Isar toplevel) may be
3658 embedded into the Isar toplevel with exception display/debug like
3661 Isar.toplevel (fn () => ...)
3663 INCOMPATIBILITY, removed special transform_error facilities, removed
3664 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3665 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3666 -- use plain ERROR instead.
3668 * Isar: theory setup now has type (theory -> theory), instead of a
3669 list. INCOMPATIBILITY, may use #> to compose setup functions.
3671 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3672 ProofContext.debug/verbose flags.
3674 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3675 theory before entering a proof state. Transactions now always see a
3676 quasi-functional intermediate checkpoint, both in interactive and
3679 * Isar: simplified interfaces for outer syntax. Renamed
3680 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3681 OuterSyntax.add_parsers -- this functionality is now included in
3682 OuterSyntax.command etc. INCOMPATIBILITY.
3684 * Simplifier: the simpset of a running simplification process now
3685 contains a proof context (cf. Simplifier.the_context), which is the
3686 very context that the initial simpset has been retrieved from (by
3687 simpset_of/local_simpset_of). Consequently, all plug-in components
3688 (solver, looper etc.) may depend on arbitrary proof data.
3690 * Simplifier.inherit_context inherits the proof context (plus the
3691 local bounds) of the current simplification process; any simproc
3692 etc. that calls the Simplifier recursively should do this! Removed
3693 former Simplifier.inherit_bounds, which is already included here --
3694 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3695 specify an explicit context using Simplifier.context/theory_context.
3697 * Simplifier/Classical Reasoner: more abstract interfaces
3698 change_simpset/claset for modifying the simpset/claset reference of a
3699 theory; raw versions simpset/claset_ref etc. have been discontinued --
3702 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3708 * settings: the default heap location within ISABELLE_HOME_USER now
3709 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3710 Isabelle installations.
3712 * isabelle-process: option -S (secure mode) disables some critical
3713 operations, notably runtime compilation and evaluation of ML source
3716 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3718 * Support for parallel execution, using native multicore support of
3719 Poly/ML 5.1. The theory loader exploits parallelism when processing
3720 independent theories, according to the given theory header
3721 specifications. The maximum number of worker threads is specified via
3722 usedir option -M or the "max-threads" setting in Proof General. A
3723 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3724 to 6 on a 8-core machine. User-code needs to observe certain
3725 guidelines for thread-safe programming, see appendix A in the Isar
3726 Implementation manual.
3730 New in Isabelle2005 (October 2005)
3731 ----------------------------------
3735 * Theory headers: the new header syntax for Isar theories is
3738 imports <theory1> ... <theoryN>
3739 uses <file1> ... <fileM>
3742 where the 'uses' part is optional. The previous syntax
3744 theory <name> = <theory1> + ... + <theoryN>:
3746 will disappear in the next release. Use isatool fixheaders to convert
3747 existing theory files. Note that there is no change in ancient
3748 non-Isar theories now, but these will disappear soon.
3750 * Theory loader: parent theories can now also be referred to via
3751 relative and absolute paths.
3753 * Command 'find_theorems' searches for a list of criteria instead of a
3754 list of constants. Known criteria are: intro, elim, dest, name:string,
3755 simp:term, and any term. Criteria can be preceded by '-' to select
3756 theorems that do not match. Intro, elim, dest select theorems that
3757 match the current goal, name:s selects theorems whose fully qualified
3758 name contain s, and simp:term selects all simplification rules whose
3759 lhs match term. Any other term is interpreted as pattern and selects
3760 all theorems matching the pattern. Available in ProofGeneral under
3761 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3763 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3765 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3766 matching the current goal as introduction rule and not having "HOL."
3767 in their name (i.e. not being defined in theory HOL).
3769 * Command 'thms_containing' has been discontinued in favour of
3770 'find_theorems'; INCOMPATIBILITY.
3772 * Communication with Proof General is now 8bit clean, which means that
3773 Unicode text in UTF-8 encoding may be used within theory texts (both
3774 formal and informal parts). Cf. option -U of the Isabelle Proof
3775 General interface. Here are some simple examples (cf. src/HOL/ex):
3777 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3778 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3780 * Improved efficiency of the Simplifier and, to a lesser degree, the
3781 Classical Reasoner. Typical big applications run around 2 times
3785 *** Document preparation ***
3787 * Commands 'display_drafts' and 'print_drafts' perform simple output
3788 of raw sources. Only those symbols that do not require additional
3789 LaTeX packages (depending on comments in isabellesym.sty) are
3790 displayed properly, everything else is left verbatim. isatool display
3791 and isatool print are used as front ends (these are subject to the
3792 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3794 * Command tags control specific markup of certain regions of text,
3795 notably folding and hiding. Predefined tags include "theory" (for
3796 theory begin and end), "proof" for proof commands, and "ML" for
3797 commands involving ML code; the additional tags "visible" and
3798 "invisible" are unused by default. Users may give explicit tag
3799 specifications in the text, e.g. ''by %invisible (auto)''. The
3800 interpretation of tags is determined by the LaTeX job during document
3801 preparation: see option -V of isatool usedir, or options -n and -t of
3802 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3805 Several document versions may be produced at the same time via isatool
3806 usedir (the generated index.html will link all of them). Typical
3807 specifications include ''-V document=theory,proof,ML'' to present
3808 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3809 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3810 these parts without any formal replacement text. The Isabelle site
3811 default settings produce ''document'' and ''outline'' versions as
3814 * Several new antiquotations:
3816 @{term_type term} prints a term with its type annotated;
3818 @{typeof term} prints the type of a term;
3820 @{const const} is the same as @{term const}, but checks that the
3821 argument is a known logical constant;
3823 @{term_style style term} and @{thm_style style thm} print a term or
3824 theorem applying a "style" to it
3828 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3829 definitions, equations, inequations etc., 'concl' printing only the
3830 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3831 to print the specified premise. TermStyle.add_style provides an ML
3832 interface for introducing further styles. See also the "LaTeX Sugar"
3833 document practical applications. The ML antiquotation prints
3834 type-checked ML expressions verbatim.
3836 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3837 and 'text' support optional locale specification '(in loc)', which
3838 specifies the default context for interpreting antiquotations. For
3839 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3841 * Option 'locale=NAME' of antiquotations specifies an alternative
3842 context interpreting the subsequent argument. For example: @{thm
3843 [locale=lattice] inf_assoc}.
3845 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3848 * Proper output of antiquotations for theory commands involving a
3849 proof context (such as 'locale' or 'theorem (in loc) ...').
3851 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3852 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3854 * isatool usedir: new option -C (default true) controls whether option
3855 -D should include a copy of the original document directory; -C false
3856 prevents unwanted effects such as copying of administrative CVS data.
3861 * Considerably improved version of 'constdefs' command. Now performs
3862 automatic type-inference of declared constants; additional support for
3863 local structure declarations (cf. locales and HOL records), see also
3864 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3865 sequential dependencies of definitions within a single 'constdefs'
3866 section; moreover, the declared name needs to be an identifier. If
3867 all fails, consider to fall back on 'consts' and 'defs' separately.
3869 * Improved indexed syntax and implicit structures. First of all,
3870 indexed syntax provides a notational device for subscripted
3871 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3872 expressions. Secondly, in a local context with structure
3873 declarations, number indexes \<^sub>n or the empty index (default
3874 number 1) refer to a certain fixed variable implicitly; option
3875 show_structs controls printing of implicit structures. Typical
3876 applications of these concepts involve record types and locales.
3878 * New command 'no_syntax' removes grammar declarations (and
3879 translations) resulting from the given syntax specification, which is
3880 interpreted in the same manner as for the 'syntax' command.
3882 * 'Advanced' translation functions (parse_translation etc.) may depend
3883 on the signature of the theory context being presently used for
3884 parsing/printing, see also isar-ref manual.
3886 * Improved 'oracle' command provides a type-safe interface to turn an
3887 ML expression of type theory -> T -> term into a primitive rule of
3888 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3889 is already included here); see also FOL/ex/IffExample.thy;
3892 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3893 before); "cI" is no longer bound, use "c.intro" instead.
3894 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3895 axclasses vs. locales.
3897 * Improved internal renaming of symbolic identifiers -- attach primes
3898 instead of base 26 numbers.
3900 * New flag show_question_marks controls printing of leading question
3901 marks in schematic variable names.
3903 * In schematic variable names, *any* symbol following \<^isub> or
3904 \<^isup> is now treated as part of the base name. For example, the
3905 following works without printing of awkward ".0" indexes:
3907 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3910 * Inner syntax includes (*(*nested*) comments*).
3912 * Pretty printer now supports unbreakable blocks, specified in mixfix
3913 annotations as "(00...)".
3915 * Clear separation of logical types and nonterminals, where the latter
3916 may only occur in 'syntax' specifications or type abbreviations.
3917 Before that distinction was only partially implemented via type class
3918 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3919 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3920 exotic syntax specifications may require further adaption
3921 (e.g. Cube/Cube.thy).
3923 * Removed obsolete type class "logic", use the top sort {} instead.
3924 Note that non-logical types should be declared as 'nonterminals'
3925 rather than 'types'. INCOMPATIBILITY for new object-logic
3928 * Attributes 'induct' and 'cases': type or set names may now be
3929 locally fixed variables as well.
3931 * Simplifier: can now control the depth to which conditional rewriting
3932 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3935 * Simplifier: simplification procedures may now take the current
3936 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3937 interface), which is very useful for calling the Simplifier
3938 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3939 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3940 low-level mk_simproc no longer applies Logic.varify internally, to
3941 allow for use in a context of fixed variables.
3943 * thin_tac now works even if the assumption being deleted contains !!
3944 or ==>. More generally, erule now works even if the major premise of
3945 the elimination rule contains !! or ==>.
3947 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3949 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3950 from Pure, which contains all common declarations already. Both
3951 theories are defined via plain Isabelle/Isar .thy files.
3952 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3953 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3954 use isatool fixcpure to adapt your theory and ML sources.
3956 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3957 selections of theorems in named facts via index ranges.
3959 * 'print_theorems': in theory mode, really print the difference
3960 wrt. the last state (works for interactive theory development only),
3961 in proof mode print all local facts (cf. 'print_facts');
3963 * 'hide': option '(open)' hides only base names.
3965 * More efficient treatment of intermediate checkpoints in interactive
3968 * Code generator is now invoked via code_module (incremental code
3969 generation) and code_library (modular code generation, ML structures
3970 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3971 must be quoted when used as identifiers.
3973 * New 'value' command for reading, evaluating and printing terms using
3974 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3975 quoted when used as identifier.
3980 * New commands for the interpretation of locale expressions in
3981 theories (1), locales (2) and proof contexts (3). These generate
3982 proof obligations from the expression specification. After the
3983 obligations have been discharged, theorems of the expression are added
3984 to the theory, target locale or proof context. The synopsis of the
3985 commands is a follows:
3987 (1) interpretation expr inst
3988 (2) interpretation target < expr
3989 (3) interpret expr inst
3991 Interpretation in theories and proof contexts require a parameter
3992 instantiation of terms from the current context. This is applied to
3993 specifications and theorems of the interpreted expression.
3994 Interpretation in locales only permits parameter renaming through the
3995 locale expression. Interpretation is smart in that interpretations
3996 that are active already do not occur in proof obligations, neither are
3997 instantiated theorems stored in duplicate. Use 'print_interps' to
3998 inspect active interpretations of a particular locale. For details,
3999 see the Isar Reference manual. Examples can be found in
4000 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
4002 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
4003 'interpret' instead.
4005 * New context element 'constrains' for adding type constraints to
4008 * Context expressions: renaming of parameters with syntax
4011 * Locale declaration: 'includes' disallowed.
4013 * Proper static binding of attribute syntax -- i.e. types / terms /
4014 facts mentioned as arguments are always those of the locale definition
4015 context, independently of the context of later invocations. Moreover,
4016 locale operations (renaming and type / term instantiation) are applied
4017 to attribute arguments as expected.
4019 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4020 actual attributes; rare situations may require Attrib.attribute to
4021 embed those attributes into Attrib.src that lack concrete syntax.
4022 Attribute implementations need to cooperate properly with the static
4023 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4024 Attrib.XXX_thm etc. already do the right thing without further
4025 intervention. Only unusual applications -- such as "where" or "of"
4026 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4027 on the context and the facts involved -- may have to assign parsed
4028 values to argument tokens explicitly.
4030 * Changed parameter management in theorem generation for long goal
4031 statements with 'includes'. INCOMPATIBILITY: produces a different
4032 theorem statement in rare situations.
4034 * Locale inspection command 'print_locale' omits notes elements. Use
4035 'print_locale!' to have them included in the output.
4040 * Provers/hypsubst.ML: improved version of the subst method, for
4041 single-step rewriting: it now works in bound variable contexts. New is
4042 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4043 rewrite a different subterm than the original subst method, which is
4044 still available as 'simplesubst'.
4046 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4049 * Provers/trancl.ML: new transitivity reasoner for transitive and
4050 reflexive-transitive closure of relations.
4052 * Provers/blast.ML: new reference depth_limit to make blast's depth
4053 limit (previously hard-coded with a value of 20) user-definable.
4055 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4056 is peformed already. Object-logics merely need to finish their
4057 initial simpset configuration as before. INCOMPATIBILITY.
4062 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4065 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4067 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4068 and x-symbol; use option '-m epsilon' to get it actually printed.
4069 Moreover, the mathematically important symbolic identifier \<epsilon>
4070 becomes available as variable, constant etc. INCOMPATIBILITY,
4072 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4073 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4074 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4075 support corresponding Isar calculations.
4077 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4080 * theory SetInterval: changed the syntax for open intervals:
4089 The old syntax is still supported but will disappear in the next
4090 release. For conversion use the following Emacs search and replace
4091 patterns (these are not perfect but work quite well):
4093 {)\([^\.]*\)\.\. -> {\1<\.\.}
4094 \.\.\([^(}]*\)(} -> \.\.<\1}
4096 * Theory Commutative_Ring (in Library): method comm_ring for proving
4097 equalities in commutative rings; method 'algebra' provides a generic
4100 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4101 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4102 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4105 Some new syntax forms are available:
4107 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4108 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4109 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4110 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4112 The latter form "\<Sum>x < k. e" used to be based on a separate
4113 function "Summation", which has been discontinued.
4115 * theory Finite_Set: in structured induction proofs, the insert case
4116 is now 'case (insert x F)' instead of the old counterintuitive 'case
4119 * The 'refute' command has been extended to support a much larger
4120 fragment of HOL, including axiomatic type classes, constdefs and
4121 typedefs, inductive datatypes and recursion.
4123 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4124 Requires zChaff with proof generation to be installed. See
4125 HOL/ex/SAT_Examples.thy for examples.
4127 * Datatype induction via method 'induct' now preserves the name of the
4128 induction variable. For example, when proving P(xs::'a list) by
4129 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4130 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4131 in unstructured proof scripts.
4133 * Reworked implementation of records. Improved scalability for
4134 records with many fields, avoiding performance problems for type
4135 inference. Records are no longer composed of nested field types, but
4136 of nested extension types. Therefore the record type only grows linear
4137 in the number of extensions and not in the number of fields. The
4138 top-level (users) view on records is preserved. Potential
4139 INCOMPATIBILITY only in strange cases, where the theory depends on the
4140 old record representation. The type generated for a record is called
4141 <record_name>_ext_type.
4143 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4144 proofs triggered by a record definition or a simproc (if
4145 quick_and_dirty is enabled). Definitions of large records can take
4148 New simproc record_upd_simproc for simplification of multiple record
4149 updates enabled by default. Moreover, trivial updates are also
4150 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4151 occasionally, since simplification is more powerful by default.
4153 * typedef: proper support for polymorphic sets, which contain extra
4154 type-variables in the term.
4156 * Simplifier: automatically reasons about transitivity chains
4157 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4158 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4159 old proofs break occasionally as simplification may now solve more
4160 goals than previously.
4162 * Simplifier: converts x <= y into x = y if assumption y <= x is
4163 present. Works for all partial orders (class "order"), in particular
4164 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4167 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4168 bound variable or a constant then the let is unfolded. Otherwise
4169 first a is simplified to b, and then f b is simplified to g. If
4170 possible we abstract b from g arriving at "let x = b in h x",
4171 otherwise we unfold the let and arrive at g. The simproc can be
4172 enabled/disabled by the reference use_let_simproc. Potential
4173 INCOMPATIBILITY since simplification is more powerful by default.
4175 * Classical reasoning: the meson method now accepts theorems as arguments.
4177 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4178 jobs to provide advice on the provability of subgoals.
4180 * Theory OrderedGroup and Ring_and_Field: various additions and
4181 improvements to faciliate calculations involving equalities and
4184 The following theorems have been eliminated or modified
4187 abs_eq now named abs_of_nonneg
4188 abs_of_ge_0 now named abs_of_nonneg
4189 abs_minus_eq now named abs_of_nonpos
4190 imp_abs_id now named abs_of_nonneg
4191 imp_abs_neg_id now named abs_of_nonpos
4192 mult_pos now named mult_pos_pos
4193 mult_pos_le now named mult_nonneg_nonneg
4194 mult_pos_neg_le now named mult_nonneg_nonpos
4195 mult_pos_neg2_le now named mult_nonneg_nonpos2
4196 mult_neg now named mult_neg_neg
4197 mult_neg_le now named mult_nonpos_nonpos
4199 * The following lemmas in Ring_and_Field have been added to the simplifier:
4202 not_square_less_zero
4204 The following lemmas have been deleted from Real/RealPow:
4214 * Theory Parity: added rules for simplifying exponents.
4218 The following theorems have been eliminated or modified
4221 list_all_Nil now named list_all.simps(1)
4222 list_all_Cons now named list_all.simps(2)
4223 list_all_conv now named list_all_iff
4224 set_mem_eq now named mem_iff
4226 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4227 asymptotic "big O" calculations. See the notes in BigO.thy.
4232 * Theory RealDef: better support for embedding natural numbers and
4233 integers in the reals.
4235 The following theorems have been eliminated or modified
4238 exp_ge_add_one_self now requires no hypotheses
4239 real_of_int_add reversed direction of equality (use [symmetric])
4240 real_of_int_minus reversed direction of equality (use [symmetric])
4241 real_of_int_diff reversed direction of equality (use [symmetric])
4242 real_of_int_mult reversed direction of equality (use [symmetric])
4244 * Theory RComplete: expanded support for floor and ceiling functions.
4246 * Theory Ln is new, with properties of the natural logarithm
4248 * Hyperreal: There is a new type constructor "star" for making
4249 nonstandard types. The old type names are now type synonyms:
4253 hcomplex = complex star
4255 * Hyperreal: Many groups of similarly-defined constants have been
4256 replaced by polymorphic versions (INCOMPATIBILITY):
4258 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4260 starset <-- starsetNat, starsetC
4261 *s* <-- *sNat*, *sc*
4262 starset_n <-- starsetNat_n, starsetC_n
4263 *sn* <-- *sNatn*, *scn*
4264 InternalSets <-- InternalNatSets, InternalCSets
4266 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4267 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4268 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4269 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4270 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4272 * Hyperreal: Many type-specific theorems have been removed in favor of
4273 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4275 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4276 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4277 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4278 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4279 right_minus <-- hypreal_add_minus
4280 left_minus <-- {hypreal,hcomplex}_add_minus_left
4281 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4282 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4283 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4284 mult_1_right <-- hcomplex_mult_one_right
4285 mult_zero_left <-- hcomplex_mult_zero_left
4286 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4287 right_distrib <-- hypnat_add_mult_distrib2
4288 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4289 right_inverse <-- hypreal_mult_inverse
4290 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4291 order_refl <-- {hypreal,hypnat}_le_refl
4292 order_trans <-- {hypreal,hypnat}_le_trans
4293 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4294 order_less_le <-- {hypreal,hypnat}_less_le
4295 linorder_linear <-- {hypreal,hypnat}_le_linear
4296 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4297 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4298 add_nonneg_nonneg <-- hypreal_le_add_order
4300 * Hyperreal: Separate theorems having to do with type-specific
4301 versions of constants have been merged into theorems that apply to the
4302 new polymorphic constants (INCOMPATIBILITY):
4304 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4305 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4306 STAR_Un <-- {STAR,NatStar,STARC}_Un
4307 STAR_Int <-- {STAR,NatStar,STARC}_Int
4308 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4309 STAR_subset <-- {STAR,NatStar,STARC}_subset
4310 STAR_mem <-- {STAR,NatStar,STARC}_mem
4311 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4312 STAR_diff <-- {STAR,STARC}_diff
4313 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4314 STARC_hcomplex_of_complex}_image_subset
4315 starset_n_Un <-- starset{Nat,C}_n_Un
4316 starset_n_Int <-- starset{Nat,C}_n_Int
4317 starset_n_Compl <-- starset{Nat,C}_n_Compl
4318 starset_n_diff <-- starset{Nat,C}_n_diff
4319 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4320 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4321 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4322 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4323 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4324 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4325 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4326 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4327 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4328 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4329 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4330 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4331 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4332 starfun_diff <-- starfun{C,RC,CR}_diff
4333 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4334 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4335 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4336 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4337 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4338 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4339 starfun_Id <-- starfunC_Id
4340 starfun_approx <-- starfun{Nat,CR}_approx
4341 starfun_capprox <-- starfun{C,RC}_capprox
4342 starfun_abs <-- starfunNat_rabs
4343 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4344 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4345 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4346 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4347 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4348 starfun_add_approx <-- starfunCR_add_approx
4349 starfun_inverse_inverse <-- starfunC_inverse_inverse
4350 starfun_divide <-- starfun{C,CR,RC}_divide
4351 starfun_n <-- starfun{Nat,C}_n
4352 starfun_n_mult <-- starfun{Nat,C}_n_mult
4353 starfun_n_add <-- starfun{Nat,C}_n_add
4354 starfun_n_add_minus <-- starfunNat_n_add_minus
4355 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4356 starfun_n_minus <-- starfun{Nat,C}_n_minus
4357 starfun_n_eq <-- starfun{Nat,C}_n_eq
4359 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4360 star_n_minus <-- {hypreal,hcomplex}_minus
4361 star_n_diff <-- {hypreal,hcomplex}_diff
4362 star_n_mult <-- {hypreal,hcomplex}_mult
4363 star_n_inverse <-- {hypreal,hcomplex}_inverse
4364 star_n_le <-- {hypreal,hypnat}_le
4365 star_n_less <-- {hypreal,hypnat}_less
4366 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4367 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4368 star_n_abs <-- hypreal_hrabs
4369 star_n_divide <-- hcomplex_divide
4371 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4372 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4373 star_of_diff <-- hypreal_of_real_diff
4374 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4375 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4376 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4377 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4378 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4379 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4380 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4381 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4382 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4383 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4384 star_of_number_of <-- {hypreal,hcomplex}_number_of
4385 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4386 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4387 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4388 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4389 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4390 star_of_power <-- hypreal_of_real_power
4391 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4393 * Hyperreal: new method "transfer" that implements the transfer
4394 principle of nonstandard analysis. With a subgoal that mentions
4395 nonstandard types like "'a star", the command "apply transfer"
4396 replaces it with an equivalent one that mentions only standard types.
4397 To be successful, all free variables must have standard types; non-
4398 standard variables must have explicit universal quantifiers.
4400 * Hyperreal: A theory of Taylor series.
4405 * Discontinued special version of 'constdefs' (which used to support
4406 continuous functions) in favor of the general Pure one with full
4409 * New simplification procedure for solving continuity conditions; it
4410 is much faster on terms with many nested lambda abstractions (cubic
4411 instead of exponential time).
4413 * New syntax for domain package: selector names are now optional.
4414 Parentheses should be omitted unless argument is lazy, for example:
4416 domain 'a stream = cons "'a" (lazy "'a stream")
4418 * New command 'fixrec' for defining recursive functions with pattern
4419 matching; defining multiple functions with mutual recursion is also
4420 supported. Patterns may include the constants cpair, spair, up, sinl,
4421 sinr, or any data constructor defined by the domain package. The given
4422 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4423 syntax and examples.
4425 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4426 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4427 but the proof obligation additionally includes an admissibility
4428 requirement. The packages generate instances of class cpo or pcpo,
4429 with continuity and strictness theorems for Rep and Abs.
4431 * HOLCF: Many theorems have been renamed according to a more standard naming
4432 scheme (INCOMPATIBILITY):
4434 foo_inject: "foo$x = foo$y ==> x = y"
4435 foo_eq: "(foo$x = foo$y) = (x = y)"
4436 foo_less: "(foo$x << foo$y) = (x << y)"
4437 foo_strict: "foo$UU = UU"
4438 foo_defined: "... ==> foo$x ~= UU"
4439 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4444 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4445 including the First Isomorphism Theorem (on quotienting by the kernel
4448 * ZF/Simplifier: install second copy of type solver that actually
4449 makes use of TC rules declared to Isar proof contexts (or locales);
4450 the old version is still required for ML proof scripts.
4455 * Converted to Isar theory format; use locales instead of axiomatic
4461 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4464 * Pure/library.ML no longer defines its own option datatype, but uses
4465 that of the SML basis, which has constructors NONE and SOME instead of
4466 None and Some, as well as exception Option.Option instead of OPTION.
4467 The functions the, if_none, is_some, is_none have been adapted
4468 accordingly, while Option.map replaces apsome.
4470 * Pure/library.ML: the exception LIST has been given up in favour of
4471 the standard exceptions Empty and Subscript, as well as
4472 Library.UnequalLengths. Function like Library.hd and Library.tl are
4473 superceded by the standard hd and tl functions etc.
4475 A number of basic list functions are no longer exported to the ML
4476 toplevel, as they are variants of predefined functions. The following
4477 suggests how one can translate existing code:
4479 rev_append xs ys = List.revAppend (xs, ys)
4480 nth_elem (i, xs) = List.nth (xs, i)
4481 last_elem xs = List.last xs
4482 flat xss = List.concat xss
4483 seq fs = List.app fs
4484 partition P xs = List.partition P xs
4485 mapfilter f xs = List.mapPartial f xs
4487 * Pure/library.ML: several combinators for linear functional
4488 transformations, notably reverse application and composition:
4491 (x, y) |-> f f #-> g
4493 * Pure/library.ML: introduced/changed precedence of infix operators:
4495 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4497 infix 3 o oo ooo oooo;
4498 infix 4 ~~ upto downto;
4500 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4503 * Pure/library.ML: natural list combinators fold, fold_rev, and
4504 fold_map support linear functional transformations and nesting. For
4507 fold f [x1, ..., xN] y =
4508 y |> f x1 |> ... |> f xN
4510 (fold o fold) f [xs1, ..., xsN] y =
4511 y |> fold f xs1 |> ... |> fold f xsN
4513 fold f [x1, ..., xN] =
4516 (fold o fold) f [xs1, ..., xsN] =
4517 fold f xs1 #> ... #> fold f xsN
4519 * Pure/library.ML: the following selectors on type 'a option are
4522 the: 'a option -> 'a (*partial*)
4523 these: 'a option -> 'a where 'a = 'b list
4524 the_default: 'a -> 'a option -> 'a
4525 the_list: 'a option -> 'a list
4527 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4528 basic operations for association lists, following natural argument
4529 order; moreover the explicit equality predicate passed here avoids
4530 potentially expensive polymorphic runtime equality checks.
4531 The old functions may be expressed as follows:
4533 assoc = uncurry (AList.lookup (op =))
4534 assocs = these oo AList.lookup (op =)
4535 overwrite = uncurry (AList.update (op =)) o swap
4537 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4539 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4540 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4542 replacing make_keylist and keyfilter (occassionally used)
4545 make_keylist = AList.make
4546 keyfilter = AList.find (op =)
4548 * eq_fst and eq_snd now take explicit equality parameter, thus
4549 avoiding eqtypes. Naive rewrites:
4551 eq_fst = eq_fst (op =)
4552 eq_snd = eq_snd (op =)
4554 * Removed deprecated apl and apr (rarely used).
4557 apl (n, op) =>>= curry op n
4558 apr (op, m) =>>= fn n => op (n, m)
4560 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4561 provides a reasonably efficient light-weight implementation of sets as
4564 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4565 few new operations; existing lookup and update are now curried to
4566 follow natural argument order (for use with fold etc.);
4567 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4569 * Pure/General: output via the Isabelle channels of
4570 writeln/warning/error etc. is now passed through Output.output, with a
4571 hook for arbitrary transformations depending on the print_mode
4572 (cf. Output.add_mode -- the first active mode that provides a output
4573 function wins). Already formatted output may be embedded into further
4574 text via Output.raw; the result of Pretty.string_of/str_of and derived
4575 functions (string_of_term/cterm/thm etc.) is already marked raw to
4576 accommodate easy composition of diagnostic messages etc. Programmers
4577 rarely need to care about Output.output or Output.raw at all, with
4578 some notable exceptions: Output.output is required when bypassing the
4579 standard channels (writeln etc.), or in token translations to produce
4580 properly formatted results; Output.raw is required when capturing
4581 already output material that will eventually be presented to the user
4582 a second time. For the default print mode, both Output.output and
4583 Output.raw have no effect.
4585 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4586 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4587 cumulative results are displayed at the end of a batch session.
4589 * Pure/General: File.sysify_path and File.quote_sysify path have been
4590 replaced by File.platform_path and File.shell_path (with appropriate
4591 hooks). This provides a clean interface for unusual systems where the
4592 internal and external process view of file names are different.
4594 * Pure: more efficient orders for basic syntactic entities: added
4595 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4596 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4597 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4598 orders now -- potential INCOMPATIBILITY for code that depends on a
4599 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4600 Library.sort_strings on result).
4602 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4603 fold_types traverse types/terms from left to right, observing natural
4604 argument order. Supercedes previous foldl_XXX versions, add_frees,
4605 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4607 * Pure: name spaces have been refined, with significant changes of the
4608 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4609 to extern(_table). The plain name entry path is superceded by a
4610 general 'naming' context, which also includes the 'policy' to produce
4611 a fully qualified name and external accesses of a fully qualified
4612 name; NameSpace.extend is superceded by context dependent
4613 Sign.declare_name. Several theory and proof context operations modify
4614 the naming context. Especially note Theory.restore_naming and
4615 ProofContext.restore_naming to get back to a sane state; note that
4616 Theory.add_path is no longer sufficient to recover from
4617 Theory.absolute_path in particular.
4619 * Pure: new flags short_names (default false) and unique_names
4620 (default true) for controlling output of qualified names. If
4621 short_names is set, names are printed unqualified. If unique_names is
4622 reset, the name prefix is reduced to the minimum required to achieve
4623 the original result when interning again, even if there is an overlap
4624 with earlier declarations.
4626 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4627 now 'extend', and 'merge' gets an additional Pretty.pp argument
4628 (useful for printing error messages). INCOMPATIBILITY.
4630 * Pure: major reorganization of the theory context. Type Sign.sg and
4631 Theory.theory are now identified, referring to the universal
4632 Context.theory (see Pure/context.ML). Actual signature and theory
4633 content is managed as theory data. The old code and interfaces were
4634 spread over many files and structures; the new arrangement introduces
4635 considerable INCOMPATIBILITY to gain more clarity:
4637 Context -- theory management operations (name, identity, inclusion,
4638 parents, ancestors, merge, etc.), plus generic theory data;
4640 Sign -- logical signature and syntax operations (declaring consts,
4641 types, etc.), plus certify/read for common entities;
4643 Theory -- logical theory operations (stating axioms, definitions,
4644 oracles), plus a copy of logical signature operations (consts,
4645 types, etc.); also a few basic management operations (Theory.copy,
4648 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4649 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4650 for convenience -- they merely return the theory.
4652 * Pure: type Type.tsig is superceded by theory in most interfaces.
4654 * Pure: the Isar proof context type is already defined early in Pure
4655 as Context.proof (note that ProofContext.context and Proof.context are
4656 aliases, where the latter is the preferred name). This enables other
4657 Isabelle components to refer to that type even before Isar is present.
4659 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4660 typeK, constK, axiomK, oracleK), but provide explicit operations for
4661 any of these kinds. For example, Sign.intern typeK is now
4662 Sign.intern_type, Theory.hide_space Sign.typeK is now
4663 Theory.hide_types. Also note that former
4664 Theory.hide_classes/types/consts are now
4665 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4666 internalize their arguments! INCOMPATIBILITY.
4668 * Pure: get_thm interface (of PureThy and ProofContext) expects
4669 datatype thmref (with constructors Name and NameSelection) instead of
4670 plain string -- INCOMPATIBILITY;
4672 * Pure: cases produced by proof methods specify options, where NONE
4673 means to remove case bindings -- INCOMPATIBILITY in
4676 * Pure: the following operations retrieve axioms or theorems from a
4677 theory node or theory hierarchy, respectively:
4679 Theory.axioms_of: theory -> (string * term) list
4680 Theory.all_axioms_of: theory -> (string * term) list
4681 PureThy.thms_of: theory -> (string * thm) list
4682 PureThy.all_thms_of: theory -> (string * thm) list
4684 * Pure: print_tac now outputs the goal through the trace channel.
4686 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4687 Reference Toplevel.debug (default false) controls detailed printing
4688 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4689 controls execution profiling -- set to 1 for time and 2 for space
4690 (both increase the runtime).
4692 * Isar session: The initial use of ROOT.ML is now always timed,
4693 i.e. the log will show the actual process times, in contrast to the
4694 elapsed wall-clock time that the outer shell wrapper produces.
4696 * Simplifier: improved handling of bound variables (nameless
4697 representation, avoid allocating new strings). Simprocs that invoke
4698 the Simplifier recursively should use Simplifier.inherit_bounds to
4699 avoid local name clashes. Failure to do so produces warnings
4700 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4701 for further details.
4703 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4704 bindings for all theorems stored within a given theory; this may help
4705 in porting non-Isar theories to Isar ones, while keeping ML proof
4706 scripts for the time being.
4708 * ML operator HTML.with_charset specifies the charset begin used for
4709 generated HTML files. For example:
4711 HTML.with_charset "utf-8" use_thy "Hebrew";
4712 HTML.with_charset "utf-8" use_thy "Chinese";
4717 * Allow symlinks to all proper Isabelle executables (Isabelle,
4718 isabelle, isatool etc.).
4720 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4721 isatool doc, isatool mkdir, display_drafts etc.).
4723 * isatool usedir: option -f allows specification of the ML file to be
4724 used by Isabelle; default is ROOT.ML.
4726 * New isatool version outputs the version identifier of the Isabelle
4727 distribution being used.
4729 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4730 (containing Boolean satisfiability problems) into Isabelle/HOL
4735 New in Isabelle2004 (April 2004)
4736 --------------------------------
4740 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4741 Replaces linorder.ML.
4743 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4744 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4745 (\<a>...\<z>), are now considered normal letters, and can therefore
4746 be used anywhere where an ASCII letter (a...zA...Z) has until
4747 now. COMPATIBILITY: This obviously changes the parsing of some
4748 terms, especially where a symbol has been used as a binder, say
4749 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4750 as an identifier. Fix it by inserting a space around former
4751 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4752 existing theory and ML files.
4754 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4756 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4757 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4758 a normal (but invisible) letter. For multiple letter subscripts repeat
4759 \<^isub> like this: x\<^isub>1\<^isub>2.
4761 * Pure: There are now sub-/superscripts that can span more than one
4762 character. Text between \<^bsub> and \<^esub> is set in subscript in
4763 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4764 superscript. The new control characters are not identifier parts.
4766 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4767 content of "..." to the latex file instead of \isacntrl... . The "..."
4768 may consist of any printable characters excluding the end bracket >.
4770 * Pure: Using new Isar command "finalconsts" (or the ML functions
4771 Theory.add_finals or Theory.add_finals_i) it is now possible to
4772 declare constants "final", which prevents their being given a definition
4773 later. It is useful for constants whose behaviour is fixed axiomatically
4774 rather than definitionally, such as the meta-logic connectives.
4776 * Pure: 'instance' now handles general arities with general sorts
4777 (i.e. intersections of classes),
4779 * Presentation: generated HTML now uses a CSS style sheet to make layout
4780 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4781 It can be changed to alter the colors/layout of generated pages.
4786 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4787 cut_tac, subgoal_tac and thin_tac:
4788 - Now understand static (Isar) contexts. As a consequence, users of Isar
4789 locales are no longer forced to write Isar proof scripts.
4790 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4792 - INCOMPATIBILITY: names of variables to be instantiated may no
4793 longer be enclosed in quotes. Instead, precede variable name with `?'.
4794 This is consistent with the instantiation attribute "where".
4796 * Attributes "where" and "of":
4797 - Now take type variables of instantiated theorem into account when reading
4798 the instantiation string. This fixes a bug that caused instantiated
4799 theorems to have too special types in some circumstances.
4800 - "where" permits explicit instantiations of type variables.
4802 * Calculation commands "moreover" and "also" no longer interfere with
4803 current facts ("this"), admitting arbitrary combinations with "then"
4807 - Goal statements involving the context element "includes" no longer
4808 generate theorems with internal delta predicates (those ending on
4809 "_axioms") in the premise.
4810 Resolve particular premise with <locale>.intro to obtain old form.
4811 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4812 specification and "includes" elements in goal statement.
4813 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4814 [intro?] and [elim?] (respectively) by default.
4815 - Experimental command for instantiation of locales in proof contexts:
4816 instantiate <label>[<attrs>]: <loc>
4817 Instantiates locale <loc> and adds all its theorems to the current context
4818 taking into account their attributes. Label and attrs are optional
4819 modifiers, like in theorem declarations. If present, names of
4820 instantiated theorems are qualified with <label>, and the attributes
4821 <attrs> are applied after any attributes these theorems might have already.
4822 If the locale has assumptions, a chained fact of the form
4823 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4824 are derived. The command does not support old-style locales declared
4825 with "locale (open)".
4826 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4828 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4834 * Proof import: new image HOL4 contains the imported library from
4835 the HOL4 system with about 2500 theorems. It is imported by
4836 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4837 can be used like any other Isabelle image. See
4838 HOL/Import/HOL/README for more information.
4841 - Much improved handling of linear and partial orders.
4842 Reasoners for linear and partial orders are set up for type classes
4843 "linorder" and "order" respectively, and are added to the default simpset
4844 as solvers. This means that the simplifier can build transitivity chains
4845 to solve goals from the assumptions.
4846 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4847 of blast or auto after simplification become unnecessary because the goal
4848 is solved by simplification already.
4850 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4851 all proved in axiomatic type classes for semirings, rings and fields.
4854 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4855 now formalized using the Ring_and_Field theory mentioned above.
4856 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4857 than before, because now they are set up once in a generic manner.
4858 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4859 Look for the general versions in Ring_and_Field (and Power if they concern
4862 * Type "rat" of the rational numbers is now available in HOL-Complex.
4865 - Record types are now by default printed with their type abbreviation
4866 instead of the list of all field types. This can be configured via
4867 the reference "print_record_type_abbr".
4868 - Simproc "record_upd_simproc" for simplification of multiple updates added
4869 (not enabled by default).
4870 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4871 EX x. x = sel r to True (not enabled by default).
4872 - Tactic "record_split_simp_tac" to split and simplify records added.
4874 * 'specification' command added, allowing for definition by
4875 specification. There is also an 'ax_specification' command that
4876 introduces the new constants axiomatically.
4878 * arith(_tac) is now able to generate counterexamples for reals as well.
4880 * HOL-Algebra: new locale "ring" for non-commutative rings.
4882 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4883 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4885 * HOL-Matrix: a first theory for matrices in HOL with an application of
4886 matrix theory to linear programming.
4888 * Unions and Intersections:
4889 The latex output syntax of UN and INT has been changed
4890 from "\Union x \in A. B" to "\Union_{x \in A} B"
4891 i.e. the index formulae has become a subscript.
4892 Similarly for "\Union x. B", and for \Inter instead of \Union.
4894 * Unions and Intersections over Intervals:
4895 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4896 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4897 like in normal math, and corresponding versions for < and for intersection.
4899 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4900 lexicographic dictonary ordering has been added as "lexord".
4902 * ML: the legacy theory structures Int and List have been removed. They had
4903 conflicted with ML Basis Library structures having the same names.
4905 * 'refute' command added to search for (finite) countermodels. Only works
4906 for a fragment of HOL. The installation of an external SAT solver is
4907 highly recommended. See "HOL/Refute.thy" for details.
4909 * 'quickcheck' command: Allows to find counterexamples by evaluating
4910 formulae under an assignment of free variables to random values.
4911 In contrast to 'refute', it can deal with inductive datatypes,
4912 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4918 * Streams now come with concatenation and are part of the HOLCF image
4922 New in Isabelle2003 (May 2003)
4923 ------------------------------
4927 * Provers/simplifier:
4929 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4930 Assumptions are now subject to complete mutual simplification,
4931 not just from left to right. The simplifier now preserves
4932 the order of assumptions.
4934 Potential INCOMPATIBILITY:
4936 -- simp sometimes diverges where the old version did
4937 not, e.g. invoking simp on the goal
4939 [| P (f x); y = x; f x = f y |] ==> Q
4941 now gives rise to the infinite reduction sequence
4943 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4945 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4948 -- Tactics combining classical reasoner and simplification (such as auto)
4949 are also affected by this change, because many of them rely on
4950 simp. They may sometimes diverge as well or yield a different numbers
4951 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4952 in case of problems. Sometimes subsequent calls to the classical
4953 reasoner will fail because a preceeding call to the simplifier too
4954 eagerly simplified the goal, e.g. deleted redundant premises.
4956 - The simplifier trace now shows the names of the applied rewrite rules
4958 - You can limit the number of recursive invocations of the simplifier
4959 during conditional rewriting (where the simplifie tries to solve the
4960 conditions before applying the rewrite rule):
4961 ML "simp_depth_limit := n"
4962 where n is an integer. Thus you can force termination where previously
4963 the simplifier would diverge.
4965 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4967 - No longer aborts on failed congruence proof. Instead, the
4968 congruence is ignored.
4970 * Pure: New generic framework for extracting programs from constructive
4971 proofs. See HOL/Extraction.thy for an example instantiation, as well
4972 as HOL/Extraction for some case studies.
4974 * Pure: The main goal of the proof state is no longer shown by default, only
4975 the subgoals. This behaviour is controlled by a new flag.
4976 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4977 (ML: Proof.show_main_goal).
4979 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4980 rules whose conclusion matches subgoal 1:
4981 PG menu: Isabelle/Isar -> Show me -> matching rules
4982 The rules are ordered by how closely they match the subgoal.
4983 In particular, rules that solve a subgoal outright are displayed first
4984 (or rather last, the way they are printed).
4985 (ML: ProofGeneral.print_intros())
4987 * Pure: New flag trace_unify_fail causes unification to print
4988 diagnostic information (PG: in trace buffer) when it fails. This is
4989 useful for figuring out why single step proofs like rule, erule or
4992 * Pure: Locale specifications now produce predicate definitions
4993 according to the body of text (covering assumptions modulo local
4994 definitions); predicate "loc_axioms" covers newly introduced text,
4995 while "loc" is cumulative wrt. all included locale expressions; the
4996 latter view is presented only on export into the global theory
4997 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4998 on the old view without predicates;
5000 * Pure: predefined locales "var" and "struct" are useful for sharing
5001 parameters (as in CASL, for example); just specify something like
5002 ``var x + var y + struct M'' as import;
5004 * Pure: improved thms_containing: proper indexing of facts instead of
5005 raw theorems; check validity of results wrt. current name space;
5006 include local facts of proof configuration (also covers active
5007 locales), cover fixed variables in index; may use "_" in term
5008 specification; an optional limit for the number of printed facts may
5009 be given (the default is 40);
5011 * Pure: disallow duplicate fact bindings within new-style theory files
5014 * Provers: improved induct method: assumptions introduced by case
5015 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5016 the goal statement); "foo" still refers to all facts collectively;
5018 * Provers: the function blast.overloaded has been removed: all constants
5019 are regarded as potentially overloaded, which improves robustness in exchange
5020 for slight decrease in efficiency;
5022 * Provers/linorder: New generic prover for transitivity reasoning over
5023 linear orders. Note: this prover is not efficient!
5025 * Isar: preview of problems to finish 'show' now produce an error
5026 rather than just a warning (in interactive mode);
5033 - Produces a counter example if it cannot prove a goal.
5034 Note that the counter example may be spurious if the goal is not a formula
5035 of quantifier-free linear arithmetic.
5036 In ProofGeneral the counter example appears in the trace buffer.
5038 - Knows about div k and mod k where k is a numeral of type nat or int.
5040 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5041 linear arithmetic fails. This takes account of quantifiers and divisibility.
5042 Presburger arithmetic can also be called explicitly via presburger(_tac).
5044 * simp's arithmetic capabilities have been enhanced a bit: it now
5045 takes ~= in premises into account (by performing a case split);
5047 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5048 are distributed over a sum of terms;
5050 * New tactic "trans_tac" and method "trans" instantiate
5051 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5054 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5055 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5057 * 'typedef' command has new option "open" to suppress the set
5060 * functions Min and Max on finite sets have been introduced (theory
5063 * attribute [symmetric] now works for relations as well; it turns
5064 (x,y) : R^-1 into (y,x) : R, and vice versa;
5066 * induct over a !!-quantified statement (say !!x1..xn):
5067 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5069 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5070 %x. None. Warning: empty_def now refers to the previously hidden definition
5073 * Algebra: formalization of classical algebra. Intended as base for
5074 any algebraic development in Isabelle. Currently covers group theory
5075 (up to Sylow's theorem) and ring theory (Universal Property of
5076 Univariate Polynomials). Contributions welcome;
5078 * GroupTheory: deleted, since its material has been moved to Algebra;
5080 * Complex: new directory of the complex numbers with numeric constants,
5081 nonstandard complex numbers, and some complex analysis, standard and
5082 nonstandard (Jacques Fleuriot);
5084 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5086 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5089 * Real/HahnBanach: updated and adapted to locales;
5091 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5094 * UNITY: added the Meier-Sanders theory of progress sets;
5096 * MicroJava: bytecode verifier and lightweight bytecode verifier
5097 as abstract algorithms, instantiated to the JVM;
5099 * Bali: Java source language formalization. Type system, operational
5100 semantics, axiomatic semantics. Supported language features:
5101 classes, interfaces, objects,virtual methods, static methods,
5102 static/instance fields, arrays, access modifiers, definite
5103 assignment, exceptions.
5108 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5111 * Main ZF: virtually all theories converted to new-style format;
5116 * Pure: Tactic.prove provides sane interface for internal proofs;
5117 omits the infamous "standard" operation, so this is more appropriate
5118 than prove_goalw_cterm in many situations (e.g. in simprocs);
5120 * Pure: improved error reporting of simprocs;
5122 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5126 *** Document preparation ***
5128 * uses \par instead of \\ for line breaks in theory text. This may
5129 shift some page breaks in large documents. To get the old behaviour
5130 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5132 * minimized dependencies of isabelle.sty and isabellesym.sty on
5135 * \<euro> now needs package babel/greek instead of marvosym (which
5138 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5143 New in Isabelle2002 (March 2002)
5144 --------------------------------
5146 *** Document preparation ***
5148 * greatly simplified document preparation setup, including more
5149 graceful interpretation of isatool usedir -i/-d/-D options, and more
5150 instructive isatool mkdir; users should basically be able to get
5151 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5152 users may run a separate document processing stage manually like this:
5153 "isatool usedir -D output HOL Test && isatool document Test/output";
5155 * theory dependency graph may now be incorporated into documents;
5156 isatool usedir -g true will produce session_graph.eps/.pdf for use
5157 with \includegraphics of LaTeX;
5159 * proper spacing of consecutive markup elements, especially text
5160 blocks after section headings;
5162 * support bold style (for single symbols only), input syntax is like
5163 this: "\<^bold>\<alpha>" or "\<^bold>A";
5165 * \<bullet> is now output as bold \cdot by default, which looks much
5166 better in printed text;
5168 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5169 note that these symbols are currently unavailable in Proof General /
5170 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5172 * isatool latex no longer depends on changed TEXINPUTS, instead
5173 isatool document copies the Isabelle style files to the target
5179 * Pure/Provers: improved proof by cases and induction;
5180 - 'case' command admits impromptu naming of parameters (such as
5182 - 'induct' method divinates rule instantiation from the inductive
5183 claim; no longer requires excessive ?P bindings for proper
5184 instantiation of cases;
5185 - 'induct' method properly enumerates all possibilities of set/type
5186 rules; as a consequence facts may be also passed through *type*
5187 rules without further ado;
5188 - 'induct' method now derives symbolic cases from the *rulified*
5189 rule (before it used to rulify cases stemming from the internal
5190 atomized version); this means that the context of a non-atomic
5191 statement becomes is included in the hypothesis, avoiding the
5192 slightly cumbersome show "PROP ?case" form;
5193 - 'induct' may now use elim-style induction rules without chaining
5194 facts, using ``missing'' premises from the goal state; this allows
5195 rules stemming from inductive sets to be applied in unstructured
5196 scripts, while still benefitting from proper handling of non-atomic
5197 statements; NB: major inductive premises need to be put first, all
5198 the rest of the goal is passed through the induction;
5199 - 'induct' proper support for mutual induction involving non-atomic
5200 rule statements (uses the new concept of simultaneous goals, see
5202 - append all possible rule selections, but only use the first
5203 success (no backtracking);
5204 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5205 - undeclared rule case names default to numbers 1, 2, 3, ...;
5206 - added 'print_induct_rules' (covered by help item in recent Proof
5208 - moved induct/cases attributes to Pure, methods to Provers;
5209 - generic method setup instantiated for FOL and HOL;
5211 * Pure: support multiple simultaneous goal statements, for example
5212 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5213 meta-level mechanism, this acts as if several individual goals had
5214 been stated separately; in particular common proof methods need to be
5215 repeated in order to cover all claims; note that a single elimination
5216 step is *not* sufficient to establish the two conjunctions, so this
5219 assume "A & B" then have A and B .. (*".." fails*)
5221 better use "obtain" in situations as above; alternative refer to
5222 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5224 * Pure: proper integration with ``locales''; unlike the original
5225 version by Florian Kammller, Isar locales package high-level proof
5226 contexts rather than raw logical ones (e.g. we admit to include
5227 attributes everywhere); operations on locales include merge and
5228 rename; support for implicit arguments (``structures''); simultaneous
5229 type-inference over imports and text; see also HOL/ex/Locales.thy for
5232 * Pure: the following commands have been ``localized'', supporting a
5233 target locale specification "(in name)": 'lemma', 'theorem',
5234 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5235 stored both within the locale and at the theory level (exported and
5236 qualified by the locale name);
5238 * Pure: theory goals may now be specified in ``long'' form, with
5239 ad-hoc contexts consisting of arbitrary locale elements. for example
5240 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5241 definitions may be given, too); the result is a meta-level rule with
5242 the context elements being discharged in the obvious way;
5244 * Pure: new proof command 'using' allows to augment currently used
5245 facts after a goal statement ('using' is syntactically analogous to
5246 'apply', but acts on the goal's facts only); this allows chained facts
5247 to be separated into parts given before and after a claim, as in
5248 ``from a and b have C using d and e <proof>'';
5250 * Pure: renamed "antecedent" case to "rule_context";
5252 * Pure: new 'judgment' command records explicit information about the
5253 object-logic embedding (used by several tools internally); no longer
5254 use hard-wired "Trueprop";
5256 * Pure: added 'corollary' command;
5258 * Pure: fixed 'token_translation' command;
5260 * Pure: removed obsolete 'exported' attribute;
5262 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5263 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5264 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5266 * Pure: method 'atomize' presents local goal premises as object-level
5267 statements (atomic meta-level propositions); setup controlled via
5268 rewrite rules declarations of 'atomize' attribute; example
5269 application: 'induct' method with proper rule statements in improper
5272 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5273 now consider the syntactic context of assumptions, giving a better
5274 chance to get type-inference of the arguments right (this is
5275 especially important for locales);
5277 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5280 * Pure/obtain: the formal conclusion "thesis", being marked as
5281 ``internal'', may no longer be reference directly in the text;
5282 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5285 * Pure: generic 'sym' attribute which declares a rule both as pure
5286 'elim?' and for the 'symmetric' operation;
5288 * Pure: marginal comments ``--'' may now occur just anywhere in the
5289 text; the fixed correlation with particular command syntax has been
5292 * Pure: new method 'rules' is particularly well-suited for proof
5293 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5294 but often produces more compact proof terms with less detours;
5296 * Pure/Provers/classical: simplified integration with pure rule
5297 attributes and methods; the classical "intro?/elim?/dest?"
5298 declarations coincide with the pure ones; the "rule" method no longer
5299 includes classically swapped intros; "intro" and "elim" methods no
5300 longer pick rules from the context; also got rid of ML declarations
5301 AddXIs/AddXEs/AddXDs; all of this has some potential for
5304 * Provers/classical: attribute 'swapped' produces classical inversions
5305 of introduction rules;
5307 * Provers/simplifier: 'simplified' attribute may refer to explicit
5308 rules instead of full simplifier context; 'iff' attribute handles
5311 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5313 * HOL: 'recdef' now fails on unfinished automated proofs, use
5314 "(permissive)" option to recover old behavior;
5316 * HOL: 'inductive' no longer features separate (collective) attributes
5317 for 'intros' (was found too confusing);
5319 * HOL: properly declared induction rules less_induct and
5325 * HOL: moved over to sane numeral syntax; the new policy is as
5328 - 0 and 1 are polymorphic constants, which are defined on any
5329 numeric type (nat, int, real etc.);
5331 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5332 binary representation internally;
5334 - type nat has special constructor Suc, and generally prefers Suc 0
5335 over 1::nat and Suc (Suc 0) over 2::nat;
5337 This change may cause significant problems of INCOMPATIBILITY; here
5338 are some hints on converting existing sources:
5340 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5341 entities, so expressions involving "-" (unary or binary minus) need
5342 to be spaced properly;
5344 - existing occurrences of "1" may need to be constraint "1::nat" or
5345 even replaced by Suc 0; similar for old "2";
5347 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5349 - remove all special provisions on numerals in proofs;
5351 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5352 representation (depends on bin_arith_simps in the default context);
5354 * HOL: symbolic syntax for x^2 (numeral 2);
5356 * HOL: the class of all HOL types is now called "type" rather than
5357 "term"; INCOMPATIBILITY, need to adapt references to this type class
5358 in axclass/classes, instance/arities, and (usually rare) occurrences
5359 in typings (of consts etc.); internally the class is called
5360 "HOL.type", ML programs should refer to HOLogic.typeS;
5362 * HOL/record package improvements:
5363 - new derived operations "fields" to build a partial record section,
5364 "extend" to promote a fixed record to a record scheme, and
5365 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5366 declared as simp by default;
5367 - shared operations ("more", "fields", etc.) now need to be always
5368 qualified) --- potential INCOMPATIBILITY;
5369 - removed "make_scheme" operations (use "make" with "extend") --
5371 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5372 - provides cases/induct rules for use with corresponding Isar
5373 methods (for concrete records, record schemes, concrete more
5374 parts, and schematic more parts -- in that order);
5375 - internal definitions directly based on a light-weight abstract
5376 theory of product types over typedef rather than datatype;
5378 * HOL: generic code generator for generating executable ML code from
5379 specifications; specific support for HOL constructs such as inductive
5380 datatypes and sets, as well as recursive functions; can be invoked
5381 via 'generate_code' theory section;
5383 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5385 * HOL: consolidated and renamed several theories. In particular:
5386 Ord.thy has been absorbed into HOL.thy
5387 String.thy has been absorbed into List.thy
5389 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5390 (beware of argument permutation!);
5392 * HOL: linorder_less_split superseded by linorder_cases;
5394 * HOL/List: "nodups" renamed to "distinct";
5396 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5397 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5398 - Ex_def has changed, now need to use some_eq_ex
5400 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5401 in this (rare) case use:
5403 delSWrapper "split_all_tac"
5404 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5406 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5409 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5410 Isabelle's type classes, ^ on functions and relations has too general
5411 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5412 necessary to attach explicit type constraints;
5414 * HOL/Relation: the prefix name of the infix "O" has been changed from
5415 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5416 renamed accordingly (eg "compI" -> "rel_compI").
5418 * HOL: syntax translations now work properly with numerals and records
5421 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5422 of "lam" -- INCOMPATIBILITY;
5424 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5425 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5426 renamed "Product_Type.unit";
5428 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5430 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5431 the "cases" method);
5433 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5436 * HOL/IMP: updated and converted to new-style theory format; several
5437 parts turned into readable document, with proper Isar proof texts and
5438 some explanations (by Gerwin Klein);
5440 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5442 * HOL-Hyperreal is now a logic image;
5447 * Isar: consts/constdefs supports mixfix syntax for continuous
5450 * Isar: domain package adapted to new-style theory format, e.g. see
5453 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5454 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5455 lift.induct_tac, always use UU instead of Undef;
5457 * HOLCF/IMP: updated and converted to new-style theory;
5462 * Isar: proper integration of logic-specific tools and packages,
5463 including theory commands '(co)inductive', '(co)datatype',
5464 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5465 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5467 * theory Main no longer includes AC; for the Axiom of Choice, base
5468 your theory on Main_ZFC;
5470 * the integer library now covers quotients and remainders, with many
5471 laws relating division to addition, multiplication, etc.;
5473 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5474 typeless version of the formalism;
5476 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5479 * ZF/Induct: new directory for examples of inductive definitions,
5480 including theory Multiset for multiset orderings; converted to
5481 new-style theory format;
5483 * ZF: many new theorems about lists, ordinals, etc.;
5488 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5489 variable proof controls level of detail: 0 = no proofs (only oracle
5490 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5491 also ref manual for further ML interfaces;
5493 * Pure/axclass: removed obsolete ML interface
5494 goal_subclass/goal_arity;
5496 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5497 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5498 separate tokens, so expressions involving minus need to be spaced
5501 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5502 rather than "infixl" or "infixr";
5504 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5505 sort constraint specifications in type inference; e.g. "x::_::foo"
5506 ensures that the type of "x" is of sort "foo" (but not necessarily a
5509 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5510 control output of nested => (types); the default behavior is
5513 * Pure/syntax: builtin parse translation for "_constify" turns valued
5514 tokens into AST constants;
5516 * Pure/syntax: prefer later declarations of translations and print
5517 translation functions; potential INCOMPATIBILITY: need to reverse
5518 multiple declarations for same syntax element constant;
5520 * Pure/show_hyps reset by default (in accordance to existing Isar
5523 * Provers/classical: renamed addaltern to addafter, addSaltern to
5526 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5529 * system: tested support for MacOS X; should be able to get Isabelle +
5530 Proof General to work in a plain Terminal after installing Poly/ML
5531 (e.g. from the Isabelle distribution area) and GNU bash alone
5532 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5533 support requires further installations, e.g. from
5534 http://fink.sourceforge.net/);
5536 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5538 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5539 of 40 MB), cf. ML_OPTIONS;
5541 * system: Proof General keywords specification is now part of the
5542 Isabelle distribution (see etc/isar-keywords.el);
5544 * system: support for persistent Proof General sessions (refrain from
5545 outdating all loaded theories on startup); user may create writable
5546 logic images like this: ``isabelle -q HOL Test'';
5548 * system: smart selection of Isabelle process versus Isabelle
5549 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5550 run both "isabelle" and "Isabelle" even if file names are badly
5551 damaged (executable inspects the case of the first letter of its own
5552 name); added separate "isabelle-process" and "isabelle-interface";
5554 * system: refrain from any attempt at filtering input streams; no
5555 longer support ``8bit'' encoding of old isabelle font, instead proper
5556 iso-latin characters may now be used; the related isatools
5557 "symbolinput" and "nonascii" have disappeared as well;
5559 * system: removed old "xterm" interface (the print modes "xterm" and
5560 "xterm_color" are still available for direct use in a suitable
5565 New in Isabelle99-2 (February 2001)
5566 -----------------------------------
5568 *** Overview of INCOMPATIBILITIES ***
5570 * HOL: please note that theories in the Library and elsewhere often use the
5571 new-style (Isar) format; to refer to their theorems in an ML script you must
5572 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5574 * HOL: inductive package no longer splits induction rule aggressively,
5575 but only as far as specified by the introductions given; the old
5576 format may be recovered via ML function complete_split_rule or attribute
5577 'split_rule (complete)';
5579 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5580 gfp_Tarski to gfp_unfold;
5582 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5584 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5585 relation); infix "^^" has been renamed "``"; infix "``" has been
5586 renamed "`"; "univalent" has been renamed "single_valued";
5588 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5591 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5593 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5595 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5596 consequence, it is no longer monotonic wrt. the local goal context
5597 (which is now passed through the inductive cases);
5599 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5600 \<gg> to \<ggreater>;
5603 *** Document preparation ***
5605 * \isabellestyle{NAME} selects version of Isabelle output (currently
5606 available: are "it" for near math-mode best-style output, "sl" for
5607 slanted text style, and "tt" for plain type-writer; if no
5608 \isabellestyle command is given, output is according to slanted
5611 * support sub/super scripts (for single symbols only), input syntax is
5612 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5614 * some more standard symbols; see Appendix A of the system manual for
5615 the complete list of symbols defined in isabellesym.sty;
5617 * improved isabelle style files; more abstract symbol implementation
5618 (should now use \isamath{...} and \isatext{...} in custom symbol
5621 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5622 state; Note that presentation of goal states does not conform to
5623 actual human-readable proof documents. Please do not include goal
5624 states into document output unless you really know what you are doing!
5626 * proper indentation of antiquoted output with proportional LaTeX
5629 * no_document ML operator temporarily disables LaTeX document
5632 * isatool unsymbolize tunes sources for plain ASCII communication;
5637 * Pure: Isar now suffers initial goal statements to contain unbound
5638 schematic variables (this does not conform to actual readable proof
5639 documents, due to unpredictable outcome and non-compositional proof
5640 checking); users who know what they are doing may use schematic goals
5641 for Prolog-style synthesis of proven results;
5643 * Pure: assumption method (an implicit finishing) now handles actual
5646 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5647 initial goal, declare "that" only as Pure intro (only for single
5648 steps); the "that" rule assumption may now be involved in implicit
5649 finishing, thus ".." becomes a feasible for trivial obtains;
5651 * Pure: default proof step now includes 'intro_classes'; thus trivial
5652 instance proofs may be performed by "..";
5654 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5657 * Pure: more robust selection of calculational rules;
5659 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5660 rule (as well as the assumption rule);
5662 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5663 lemmas, using the graph browser tool;
5665 * Pure: predict failure of "show" in interactive mode;
5667 * Pure: 'thms_containing' now takes actual terms as arguments;
5669 * HOL: improved method 'induct' --- now handles non-atomic goals
5670 (potential INCOMPATIBILITY); tuned error handling;
5672 * HOL: cases and induct rules now provide explicit hints about the
5673 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5674 any remaining facts are inserted into the goal verbatim;
5676 * HOL: local contexts (aka cases) may now contain term bindings as
5677 well; the 'cases' and 'induct' methods new provide a ?case binding for
5678 the result to be shown in each case;
5680 * HOL: added 'recdef_tc' command;
5682 * isatool convert assists in eliminating legacy ML scripts;
5687 * HOL/Library: a collection of generic theories to be used together
5688 with main HOL; the theory loader path already includes this directory
5689 by default; the following existing theories have been moved here:
5690 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5691 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5693 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5694 modelling and verification task performed in Isabelle/HOL +
5695 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5697 * HOL/Algebra: special summation operator SUM no longer exists, it has
5698 been replaced by setsum; infix 'assoc' now has priority 50 (like
5699 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5700 'domain', this makes the theory consistent with mathematical
5703 * HOL basics: added overloaded operations "inverse" and "divide"
5704 (infix "/"), syntax for generic "abs" operation, generic summation
5707 * HOL/typedef: simplified package, provide more useful rules (see also
5710 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5711 now expressed as a proper nested rule (old-style tactic scripts may
5712 require atomize_strip_tac to cope with non-atomic premises);
5714 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5715 to "split_conv" (old name still available for compatibility);
5717 * HOL: improved concrete syntax for strings (e.g. allows translation
5718 rules with string literals);
5720 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5721 and Fleuriot's mechanization of analysis, including the transcendental
5722 functions for the reals;
5724 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5729 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5730 "lam" is displayed as TWO lambda-symbols
5732 * CTT: theory Main now available, containing everything (that is, Bool
5738 * Pure: the Simplifier has been implemented properly as a derived rule
5739 outside of the actual kernel (at last!); the overall performance
5740 penalty in practical applications is about 50%, while reliability of
5741 the Isabelle inference kernel has been greatly improved;
5743 * print modes "brackets" and "no_brackets" control output of nested =>
5744 (types) and ==> (props); the default behaviour is "brackets";
5746 * Provers: fast_tac (and friends) now handle actual object-logic rules
5747 as assumptions as well;
5749 * system: support Poly/ML 4.0;
5751 * system: isatool install handles KDE version 1 or 2;
5755 New in Isabelle99-1 (October 2000)
5756 ----------------------------------
5758 *** Overview of INCOMPATIBILITIES ***
5760 * HOL: simplification of natural numbers is much changed; to partly
5761 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5762 issue the following ML commands:
5764 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5765 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5767 * HOL: simplification no longer dives into case-expressions; this is
5768 controlled by "t.weak_case_cong" for each datatype t;
5770 * HOL: nat_less_induct renamed to less_induct;
5772 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5773 fixsome to patch .thy and .ML sources automatically;
5775 select_equality -> some_equality
5776 select_eq_Ex -> some_eq_ex
5777 selectI2EX -> someI2_ex
5780 select1_equality -> some1_equality
5781 Eps_sym_eq -> some_sym_eq_trivial
5782 Eps_eq -> some_eq_trivial
5784 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5786 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5789 * HOL: the recursion equations generated by 'recdef' are now called
5790 f.simps instead of f.rules;
5792 * HOL: qed_spec_mp now also handles bounded ALL as well;
5794 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5795 sometimes be needed;
5797 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5799 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5801 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5802 product is now "<*>" instead of "Times"; the lexicographic product is
5803 now "<*lex*>" instead of "**";
5805 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5806 of main HOL, but was unused); better use HOL's datatype package;
5808 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5809 the old syntax may be recovered as follows:
5812 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5813 (infixl "\\<oplus>" 100)
5815 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5817 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5818 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5821 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5822 changed from A/r to A//r;
5824 * ZF: new treatment of arithmetic (nat & int) may break some old
5827 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5828 rulify -> rule_format, elimify -> elim_format, ...);
5830 * Isar/Provers: intro/elim/dest attributes changed; renamed
5831 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5832 should have to change intro!! to intro? only); replaced "delrule" by
5835 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5837 * Provers: strengthened force_tac by using new first_best_tac;
5839 * LaTeX document preparation: several changes of isabelle.sty (see
5843 *** Document preparation ***
5845 * formal comments (text blocks etc.) in new-style theories may now
5846 contain antiquotations of thm/prop/term/typ/text to be presented
5847 according to latex print mode; concrete syntax is like this:
5848 @{term[show_types] "f(x) = a + x"};
5850 * isatool mkdir provides easy setup of Isabelle session directories,
5851 including proper document sources;
5853 * generated LaTeX sources are now deleted after successful run
5854 (isatool document -c); may retain a copy somewhere else via -D option
5857 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5858 style files, achieving self-contained LaTeX sources and simplifying
5861 * old-style theories now produce (crude) LaTeX output as well;
5863 * browser info session directories are now self-contained (may be put
5864 on WWW server seperately); improved graphs of nested sessions; removed
5865 graph for 'all sessions';
5867 * several improvements in isabelle style files; \isabellestyle{it}
5868 produces fake math mode output; \isamarkupheader is now \section by
5869 default; see lib/texinputs/isabelle.sty etc.;
5874 * Isar/Pure: local results and corresponding term bindings are now
5875 subject to Hindley-Milner polymorphism (similar to ML); this
5876 accommodates incremental type-inference very nicely;
5878 * Isar/Pure: new derived language element 'obtain' supports
5879 generalized existence reasoning;
5881 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5882 support accumulation of results, without applying any rules yet;
5883 useful to collect intermediate results without explicit name
5884 references, and for use with transitivity rules with more than 2
5887 * Isar/Pure: scalable support for case-analysis type proofs: new
5888 'case' language element refers to local contexts symbolically, as
5889 produced by certain proof methods; internally, case names are attached
5890 to theorems as "tags";
5892 * Isar/Pure: theory command 'hide' removes declarations from
5893 class/type/const name spaces;
5895 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5896 indicate potential overloading;
5898 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5900 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5901 "{a,b,c}" instead of {a,b,c};
5903 * Isar/Pure now provides its own version of intro/elim/dest
5904 attributes; useful for building new logics, but beware of confusion
5905 with the version in Provers/classical;
5907 * Isar/Pure: the local context of (non-atomic) goals is provided via
5908 case name 'antecedent';
5910 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5911 to the current context is now done automatically);
5913 * Isar/Pure: theory command 'method_setup' provides a simple interface
5914 for definining proof methods in ML;
5916 * Isar/Provers: intro/elim/dest attributes changed; renamed
5917 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5918 most cases, one should have to change intro!! to intro? only);
5919 replaced "delrule" by "rule del";
5921 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5922 'symmetric' attribute (the latter supercedes [RS sym]);
5924 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5925 method modifier); 'simp' method: 'only:' modifier removes loopers as
5926 well (including splits);
5928 * Isar/Provers: Simplifier and Classical methods now support all kind
5929 of modifiers used in the past, including 'cong', 'iff', etc.
5931 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5932 of Simplifier and Classical reasoner);
5934 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5935 now support named cases; major packages (inductive, datatype, primrec,
5936 recdef) support case names and properly name parameters;
5938 * Isar/HOL: new transitivity rules for substitution in inequalities --
5939 monotonicity conditions are extracted to be proven at end of
5942 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5945 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5946 split_if split_if_asm; datatype package provides theorems foo.splits =
5947 foo.split foo.split_asm for each datatype;
5949 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5950 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5951 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5952 use "(cases (simplified))" method in proper proof texts);
5954 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5956 * Isar: names of theorems etc. may be natural numbers as well;
5958 * Isar: 'pr' command: optional arguments for goals_limit and
5959 ProofContext.prems_limit; no longer prints theory contexts, but only
5962 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5963 additional print modes to be specified; e.g. "pr(latex)" will print
5964 proof state according to the Isabelle LaTeX style;
5966 * Isar: improved support for emulating tactic scripts, including proof
5967 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5968 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5969 (for HOL datatypes);
5971 * Isar: simplified (more robust) goal selection of proof methods: 1st
5972 goal, all goals, or explicit goal specifier (tactic emulation); thus
5973 'proof method scripts' have to be in depth-first order;
5975 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5977 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5978 should instead use individual commands for printing items
5979 (print_commands, print_methods etc.);
5981 * Isar: added 'nothing' --- the empty list of theorems;
5986 * HOL/MicroJava: formalization of a fragment of Java, together with a
5987 corresponding virtual machine and a specification of its bytecode
5988 verifier and a lightweight bytecode verifier, including proofs of
5989 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5990 Cornelia Pusch (see also the homepage of project Bali at
5991 http://isabelle.in.tum.de/Bali/);
5993 * HOL/Algebra: new theory of rings and univariate polynomials, by
5996 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5997 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
6000 * HOL/Lattice: fundamental concepts of lattice theory and order
6001 structures, including duals, properties of bounds versus algebraic
6002 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
6003 Theorem for complete lattices etc.; may also serve as a demonstration
6004 for abstract algebraic reasoning using axiomatic type classes, and
6005 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6007 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6010 * HOL/IMPP: extension of IMP with local variables and mutually
6011 recursive procedures, by David von Oheimb;
6013 * HOL/Lambda: converted into new-style theory and document;
6015 * HOL/ex/Multiquote: example of multiple nested quotations and
6016 anti-quotations -- basically a generalized version of de-Bruijn
6017 representation; very useful in avoiding lifting of operations;
6019 * HOL/record: added general record equality rule to simpset; fixed
6020 select-update simplification procedure to handle extended records as
6021 well; admit "r" as field name;
6023 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6024 other numeric types and also as the identity of groups, rings, etc.;
6026 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6027 Types nat and int belong to this axclass;
6029 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6030 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6031 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6032 two terms #m*u and #n*u are replaced by #(m+n)*u
6033 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6034 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6035 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6037 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6038 powerful prover for predicate logic but knows nothing of clasets; see
6039 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6041 * HOL: new version of "case_tac" subsumes both boolean case split and
6042 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6043 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6045 * HOL: simplification no longer dives into case-expressions: only the
6046 selector expression is simplified, but not the remaining arms; to
6047 enable full simplification of case-expressions for datatype t, you may
6048 remove t.weak_case_cong from the simpset, either globally (Delcongs
6049 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6051 * HOL/recdef: the recursion equations generated by 'recdef' for
6052 function 'f' are now called f.simps instead of f.rules; if all
6053 termination conditions are proved automatically, these simplification
6054 rules are added to the simpset, as in primrec; rules may be named
6055 individually as well, resulting in a separate list of theorems for
6058 * HOL/While is a new theory that provides a while-combinator. It
6059 permits the definition of tail-recursive functions without the
6060 provision of a termination measure. The latter is necessary once the
6061 invariant proof rule for while is applied.
6063 * HOL: new (overloaded) notation for the set of elements below/above
6064 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6066 * HOL: theorems impI, allI, ballI bound as "strip";
6068 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6069 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6070 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6072 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6074 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6075 main HOL, but was unused);
6077 * HOL: fewer consts declared as global (e.g. have to refer to
6078 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6080 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6081 in case of overlap with user translations (e.g. judgements over
6082 tuples); (note that the underlying logical represenation is still
6088 * ZF: simplification automatically cancels common terms in arithmetic
6089 expressions over nat and int;
6091 * ZF: new treatment of nat to minimize type-checking: all operators
6092 coerce their operands to a natural number using the function natify,
6093 making the algebraic laws unconditional;
6095 * ZF: as above, for int: operators coerce their operands to an integer
6096 using the function intify;
6098 * ZF: the integer library now contains many of the usual laws for the
6099 orderings, including $<=, and monotonicity laws for $+ and $*;
6101 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6104 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6105 to the simplifier and classical reasoner simultaneously;
6110 * Provers: blast_tac now handles actual object-logic rules as
6111 assumptions; note that auto_tac uses blast_tac internally as well;
6113 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6114 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6116 * Provers: delrules now handles destruct rules as well (no longer need
6117 explicit make_elim);
6119 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6120 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6121 use instead the strong form,
6122 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6123 in HOL, FOL and ZF the function cla_make_elim will create such rules
6124 from destruct-rules;
6126 * Provers: Simplifier.easy_setup provides a fast path to basic
6127 Simplifier setup for new object-logics;
6129 * Pure: AST translation rules no longer require constant head on LHS;
6131 * Pure: improved name spaces: ambiguous output is qualified; support
6132 for hiding of names;
6134 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6135 XSYMBOL_HOME; no longer need to do manual configuration in most
6138 * system: compression of ML heaps images may now be controlled via -c
6139 option of isabelle and isatool usedir (currently only observed by
6142 * system: isatool installfonts may handle X-Symbol fonts as well (very
6143 useful for remote X11);
6145 * system: provide TAGS file for Isabelle sources;
6147 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6150 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6151 timing flag supersedes proof_timing and Toplevel.trace;
6153 * ML: new combinators |>> and |>>> for incremental transformations
6154 with secondary results (e.g. certain theory extensions):
6156 * ML: PureThy.add_defs gets additional argument to indicate potential
6157 overloading (usually false);
6159 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6164 New in Isabelle99 (October 1999)
6165 --------------------------------
6167 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6169 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6170 are no longer simplified. (This allows the simplifier to unfold recursive
6171 functional programs.) To restore the old behaviour, declare
6173 Delcongs [if_weak_cong];
6175 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6178 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6180 * HOL/datatype: mutual_induct_tac no longer exists --
6181 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6183 * HOL/typedef: fixed type inference for representing set; type
6184 arguments now have to occur explicitly on the rhs as type constraints;
6186 * ZF: The con_defs part of an inductive definition may no longer refer
6187 to constants declared in the same theory;
6189 * HOL, ZF: the function mk_cases, generated by the inductive
6190 definition package, has lost an argument. To simplify its result, it
6191 uses the default simpset instead of a supplied list of theorems.
6193 * HOL/List: the constructors of type list are now Nil and Cons;
6195 * Simplifier: the type of the infix ML functions
6196 setSSolver addSSolver setSolver addSolver
6197 is now simpset * solver -> simpset where `solver' is a new abstract type
6198 for packaging solvers. A solver is created via
6199 mk_solver: string -> (thm list -> int -> tactic) -> solver
6200 where the string argument is only a comment.
6205 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6206 decision procedure for linear arithmetic. Currently it is used for
6207 types `nat', `int', and `real' in HOL (see below); it can, should and
6208 will be instantiated for other types and logics as well.
6210 * The simplifier now accepts rewrite rules with flexible heads, eg
6211 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6212 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6218 * New Isabelle/Isar subsystem provides an alternative to traditional
6219 tactical theorem proving; together with the ProofGeneral/isar user
6220 interface it offers an interactive environment for developing human
6221 readable proof documents (Isar == Intelligible semi-automated
6222 reasoning); for further information see isatool doc isar-ref,
6223 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6225 * improved and simplified presentation of theories: better HTML markup
6226 (including colors), graph views in several sizes; isatool usedir now
6227 provides a proper interface for user theories (via -P option); actual
6228 document preparation based on (PDF)LaTeX is available as well (for
6229 new-style theories only); see isatool doc system for more information;
6231 * native support for Proof General, both for classic Isabelle and
6234 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6235 using the graph browser tool;
6237 * Isabelle manuals now also available as PDF;
6239 * theory loader rewritten from scratch (may not be fully
6240 bug-compatible); old loadpath variable has been replaced by show_path,
6241 add_path, del_path, reset_path functions; new operations such as
6242 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6245 * improved isatool install: option -k creates KDE application icon,
6246 option -p DIR installs standalone binaries;
6248 * added ML_PLATFORM setting (useful for cross-platform installations);
6249 more robust handling of platform specific ML images for SML/NJ;
6251 * the settings environment is now statically scoped, i.e. it is never
6252 created again in sub-processes invoked from isabelle, isatool, or
6255 * path element specification '~~' refers to '$ISABELLE_HOME';
6257 * in locales, the "assumes" and "defines" parts may be omitted if
6260 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6263 * new print_mode "HTML";
6265 * new flag show_tags controls display of tags of theorems (which are
6266 basically just comments that may be attached by some tools);
6268 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6269 mode and goal output format:
6271 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6273 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6275 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6276 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6278 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6280 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6282 * function bind_thms stores lists of theorems (cf. bind_thm);
6284 * new shorthand tactics ftac, eatac, datac, fatac;
6286 * qed (and friends) now accept "" as result name; in that case the
6287 theorem is not stored, but proper checks and presentation of the
6290 * theorem database now also indexes constants "Trueprop", "all",
6291 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6296 ** HOL arithmetic **
6298 * There are now decision procedures for linear arithmetic over nat and
6301 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6302 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6303 are treated as atomic; subformulae not involving type `nat' or `int'
6304 are ignored; quantified subformulae are ignored unless they are
6305 positive universal or negative existential. The tactic has to be
6306 invoked by hand and can be a little bit slow. In particular, the
6307 running time is exponential in the number of occurrences of `min' and
6308 `max', and `-' on `nat'.
6310 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6311 (negated) (in)equalities among the premises and the conclusion into
6312 account (i.e. no compound formulae) and does not know about `min' and
6313 `max', and `-' on `nat'. It is fast and is used automatically by the
6316 NB: At the moment, these decision procedures do not cope with mixed
6317 nat/int formulae where the two parts interact, such as `m < n ==>
6320 * HOL/Numeral provides a generic theory of numerals (encoded
6321 efficiently as bit strings); setup for types nat/int/real is in place;
6322 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6323 int, existing theories and proof scripts may require a few additional
6326 * integer division and remainder can now be performed on constant
6329 * many properties of integer multiplication, division and remainder
6332 * An interface to the Stanford Validity Checker (SVC) is available through the
6333 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6334 are proved automatically. SVC must be installed separately, and its results
6335 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6336 invocation of the underlying oracle). For SVC see
6337 http://verify.stanford.edu/SVC
6339 * IsaMakefile: the HOL-Real target now builds an actual image;
6344 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6345 (in Isabelle/Isar) -- by Gertrud Bauer;
6347 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6348 analysis for assembly languages with subtypes;
6350 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6351 -- avoids syntactic ambiguities and treats state, transition, and
6352 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6353 changed syntax and (many) tactics;
6355 * HOL/inductive: Now also handles more general introduction rules such
6356 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6357 theorems are now maintained within the theory (maintained via the
6360 * HOL/datatype: Now also handles arbitrarily branching datatypes
6361 (using function types) such as
6363 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6365 * HOL/record: record_simproc (part of the default simpset) takes care
6366 of selectors applied to updated records; record_split_tac is no longer
6367 part of the default claset; update_defs may now be removed from the
6368 simpset in many cases; COMPATIBILITY: old behavior achieved by
6370 claset_ref () := claset() addSWrapper record_split_wrapper;
6371 Delsimprocs [record_simproc]
6373 * HOL/typedef: fixed type inference for representing set; type
6374 arguments now have to occur explicitly on the rhs as type constraints;
6376 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6377 names rather than an ML expression;
6379 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6380 supplied later. Program schemes can be defined, such as
6381 "While B C s = (if B s then While B C (C s) else s)"
6382 where the well-founded relation can be chosen after B and C have been given.
6384 * HOL/List: the constructors of type list are now Nil and Cons;
6385 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6386 course, ML tools referring to List.list.op # etc. have to be adapted;
6388 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6389 disabled by default; run isabelle with option -m HOL to get back to
6390 the original Gordon/HOL-style output;
6392 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6393 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6395 * HOL basic syntax simplified (more orthogonal): all variants of
6396 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6397 Eps operator is provided as well: "SOME x. P[x]";
6399 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6401 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6402 thus available for user theories;
6404 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6405 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6408 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6409 several times and then mp;
6414 * the notation <<...>> is now available as a notation for sequences of
6417 * the simplifier is now installed
6419 * the axiom system has been generalized (thanks to Soren Heilmann)
6421 * the classical reasoner now has a default rule database
6426 * new primrec section allows primitive recursive functions to be given
6427 directly (as in HOL) over datatypes and the natural numbers;
6429 * new tactics induct_tac and exhaust_tac for induction (or case
6430 analysis) over datatypes and the natural numbers;
6432 * the datatype declaration of type T now defines the recursor T_rec;
6434 * simplification automatically does freeness reasoning for datatype
6437 * automatic type-inference, with AddTCs command to insert new
6438 type-checking rules;
6440 * datatype introduction rules are now added as Safe Introduction rules
6443 * the syntax "if P then x else y" is now available in addition to
6447 *** Internal programming interfaces ***
6449 * tuned simplifier trace output; new flag debug_simp;
6451 * structures Vartab / Termtab (instances of TableFun) offer efficient
6452 tables indexed by indexname_ord / term_ord (compatible with aconv);
6454 * AxClass.axclass_tac lost the theory argument;
6456 * tuned current_goals_markers semantics: begin / end goal avoids
6457 printing empty lines;
6459 * removed prs and prs_fn hook, which was broken because it did not
6460 include \n in its semantics, forcing writeln to add one
6461 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6462 string -> unit if you really want to output text without newline;
6464 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6465 plain output, interface builders may have to enable 'isabelle_font'
6466 mode to get Isabelle font glyphs as before;
6468 * refined token_translation interface; INCOMPATIBILITY: output length
6469 now of type real instead of int;
6471 * theory loader actions may be traced via new ThyInfo.add_hook
6472 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6473 your own database of information attached to *whole* theories -- as
6474 opposed to intra-theory data slots offered via TheoryDataFun;
6476 * proper handling of dangling sort hypotheses (at last!);
6477 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6478 extra sort hypotheses that can be witnessed from the type signature;
6479 the force_strip_shyps flag is gone, any remaining shyps are simply
6480 left in the theorem (with a warning issued by strip_shyps_warning);
6484 New in Isabelle98-1 (October 1998)
6485 ----------------------------------
6487 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6489 * several changes of automated proof tools;
6491 * HOL: major changes to the inductive and datatype packages, including
6492 some minor incompatibilities of theory syntax;
6494 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6497 * HOL: removed duplicate thms in Arith:
6498 less_imp_add_less should be replaced by trans_less_add1
6499 le_imp_add_le should be replaced by trans_le_add1
6501 * HOL: unary minus is now overloaded (new type constraints may be
6504 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6505 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6506 now taken as an integer constant.
6508 * Pure: ML function 'theory_of' renamed to 'theory';
6514 1. Asm_full_simp_tac is now more aggressive.
6515 1. It will sometimes reorient premises if that increases their power to
6517 2. It does no longer proceed strictly from left to right but may also
6518 rotate premises to achieve further simplification.
6519 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6520 old Asm_full_simp_tac in that it does not rotate premises.
6521 2. The simplifier now knows a little bit about nat-arithmetic.
6523 * Classical reasoner: wrapper mechanism for the classical reasoner now
6524 allows for selected deletion of wrappers, by introduction of names for
6525 wrapper functionals. This implies that addbefore, addSbefore,
6526 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6527 and that adding two tactics with the same name overwrites the first
6528 one (emitting a warning).
6529 type wrapper = (int -> tactic) -> (int -> tactic)
6530 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6531 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6532 delWrapper, delSWrapper: claset * string -> claset
6533 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6535 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6536 semantics; addbefore now affects only the unsafe part of step_tac
6537 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6538 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6541 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6542 compWrapper; added safe wrapper (and access functions for it);
6544 * HOL/split_all_tac is now much faster and fails if there is nothing
6545 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6546 and the names of the automatically generated variables have changed.
6547 split_all_tac has moved within claset() from unsafe wrappers to safe
6548 wrappers, which means that !!-bound variables are split much more
6549 aggressively, and safe_tac and clarify_tac now split such variables.
6550 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6551 Note: the same holds for record_split_tac, which does the job of
6552 split_all_tac for record fields.
6554 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6555 permanently to the default simpset using Addsplits just like
6556 Addsimps. They can be removed via Delsplits just like
6557 Delsimps. Lower-case versions are also available.
6559 * HOL/Simplifier: The rule split_if is now part of the default
6560 simpset. This means that the simplifier will eliminate all occurrences
6561 of if-then-else in the conclusion of a goal. To prevent this, you can
6562 either remove split_if completely from the default simpset by
6563 `Delsplits [split_if]' or remove it in a specific call of the
6564 simplifier using `... delsplits [split_if]'. You can also add/delete
6565 other case splitting rules to/from the default simpset: every datatype
6566 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6567 t is the name of the datatype).
6569 * Classical reasoner / Simplifier combination: new force_tac (and
6570 derivatives Force_tac, force) combines rewriting and classical
6571 reasoning (and whatever other tools) similarly to auto_tac, but is
6572 aimed to solve the given subgoal completely.
6577 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6578 and `goalw': the theory is no longer needed as an explicit argument -
6579 the current theory context is used; assumptions are no longer returned
6580 at the ML-level unless one of them starts with ==> or !!; it is
6581 recommended to convert to these new commands using isatool fixgoal
6582 (backup your sources first!);
6584 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6585 the current theory context, and 'theory' to lookup stored theories;
6587 * new theory section 'locale' for declaring constants, assumptions and
6588 definitions that have local scope;
6590 * new theory section 'nonterminals' for purely syntactic types;
6592 * new theory section 'setup' for generic ML setup functions
6593 (e.g. package initialization);
6595 * the distribution now includes Isabelle icons: see
6596 lib/logo/isabelle-{small,tiny}.xpm;
6598 * isatool install - install binaries with absolute references to
6601 * isatool logo -- create instances of the Isabelle logo (as EPS);
6603 * print mode 'emacs' reserved for Isamode;
6605 * support multiple print (ast) translations per constant name;
6607 * theorems involving oracles are now printed with a suffixed [!];
6612 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6614 * HOL/inductive package reorganized and improved: now supports mutual
6620 oddI "n : EVEN ==> Suc n : ODD"
6621 evenI "n : ODD ==> Suc n : EVEN"
6623 new theorem list "elims" contains an elimination rule for each of the
6624 recursive sets; inductive definitions now handle disjunctive premises
6625 correctly (also ZF);
6627 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6628 "mutual_induct" no longer exists - the induction rule is always
6629 contained in "induct";
6632 * HOL/datatype package re-implemented and greatly improved: now
6633 supports mutually recursive datatypes such as
6636 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6637 | SUM ('a aexp) ('a aexp)
6638 | DIFF ('a aexp) ('a aexp)
6641 'a bexp = LESS ('a aexp) ('a aexp)
6642 | AND ('a bexp) ('a bexp)
6643 | OR ('a bexp) ('a bexp)
6645 as well as indirectly recursive datatypes such as
6648 ('a, 'b) term = Var 'a
6649 | App 'b ((('a, 'b) term) list)
6651 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6652 induction on mutually / indirectly recursive datatypes.
6654 Primrec equations are now stored in theory and can be accessed via
6655 <function_name>.simps.
6659 - Theories using datatypes must now have theory Datatype as an
6661 - The specific <typename>.induct_tac no longer exists - use the
6662 generic induct_tac instead.
6663 - natE has been renamed to nat.exhaust - use exhaust_tac
6664 instead of res_inst_tac ... natE. Note that the variable
6665 names in nat.exhaust differ from the names in natE, this
6666 may cause some "fragile" proofs to fail.
6667 - The theorems split_<typename>_case and split_<typename>_case_asm
6668 have been renamed to <typename>.split and <typename>.split_asm.
6669 - Since default sorts of type variables are now handled correctly,
6670 some datatype definitions may have to be annotated with explicit
6672 - Primrec definitions no longer require function name and type
6673 of recursive argument.
6675 Consider using isatool fixdatatype to adapt your theories and proof
6676 scripts to the new package (backup your sources first!).
6679 * HOL/record package: considerably improved implementation; now
6680 includes concrete syntax for record types, terms, updates; theorems
6681 for surjective pairing and splitting !!-bound record variables; proof
6682 support is as follows:
6684 1) standard conversions (selectors or updates applied to record
6685 constructor terms) are part of the standard simpset;
6687 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6688 made part of standard simpset and claset via addIffs;
6690 3) a tactic for record field splitting (record_split_tac) is part of
6691 the standard claset (addSWrapper);
6693 To get a better idea about these rules you may retrieve them via
6694 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6695 the name of your record type.
6697 The split tactic 3) conceptually simplifies by the following rule:
6699 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6701 Thus any record variable that is bound by meta-all will automatically
6702 blow up into some record constructor term, consequently the
6703 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6704 solve record problems automatically.
6707 * reorganized the main HOL image: HOL/Integ and String loaded by
6708 default; theory Main includes everything;
6710 * automatic simplification of integer sums and comparisons, using cancellation;
6712 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6714 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6716 * many new identities for unions, intersections, set difference, etc.;
6718 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6719 called split_if, split_split, split_sum_case and split_nat_case (to go
6720 with add/delsplits);
6722 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6723 (?x::unit) = (); this is made part of the default simpset, which COULD
6724 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6725 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6726 unit_abs_eta_conv is added in order to counter the effect of
6727 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6730 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6733 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6734 It and 'sym RS equals0D' are now in the default claset, giving automatic
6735 disjointness reasoning but breaking a few old proofs.
6737 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6738 to 'converse' from 'inverse' (for compatibility with ZF and some
6741 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6742 the well-founded relation;
6744 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6745 Compl A. The "Compl" syntax remains available as input syntax for this
6748 * HOL/Update: new theory of function updates:
6749 f(a:=b) == %x. if x=a then b else f x
6750 may also be iterated as in f(a:=b,c:=d,...);
6752 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6755 - new function list_update written xs[i:=v] that updates the i-th
6756 list position. May also be iterated as in xs[i:=a,j:=b,...].
6757 - new function `upt' written [i..j(] which generates the list
6758 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6759 bound write [i..j], which is a shorthand for [i..j+1(].
6760 - new lexicographic orderings and corresponding wellfoundedness theorems.
6763 - removed 'pred' (predecessor) function;
6764 - generalized some theorems about n-1;
6765 - many new laws about "div" and "mod";
6766 - new laws about greatest common divisors (see theory ex/Primes);
6768 * HOL/Relation: renamed the relational operator r^-1 "converse"
6769 instead of "inverse";
6771 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6772 of the multiset ordering;
6774 * directory HOL/Real: a construction of the reals using Dedekind cuts
6775 (not included by default);
6777 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6779 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6780 programs, i.e. different program variables may have different types.
6782 * calling (stac rew i) now fails if "rew" has no effect on the goal
6783 [previously, this check worked only if the rewrite rule was unconditional]
6784 Now rew can involve either definitions or equalities (either == or =).
6789 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6790 only the theorems proved on ZF.ML;
6792 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6793 It and 'sym RS equals0D' are now in the default claset, giving automatic
6794 disjointness reasoning but breaking a few old proofs.
6796 * ZF/Update: new theory of function updates
6797 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6798 may also be iterated as in f(a:=b,c:=d,...);
6800 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6802 * calling (stac rew i) now fails if "rew" has no effect on the goal
6803 [previously, this check worked only if the rewrite rule was unconditional]
6804 Now rew can involve either definitions or equalities (either == or =).
6806 * case_tac provided for compatibility with HOL
6807 (like the old excluded_middle_tac, but with subgoals swapped)
6810 *** Internal programming interfaces ***
6812 * Pure: several new basic modules made available for general use, see
6813 also src/Pure/README;
6815 * improved the theory data mechanism to support encapsulation (data
6816 kind name replaced by private Object.kind, acting as authorization
6817 key); new type-safe user interface via functor TheoryDataFun; generic
6818 print_data function becomes basically useless;
6820 * removed global_names compatibility flag -- all theory declarations
6821 are qualified by default;
6823 * module Pure/Syntax now offers quote / antiquote translation
6824 functions (useful for Hoare logic etc. with implicit dependencies);
6825 see HOL/ex/Antiquote for an example use;
6827 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6830 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6833 * Display.print_goals function moved to Locale.print_goals;
6835 * standard print function for goals supports current_goals_markers
6836 variable for marking begin of proof, end of proof, start of goal; the
6837 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6838 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6843 New in Isabelle98 (January 1998)
6844 --------------------------------
6846 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6848 * changed lexical syntax of terms / types: dots made part of long
6849 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6851 * simpset (and claset) reference variable replaced by functions
6852 simpset / simpset_ref;
6854 * no longer supports theory aliases (via merge) and non-trivial
6855 implicit merge of thms' signatures;
6857 * most internal names of constants changed due to qualified names;
6859 * changed Pure/Sequence interface (see Pure/seq.ML);
6862 *** General Changes ***
6864 * hierachically structured name spaces (for consts, types, axms, thms
6865 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6866 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6867 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6868 long_names for fully qualified output names; NOTE: ML programs
6869 (special tactics, packages etc.) referring to internal names may have
6870 to be adapted to cope with fully qualified names; in case of severe
6871 backward campatibility problems try setting 'global_names' at compile
6872 time to have enrything declared within a flat name space; one may also
6873 fine tune name declarations in theories via the 'global' and 'local'
6876 * reimplemented the implicit simpset and claset using the new anytype
6877 data filed in signatures; references simpset:simpset ref etc. are
6878 replaced by functions simpset:unit->simpset and
6879 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6880 to patch your ML files accordingly;
6882 * HTML output now includes theory graph data for display with Java
6883 applet or isatool browser; data generated automatically via isatool
6884 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6886 * defs may now be conditional; improved rewrite_goals_tac to handle
6887 conditional equations;
6889 * defs now admits additional type arguments, using TYPE('a) syntax;
6891 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6892 creates a new theory node; implicit merge of thms' signatures is
6893 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6894 transfer:theory->thm->thm in (rare) cases;
6896 * improved handling of draft signatures / theories; draft thms (and
6897 ctyps, cterms) are automatically promoted to real ones;
6899 * slightly changed interfaces for oracles: admit many per theory, named
6900 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6902 * print_goals: optional output of const types (set show_consts and
6905 * improved output of warnings (###) and errors (***);
6907 * subgoal_tac displays a warning if the new subgoal has type variables;
6909 * removed old README and Makefiles;
6911 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6913 * removed obsolete init_pps and init_database;
6915 * deleted the obsolete tactical STATE, which was declared by
6916 fun STATE tacfun st = tacfun st st;
6918 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6919 (which abbreviates $HOME);
6921 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6922 use isatool fixseq to adapt your ML programs (this works for fully
6923 qualified references to the Sequence structure only!);
6925 * use_thy no longer requires writable current directory; it always
6926 reloads .ML *and* .thy file, if either one is out of date;
6929 *** Classical Reasoner ***
6931 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6932 tactics that use classical reasoning to simplify a subgoal without
6933 splitting it into several subgoals;
6935 * Safe_tac: like safe_tac but uses the default claset;
6940 * added simplification meta rules:
6941 (asm_)(full_)simplify: simpset -> thm -> thm;
6943 * simplifier.ML no longer part of Pure -- has to be loaded by object
6946 * added prems argument to simplification procedures;
6948 * HOL, FOL, ZF: added infix function `addsplits':
6949 instead of `<simpset> setloop (split_tac <thms>)'
6950 you can simply write `<simpset> addsplits <thms>'
6955 * TYPE('a) syntax for type reflection terms;
6957 * no longer handles consts with name "" -- declare as 'syntax' instead;
6959 * pretty printer: changed order of mixfix annotation preference (again!);
6961 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6966 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6967 with `addloop' of the simplifier to faciliate case splitting in premises.
6969 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6971 * HOL/Auth: new protocol proofs including some for the Internet
6974 * HOL/Map: new theory of `maps' a la VDM;
6976 * HOL/simplifier: simplification procedures nat_cancel_sums for
6977 cancelling out common nat summands from =, <, <= (in)equalities, or
6978 differences; simplification procedures nat_cancel_factor for
6979 cancelling common factor from =, <, <= (in)equalities over natural
6980 sums; nat_cancel contains both kinds of procedures, it is installed by
6981 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6983 * HOL/simplifier: terms of the form
6984 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6986 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6987 and those of the form
6988 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6990 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6993 Each datatype `t' now comes with a theorem `split_t_case' of the form
6995 P(t_case f1 ... fn x) =
6996 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6998 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
7001 and a theorem `split_t_case_asm' of the form
7003 P(t_case f1 ... fn x) =
7004 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7006 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7008 which can be added to a simpset via `addsplits'. The existing theorems
7009 expand_list_case and expand_option_case have been renamed to
7010 split_list_case and split_option_case.
7013 - `pred n' is automatically converted to `n-1'.
7014 Users are strongly encouraged not to use `pred' any longer,
7015 because it will disappear altogether at some point.
7016 - Users are strongly encouraged to write "0 < n" rather than
7017 "n ~= 0". Theorems and proof tools have been modified towards this
7021 the function "set_of_list" has been renamed "set" (and its theorems too);
7022 the function "nth" now takes its arguments in the reverse order and
7023 has acquired the infix notation "!" as in "xs!n".
7025 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7027 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7028 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7030 * HOL/record: extensible records with schematic structural subtyping
7031 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7032 still lacks various theorems and concrete record syntax;
7037 * removed "axioms" and "generated by" sections;
7039 * replaced "ops" section by extended "consts" section, which is capable of
7040 handling the continuous function space "->" directly;
7043 . proves theorems immediately and stores them in the theory,
7044 . creates hierachical name space,
7045 . now uses normal mixfix annotations (instead of cinfix...),
7046 . minor changes to some names and values (for consistency),
7047 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7048 . separator between mutual domain defs: changed "," to "and",
7049 . improved handling of sort constraints; now they have to
7050 appear on the left-hand side of the equations only;
7052 * fixed LAM <x,y,zs>.b syntax;
7054 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7055 adm (%x. P (t x)), where P is chainfinite and t continuous;
7060 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7061 with `addloop' of the simplifier to faciliate case splitting in premises.
7063 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7064 in HOL, they strip ALL and --> from proved theorems;
7068 New in Isabelle94-8 (May 1997)
7069 ------------------------------
7071 *** General Changes ***
7073 * new utilities to build / run / maintain Isabelle etc. (in parts
7074 still somewhat experimental); old Makefiles etc. still functional;
7076 * new 'Isabelle System Manual';
7078 * INSTALL text, together with ./configure and ./build scripts;
7080 * reimplemented type inference for greater efficiency, better error
7081 messages and clean internal interface;
7083 * prlim command for dealing with lots of subgoals (an easier way of
7084 setting goals_limit);
7089 * supports alternative (named) syntax tables (parser and pretty
7090 printer); internal interface is provided by add_modesyntax(_i);
7092 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7093 be used in conjunction with the Isabelle symbol font; uses the
7094 "symbols" syntax table;
7096 * added token_translation interface (may translate name tokens in
7097 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7098 the current print_mode); IMPORTANT: user print translation functions
7099 are responsible for marking newly introduced bounds
7100 (Syntax.mark_boundT);
7102 * token translations for modes "xterm" and "xterm_color" that display
7103 names in bold, underline etc. or colors (which requires a color
7106 * infixes may now be declared with names independent of their syntax;
7108 * added typed_print_translation (like print_translation, but may
7109 access type of constant);
7112 *** Classical Reasoner ***
7114 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7115 some limitations. Blast_tac...
7116 + ignores addss, addbefore, addafter; this restriction is intrinsic
7117 + ignores elimination rules that don't have the correct format
7118 (the conclusion MUST be a formula variable)
7119 + ignores types, which can make HOL proofs fail
7120 + rules must not require higher-order unification, e.g. apply_type in ZF
7121 [message "Function Var's argument not a bound variable" relates to this]
7122 + its proof strategy is more general but can actually be slower
7124 * substitution with equality assumptions no longer permutes other
7127 * minor changes in semantics of addafter (now called addaltern); renamed
7128 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7129 (and access functions for it);
7131 * improved combination of classical reasoner and simplifier:
7132 + functions for handling clasimpsets
7133 + improvement of addss: now the simplifier is called _after_ the
7135 + safe variant of addss called addSss: uses safe simplifications
7136 _during_ the safe steps. It is more complete as it allows multiple
7137 instantiations of unknowns (e.g. with slow_tac).
7141 * added interface for simplification procedures (functions that
7142 produce *proven* rewrite rules on the fly, depending on current
7145 * ordering on terms as parameter (used for ordered rewriting);
7147 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7149 * the solver is now split into a safe and an unsafe part.
7150 This should be invisible for the normal user, except that the
7151 functions setsolver and addsolver have been renamed to setSolver and
7152 addSolver; added safe_asm_full_simp_tac;
7157 * a generic induction tactic `induct_tac' which works for all datatypes and
7158 also for type `nat';
7160 * a generic case distinction tactic `exhaust_tac' which works for all
7161 datatypes and also for type `nat';
7163 * each datatype comes with a function `size';
7165 * patterns in case expressions allow tuple patterns as arguments to
7166 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7168 * primrec now also works with type nat;
7170 * recdef: a new declaration form, allows general recursive functions to be
7171 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7173 * the constant for negation has been renamed from "not" to "Not" to
7174 harmonize with FOL, ZF, LK, etc.;
7176 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7179 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7181 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7182 problems in commutative rings, using axiomatic type classes for + and *;
7184 * more examples in HOL/MiniML and HOL/Auth;
7186 * more default rewrite rules for quantifiers, union/intersection;
7188 * a new constant `arbitrary == @x.False';
7190 * HOLCF/IOA replaces old HOL/IOA;
7192 * HOLCF changes: derived all rules and arities
7193 + axiomatic type classes instead of classes
7194 + typedef instead of faking type definitions
7195 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7196 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7197 + eliminated the types void, one, tr
7198 + use unit lift and bool lift (with translations) instead of one and tr
7199 + eliminated blift from Lift3.thy (use Def instead of blift)
7200 all eliminated rules are derived as theorems --> no visible changes ;
7205 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7206 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7207 as ZF_cs addSIs [equalityI];
7211 New in Isabelle94-7 (November 96)
7212 ---------------------------------
7214 * allowing negative levels (as offsets) in prlev and choplev;
7216 * super-linear speedup for large simplifications;
7218 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7219 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7220 FAIL); can suppress it using the command Delsimps (ex_simps @
7221 all_simps); De Morgan laws are also now included, by default;
7223 * improved printing of ==> : ~:
7225 * new object-logic "Sequents" adds linear logic, while replacing LK
7226 and Modal (thanks to Sara Kalvala);
7228 * HOL/Auth: correctness proofs for authentication protocols;
7230 * HOL: new auto_tac combines rewriting and classical reasoning (many
7231 examples on HOL/Auth);
7233 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7234 the rewriter and classical reasoner simultaneously;
7236 * function uresult no longer returns theorems in "standard" format;
7237 regain previous version by: val uresult = standard o uresult;
7244 * oracles -- these establish an interface between Isabelle and trusted
7245 external reasoners, which may deliver results as theorems;
7247 * proof objects (in particular record all uses of oracles);
7249 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7251 * "constdefs" section in theory files;
7253 * "primrec" section (HOL) no longer requires names;
7255 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7262 * reduced space requirements;
7264 * automatic HTML generation from theories;
7266 * theory files no longer require "..." (quotes) around most types;
7268 * new examples, including two proofs of the Church-Rosser theorem;
7270 * non-curried (1994) version of HOL is no longer distributed;
7277 * greatly reduced space requirements;
7279 * theory files (.thy) no longer require \...\ escapes at line breaks;
7281 * searchable theorem database (see the section "Retrieving theorems" on
7282 page 8 of the Reference Manual);
7284 * new examples, including Grabczewski's monumental case study of the
7287 * The previous version of HOL renamed to Old_HOL;
7289 * The new version of HOL (previously called CHOL) uses a curried syntax
7290 for functions. Application looks like f a b instead of f(a,b);
7292 * Mutually recursive inductive definitions finally work in HOL;
7294 * In ZF, pattern-matching on tuples is now available in all abstractions and
7295 translates to the operator "split";
7302 * new infix operator, addss, allowing the classical reasoner to
7303 perform simplification at each step of its search. Example:
7304 fast_tac (cs addss ss)
7306 * a new logic, CHOL, the same as HOL, but with a curried syntax
7307 for functions. Application looks like f a b instead of f(a,b). Also pairs
7308 look like (a,b) instead of <a,b>;
7310 * PLEASE NOTE: CHOL will eventually replace HOL!
7312 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7313 It translates to the operator "split". A new theory of integers is available;
7315 * In ZF, integer numerals now denote two's-complement binary integers.
7316 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7318 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7319 of the Axiom of Choice;
7326 * Significantly faster resolution;
7328 * the different sections in a .thy file can now be mixed and repeated
7331 * Database of theorems for FOL, HOL and ZF. New
7332 commands including qed, qed_goal and bind_thm store theorems in the database.
7334 * Simple database queries: return a named theorem (get_thm) or all theorems of
7335 a given theory (thms_of), or find out what theory a theorem was proved in
7338 * Bugs fixed in the inductive definition and datatype packages;
7340 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7341 and HOL_dup_cs obsolete;
7343 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7346 * Simpler definition of function space in ZF;
7348 * new results about cardinal and ordinal arithmetic in ZF;
7350 * 'subtype' facility in HOL for introducing new types as subsets of existing
7353 :mode=text:wrap=hard:maxLineLen=72: