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 * Some previously unqualified names have been qualified:
31 Pair ~> Product_Type.Pair
32 fst ~> Product_Type.fst
33 snd ~> Product_Type.snd
34 split ~> Product_Type.split
35 curry ~> Product_Type.curry
39 * Removed simplifier congruence rule of "prod_case", as has for long
40 been the case with "split".
42 * Datatype package: theorems generated for executable equality
43 (class eq) carry proper names and are treated as default code
46 * List.thy: use various operations from the Haskell prelude when
47 generating Haskell code.
49 * code_simp.ML: simplification with rules determined by
52 * code generator: do not print function definitions for case
53 combinators any longer.
57 New in Isabelle2009-2 (June 2010)
58 ---------------------------------
62 * Authentic syntax for *all* logical entities (type classes, type
63 constructors, term constants): provides simple and robust
64 correspondence between formal entities and concrete syntax. Within
65 the parse tree / AST representations, "constants" are decorated by
66 their category (class, type, const) and spelled out explicitly with
67 their full internal name.
69 Substantial INCOMPATIBILITY concerning low-level syntax declarations
70 and translations (translation rules and translation functions in ML).
71 Some hints on upgrading:
73 - Many existing uses of 'syntax' and 'translations' can be replaced
74 by more modern 'type_notation', 'notation' and 'abbreviation',
75 which are independent of this issue.
77 - 'translations' require markup within the AST; the term syntax
78 provides the following special forms:
80 CONST c -- produces syntax version of constant c from context
81 XCONST c -- literally c, checked as constant from context
82 c -- literally c, if declared by 'syntax'
84 Plain identifiers are treated as AST variables -- occasionally the
85 system indicates accidental variables via the error "rhs contains
88 Type classes and type constructors are marked according to their
89 concrete syntax. Some old translations rules need to be written
90 for the "type" category, using type constructor application
91 instead of pseudo-term application of the default category
94 - 'parse_translation' etc. in ML may use the following
97 @{class_syntax c} -- type class c within parse tree / AST
98 @{term_syntax c} -- type constructor c within parse tree / AST
99 @{const_syntax c} -- ML version of "CONST c" above
100 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
102 - Literal types within 'typed_print_translations', i.e. those *not*
103 represented as pseudo-terms are represented verbatim. Use @{class
104 c} or @{type_name c} here instead of the above syntax
107 Note that old non-authentic syntax was based on unqualified base
108 names, so all of the above "constant" names would coincide. Recall
109 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
110 diagnose syntax problems.
112 * Type constructors admit general mixfix syntax, not just infix.
114 * Concrete syntax may be attached to local entities without a proof
115 body, too. This works via regular mixfix annotations for 'fix',
116 'def', 'obtain' etc. or via the explicit 'write' command, which is
117 similar to the 'notation' command in theory specifications.
119 * Discontinued unnamed infix syntax (legacy feature for many years) --
120 need to specify constant name and syntax separately. Internal ML
121 datatype constructors have been renamed from InfixName to Infix etc.
122 Minor INCOMPATIBILITY.
124 * Schematic theorem statements need to be explicitly markup as such,
125 via commands 'schematic_lemma', 'schematic_theorem',
126 'schematic_corollary'. Thus the relevance of the proof is made
127 syntactically clear, which impacts performance in a parallel or
128 asynchronous interactive environment. Minor INCOMPATIBILITY.
130 * Use of cumulative prems via "!" in some proof methods has been
131 discontinued (old legacy feature).
133 * References 'trace_simp' and 'debug_simp' have been replaced by
134 configuration options stored in the context. Enabling tracing (the
135 case of debugging is similar) in proofs works via
137 using [[trace_simp = true]]
139 Tracing is then active for all invocations of the simplifier in
140 subsequent goal refinement steps. Tracing may also still be enabled or
141 disabled via the ProofGeneral settings menu.
143 * Separate commands 'hide_class', 'hide_type', 'hide_const',
144 'hide_fact' replace the former 'hide' KIND command. Minor
147 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
148 more efficient than combinations with -q1 or -q2.
153 * Proofterms record type-class reasoning explicitly, using the
154 "unconstrain" operation internally. This eliminates all sort
155 constraints from a theorem and proof, introducing explicit
156 OFCLASS-premises. On the proof term level, this operation is
157 automatically applied at theorem boundaries, such that closed proofs
158 are always free of sort constraints. INCOMPATIBILITY for tools that
161 * Local theory specifications may depend on extra type variables that
162 are not present in the result type -- arguments TYPE('a) :: 'a itself
163 are added internally. For example:
165 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
167 * Predicates of locales introduced by classes carry a mandatory
168 "class" prefix. INCOMPATIBILITY.
170 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
172 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
175 * Command 'code_reflect' allows to incorporate generated ML code into
176 runtime environment; replaces immature code_datatype antiquotation.
179 * Code generator: simple concept for abstract datatypes obeying
182 * Code generator: details of internal data cache have no impact on the
183 user space functionality any longer.
185 * Methods "unfold_locales" and "intro_locales" ignore non-locale
186 subgoals. This is more appropriate for interpretations with 'where'.
189 * Command 'example_proof' opens an empty proof body. This allows to
190 experiment with Isar, without producing any persistent result.
192 * Commands 'type_notation' and 'no_type_notation' declare type syntax
193 within a local theory context, with explicit checking of the
194 constructors involved (in contrast to the raw 'syntax' versions).
196 * Commands 'types' and 'typedecl' now work within a local theory
197 context -- without introducing dependencies on parameters or
198 assumptions, which is not possible in Isabelle/Pure.
200 * Command 'defaultsort' has been renamed to 'default_sort', it works
201 within a local theory context. Minor INCOMPATIBILITY.
206 * Command 'typedef' now works within a local theory context -- without
207 introducing dependencies on parameters or assumptions, which is not
208 possible in Isabelle/Pure/HOL. Note that the logical environment may
209 contain multiple interpretations of local typedefs (with different
210 non-emptiness proofs), even in a global theory context.
212 * New package for quotient types. Commands 'quotient_type' and
213 'quotient_definition' may be used for defining types and constants by
214 quotient constructions. An example is the type of integers created by
215 quotienting pairs of natural numbers:
218 intrel :: "(nat * nat) => (nat * nat) => bool"
220 "intrel (x, y) (u, v) = (x + v = u + y)"
222 quotient_type int = "nat * nat" / intrel
223 by (auto simp add: equivp_def expand_fun_eq)
226 "0::int" is "(0::nat, 0::nat)"
228 The method "lifting" can be used to lift of theorems from the
229 underlying "raw" type to the quotient type. The example
230 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
231 construction and provides a reasoning infrastructure for finite sets.
233 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
234 clash with new theory Quotient in Main HOL.
236 * Moved the SMT binding into the main HOL session, eliminating
237 separate HOL-SMT session.
239 * List membership infix mem operation is only an input abbreviation.
242 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
243 for future developements; former Library/Word.thy is still present in
244 the AFP entry RSAPPS.
246 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
247 longer shadowed. INCOMPATIBILITY.
249 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
252 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
255 * Dropped normalizing_semiring etc; use the facts in semiring classes
256 instead. INCOMPATIBILITY.
258 * Dropped several real-specific versions of lemmas about floor and
259 ceiling; use the generic lemmas from theory "Archimedean_Field"
260 instead. INCOMPATIBILITY.
262 floor_number_of_eq ~> floor_number_of
263 le_floor_eq_number_of ~> number_of_le_floor
264 le_floor_eq_zero ~> zero_le_floor
265 le_floor_eq_one ~> one_le_floor
266 floor_less_eq_number_of ~> floor_less_number_of
267 floor_less_eq_zero ~> floor_less_zero
268 floor_less_eq_one ~> floor_less_one
269 less_floor_eq_number_of ~> number_of_less_floor
270 less_floor_eq_zero ~> zero_less_floor
271 less_floor_eq_one ~> one_less_floor
272 floor_le_eq_number_of ~> floor_le_number_of
273 floor_le_eq_zero ~> floor_le_zero
274 floor_le_eq_one ~> floor_le_one
275 floor_subtract_number_of ~> floor_diff_number_of
276 floor_subtract_one ~> floor_diff_one
277 ceiling_number_of_eq ~> ceiling_number_of
278 ceiling_le_eq_number_of ~> ceiling_le_number_of
279 ceiling_le_zero_eq ~> ceiling_le_zero
280 ceiling_le_eq_one ~> ceiling_le_one
281 less_ceiling_eq_number_of ~> number_of_less_ceiling
282 less_ceiling_eq_zero ~> zero_less_ceiling
283 less_ceiling_eq_one ~> one_less_ceiling
284 ceiling_less_eq_number_of ~> ceiling_less_number_of
285 ceiling_less_eq_zero ~> ceiling_less_zero
286 ceiling_less_eq_one ~> ceiling_less_one
287 le_ceiling_eq_number_of ~> number_of_le_ceiling
288 le_ceiling_eq_zero ~> zero_le_ceiling
289 le_ceiling_eq_one ~> one_le_ceiling
290 ceiling_subtract_number_of ~> ceiling_diff_number_of
291 ceiling_subtract_one ~> ceiling_diff_one
293 * Theory "Finite_Set": various folding_XXX locales facilitate the
294 application of the various fold combinators on finite sets.
296 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
297 provides abstract red-black tree type which is backed by "RBT_Impl" as
298 implementation. INCOMPATIBILTY.
300 * Theory Library/Coinductive_List has been removed -- superseded by
301 AFP/thys/Coinductive.
303 * Theory PReal, including the type "preal" and related operations, has
304 been removed. INCOMPATIBILITY.
306 * Real: new development using Cauchy Sequences.
308 * Split off theory "Big_Operators" containing setsum, setprod,
309 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
311 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
312 "Int" etc. INCOMPATIBILITY.
314 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
316 * New set of rules "ac_simps" provides combined assoc / commute
317 rewrites for all interpretations of the appropriate generic locales.
319 * Renamed theory "OrderedGroup" to "Groups" and split theory
320 "Ring_and_Field" into theories "Rings" and "Fields"; for more
321 appropriate and more consistent names suitable for name prefixes
322 within the HOL theories. INCOMPATIBILITY.
324 * Some generic constants have been put to appropriate theories:
325 - less_eq, less: Orderings
326 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
327 - inverse, divide: Rings
330 * More consistent naming of type classes involving orderings (and
333 lower_semilattice ~> semilattice_inf
334 upper_semilattice ~> semilattice_sup
336 dense_linear_order ~> dense_linorder
338 pordered_ab_group_add ~> ordered_ab_group_add
339 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
340 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
341 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
342 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
343 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
344 pordered_cancel_semiring ~> ordered_cancel_semiring
345 pordered_comm_monoid_add ~> ordered_comm_monoid_add
346 pordered_comm_ring ~> ordered_comm_ring
347 pordered_comm_semiring ~> ordered_comm_semiring
348 pordered_ring ~> ordered_ring
349 pordered_ring_abs ~> ordered_ring_abs
350 pordered_semiring ~> ordered_semiring
352 ordered_ab_group_add ~> linordered_ab_group_add
353 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
354 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
355 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
356 ordered_field ~> linordered_field
357 ordered_field_no_lb ~> linordered_field_no_lb
358 ordered_field_no_ub ~> linordered_field_no_ub
359 ordered_field_dense_linear_order ~> dense_linordered_field
360 ordered_idom ~> linordered_idom
361 ordered_ring ~> linordered_ring
362 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
363 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
364 ordered_ring_strict ~> linordered_ring_strict
365 ordered_semidom ~> linordered_semidom
366 ordered_semiring ~> linordered_semiring
367 ordered_semiring_1 ~> linordered_semiring_1
368 ordered_semiring_1_strict ~> linordered_semiring_1_strict
369 ordered_semiring_strict ~> linordered_semiring_strict
371 The following slightly odd type classes have been moved to a
372 separate theory Library/Lattice_Algebras:
374 lordered_ab_group_add ~> lattice_ab_group_add
375 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
376 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
377 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
378 lordered_ring ~> lattice_ring
382 * Refined field classes:
383 - classes division_ring_inverse_zero, field_inverse_zero,
384 linordered_field_inverse_zero include rule inverse 0 = 0 --
385 subsumes former division_by_zero class;
386 - numerous lemmas have been ported from field to division_ring.
389 * Refined algebra theorem collections:
390 - dropped theorem group group_simps, use algebra_simps instead;
391 - dropped theorem group ring_simps, use field_simps instead;
392 - proper theorem collection field_simps subsumes former theorem
393 groups field_eq_simps and field_simps;
394 - dropped lemma eq_minus_self_iff which is a duplicate for
398 * Theory Finite_Set and List: some lemmas have been generalized from
401 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
402 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
403 inter_Inter_fold_inter ~> inf_Inf_fold_inf
404 union_Union_fold_union ~> sup_Sup_fold_sup
405 Inter_fold_inter ~> Inf_fold_inf
406 Union_fold_union ~> Sup_fold_sup
407 inter_INTER_fold_inter ~> inf_INFI_fold_inf
408 union_UNION_fold_union ~> sup_SUPR_fold_sup
409 INTER_fold_inter ~> INFI_fold_inf
410 UNION_fold_union ~> SUPR_fold_sup
412 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
413 replaced by the more convenient lemmas Inf_empty and Sup_empty.
414 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
415 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
416 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
417 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
419 * Reorganized theory Multiset: swapped notation of pointwise and
422 - pointwise ordering is instance of class order with standard syntax
424 - multiset ordering has syntax <=# and <#; partial order properties
425 are provided by means of interpretation with prefix
427 - less duplication, less historical organization of sections,
428 conversion from associations lists to multisets, rudimentary code
430 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
435 multiset_eq_conv_count_eq ~> multiset_ext_iff
436 multi_count_ext ~> multiset_ext
437 diff_union_inverse2 ~> diff_union_cancelR
441 * Theory Permutation: replaced local "remove" by List.remove1.
443 * Code generation: ML and OCaml code is decorated with signatures.
445 * Theory List: added transpose.
447 * Library/Nat_Bijection.thy is a collection of bijective functions
448 between nat and other types, which supersedes the older libraries
449 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
452 Nat_Int_Bij.nat2_to_nat ~> prod_encode
453 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
454 Nat_Int_Bij.int_to_nat_bij ~> int_encode
455 Nat_Int_Bij.nat_to_int_bij ~> int_decode
456 Countable.pair_encode ~> prod_encode
457 NatIso.prod2nat ~> prod_encode
458 NatIso.nat2prod ~> prod_decode
459 NatIso.sum2nat ~> sum_encode
460 NatIso.nat2sum ~> sum_decode
461 NatIso.list2nat ~> list_encode
462 NatIso.nat2list ~> list_decode
463 NatIso.set2nat ~> set_encode
464 NatIso.nat2set ~> set_decode
467 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
468 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
469 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
470 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
471 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
472 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
473 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
474 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
475 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
476 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
477 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
478 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
479 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
482 - Renamed ATP commands:
483 atp_info ~> sledgehammer running_atps
484 atp_kill ~> sledgehammer kill_atps
485 atp_messages ~> sledgehammer messages
486 atp_minimize ~> sledgehammer minimize
487 print_atps ~> sledgehammer available_atps
489 - Added user's manual ("isabelle doc sledgehammer").
490 - Added option syntax and "sledgehammer_params" to customize
491 Sledgehammer's behavior. See the manual for details.
492 - Modified the Isar proof reconstruction code so that it produces
493 direct proofs rather than proofs by contradiction. (This feature
494 is still experimental.)
495 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
497 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
500 - Added and implemented "binary_ints" and "bits" options.
501 - Added "std" option and implemented support for nonstandard models.
502 - Added and implemented "finitize" option to improve the precision
503 of infinite datatypes based on a monotonicity analysis.
504 - Added support for quotient types.
505 - Added support for "specification" and "ax_specification"
507 - Added support for local definitions (for "function" and
508 "termination" proofs).
509 - Added support for term postprocessors.
510 - Optimized "Multiset.multiset" and "FinFun.finfun".
511 - Improved efficiency of "destroy_constrs" optimization.
512 - Fixed soundness bugs related to "destroy_constrs" optimization and
514 - Fixed soundness bug related to higher-order constructors.
515 - Fixed soundness bug when "full_descrs" is enabled.
516 - Improved precision of set constructs.
517 - Added "atoms" option.
518 - Added cache to speed up repeated Kodkod invocations on the same
520 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
521 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
522 "SAT4J_Light". INCOMPATIBILITY.
523 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
524 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
525 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
527 * Method "induct" now takes instantiations of the form t, where t is not
528 a variable, as a shorthand for "x == t", where x is a fresh variable.
529 If this is not intended, t has to be enclosed in parentheses.
530 By default, the equalities generated by definitional instantiations
531 are pre-simplified, which may cause parameters of inductive cases
532 to disappear, or may even delete some of the inductive cases.
533 Use "induct (no_simp)" instead of "induct" to restore the old
534 behaviour. The (no_simp) option is also understood by the "cases"
535 and "nominal_induct" methods, which now perform pre-simplification, too.
541 * Variable names in lemmas generated by the domain package have
542 changed; the naming scheme is now consistent with the HOL datatype
543 package. Some proof scripts may be affected, INCOMPATIBILITY.
545 * The domain package no longer defines the function "foo_copy" for
546 recursive domain "foo". The reach lemma is now stated directly in
547 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
548 be reformulated in terms of "foo_take", INCOMPATIBILITY.
550 * Most definedness lemmas generated by the domain package (previously
551 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
552 like "foo$x = UU <-> x = UU", which works better as a simp rule.
553 Proofs that used definedness lemmas as intro rules may break,
554 potential INCOMPATIBILITY.
556 * Induction and casedist rules generated by the domain package now
557 declare proper case_names (one called "bottom", and one named for each
558 constructor). INCOMPATIBILITY.
560 * For mutually-recursive domains, separate "reach" and "take_lemma"
561 rules are generated for each domain, INCOMPATIBILITY.
563 foo_bar.reach ~> foo.reach bar.reach
564 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
566 * Some lemmas generated by the domain package have been renamed for
567 consistency with the datatype package, INCOMPATIBILITY.
569 foo.ind ~> foo.induct
570 foo.finite_ind ~> foo.finite_induct
571 foo.coind ~> foo.coinduct
572 foo.casedist ~> foo.exhaust
573 foo.exhaust ~> foo.nchotomy
575 * For consistency with other definition packages, the fixrec package
576 now generates qualified theorem names, INCOMPATIBILITY.
578 foo_simps ~> foo.simps
579 foo_unfold ~> foo.unfold
580 foo_induct ~> foo.induct
582 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
583 method and internal fixrec proofs now use the default simpset instead.
586 * The "contlub" predicate has been removed. Proof scripts should use
587 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
589 * The "admw" predicate has been removed, INCOMPATIBILITY.
591 * The constants cpair, cfst, and csnd have been removed in favor of
592 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
597 * Antiquotations for basic formal entities:
599 @{class NAME} -- type class
600 @{class_syntax NAME} -- syntax representation of the above
602 @{type_name NAME} -- logical type
603 @{type_abbrev NAME} -- type abbreviation
604 @{nonterminal NAME} -- type of concrete syntactic category
605 @{type_syntax NAME} -- syntax representation of any of the above
607 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
608 @{const_abbrev NAME} -- abbreviated constant
609 @{const_syntax NAME} -- syntax representation of any of the above
611 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
612 syntax constant (cf. 'syntax' command).
614 * Antiquotation @{make_string} inlines a function to print arbitrary
615 values similar to the ML toplevel. The result is compiler dependent
616 and may fall back on "?" in certain situations.
618 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
619 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
620 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
621 not work with the asynchronous Isar document model.
623 * Configuration options now admit dynamic default values, depending on
624 the context or even global references.
626 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
627 uses an efficient external library if available (for Poly/ML).
629 * Renamed some important ML structures, while keeping the old names
630 for some time as aliases within the structure Legacy:
632 OuterKeyword ~> Keyword
635 OuterSyntax ~> Outer_Syntax
636 PrintMode ~> Print_Mode
637 SpecParse ~> Parse_Spec
640 ThyOutput ~> Thy_Output
641 TypeInfer ~> Type_Infer
643 Note that "open Legacy" simplifies porting of sources, but forgetting
644 to remove it again will complicate porting again in the future.
646 * Most operations that refer to a global context are named
647 accordingly, e.g. Simplifier.global_context or
648 ProofContext.init_global. There are some situations where a global
649 context actually works, but under normal circumstances one needs to
650 pass the proper local context through the code!
652 * Discontinued old TheoryDataFun with its copy/init operation -- data
653 needs to be pure. Functor Theory_Data_PP retains the traditional
654 Pretty.pp argument to merge, which is absent in the standard
657 * Sorts.certify_sort and derived "cert" operations for types and terms
658 no longer minimize sorts. Thus certification at the boundary of the
659 inference kernel becomes invariant under addition of class relations,
660 which is an important monotonicity principle. Sorts are now minimized
661 in the syntax layer only, at the boundary between the end-user and the
662 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
663 explicitly in rare situations.
665 * Renamed old-style Drule.standard to Drule.export_without_context, to
666 emphasize that this is in no way a standard operation.
669 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
670 usual for resolution. Rare INCOMPATIBILITY.
672 * Renamed varify/unvarify operations to varify_global/unvarify_global
673 to emphasize that these only work in a global situation (which is
676 * Curried take and drop in library.ML; negative length is interpreted
677 as infinity (as in chop). Subtle INCOMPATIBILITY.
679 * Proof terms: type substitutions on proof constants now use canonical
680 order of type variables. INCOMPATIBILITY for tools working with proof
683 * Raw axioms/defs may no longer carry sort constraints, and raw defs
684 may no longer carry premises. User-level specifications are
685 transformed accordingly by Thm.add_axiom/add_def.
690 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
691 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
692 proof terms are enabled unconditionally in the new HOL-Proofs image.
694 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
695 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
698 * Old lib/scripts/polyml-platform is superseded by the
699 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
700 variant, even on a 64 bit machine. The following example setting
701 prefers 64 bit if available:
703 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
705 * The preliminary Isabelle/jEdit application demonstrates the emerging
706 Isabelle/Scala layer for advanced prover interaction and integration.
707 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
710 * "IsabelleText" is a Unicode font derived from Bitstream Vera Mono
711 and Bluesky TeX fonts. It provides the usual Isabelle symbols,
712 similar to the default assignment of the document preparation system
713 (cf. isabellesym.sty). The Isabelle/Scala class Isabelle_System
714 provides some operations for direct access to the font without asking
715 the user for manual installation.
719 New in Isabelle2009-1 (December 2009)
720 -------------------------------------
724 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
725 one backslash should be used, even in ML sources.
730 * Locale interpretation propagates mixins along the locale hierarchy.
731 The currently only available mixins are the equations used to map
732 local definitions to terms of the target domain of an interpretation.
734 * Reactivated diagnostic command 'print_interps'. Use "print_interps
735 loc" to print all interpretations of locale "loc" in the theory.
736 Interpretations in proofs are not shown.
738 * Thoroughly revised locales tutorial. New section on conditional
741 * On instantiation of classes, remaining undefined class parameters
742 are formally declared. INCOMPATIBILITY.
745 *** Document preparation ***
747 * New generalized style concept for printing terms: @{foo (style) ...}
748 instead of @{foo_style style ...} (old form is still retained for
749 backward compatibility). Styles can be also applied for
750 antiquotations prop, term_type and typeof.
755 * New proof method "smt" for a combination of first-order logic with
756 equality, linear and nonlinear (natural/integer/real) arithmetic, and
757 fixed-size bitvectors; there is also basic support for higher-order
758 features (esp. lambda abstractions). It is an incomplete decision
759 procedure based on external SMT solvers using the oracle mechanism;
760 for the SMT solver Z3, this method is proof-producing. Certificates
761 are provided to avoid calling the external solvers solely for
762 re-checking proofs. Due to a remote SMT service there is no need for
763 installing SMT solvers locally. See src/HOL/SMT.
765 * New commands to load and prove verification conditions generated by
766 the Boogie program verifier or derived systems (e.g. the Verifying C
767 Compiler (VCC) or Spec#). See src/HOL/Boogie.
769 * New counterexample generator tool 'nitpick' based on the Kodkod
770 relational model finder. See src/HOL/Tools/Nitpick and
771 src/HOL/Nitpick_Examples.
773 * New commands 'code_pred' and 'values' to invoke the predicate
774 compiler and to enumerate values of inductive predicates.
776 * A tabled implementation of the reflexive transitive closure.
778 * New implementation of quickcheck uses generic code generator;
779 default generators are provided for all suitable HOL types, records
780 and datatypes. Old quickcheck can be re-activated importing theory
781 Library/SML_Quickcheck.
783 * New testing tool Mirabelle for automated proof tools. Applies
784 several tools and tactics like sledgehammer, metis, or quickcheck, to
785 every proof step in a theory. To be used in batch mode via the
788 * New proof method "sos" (sum of squares) for nonlinear real
789 arithmetic (originally due to John Harison). It requires theory
790 Library/Sum_Of_Squares. It is not a complete decision procedure but
791 works well in practice on quantifier-free real arithmetic with +, -,
792 *, ^, =, <= and <, i.e. boolean combinations of equalities and
793 inequalities between polynomials. It makes use of external
794 semidefinite programming solvers. Method "sos" generates a
795 certificate that can be pasted into the proof thus avoiding the need
796 to call an external tool every time the proof is checked. See
797 src/HOL/Library/Sum_Of_Squares.
799 * New method "linarith" invokes existing linear arithmetic decision
802 * New command 'atp_minimal' reduces result produced by Sledgehammer.
804 * New Sledgehammer option "Full Types" in Proof General settings menu.
805 Causes full type information to be output to the ATPs. This slows
806 ATPs down considerably but eliminates a source of unsound "proofs"
809 * New method "metisFT": A version of metis that uses full type
810 information in order to avoid failures of proof reconstruction.
812 * New evaluator "approximate" approximates an real valued term using
813 the same method as the approximation method.
815 * Method "approximate" now supports arithmetic expressions as
816 boundaries of intervals and implements interval splitting and Taylor
819 * ML antiquotation @{code_datatype} inserts definition of a datatype
820 generated by the code generator; e.g. see src/HOL/Predicate.thy.
822 * New theory SupInf of the supremum and infimum operators for sets of
825 * New theory Probability, which contains a development of measure
826 theory, eventually leading to Lebesgue integration and probability.
828 * Extended Multivariate Analysis to include derivation and Brouwer's
831 * Reorganization of number theory, INCOMPATIBILITY:
832 - new number theory development for nat and int, in theories Divides
833 and GCD as well as in new session Number_Theory
834 - some constants and facts now suffixed with _nat and _int
836 - former session NumberTheory now named Old_Number_Theory, including
837 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
838 - moved theory Pocklington from src/HOL/Library to
839 src/HOL/Old_Number_Theory
841 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
842 lcm of finite and infinite sets. It is shown that they form a complete
845 * Class semiring_div requires superclass no_zero_divisors and proof of
846 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
847 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
848 generalized to class semiring_div, subsuming former theorems
849 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
850 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
853 * Refinements to lattice classes and sets:
854 - less default intro/elim rules in locale variant, more default
855 intro/elim rules in class variant: more uniformity
856 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
858 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
860 - renamed ACI to inf_sup_aci
861 - new class "boolean_algebra"
862 - class "complete_lattice" moved to separate theory
863 "Complete_Lattice"; corresponding constants (and abbreviations)
864 renamed and with authentic syntax:
865 Set.Inf ~> Complete_Lattice.Inf
866 Set.Sup ~> Complete_Lattice.Sup
867 Set.INFI ~> Complete_Lattice.INFI
868 Set.SUPR ~> Complete_Lattice.SUPR
869 Set.Inter ~> Complete_Lattice.Inter
870 Set.Union ~> Complete_Lattice.Union
871 Set.INTER ~> Complete_Lattice.INTER
872 Set.UNION ~> Complete_Lattice.UNION
873 - authentic syntax for
876 - mere abbreviations:
879 Set.inter (for inf, formerly Set.Int)
880 Set.union (for sup, formerly Set.Un)
881 Complete_Lattice.Inter (for Inf)
882 Complete_Lattice.Union (for Sup)
883 Complete_Lattice.INTER (for INFI)
884 Complete_Lattice.UNION (for SUPR)
885 - object-logic definitions as far as appropriate
887 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
888 Un_subset_iff are explicitly deleted as default simp rules; then also
889 their lattice counterparts le_inf_iff and le_sup_iff have to be
890 deleted to achieve the desired effect.
892 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
893 rules by default any longer; the same applies to min_max.inf_absorb1
894 etc. INCOMPATIBILITY.
896 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
897 pred_set_conv by default. INCOMPATIBILITY.
899 * Power operations on relations and functions are now one dedicated
900 constant "compow" with infix syntax "^^". Power operation on
901 multiplicative monoids retains syntax "^" and is now defined generic
902 in class power. INCOMPATIBILITY.
904 * Relation composition "R O S" now has a more standard argument order:
905 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
906 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
907 break, since the O_assoc rule was not rewritten like this. Fix using
908 O_assoc[symmetric]. The same applies to the curried version "R OO S".
910 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
911 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
914 * Most rules produced by inductive and datatype package have mandatory
915 prefixes. INCOMPATIBILITY.
917 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
918 the attribute of the same name. Each of the theorems in the list
919 DERIV_intros assumes composition with an additional function and
920 matches a variable to the derivative, which has to be solved by the
921 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
922 of most elementary terms. Former Maclauren.DERIV_tac and
923 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
926 * Code generator attributes follow the usual underscore convention:
927 code_unfold replaces code unfold
928 code_post replaces code post
933 sizechange -> size_change
934 induct_scheme -> induction_schema
937 * Discontinued abbreviation "arbitrary" of constant "undefined".
938 INCOMPATIBILITY, use "undefined" directly.
941 Suc_eq_add_numeral_1 -> Suc_eq_plus1
942 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
943 Suc_plus1 -> Suc_eq_plus1
944 *anti_sym -> *antisym*
945 vector_less_eq_def -> vector_le_def
948 * Added theorem List.map_map as [simp]. Removed List.map_compose.
951 * Removed predicate "M hassize n" (<--> card M = n & finite M).
957 * Theory Representable defines a class "rep" of domains that are
958 representable (via an ep-pair) in the universal domain type "udom".
959 Instances are provided for all type constructors defined in HOLCF.
961 * The 'new_domain' command is a purely definitional version of the
962 domain package, for representable domains. Syntax is identical to the
963 old domain package. The 'new_domain' package also supports indirect
964 recursion using previously-defined type constructors. See
965 src/HOLCF/ex/New_Domain.thy for examples.
967 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
968 on the left-hand side of an equation, and then performs
969 simplification. Rewriting is done using rules declared with the
970 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
971 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
973 * The pattern-match compiler in 'fixrec' can now handle constructors
974 with HOL function types. Pattern-match combinators for the Pair
975 constructor are pre-configured.
977 * The 'fixrec' package now produces better fixed-point induction rules
978 for mutually-recursive definitions: Induction rules have conclusions
979 of the form "P foo bar" instead of "P <foo, bar>".
981 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
982 been renamed to "below". The name "below" now replaces "less" in many
983 theorem names. (Legacy theorem names using "less" are still supported
986 * The 'fixrec' package now supports "bottom patterns". Bottom
987 patterns can be used to generate strictness rules, or to make
988 functions more strict (much like the bang-patterns supported by the
989 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
995 * Support for Poly/ML 5.3.0, with improved reporting of compiler
996 errors and run-time exceptions, including detailed source positions.
998 * Structure Name_Space (formerly NameSpace) now manages uniquely
999 identified entries, with some additional information such as source
1000 position, logical grouping etc.
1002 * Theory and context data is now introduced by the simplified and
1003 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
1004 to be pure, but the old TheoryDataFun for mutable data (with explicit
1005 copy operation) is still available for some time.
1007 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
1008 provides a high-level programming interface to synchronized state
1009 variables with atomic update. This works via pure function
1010 application within a critical section -- its runtime should be as
1011 short as possible; beware of deadlocks if critical code is nested,
1012 either directly or indirectly via other synchronized variables!
1014 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
1015 wraps raw ML references, explicitly indicating their non-thread-safe
1016 behaviour. The Isar toplevel keeps this structure open, to
1017 accommodate Proof General as well as quick and dirty interactive
1018 experiments with references.
1020 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
1021 parallel tactical reasoning.
1023 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
1024 are similar to SUBPROOF, but are slightly more flexible: only the
1025 specified parts of the subgoal are imported into the context, and the
1026 body tactic may introduce new subgoals and schematic variables.
1028 * Old tactical METAHYPS, which does not observe the proof context, has
1029 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
1030 or Subgoal.FOCUS etc.
1032 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1033 functors have their own ML name space there is no point to mark them
1034 separately.) Minor INCOMPATIBILITY.
1036 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1038 * Renamed several structures FooBar to Foo_Bar. Occasional,
1041 * Operations of structure Skip_Proof no longer require quick_and_dirty
1042 mode, which avoids critical setmp.
1044 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1045 combinators for "args". INCOMPATIBILITY, need to use simplified
1046 Attrib/Method.setup introduced in Isabelle2009.
1048 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1049 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1050 last resort. INCOMPATIBILITY.
1052 * Display.pretty_thm now requires a proper context (cf. former
1053 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1054 or even Display.pretty_thm_without_context as last resort.
1057 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1058 Syntax.pretty_typ/term directly, preferably with proper context
1059 instead of global theory.
1064 * Further fine tuning of parallel proof checking, scales up to 8 cores
1065 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1068 * Support for additional "Isabelle components" via etc/components, see
1069 also the system manual.
1071 * The isabelle makeall tool now operates on all components with
1072 IsaMakefile, not just hardwired "logics".
1074 * Removed "compress" option from isabelle-process and isabelle usedir;
1075 this is always enabled.
1077 * Discontinued support for Poly/ML 4.x versions.
1079 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1080 on a given logic image. This requires the lighttpd webserver and is
1081 currently supported on Linux only.
1085 New in Isabelle2009 (April 2009)
1086 --------------------------------
1090 * Simplified main Isabelle executables, with less surprises on
1091 case-insensitive file-systems (such as Mac OS).
1093 - The main Isabelle tool wrapper is now called "isabelle" instead of
1096 - The former "isabelle" alias for "isabelle-process" has been
1097 removed (should rarely occur to regular users).
1099 - The former "isabelle-interface" and its alias "Isabelle" have been
1100 removed (interfaces are now regular Isabelle tools).
1102 Within scripts and make files, the Isabelle environment variables
1103 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1104 respectively. (The latter are still available as legacy feature.)
1106 The old isabelle-interface wrapper could react in confusing ways if
1107 the interface was uninstalled or changed otherwise. Individual
1108 interface tool configuration is now more explicit, see also the
1109 Isabelle system manual. In particular, Proof General is now available
1110 via "isabelle emacs".
1112 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1113 purge installed copies of Isabelle executables and re-run "isabelle
1114 install -p ...", or use symlinks.
1116 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1117 old ~/isabelle, which was slightly non-standard and apt to cause
1118 surprises on case-insensitive file-systems (such as Mac OS).
1120 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1121 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1122 care is required when using older releases of Isabelle. Note that
1123 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1124 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1126 * Proofs of fully specified statements are run in parallel on
1127 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1128 a regular 4-core machine, if the initial heap space is made reasonably
1129 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1131 * The main reference manuals ("isar-ref", "implementation", and
1132 "system") have been updated and extended. Formally checked references
1133 as hyperlinks are now available uniformly.
1138 * Complete re-implementation of locales. INCOMPATIBILITY in several
1139 respects. The most important changes are listed below. See the
1140 Tutorial on Locales ("locales" manual) for details.
1142 - In locale expressions, instantiation replaces renaming. Parameters
1143 must be declared in a for clause. To aid compatibility with previous
1144 parameter inheritance, in locale declarations, parameters that are not
1145 'touched' (instantiation position "_" or omitted) are implicitly added
1146 with their syntax at the beginning of the for clause.
1148 - Syntax from abbreviations and definitions in locales is available in
1149 locale expressions and context elements. The latter is particularly
1150 useful in locale declarations.
1152 - More flexible mechanisms to qualify names generated by locale
1153 expressions. Qualifiers (prefixes) may be specified in locale
1154 expressions, and can be marked as mandatory (syntax: "name!:") or
1155 optional (syntax "name?:"). The default depends for plain "name:"
1156 depends on the situation where a locale expression is used: in
1157 commands 'locale' and 'sublocale' prefixes are optional, in
1158 'interpretation' and 'interpret' prefixes are mandatory. The old
1159 implicit qualifiers derived from the parameter names of a locale are
1160 no longer generated.
1162 - Command "sublocale l < e" replaces "interpretation l < e". The
1163 instantiation clause in "interpretation" and "interpret" (square
1164 brackets) is no longer available. Use locale expressions.
1166 - When converting proof scripts, mandatory qualifiers in
1167 'interpretation' and 'interpret' should be retained by default, even
1168 if this is an INCOMPATIBILITY compared to former behavior. In the
1169 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1170 in locale expressions range over a single locale instance only.
1172 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1173 In existing theorem specifications replace the includes element by the
1174 respective context elements of the included locale, omitting those
1175 that are already present in the theorem specification. Multiple
1176 assume elements of a locale should be replaced by a single one
1177 involving the locale predicate. In the proof body, declarations (most
1178 notably theorems) may be regained by interpreting the respective
1179 locales in the proof context as required (command "interpret").
1181 If using "includes" in replacement of a target solely because the
1182 parameter types in the theorem are not as general as in the target,
1183 consider declaring a new locale with additional type constraints on
1184 the parameters (context element "constrains").
1186 - Discontinued "locale (open)". INCOMPATIBILITY.
1188 - Locale interpretation commands no longer attempt to simplify goal.
1189 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1190 methods intro_locales and unfold_locales to clarify.
1192 - Locale interpretation commands no longer accept interpretation
1193 attributes. INCOMPATIBILITY.
1195 * Class declaration: so-called "base sort" must not be given in import
1196 list any longer, but is inferred from the specification. Particularly
1203 class foo = type + ...
1205 * Class target: global versions of theorems stemming do not carry a
1206 parameter prefix any longer. INCOMPATIBILITY.
1208 * Class 'instance' command no longer accepts attached definitions.
1209 INCOMPATIBILITY, use proper 'instantiation' target instead.
1211 * Recovered hiding of consts, which was accidentally broken in
1212 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1213 makes c inaccessible; consider using ``hide (open) const c'' instead.
1215 * Slightly more coherent Pure syntax, with updated documentation in
1216 isar-ref manual. Removed locales meta_term_syntax and
1217 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1218 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1219 directly in regular applications.
1221 * There is a new syntactic category "float_const" for signed decimal
1222 fractions (e.g. 123.45 or -123.45).
1224 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1225 interface with 'setup' command instead.
1227 * Command 'local_setup' is similar to 'setup', but operates on a local
1230 * The 'axiomatization' command now only works within a global theory
1231 context. INCOMPATIBILITY.
1233 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1234 hypotheses. Sorts required in the course of reasoning need to be
1235 covered by the constraints in the initial statement, completed by the
1236 type instance information of the background theory. Non-trivial sort
1237 hypotheses, which rarely occur in practice, may be specified via
1238 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1240 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1242 The result contains an implicit sort hypotheses as before --
1243 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1246 * Generalized Isar history, with support for linear undo, direct state
1249 * Changed defaults for unify configuration options:
1251 unify_trace_bound = 50 (formerly 25)
1252 unify_search_bound = 60 (formerly 30)
1254 * Different bookkeeping for code equations (INCOMPATIBILITY):
1256 a) On theory merge, the last set of code equations for a particular
1257 constant is taken (in accordance with the policy applied by other
1258 parts of the code generator framework).
1260 b) Code equations stemming from explicit declarations (e.g. code
1261 attribute) gain priority over default code equations stemming
1262 from definition, primrec, fun etc.
1264 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1266 * Unified theorem tables for both code generators. Thus [code
1267 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1269 * Command 'find_consts' searches for constants based on type and name
1272 find_consts "_ => bool"
1274 By default, matching is against subtypes, but it may be restricted to
1275 the whole type. Searching by name is possible. Multiple queries are
1276 conjunctive and queries may be negated by prefixing them with a
1279 find_consts strict: "_ => bool" name: "Int" -"int => int"
1281 * New 'find_theorems' criterion "solves" matches theorems that
1282 directly solve the current goal (modulo higher-order unification).
1284 * Auto solve feature for main theorem statements: whenever a new goal
1285 is stated, "find_theorems solves" is called; any theorems that could
1286 solve the lemma directly are listed as part of the goal state.
1287 Cf. associated options in Proof General Isabelle settings menu,
1288 enabled by default, with reasonable timeout for pathological cases of
1289 higher-order unification.
1292 *** Document preparation ***
1294 * Antiquotation @{lemma} now imitates a regular terminal proof,
1295 demanding keyword 'by' and supporting the full method expression
1296 syntax just like the Isar command 'by'.
1301 * Integrated main parts of former image HOL-Complex with HOL. Entry
1302 points Main and Complex_Main remain as before.
1304 * Logic image HOL-Plain provides a minimal HOL with the most important
1305 tools available (inductive, datatype, primrec, ...). This facilitates
1306 experimentation and tool development. Note that user applications
1307 (and library theories) should never refer to anything below theory
1310 * Logic image HOL-Main stops at theory Main, and thus facilitates
1311 experimentation due to shorter build times.
1313 * Logic image HOL-NSA contains theories of nonstandard analysis which
1314 were previously part of former HOL-Complex. Entry point Hyperreal
1315 remains valid, but theories formerly using Complex_Main should now use
1316 new entry point Hypercomplex.
1318 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1319 Posix processes. Avoids potentially expensive forking of the ML
1320 process. New thread-based implementation also works on non-Unix
1321 platforms (Cygwin). Provers are no longer hardwired, but defined
1322 within the theory via plain ML wrapper functions. Basic Sledgehammer
1323 commands are covered in the isar-ref manual.
1325 * Wrapper scripts for remote SystemOnTPTP service allows to use
1326 sledgehammer without local ATP installation (Vampire etc.). Other
1327 provers may be included via suitable ML wrappers, see also
1328 src/HOL/ATP_Linkup.thy.
1330 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1333 * The metis method no longer fails because the theorem is too trivial
1334 (contains the empty clause).
1336 * The metis method now fails in the usual manner, rather than raising
1337 an exception, if it determines that it cannot prove the theorem.
1339 * Method "coherent" implements a prover for coherent logic (see also
1340 src/Tools/coherent.ML).
1342 * Constants "undefined" and "default" replace "arbitrary". Usually
1343 "undefined" is the right choice to replace "arbitrary", though
1344 logically there is no difference. INCOMPATIBILITY.
1346 * Command "value" now integrates different evaluation mechanisms. The
1347 result of the first successful evaluation mechanism is printed. In
1348 square brackets a particular named evaluation mechanisms may be
1349 specified (currently, [SML], [code] or [nbe]). See further
1350 src/HOL/ex/Eval_Examples.thy.
1352 * Normalization by evaluation now allows non-leftlinear equations.
1353 Declare with attribute [code nbe].
1355 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1356 as the structured Isar versions "cases" and "induct", cf. the
1357 corresponding "cases" and "induct" attributes. Mutual induction rules
1358 are now presented as a list of individual projections
1359 (e.g. foo_bar.inducts for types foo and bar); the old format with
1360 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1361 rare situations a different rule is selected --- notably nested tuple
1362 elimination instead of former prod.exhaust: use explicit (case_tac t
1363 rule: prod.exhaust) here.
1365 * Attributes "cases", "induct", "coinduct" support "del" option.
1367 * Removed fact "case_split_thm", which duplicates "case_split".
1369 * The option datatype has been moved to a new theory Option. Renamed
1370 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1372 * New predicate "strict_mono" classifies strict functions on partial
1373 orders. With strict functions on linear orders, reasoning about
1374 (in)equalities is facilitated by theorems "strict_mono_eq",
1375 "strict_mono_less_eq" and "strict_mono_less".
1377 * Some set operations are now proper qualified constants with
1378 authentic syntax. INCOMPATIBILITY:
1389 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1392 * Auxiliary class "itself" has disappeared -- classes without any
1393 parameter are treated as expected by the 'class' command.
1395 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1397 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1398 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1400 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1401 method "approximation". It proves formulas on real values by using
1402 interval arithmetic. In the formulas are also the transcendental
1403 functions sin, cos, tan, atan, ln, exp and the constant pi are
1404 allowed. For examples see
1405 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1407 * Theory "Reflection" now resides in HOL/Library.
1409 * Entry point to Word library now simply named "Word".
1412 * Made source layout more coherent with logical distribution
1415 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1416 src/HOL/Library/Code_Message.thy ~> src/HOL/
1417 src/HOL/Library/GCD.thy ~> src/HOL/
1418 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1419 src/HOL/Library/Parity.thy ~> src/HOL/
1420 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1421 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1422 src/HOL/Real/Lubs.thy ~> src/HOL/
1423 src/HOL/Real/PReal.thy ~> src/HOL/
1424 src/HOL/Real/Rational.thy ~> src/HOL/
1425 src/HOL/Real/RComplete.thy ~> src/HOL/
1426 src/HOL/Real/RealDef.thy ~> src/HOL/
1427 src/HOL/Real/RealPow.thy ~> src/HOL/
1428 src/HOL/Real/Real.thy ~> src/HOL/
1429 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1430 src/HOL/Complex/Complex.thy ~> src/HOL/
1431 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1432 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1433 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1434 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1435 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1436 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1437 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1438 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1439 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1440 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1441 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1442 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1443 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1444 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1445 src/HOL/Real/Float ~> src/HOL/Library/
1446 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1447 src/HOL/Real/RealVector.thy ~> src/HOL/
1449 src/HOL/arith_data.ML ~> src/HOL/Tools
1450 src/HOL/hologic.ML ~> src/HOL/Tools
1451 src/HOL/simpdata.ML ~> src/HOL/Tools
1452 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1453 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1454 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1455 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1456 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1457 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1458 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1460 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1461 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1462 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1463 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1464 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1465 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1467 * If methods "eval" and "evaluation" encounter a structured proof
1468 state with !!/==>, only the conclusion is evaluated to True (if
1469 possible), avoiding strange error messages.
1471 * Method "sizechange" automates termination proofs using (a
1472 modification of) the size-change principle. Requires SAT solver. See
1473 src/HOL/ex/Termination.thy for examples.
1475 * Simplifier: simproc for let expressions now unfolds if bound
1476 variable occurs at most once in let expression body. INCOMPATIBILITY.
1478 * Method "arith": Linear arithmetic now ignores all inequalities when
1479 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1481 * New attribute "arith" for facts that should always be used
1482 automatically by arithmetic. It is intended to be used locally in
1485 assumes [arith]: "x > 0"
1487 Global usage is discouraged because of possible performance impact.
1489 * New classes "top" and "bot" with corresponding operations "top" and
1490 "bot" in theory Orderings; instantiation of class "complete_lattice"
1491 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1493 * Changed definition lemma "less_fun_def" in order to provide an
1494 instance for preorders on functions; use lemma "less_le" instead.
1497 * Theory Orderings: class "wellorder" moved here, with explicit
1498 induction rule "less_induct" as assumption. For instantiation of
1499 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1502 * Theory Orderings: added class "preorder" as superclass of "order".
1503 INCOMPATIBILITY: Instantiation proofs for order, linorder
1504 etc. slightly changed. Some theorems named order_class.* now named
1507 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1510 * Theory Finite_Set: added a new fold combinator of type
1512 ('a => 'b => 'b) => 'b => 'a set => 'b
1514 Occasionally this is more convenient than the old fold combinator
1515 which is now defined in terms of the new one and renamed to
1518 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1519 and "ring_simps" have been replaced by "algebra_simps" (which can be
1520 extended with further lemmas!). At the moment both still exist but
1521 the former will disappear at some point.
1523 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1524 class recpower. Type-specific simp rules for various recpower types
1525 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1527 rat_power_0 -> power_0
1528 rat_power_Suc -> power_Suc
1529 realpow_0 -> power_0
1530 realpow_Suc -> power_Suc
1531 complexpow_0 -> power_0
1532 complexpow_Suc -> power_Suc
1533 power_poly_0 -> power_0
1534 power_poly_Suc -> power_Suc
1536 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1537 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1538 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1539 of lemmas from Divides has been generalized from nat to class
1540 semiring_div. INCOMPATIBILITY. This involves the following theorem
1541 renames resulting from duplicate elimination:
1543 dvd_def_mod ~> dvd_eq_mod_eq_0
1544 zero_dvd_iff ~> dvd_0_left_iff
1545 dvd_0 ~> dvd_0_right
1546 DIVISION_BY_ZERO_DIV ~> div_by_0
1547 DIVISION_BY_ZERO_MOD ~> mod_by_0
1548 mult_div ~> div_mult_self2_is_id
1549 mult_mod ~> mod_mult_self2_is_0
1551 * Theory IntDiv: removed many lemmas that are instances of class-based
1552 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1553 rename old lemmas as follows:
1555 dvd_diff -> nat_dvd_diff
1556 dvd_zminus_iff -> dvd_minus_iff
1557 mod_add1_eq -> mod_add_eq
1558 mod_mult1_eq -> mod_mult_right_eq
1559 mod_mult1_eq' -> mod_mult_left_eq
1560 mod_mult_distrib_mod -> mod_mult_eq
1561 nat_mod_add_left_eq -> mod_add_left_eq
1562 nat_mod_add_right_eq -> mod_add_right_eq
1563 nat_mod_div_trivial -> mod_div_trivial
1564 nat_mod_mod_trivial -> mod_mod_trivial
1565 zdiv_zadd_self1 -> div_add_self1
1566 zdiv_zadd_self2 -> div_add_self2
1567 zdiv_zmult_self1 -> div_mult_self2_is_id
1568 zdiv_zmult_self2 -> div_mult_self1_is_id
1569 zdvd_triv_left -> dvd_triv_left
1570 zdvd_triv_right -> dvd_triv_right
1571 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1572 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1573 zmod_zadd_left_eq -> mod_add_left_eq
1574 zmod_zadd_right_eq -> mod_add_right_eq
1575 zmod_zadd_self1 -> mod_add_self1
1576 zmod_zadd_self2 -> mod_add_self2
1577 zmod_zadd1_eq -> mod_add_eq
1578 zmod_zdiff1_eq -> mod_diff_eq
1579 zmod_zdvd_zmod -> mod_mod_cancel
1580 zmod_zmod_cancel -> mod_mod_cancel
1581 zmod_zmult_self1 -> mod_mult_self2_is_0
1582 zmod_zmult_self2 -> mod_mult_self1_is_0
1585 zdvd_abs1 -> abs_dvd_iff
1586 zdvd_abs2 -> dvd_abs_iff
1587 zdvd_refl -> dvd_refl
1588 zdvd_trans -> dvd_trans
1589 zdvd_zadd -> dvd_add
1590 zdvd_zdiff -> dvd_diff
1591 zdvd_zminus_iff -> dvd_minus_iff
1592 zdvd_zminus2_iff -> minus_dvd_iff
1593 zdvd_zmultD -> dvd_mult_right
1594 zdvd_zmultD2 -> dvd_mult_left
1595 zdvd_zmult_mono -> mult_dvd_mono
1596 zdvd_0_right -> dvd_0_right
1597 zdvd_0_left -> dvd_0_left_iff
1598 zdvd_1_left -> one_dvd
1599 zminus_dvd_iff -> minus_dvd_iff
1601 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1603 * The real numbers offer decimal input syntax: 12.34 is translated
1604 into 1234/10^2. This translation is not reversed upon output.
1606 * Theory Library/Polynomial defines an abstract type 'a poly of
1607 univariate polynomials with coefficients of type 'a. In addition to
1608 the standard ring operations, it also supports div and mod. Code
1609 generation is also supported, using list-style constructors.
1611 * Theory Library/Inner_Product defines a class of real_inner for real
1612 inner product spaces, with an overloaded operation inner :: 'a => 'a
1613 => real. Class real_inner is a subclass of real_normed_vector from
1616 * Theory Library/Product_Vector provides instances for the product
1617 type 'a * 'b of several classes from RealVector and Inner_Product.
1618 Definitions of addition, subtraction, scalar multiplication, norms,
1619 and inner products are included.
1621 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1622 addition to the field operations, numerals and case syntax are also
1625 * Theory Library/Diagonalize provides constructive version of Cantor's
1626 first diagonalization argument.
1628 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1629 zlcm (for int); carried together from various gcd/lcm developements in
1630 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1631 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1632 may recover tupled syntax as follows:
1634 hide (open) const gcd
1635 abbreviation gcd where
1636 "gcd == (%(a, b). GCD.gcd a b)"
1638 GCD.gcd ("gcd '(_, _')")
1640 The same works for lcm, zgcd, zlcm.
1642 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1643 instantiations for algebraic structures. Removed some duplicate
1644 theorems. Changes in simp rules. INCOMPATIBILITY.
1646 * ML antiquotation @{code} takes a constant as argument and generates
1647 corresponding code in background and inserts name of the corresponding
1648 resulting ML value/function/datatype constructor binding in place.
1649 All occurrences of @{code} with a single ML block are generated
1650 simultaneously. Provides a generic and safe interface for
1651 instrumentalizing code generation. See
1652 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1653 In future you ought to refrain from ad-hoc compiling generated SML
1654 code on the ML toplevel. Note that (for technical reasons) @{code}
1655 cannot refer to constants for which user-defined serializations are
1656 set. Refer to the corresponding ML counterpart directly in that
1659 * Command 'rep_datatype': instead of theorem names the command now
1660 takes a list of terms denoting the constructors of the type to be
1661 represented as datatype. The characteristic theorems have to be
1662 proven. INCOMPATIBILITY. Also observe that the following theorems
1663 have disappeared in favour of existing ones:
1665 unit_induct ~> unit.induct
1666 prod_induct ~> prod.induct
1667 sum_induct ~> sum.induct
1668 Suc_Suc_eq ~> nat.inject
1669 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1674 * New locales for orders and lattices where the equivalence relation
1675 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1676 locales use a record structure with field eq for the equivalence.
1678 * New theory of factorial domains.
1680 * Units_l_inv and Units_r_inv are now simp rules by default.
1681 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1682 and/or r_inv will now also require deletion of these lemmas.
1684 * Renamed the following theorems, INCOMPATIBILITY:
1686 UpperD ~> Upper_memD
1687 LowerD ~> Lower_memD
1688 least_carrier ~> least_closed
1689 greatest_carrier ~> greatest_closed
1690 greatest_Lower_above ~> greatest_Lower_below
1691 one_zero ~> carrier_one_zero
1692 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1697 * Nominal datatypes can now contain type-variables.
1699 * Commands 'nominal_inductive' and 'equivariance' work with local
1702 * Nominal primrec can now works with local theory targets and its
1703 specification syntax now conforms to the general format as seen in
1706 * Method "perm_simp" honours the standard simplifier attributes
1707 (no_asm), (no_asm_use) etc.
1709 * The new predicate #* is defined like freshness, except that on the
1710 left hand side can be a set or list of atoms.
1712 * Experimental command 'nominal_inductive2' derives strong induction
1713 principles for inductive definitions. In contrast to
1714 'nominal_inductive', which can only deal with a fixed number of
1715 binders, it can deal with arbitrary expressions standing for sets of
1716 atoms to be avoided. The only inductive definition we have at the
1717 moment that needs this generalisation is the typing rule for Lets in
1720 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1721 -----------------------------------------------------------------
1722 Gamma |- Let x be t1 in t2 : T2
1724 In this rule one wants to avoid all the binders that are introduced by
1725 "close Gamma T1". We are looking for other examples where this
1726 feature might be useful. Please let us know.
1731 * Reimplemented the simplification procedure for proving continuity
1732 subgoals. The new simproc is extensible; users can declare additional
1733 continuity introduction rules with the attribute [cont2cont].
1735 * The continuity simproc now uses a different introduction rule for
1736 solving continuity subgoals on terms with lambda abstractions. In
1737 some rare cases the new simproc may fail to solve subgoals that the
1738 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1739 Potential INCOMPATIBILITY.
1741 * Command 'fixrec': specification syntax now conforms to the general
1742 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1743 examples. INCOMPATIBILITY.
1748 * Proof of Zorn's Lemma for partial orders.
1753 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1754 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1755 depends on multithreading, so timouts will not work before Poly/ML
1758 * High-level support for concurrent ML programming, see
1759 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1760 particularly convenient to organize independent functional
1761 computations. The concept of "synchronized variables" provides a
1762 higher-order interface for components with shared state, avoiding the
1763 delicate details of mutexes and condition variables. (Requires
1764 Poly/ML 5.2.1 or later.)
1766 * ML bindings produced via Isar commands are stored within the Isar
1767 context (theory or proof). Consequently, commands like 'use' and 'ML'
1768 become thread-safe and work with undo as expected (concerning
1769 top-level bindings, not side-effects on global references).
1770 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1771 compiler at runtime; really global bindings need to be given outside a
1772 theory. (Requires Poly/ML 5.2 or later.)
1774 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1775 context. Top-level ML bindings are stored within the proof context in
1776 a purely sequential fashion, disregarding the nested proof structure.
1777 ML bindings introduced by 'ML_prf' are discarded at the end of the
1778 proof. (Requires Poly/ML 5.2 or later.)
1780 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1781 and Method.setup, as well as Isar commands 'attribute_setup' and
1782 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1783 existing code accordingly, or use plain 'setup' together with old
1786 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1787 to 'a -> thm, while results are always tagged with an authentic oracle
1788 name. The Isar command 'oracle' is now polymorphic, no argument type
1789 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1790 accordingly. Note that extra performance may be gained by producing
1791 the cterm carefully, avoiding slow Thm.cterm_of.
1793 * Simplified interface for defining document antiquotations via
1794 ThyOutput.antiquotation, ThyOutput.output, and optionally
1795 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1796 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1799 * More systematic treatment of long names, abstract name bindings, and
1800 name space operations. Basic operations on qualified names have been
1801 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1802 Long_Name.append. Old type bstring has been mostly replaced by
1803 abstract type binding (see structure Binding), which supports precise
1804 qualification by packages and local theory targets, as well as proper
1805 tracking of source positions. INCOMPATIBILITY, need to wrap old
1806 bstring values into Binding.name, or better pass through abstract
1807 bindings everywhere. See further src/Pure/General/long_name.ML,
1808 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1810 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1811 LocalTheory.note etc.) now refer to the *full* internal name, not the
1812 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1814 * Disposed old type and term read functions (Sign.read_def_typ,
1815 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1816 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1817 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1818 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1819 resort for legacy applications.
1821 * Disposed old declarations, tactics, tactic combinators that refer to
1822 the simpset or claset of an implicit theory (such as Addsimps,
1823 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1824 embedded ML text, or local_simpset_of with a proper context passed as
1825 explicit runtime argument.
1827 * Rules and tactics that read instantiations (read_instantiate,
1828 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1829 context, which is required for parsing and type-checking. Moreover,
1830 the variables are specified as plain indexnames, not string encodings
1831 thereof. INCOMPATIBILITY.
1833 * Generic Toplevel.add_hook interface allows to analyze the result of
1834 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1835 for theorem dependency output of transactions resulting in a new
1838 * ML antiquotations: block-structured compilation context indicated by
1839 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1841 @{binding name} - basic name binding
1842 @{let ?pat = term} - term abbreviation (HO matching)
1843 @{note name = fact} - fact abbreviation
1844 @{thm fact} - singleton fact (with attributes)
1845 @{thms fact} - general fact (with attributes)
1846 @{lemma prop by method} - singleton goal
1847 @{lemma prop by meth1 meth2} - singleton goal
1848 @{lemma prop1 ... propN by method} - general goal
1849 @{lemma prop1 ... propN by meth1 meth2} - general goal
1850 @{lemma (open) ...} - open derivation
1855 * The Isabelle "emacs" tool provides a specific interface to invoke
1856 Proof General / Emacs, with more explicit failure if that is not
1857 installed (the old isabelle-interface script silently falls back on
1858 isabelle-process). The PROOFGENERAL_HOME setting determines the
1859 installation location of the Proof General distribution.
1861 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1862 the Isabelle process into a JVM/Scala application. See
1863 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1864 process wrapper has been discontinued.)
1866 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1868 * Various status messages (with exact source position information) are
1869 emitted, if proper markup print mode is enabled. This allows
1870 user-interface components to provide detailed feedback on internal
1875 New in Isabelle2008 (June 2008)
1876 -------------------------------
1880 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1881 and updated, with formally checked references as hyperlinks.
1883 * Theory loader: use_thy (and similar operations) no longer set the
1884 implicit ML context, which was occasionally hard to predict and in
1885 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1886 provides a proper context already.
1888 * Theory loader: old-style ML proof scripts being *attached* to a thy
1889 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1890 'use' within a theory file will do the job.
1892 * Name space merge now observes canonical order, i.e. the second space
1893 is inserted into the first one, while existing entries in the first
1894 space take precedence. INCOMPATIBILITY in rare situations, may try to
1895 swap theory imports.
1897 * Syntax: symbol \<chi> is now considered a letter. Potential
1898 INCOMPATIBILITY in identifier syntax etc.
1900 * Outer syntax: string tokens no longer admit escaped white space,
1901 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1902 white space without escapes.
1904 * Outer syntax: string tokens may contain arbitrary character codes
1905 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1911 * Context-dependent token translations. Default setup reverts locally
1912 fixed variables, and adds hilite markup for undeclared frees.
1914 * Unused theorems can be found using the new command 'unused_thms'.
1915 There are three ways of invoking it:
1918 Only finds unused theorems in the current theory.
1920 (2) unused_thms thy_1 ... thy_n -
1921 Finds unused theorems in the current theory and all of its ancestors,
1922 excluding the theories thy_1 ... thy_n and all of their ancestors.
1924 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1925 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1926 their ancestors, excluding the theories thy_1 ... thy_n and all of
1929 In order to increase the readability of the list produced by
1930 unused_thms, theorems that have been created by a particular instance
1931 of a theory command such as 'inductive' or 'function' are considered
1932 to belong to the same "group", meaning that if at least one theorem in
1933 this group is used, the other theorems in the same group are no longer
1934 reported as unused. Moreover, if all theorems in the group are
1935 unused, only one theorem in the group is displayed.
1937 Note that proof objects have to be switched on in order for
1938 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1939 usually the case when using Proof General with the default settings).
1941 * Authentic naming of facts disallows ad-hoc overwriting of previous
1942 theorems within the same name space. INCOMPATIBILITY, need to remove
1943 duplicate fact bindings, or even accidental fact duplications. Note
1944 that tools may maintain dynamically scoped facts systematically, using
1945 PureThy.add_thms_dynamic.
1947 * Command 'hide' now allows to hide from "fact" name space as well.
1949 * Eliminated destructive theorem database, simpset, claset, and
1950 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1951 update of theories within ML code.
1953 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1954 INCOMPATIBILITY, object-logics depending on former Pure require
1955 additional setup PureThy.old_appl_syntax_setup; object-logics
1956 depending on former CPure need to refer to Pure.
1958 * Commands 'use' and 'ML' are now purely functional, operating on
1959 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1960 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1963 * Command 'setup': discontinued implicit version with ML reference.
1965 * Instantiation target allows for simultaneous specification of class
1966 instance operations together with an instantiation proof.
1967 Type-checking phase allows to refer to class operations uniformly.
1968 See src/HOL/Complex/Complex.thy for an Isar example and
1969 src/HOL/Library/Eval.thy for an ML example.
1971 * Indexing of literal facts: be more serious about including only
1972 facts from the visible specification/proof context, but not the
1973 background context (locale etc.). Affects `prop` notation and method
1974 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1977 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1978 "(open)" option, which used to expose internal bound variables to the
1981 * Isar statements: removed obsolete case "rule_context".
1982 INCOMPATIBILITY, better use explicit fixes/assumes.
1984 * Locale proofs: default proof step now includes 'unfold_locales';
1985 hence 'proof' without argument may be used to unfold locale
1989 *** Document preparation ***
1991 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1992 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1993 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1994 spot); renamed link color from "darkblue" to "linkcolor" (default
1995 value unchanged, can be redefined via \definecolor); no longer sets
1996 "a4paper" option (unnecessary or even intrusive).
1998 * Antiquotation @{lemma A method} proves proposition A by the given
1999 method (either a method name or a method name plus (optional) method
2000 arguments in parentheses) and prints A just like @{prop A}.
2005 * New primrec package. Specification syntax conforms in style to
2006 definition/function/.... No separate induction rule is provided. The
2007 "primrec" command distinguishes old-style and new-style specifications
2008 by syntax. The former primrec package is now named OldPrimrecPackage.
2009 When adjusting theories, beware: constants stemming from new-style
2010 primrec specifications have authentic syntax.
2012 * Metis prover is now an order of magnitude faster, and also works
2013 with multithreading.
2015 * Metis: the maximum number of clauses that can be produced from a
2016 theorem is now given by the attribute max_clauses. Theorems that
2017 exceed this number are ignored, with a warning printed.
2019 * Sledgehammer no longer produces structured proofs by default. To
2020 enable, declare [[sledgehammer_full = true]]. Attributes
2021 reconstruction_modulus, reconstruction_sorts renamed
2022 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
2024 * Method "induct_scheme" derives user-specified induction rules
2025 from well-founded induction and completeness of patterns. This factors
2026 out some operations that are done internally by the function package
2027 and makes them available separately. See
2028 src/HOL/ex/Induction_Scheme.thy for examples.
2030 * More flexible generation of measure functions for termination
2031 proofs: Measure functions can be declared by proving a rule of the
2032 form "is_measure f" and giving it the [measure_function] attribute.
2033 The "is_measure" predicate is logically meaningless (always true), and
2034 just guides the heuristic. To find suitable measure functions, the
2035 termination prover sets up the goal "is_measure ?f" of the appropriate
2036 type and generates all solutions by prolog-style backwards proof using
2039 This setup also deals with rules like
2041 "is_measure f ==> is_measure (list_size f)"
2043 which accommodates nested datatypes that recurse through lists.
2044 Similar rules are predeclared for products and option types.
2046 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2050 - Definitions of overloaded constants on sets have to be replaced by
2051 definitions on => and bool.
2053 - Some definitions of overloaded operators on sets can now be proved
2054 using the definitions of the operators on => and bool. Therefore,
2055 the following theorems have been renamed:
2057 subset_def -> subset_eq
2058 psubset_def -> psubset_eq
2059 set_diff_def -> set_diff_eq
2060 Compl_def -> Compl_eq
2061 Sup_set_def -> Sup_set_eq
2062 Inf_set_def -> Inf_set_eq
2063 sup_set_def -> sup_set_eq
2064 inf_set_def -> inf_set_eq
2066 - Due to the incompleteness of the HO unification algorithm, some
2067 rules such as subst may require manual instantiation, if some of
2068 the unknowns in the rule is a set.
2070 - Higher order unification and forward proofs:
2073 have "P (S::'a set)" <...>
2074 then have "EX S. P S" ..
2076 no longer works (due to the incompleteness of the HO unification
2077 algorithm) and must be replaced by the pattern
2084 - Calculational reasoning with subst (or similar rules):
2087 have "P (S::'a set)" <...>
2088 also have "S = T" <...>
2089 finally have "P T" .
2091 no longer works (for similar reasons as the previous example) and
2092 must be replaced by something like
2094 have "P (S::'a set)" <...>
2095 moreover have "S = T" <...>
2096 ultimately have "P T" by simp
2098 - Tactics or packages written in ML code:
2099 Code performing pattern matching on types via
2101 Type ("set", [T]) => ...
2103 must be rewritten. Moreover, functions like strip_type or
2104 binder_types no longer return the right value when applied to a
2107 T1 => ... => Tn => U => bool
2111 T1 => ... => Tn => U set
2113 * Merged theories Wellfounded_Recursion, Accessible_Part and
2114 Wellfounded_Relations to theory Wellfounded.
2116 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2118 * Class finite no longer treats UNIV as class parameter. Use class
2119 enum from theory Library/Enum instead to achieve a similar effect.
2122 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2123 and "Cons". INCOMPATIBILITY.
2125 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2126 Potential INCOMPATIBILITY.
2128 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2129 injective_fst_snd removed, use split_eta and prod_eqI instead.
2130 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2132 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2133 the same name in theory Orderings:
2143 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2144 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2145 and different variable names.
2147 * Library/Option_ord.thy: Canonical order on option type.
2149 * Library/RBT.thy: Red-black trees, an efficient implementation of
2152 * Library/Countable.thy: Type class for countable types.
2154 * Theory Int: The representation of numerals has changed. The infix
2155 operator BIT and the bit datatype with constructors B0 and B1 have
2156 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2157 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2158 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2161 * Theory Nat: definition of <= and < on natural numbers no longer
2162 depend on well-founded relations. INCOMPATIBILITY. Definitions
2163 le_def and less_def have disappeared. Consider lemmas not_less
2164 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2166 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2167 (whose purpose mainly is for various fold_set functionals) have been
2168 abandoned in favor of the existing algebraic classes
2169 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2170 lower_semilattice (resp. upper_semilattice) and linorder.
2173 * Theory Transitive_Closure: induct and cases rules now declare proper
2174 case_names ("base" and "step"). INCOMPATIBILITY.
2176 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2177 lattices. The form set-specific version is available as
2178 Inductive.lfp_ordinal_induct_set.
2180 * Renamed theorems "power.simps" to "power_int.simps".
2183 * Class semiring_div provides basic abstract properties of semirings
2184 with division and modulo operations. Subsumes former class dvd_mod.
2186 * Merged theories IntDef, Numeral and IntArith into unified theory
2187 Int. INCOMPATIBILITY.
2189 * Theory Library/Code_Index: type "index" now represents natural
2190 numbers rather than integers. INCOMPATIBILITY.
2192 * New class "uminus" with operation "uminus" (split of from class
2193 "minus" which now only has operation "minus", binary).
2196 * Constants "card", "internal_split", "option_map" now with authentic
2197 syntax. INCOMPATIBILITY.
2199 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2200 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2201 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2202 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2203 Sup_set_def, le_def, less_def, option_map_def now with object
2204 equality. INCOMPATIBILITY.
2206 * Records. Removed K_record, and replaced it by pure lambda term
2207 %x. c. The simplifier setup is now more robust against eta expansion.
2208 INCOMPATIBILITY: in cases explicitly referring to K_record.
2210 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2212 * Library/ListVector: new theory of arithmetic vector operations.
2214 * Library/Order_Relation: new theory of various orderings as sets of
2215 pairs. Defines preorders, partial orders, linear orders and
2216 well-orders on sets and on types.
2221 * Renamed some theories to allow to loading both ZF and HOL in the
2224 Datatype -> Datatype_ZF
2225 Inductive -> Inductive_ZF
2232 INCOMPATIBILITY: ZF theories that import individual theories below
2233 Main might need to be adapted. Regular theory Main is still
2234 available, as trivial extension of Main_ZF.
2239 * ML within Isar: antiquotation @{const name} or @{const
2240 name(typargs)} produces statically-checked Const term.
2242 * Functor NamedThmsFun: data is available to the user as dynamic fact
2243 (of the same name). Removed obsolete print command.
2245 * Removed obsolete "use_legacy_bindings" function.
2247 * The ``print mode'' is now a thread-local value derived from a global
2248 template (the former print_mode reference), thus access becomes
2249 non-critical. The global print_mode reference is for session
2250 management only; user-code should use print_mode_value,
2251 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2253 * Functions system/system_out provide a robust way to invoke external
2254 shell commands, with propagation of interrupts (requires Poly/ML
2255 5.2.1). Do not use OS.Process.system etc. from the basis library!
2260 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2261 in accordance with Proof General 3.7, which prefers GNU emacs.
2263 * isatool tty runs Isabelle process with plain tty interaction;
2264 optional line editor may be specified via ISABELLE_LINE_EDITOR
2265 setting, the default settings attempt to locate "ledit" and "rlwrap".
2267 * isatool browser now works with Cygwin as well, using general
2268 "javapath" function defined in Isabelle process environment.
2270 * YXML notation provides a simple and efficient alternative to
2271 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2272 isatool yxml as described in the Isabelle system manual.
2274 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2275 provides general wrapper for managing an Isabelle process in a robust
2276 fashion, with ``cooked'' output from stdin/stderr.
2278 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2279 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2281 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2282 way of changing the user's settings is via
2283 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2286 * Multithreading.max_threads := 0 refers to the number of actual CPU
2287 cores of the underlying machine, which is a good starting point for
2288 optimal performance tuning. The corresponding usedir option -M allows
2289 "max" as an alias for "0". WARNING: does not work on certain versions
2290 of Mac OS (with Poly/ML 5.1).
2292 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2293 adverse effect of Isabelle flooding interactive front-ends (notably
2294 ProofGeneral / XEmacs).
2298 New in Isabelle2007 (November 2007)
2299 -----------------------------------
2303 * More uniform information about legacy features, notably a
2304 warning/error of "Legacy feature: ...", depending on the state of the
2305 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2306 legacy features will disappear eventually.
2308 * Theory syntax: the header format ``theory A = B + C:'' has been
2309 discontinued in favour of ``theory A imports B C begin''. Use isatool
2310 fixheaders to convert existing theory files. INCOMPATIBILITY.
2312 * Theory syntax: the old non-Isar theory file format has been
2313 discontinued altogether. Note that ML proof scripts may still be used
2314 with Isar theories; migration is usually quite simple with the ML
2315 function use_legacy_bindings. INCOMPATIBILITY.
2317 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2318 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2321 * Theory loader: be more serious about observing the static theory
2322 header specifications (including optional directories), but not the
2323 accidental file locations of previously successful loads. The strict
2324 update policy of former update_thy is now already performed by
2325 use_thy, so the former has been removed; use_thys updates several
2326 theories simultaneously, just as 'imports' within a theory header
2327 specification, but without merging the results. Potential
2328 INCOMPATIBILITY: may need to refine theory headers and commands
2329 ROOT.ML which depend on load order.
2331 * Theory loader: optional support for content-based file
2332 identification, instead of the traditional scheme of full physical
2333 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2334 (cf. the system manual). The new scheme allows to work with
2335 non-finished theories in persistent session images, such that source
2336 files may be moved later on without requiring reloads.
2338 * Theory loader: old-style ML proof scripts being *attached* to a thy
2339 file (with the same base name as the theory) are considered a legacy
2340 feature, which will disappear eventually. Even now, the theory loader
2341 no longer maintains dependencies on such files.
2343 * Syntax: the scope for resolving ambiguities via type-inference is
2344 now limited to individual terms, instead of whole simultaneous
2345 specifications as before. This greatly reduces the complexity of the
2346 syntax module and improves flexibility by separating parsing and
2347 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2348 'fixes' etc.) are required in rare situations.
2350 * Syntax: constants introduced by new-style packages ('definition',
2351 'abbreviation' etc.) are passed through the syntax module in
2352 ``authentic mode''. This means that associated mixfix annotations
2353 really stick to such constants, independently of potential name space
2354 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2355 trees are represented slightly differently, may need to adapt syntax
2356 translations accordingly. Use CONST marker in 'translations' and
2357 @{const_syntax} antiquotation in 'parse_translation' etc.
2359 * Legacy goal package: reduced interface to the bare minimum required
2360 to keep existing proof scripts running. Most other user-level
2361 functions are now part of the OldGoals structure, which is *not* open
2362 by default (consider isatool expandshort before open OldGoals).
2363 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2364 these tend to cause confusion about the actual goal (!) context being
2365 used here, which is not necessarily the same as the_context().
2367 * Command 'find_theorems': supports "*" wild-card in "name:"
2368 criterion; "with_dups" option. Certain ProofGeneral versions might
2369 support a specific search form (see ProofGeneral/CHANGES).
2371 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2372 by default, which means that "prems" (and also "fixed variables") are
2373 suppressed from proof state output. Note that the ProofGeneral
2374 settings mechanism allows to change and save options persistently, but
2375 older versions of Isabelle will fail to start up if a negative prems
2378 * Local theory targets may be specified by non-nested blocks of
2379 ``context/locale/class ... begin'' followed by ``end''. The body may
2380 contain definitions, theorems etc., including any derived mechanism
2381 that has been implemented on top of these primitives. This concept
2382 generalizes the existing ``theorem (in ...)'' towards more versatility
2385 * Proof General interface: proper undo of final 'end' command;
2386 discontinued Isabelle/classic mode (ML proof scripts).
2389 *** Document preparation ***
2391 * Added antiquotation @{theory name} which prints the given name,
2392 after checking that it refers to a valid ancestor theory in the
2395 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2396 check the given source text as ML type/structure, printing verbatim.
2398 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2399 "c args == rhs" given in the current context. (Any number of
2400 arguments may be given on the LHS.)
2405 * The 'class' package offers a combination of axclass and locale to
2406 achieve Haskell-like type classes in Isabelle. Definitions and
2407 theorems within a class context produce both relative results (with
2408 implicit parameters according to the locale context), and polymorphic
2409 constants with qualified polymorphism (according to the class
2410 context). Within the body context of a 'class' target, a separate
2411 syntax layer ("user space type system") takes care of converting
2412 between global polymorphic consts and internal locale representation.
2413 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2414 "isatool doc classes" provides a tutorial.
2416 * Generic code generator framework allows to generate executable
2417 code for ML and Haskell (including Isabelle classes). A short usage
2420 internal compilation:
2421 export_code <list of constants (term syntax)> in SML
2422 writing SML code to a file:
2423 export_code <list of constants (term syntax)> in SML <filename>
2424 writing OCaml code to a file:
2425 export_code <list of constants (term syntax)> in OCaml <filename>
2426 writing Haskell code to a bunch of files:
2427 export_code <list of constants (term syntax)> in Haskell <filename>
2429 evaluating closed propositions to True/False using code generation:
2432 Reasonable default setup of framework in HOL.
2434 Theorem attributs for selecting and transforming function equations theorems:
2436 [code fun]: select a theorem as function equation for a specific constant
2437 [code fun del]: deselect a theorem as function equation for a specific constant
2438 [code inline]: select an equation theorem for unfolding (inlining) in place
2439 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2441 User-defined serializations (target in {SML, OCaml, Haskell}):
2443 code_const <and-list of constants (term syntax)>
2444 {(target) <and-list of const target syntax>}+
2446 code_type <and-list of type constructors>
2447 {(target) <and-list of type target syntax>}+
2449 code_instance <and-list of instances>
2451 where instance ::= <type constructor> :: <class>
2453 code_class <and_list of classes>
2454 {(target) <and-list of class target syntax>}+
2455 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2457 code_instance and code_class only are effective to target Haskell.
2459 For example usage see src/HOL/ex/Codegenerator.thy and
2460 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2461 generation from Isabelle/HOL theories is available via "isatool doc
2464 * Code generator: consts in 'consts_code' Isar commands are now
2465 referred to by usual term syntax (including optional type
2468 * Command 'no_translations' removes translation rules from theory
2471 * Overloaded definitions are now actually checked for acyclic
2472 dependencies. The overloading scheme is slightly more general than
2473 that of Haskell98, although Isabelle does not demand an exact
2474 correspondence to type class and instance declarations.
2475 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2476 exotic versions of overloading -- at the discretion of the user!
2478 Polymorphic constants are represented via type arguments, i.e. the
2479 instantiation that matches an instance against the most general
2480 declaration given in the signature. For example, with the declaration
2481 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2482 as c(nat). Overloading is essentially simultaneous structural
2483 recursion over such type arguments. Incomplete specification patterns
2484 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2485 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2486 Command 'print_theory' outputs the normalized system of recursive
2487 equations, see section "definitions".
2489 * Configuration options are maintained within the theory or proof
2490 context (with name and type bool/int/string), providing a very simple
2491 interface to a poor-man's version of general context data. Tools may
2492 declare options in ML (e.g. using Attrib.config_int) and then refer to
2493 these values using Config.get etc. Users may change options via an
2494 associated attribute of the same name. This form of context
2495 declaration works particularly well with commands 'declare' or
2496 'using', for example ``declare [[foo = 42]]''. Thus it has become
2497 very easy to avoid global references, which would not observe Isar
2498 toplevel undo/redo and fail to work with multithreading.
2500 Various global ML references of Pure and HOL have been turned into
2501 configuration options:
2503 Unify.search_bound unify_search_bound
2504 Unify.trace_bound unify_trace_bound
2505 Unify.trace_simp unify_trace_simp
2506 Unify.trace_types unify_trace_types
2507 Simplifier.simp_depth_limit simp_depth_limit
2508 Blast.depth_limit blast_depth_limit
2509 DatatypeProp.dtK datatype_distinctness_limit
2510 fast_arith_neq_limit fast_arith_neq_limit
2511 fast_arith_split_limit fast_arith_split_limit
2513 * Named collections of theorems may be easily installed as context
2514 data using the functor NamedThmsFun (see also
2515 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2516 attributes; there is also a toplevel print command. This facility is
2517 just a common case of general context data, which is the preferred way
2518 for anything more complex than just a list of facts in canonical
2521 * Isar: command 'declaration' augments a local theory by generic
2522 declaration functions written in ML. This enables arbitrary content
2523 being added to the context, depending on a morphism that tells the
2524 difference of the original declaration context wrt. the application
2525 context encountered later on.
2527 * Isar: proper interfaces for simplification procedures. Command
2528 'simproc_setup' declares named simprocs (with match patterns, and body
2529 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2530 context. ML antiquotation @{simproc name} retrieves named simprocs.
2532 * Isar: an extra pair of brackets around attribute declarations
2533 abbreviates a theorem reference involving an internal dummy fact,
2534 which will be ignored later --- only the effect of the attribute on
2535 the background context will persist. This form of in-place
2536 declarations is particularly useful with commands like 'declare' and
2537 'using', for example ``have A using [[simproc a]] by simp''.
2539 * Isar: method "assumption" (and implicit closing of subproofs) now
2540 takes simple non-atomic goal assumptions into account: after applying
2541 an assumption as a rule the resulting subgoals are solved by atomic
2542 assumption steps. This is particularly useful to finish 'obtain'
2543 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2544 without referring to the original premise "!!x. P x ==> thesis" in the
2545 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2548 * Isar: implicit use of prems from the Isar proof context is
2549 considered a legacy feature. Common applications like ``have A .''
2550 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2551 referencing facts explicitly here improves readability and
2552 maintainability of proof texts.
2554 * Isar: improper proof element 'guess' is like 'obtain', but derives
2555 the obtained context from the course of reasoning! For example:
2557 assume "EX x y. A x & B y" -- "any previous fact"
2558 then guess x and y by clarify
2560 This technique is potentially adventurous, depending on the facts and
2561 proof tools being involved here.
2563 * Isar: known facts from the proof context may be specified as literal
2564 propositions, using ASCII back-quote syntax. This works wherever
2565 named facts used to be allowed so far, in proof commands, proof
2566 methods, attributes etc. Literal facts are retrieved from the context
2567 according to unification of type and term parameters. For example,
2568 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2569 theorems in the current context, then these are valid literal facts:
2570 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2572 There is also a proof method "fact" which does the same composition
2573 for explicit goal states, e.g. the following proof texts coincide with
2574 certain special cases of literal facts:
2576 have "A" by fact == note `A`
2577 have "A ==> B" by fact == note `A ==> B`
2578 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2579 have "P a ==> Q a" by fact == note `P a ==> Q a`
2581 * Isar: ":" (colon) is no longer a symbolic identifier character in
2582 outer syntax. Thus symbolic identifiers may be used without
2583 additional white space in declarations like this: ``assume *: A''.
2585 * Isar: 'print_facts' prints all local facts of the current context,
2586 both named and unnamed ones.
2588 * Isar: 'def' now admits simultaneous definitions, e.g.:
2590 def x == "t" and y == "u"
2592 * Isar: added command 'unfolding', which is structurally similar to
2593 'using', but affects both the goal state and facts by unfolding given
2594 rewrite rules. Thus many occurrences of the 'unfold' method or
2595 'unfolded' attribute may be replaced by first-class proof text.
2597 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2598 and command 'unfolding' now all support object-level equalities
2599 (potentially conditional). The underlying notion of rewrite rule is
2600 analogous to the 'rule_format' attribute, but *not* that of the
2601 Simplifier (which is usually more generous).
2603 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2604 premises of a theorem by n. Useful in conjunction with drule.
2606 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2607 method expression within a sandbox consisting of the first N
2608 sub-goals, which need to exist. For example, ``simp_all [3]''
2609 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2610 simplifies all new goals that emerge from applying rule foo to the
2611 originally first one.
2613 * Isar: schematic goals are no longer restricted to higher-order
2614 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2617 * Isar: the conclusion of a long theorem statement is now either
2618 'shows' (a simultaneous conjunction, as before), or 'obtains'
2619 (essentially a disjunction of cases with local parameters and
2620 assumptions). The latter allows to express general elimination rules
2621 adequately; in this notation common elimination rules look like this:
2623 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2625 obtains x where "P x"
2627 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2631 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2637 The subsequent classical rules even refer to the formal "thesis"
2640 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2643 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2644 obtains "thesis ==> something"
2646 The actual proof of an 'obtains' statement is analogous to that of the
2647 Isar proof element 'obtain', only that there may be several cases.
2648 Optional case names may be specified in parentheses; these will be
2649 available both in the present proof and as annotations in the
2650 resulting rule, for later use with the 'cases' method (cf. attribute
2653 * Isar: the assumptions of a long theorem statement are available as
2654 "assms" fact in the proof context. This is more appropriate than the
2655 (historical) "prems", which refers to all assumptions of the current
2656 context, including those from the target locale, proof body etc.
2658 * Isar: 'print_statement' prints theorems from the current theory or
2659 proof context in long statement form, according to the syntax of a
2662 * Isar: 'obtain' takes an optional case name for the local context
2663 introduction rule (default "that").
2665 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2666 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2669 * Pure: syntax "CONST name" produces a fully internalized constant
2670 according to the current context. This is particularly useful for
2671 syntax translations that should refer to internal constant
2672 representations independently of name spaces.
2674 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2675 instead of "FOO ". This allows multiple binder declarations to coexist
2676 in the same context. INCOMPATIBILITY.
2678 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2679 primitive that also works in a locale context (both for constants and
2680 fixed variables). Type declaration and internal syntactic representation
2681 of given constants retrieved from the context. Likewise, the
2682 'no_notation' command allows to remove given syntax annotations from the
2685 * Isar/locales: new derived specification elements 'axiomatization',
2686 'definition', 'abbreviation', which support type-inference, admit
2687 object-level specifications (equality, equivalence). See also the
2688 isar-ref manual. Examples:
2691 eq (infix "===" 50) where
2692 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2694 definition "f x y = x + y + 1"
2695 definition g where "g x = f x x"
2698 neq (infix "=!=" 50) where
2699 "x =!= y == ~ (x === y)"
2701 These specifications may be also used in a locale context. Then the
2702 constants being introduced depend on certain fixed parameters, and the
2703 constant name is qualified by the locale base name. An internal
2704 abbreviation takes care for convenient input and output, making the
2705 parameters implicit and using the original short name. See also
2706 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2707 entities from a monomorphic theory.
2709 Presently, abbreviations are only available 'in' a target locale, but
2710 not inherited by general import expressions. Also note that
2711 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2712 'translations' in common applications. The "no_abbrevs" print mode
2713 prevents folding of abbreviations in term output.
2715 Concrete syntax is attached to specified constants in internal form,
2716 independently of name spaces. The parse tree representation is
2717 slightly different -- use 'notation' instead of raw 'syntax', and
2718 'translations' with explicit "CONST" markup to accommodate this.
2720 * Pure/Isar: unified syntax for new-style specification mechanisms
2721 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2722 full type inference and dummy patterns ("_"). For example:
2724 definition "K x _ = x"
2726 inductive conj for A B
2727 where "A ==> B ==> conj A B"
2729 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2730 the current context. Print mode "no_abbrevs" prevents inversion of
2731 abbreviations on output.
2733 * Isar/locales: improved parameter handling: use of locales "var" and
2734 "struct" no longer necessary; - parameter renamings are no longer
2735 required to be injective. For example, this allows to define
2736 endomorphisms as locale endom = homom mult mult h.
2738 * Isar/locales: changed the way locales with predicates are defined.
2739 Instead of accumulating the specification, the imported expression is
2740 now an interpretation. INCOMPATIBILITY: different normal form of
2741 locale expressions. In particular, in interpretations of locales with
2742 predicates, goals repesenting already interpreted fragments are not
2743 removed automatically. Use methods `intro_locales' and
2744 `unfold_locales'; see below.
2746 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2747 provide backward reasoning on locales predicates. The methods are
2748 aware of interpretations and discharge corresponding goals.
2749 `intro_locales' is less aggressive then `unfold_locales' and does not
2750 unfold predicates to assumptions.
2752 * Isar/locales: the order in which locale fragments are accumulated
2753 has changed. This enables to override declarations from fragments due
2754 to interpretations -- for example, unwanted simp rules.
2756 * Isar/locales: interpretation in theories and proof contexts has been
2757 extended. One may now specify (and prove) equations, which are
2758 unfolded in interpreted theorems. This is useful for replacing
2759 defined concepts (constants depending on locale parameters) by
2760 concepts already existing in the target context. Example:
2762 interpretation partial_order ["op <= :: [int, int] => bool"]
2763 where "partial_order.less (op <=) (x::int) y = (x < y)"
2765 Typically, the constant `partial_order.less' is created by a
2766 definition specification element in the context of locale
2769 * Method "induct": improved internal context management to support
2770 local fixes and defines on-the-fly. Thus explicit meta-level
2771 connectives !! and ==> are rarely required anymore in inductive goals
2772 (using object-logic connectives for this purpose has been long
2773 obsolete anyway). Common proof patterns are explained in
2774 src/HOL/Induct/Common_Patterns.thy, see also
2775 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2778 * Method "induct": improved handling of simultaneous goals. Instead of
2779 introducing object-level conjunction, the statement is now split into
2780 several conclusions, while the corresponding symbolic cases are nested
2781 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2782 see src/HOL/Induct/Common_Patterns.thy, for example.
2784 * Method "induct": mutual induction rules are now specified as a list
2785 of rule sharing the same induction cases. HOL packages usually provide
2786 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2787 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2788 mutual induction rules differently, i.e. like this:
2790 (induct rule: foo_bar.inducts)
2791 (induct set: foo bar)
2792 (induct pred: foo bar)
2793 (induct type: foo bar)
2795 The ML function ProjectRule.projections turns old-style rules into the
2798 * Method "coinduct": dual of induction, see
2799 src/HOL/Library/Coinductive_List.thy for various examples.
2801 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2802 considered a legacy feature.
2804 * Attribute "symmetric" produces result with standardized schematic
2805 variables (index 0). Potential INCOMPATIBILITY.
2807 * Simplifier: by default the simplifier trace only shows top level
2808 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2809 default. Thus there is less danger of being flooded by the trace. The
2810 trace indicates where parts have been suppressed.
2812 * Provers/classical: removed obsolete classical version of elim_format
2813 attribute; classical elim/dest rules are now treated uniformly when
2814 manipulating the claset.
2816 * Provers/classical: stricter checks to ensure that supplied intro,
2817 dest and elim rules are well-formed; dest and elim rules must have at
2820 * Provers/classical: attributes dest/elim/intro take an optional
2821 weight argument for the rule (just as the Pure versions). Weights are
2822 ignored by automated tools, but determine the search order of single
2825 * Syntax: input syntax now supports dummy variable binding "%_. b",
2826 where the body does not mention the bound variable. Note that dummy
2827 patterns implicitly depend on their context of bounds, which makes
2828 "{_. _}" match any set comprehension as expected. Potential
2829 INCOMPATIBILITY -- parse translations need to cope with syntactic
2830 constant "_idtdummy" in the binding position.
2832 * Syntax: removed obsolete syntactic constant "_K" and its associated
2833 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2834 for example "A -> B" => "Pi A (%_. B)".
2836 * Pure: 'class_deps' command visualizes the subclass relation, using
2837 the graph browser tool.
2839 * Pure: 'print_theory' now suppresses certain internal declarations by
2840 default; use '!' option for full details.
2845 * Method "metis" proves goals by applying the Metis general-purpose
2846 resolution prover (see also http://gilith.com/software/metis/).
2847 Examples are in the directory MetisExamples. WARNING: the
2848 Isabelle/HOL-Metis integration does not yet work properly with
2851 * Command 'sledgehammer' invokes external automatic theorem provers as
2852 background processes. It generates calls to the "metis" method if
2853 successful. These can be pasted into the proof. Users do not have to
2854 wait for the automatic provers to return. WARNING: does not really
2855 work with multi-threading.
2857 * New "auto_quickcheck" feature tests outermost goal statements for
2858 potential counter-examples. Controlled by ML references
2859 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2860 5000 milliseconds). Fails silently if statements is outside of
2861 executable fragment, or any other codgenerator problem occurs.
2863 * New constant "undefined" with axiom "undefined x = undefined".
2865 * Added class "HOL.eq", allowing for code generation with polymorphic
2868 * Some renaming of class constants due to canonical name prefixing in
2869 the new 'class' package:
2871 HOL.abs ~> HOL.abs_class.abs
2872 HOL.divide ~> HOL.divide_class.divide
2873 0 ~> HOL.zero_class.zero
2874 1 ~> HOL.one_class.one
2875 op + ~> HOL.plus_class.plus
2876 op - ~> HOL.minus_class.minus
2877 uminus ~> HOL.minus_class.uminus
2878 op * ~> HOL.times_class.times
2879 op < ~> HOL.ord_class.less
2880 op <= > HOL.ord_class.less_eq
2881 Nat.power ~> Power.power_class.power
2882 Nat.size ~> Nat.size_class.size
2883 Numeral.number_of ~> Numeral.number_class.number_of
2884 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2885 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2886 Orderings.min ~> Orderings.ord_class.min
2887 Orderings.max ~> Orderings.ord_class.max
2888 Divides.op div ~> Divides.div_class.div
2889 Divides.op mod ~> Divides.div_class.mod
2890 Divides.op dvd ~> Divides.div_class.dvd
2892 INCOMPATIBILITY. Adaptions may be required in the following cases:
2894 a) User-defined constants using any of the names "plus", "minus",
2895 "times", "less" or "less_eq". The standard syntax translations for
2896 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2899 b) Variables named "plus", "minus", "times", "less", "less_eq"
2900 INCOMPATIBILITY: use more specific names.
2902 c) Permutative equations (e.g. "a + b = b + a")
2903 Since the change of names also changes the order of terms, permutative
2904 rewrite rules may get applied in a different order. Experience shows
2905 that this is rarely the case (only two adaptions in the whole Isabelle
2906 distribution). INCOMPATIBILITY: rewrite proofs
2908 d) ML code directly refering to constant names
2909 This in general only affects hand-written proof tactics, simprocs and
2910 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2911 Consider using @{const_name} antiquotation.
2913 * New class "default" with associated constant "default".
2915 * Function "sgn" is now overloaded and available on int, real, complex
2916 (and other numeric types), using class "sgn". Two possible defs of
2917 sgn are given as equational assumptions in the classes sgn_if and
2918 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2921 * Locale "partial_order" now unified with class "order" (cf. theory
2922 Orderings), added parameter "less". INCOMPATIBILITY.
2924 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2925 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2926 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2928 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2929 changed order of proof goals in instance proofs.
2931 * The transitivity reasoner for partial and linear orders is set up
2932 for classes "order" and "linorder". Instances of the reasoner are available
2933 in all contexts importing or interpreting the corresponding locales.
2934 Method "order" invokes the reasoner separately; the reasoner
2935 is also integrated with the Simplifier as a solver. Diagnostic
2936 command 'print_orders' shows the available instances of the reasoner
2937 in the current context.
2939 * Localized monotonicity predicate in theory "Orderings"; integrated
2940 lemmas max_of_mono and min_of_mono with this predicate.
2943 * Formulation of theorem "dense" changed slightly due to integration
2944 with new class dense_linear_order.
2946 * Uniform lattice theory development in HOL.
2948 constants "meet" and "join" now named "inf" and "sup"
2949 constant "Meet" now named "Inf"
2951 classes "meet_semilorder" and "join_semilorder" now named
2952 "lower_semilattice" and "upper_semilattice"
2953 class "lorder" now named "lattice"
2954 class "comp_lat" now named "complete_lattice"
2956 Instantiation of lattice classes allows explicit definitions
2957 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2959 INCOMPATIBILITY. Theorem renames:
2961 meet_left_le ~> inf_le1
2962 meet_right_le ~> inf_le2
2963 join_left_le ~> sup_ge1
2964 join_right_le ~> sup_ge2
2965 meet_join_le ~> inf_sup_ord
2968 le_meet ~> le_inf_iff
2969 le_join ~> ge_sup_conv
2970 meet_idempotent ~> inf_idem
2971 join_idempotent ~> sup_idem
2972 meet_comm ~> inf_commute
2973 join_comm ~> sup_commute
2974 meet_leI1 ~> le_infI1
2975 meet_leI2 ~> le_infI2
2976 le_joinI1 ~> le_supI1
2977 le_joinI2 ~> le_supI2
2978 meet_assoc ~> inf_assoc
2979 join_assoc ~> sup_assoc
2980 meet_left_comm ~> inf_left_commute
2981 meet_left_idempotent ~> inf_left_idem
2982 join_left_comm ~> sup_left_commute
2983 join_left_idempotent ~> sup_left_idem
2986 le_def_meet ~> le_iff_inf
2987 le_def_join ~> le_iff_sup
2988 join_absorp2 ~> sup_absorb2
2989 join_absorp1 ~> sup_absorb1
2990 meet_absorp1 ~> inf_absorb1
2991 meet_absorp2 ~> inf_absorb2
2992 meet_join_absorp ~> inf_sup_absorb
2993 join_meet_absorp ~> sup_inf_absorb
2994 distrib_join_le ~> distrib_sup_le
2995 distrib_meet_le ~> distrib_inf_le
2997 add_meet_distrib_left ~> add_inf_distrib_left
2998 add_join_distrib_left ~> add_sup_distrib_left
2999 is_join_neg_meet ~> is_join_neg_inf
3000 is_meet_neg_join ~> is_meet_neg_sup
3001 add_meet_distrib_right ~> add_inf_distrib_right
3002 add_join_distrib_right ~> add_sup_distrib_right
3003 add_meet_join_distribs ~> add_sup_inf_distribs
3004 join_eq_neg_meet ~> sup_eq_neg_inf
3005 meet_eq_neg_join ~> inf_eq_neg_sup
3006 add_eq_meet_join ~> add_eq_inf_sup
3007 meet_0_imp_0 ~> inf_0_imp_0
3008 join_0_imp_0 ~> sup_0_imp_0
3009 meet_0_eq_0 ~> inf_0_eq_0
3010 join_0_eq_0 ~> sup_0_eq_0
3011 neg_meet_eq_join ~> neg_inf_eq_sup
3012 neg_join_eq_meet ~> neg_sup_eq_inf
3013 join_eq_if ~> sup_eq_if
3015 mono_meet ~> mono_inf
3016 mono_join ~> mono_sup
3017 meet_bool_eq ~> inf_bool_eq
3018 join_bool_eq ~> sup_bool_eq
3019 meet_fun_eq ~> inf_fun_eq
3020 join_fun_eq ~> sup_fun_eq
3021 meet_set_eq ~> inf_set_eq
3022 join_set_eq ~> sup_set_eq
3023 meet1_iff ~> inf1_iff
3024 meet2_iff ~> inf2_iff
3033 join1_iff ~> sup1_iff
3034 join2_iff ~> sup2_iff
3044 is_meet_Meet ~> is_meet_Inf
3045 Meet_bool_def ~> Inf_bool_def
3046 Meet_fun_def ~> Inf_fun_def
3047 Meet_greatest ~> Inf_greatest
3048 Meet_lower ~> Inf_lower
3049 Meet_set_def ~> Inf_set_def
3052 Sup_bool_eq ~> Sup_bool_def
3053 Sup_fun_eq ~> Sup_fun_def
3054 Sup_set_eq ~> Sup_set_def
3056 listsp_meetI ~> listsp_infI
3057 listsp_meet_eq ~> listsp_inf_eq
3062 * Added syntactic class "size"; overloaded constant "size" now has
3063 type "'a::size ==> bool"
3065 * Internal reorganisation of `size' of datatypes: size theorems
3066 "foo.size" are no longer subsumed by "foo.simps" (but are still
3067 simplification rules by default!); theorems "prod.size" now named
3070 * Class "div" now inherits from class "times" rather than "type".
3073 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3074 Linorder etc. have disappeared; operations defined in terms of
3075 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3077 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3079 * HOL-Word: New extensive library and type for generic, fixed size
3080 machine words, with arithemtic, bit-wise, shifting and rotating
3081 operations, reflection into int, nat, and bool lists, automation for
3082 linear arithmetic (by automatic reflection into nat or int), including
3083 lemmas on overflow and monotonicity. Instantiated to all appropriate
3084 arithmetic type classes, supporting automatic simplification of
3085 numerals on all operations.
3087 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3089 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3091 * Code generator library theories:
3092 - Code_Integer represents HOL integers by big integer literals in target
3094 - Code_Char represents HOL characters by character literals in target
3096 - Code_Char_chr like Code_Char, but also offers treatment of character
3097 codes; includes Code_Integer.
3098 - Executable_Set allows to generate code for finite sets using lists.
3099 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3101 - Executable_Real implements a subset of real numbers, namly those
3102 representable by rational numbers.
3103 - Efficient_Nat implements natural numbers by integers, which in general will
3104 result in higher efficency; pattern matching with 0/Suc is eliminated;
3105 includes Code_Integer.
3106 - Code_Index provides an additional datatype index which is mapped to
3107 target-language built-in integers.
3108 - Code_Message provides an additional datatype message_string which is isomorphic to
3109 strings; messages are mapped to target-language strings.
3111 * New package for inductive predicates
3113 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3116 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3117 for z_1 :: U_1 and ... and z_n :: U_m
3119 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3122 with full support for type-inference, rather than
3124 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3126 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3127 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3129 inductive "s z_1 ... z_m"
3131 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3134 For backward compatibility, there is a wrapper allowing inductive
3135 sets to be defined with the new package via
3138 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3139 for z_1 :: U_1 and ... and z_n :: U_m
3141 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3147 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3148 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3149 for z_1 :: U_1 and ... and z_n :: U_m
3151 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3152 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3155 if the additional syntax "p ..." is required.
3157 Numerous examples can be found in the subdirectories src/HOL/Auth,
3158 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3162 - Since declaration and definition of inductive sets or predicates
3163 is no longer separated, abbreviations involving the newly
3164 introduced sets or predicates must be specified together with the
3165 introduction rules after the 'where' keyword (see above), rather
3166 than before the actual inductive definition.
3168 - The variables in induction and elimination rules are now
3169 quantified in the order of their occurrence in the introduction
3170 rules, rather than in alphabetical order. Since this may break
3171 some proofs, these proofs either have to be repaired, e.g. by
3172 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3173 statements of the form
3175 case (rule_i a_i_1 ... a_i_{k_i})
3177 or the old order of quantification has to be restored by explicitly adding
3178 meta-level quantifiers in the introduction rules, i.e.
3180 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3182 - The format of the elimination rules is now
3184 p z_1 ... z_m x_1 ... x_n ==>
3185 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3190 (x_1, ..., x_n) : s z_1 ... z_m ==>
3191 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3194 for sets rather than
3196 x : s z_1 ... z_m ==>
3197 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3200 This may require terms in goals to be expanded to n-tuples
3201 (e.g. using case_tac or simplification with the split_paired_all
3202 rule) before the above elimination rule is applicable.
3204 - The elimination or case analysis rules for (mutually) inductive
3205 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3206 list of rules "p_1_..._p_k.elims" is no longer available.
3208 * New package "function"/"fun" for general recursive functions,
3209 supporting mutual and nested recursion, definitions in local contexts,
3210 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3211 for small examples, and the separate tutorial on the function
3212 package. The old recdef "package" is still available as before, but
3213 users are encouraged to use the new package.
3215 * Method "lexicographic_order" automatically synthesizes termination
3216 relations as lexicographic combinations of size measures.
3218 * Case-expressions allow arbitrary constructor-patterns (including
3219 "_") and take their order into account, like in functional
3220 programming. Internally, this is translated into nested
3221 case-expressions; missing cases are added and mapped to the predefined
3222 constant "undefined". In complicated cases printing may no longer show
3223 the original input but the internal form. Lambda-abstractions allow
3224 the same form of pattern matching: "% pat1 => e1 | ..." is an
3225 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3228 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3229 is an abbreviation for "of_nat :: nat => int". The simplification
3230 rules for "of_nat" have been changed to work like "int" did
3231 previously. Potential INCOMPATIBILITY:
3232 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3233 - of_nat_diff and of_nat_mult are no longer default simp rules
3235 * Method "algebra" solves polynomial equations over (semi)rings using
3236 Groebner bases. The (semi)ring structure is defined by locales and the
3237 tool setup depends on that generic context. Installing the method for
3238 a specific type involves instantiating the locale and possibly adding
3239 declarations for computation on the coefficients. The method is
3240 already instantiated for natural numbers and for the axiomatic class
3241 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3242 CALCULEMUS 2007 for the general principles underlying this
3243 architecture of context-aware proof-tools.
3245 * Method "ferrack" implements quantifier elimination over
3246 special-purpose dense linear orders using locales (analogous to
3247 "algebra"). The method is already installed for class
3248 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3251 * Former constant "List.op @" now named "List.append". Use ML
3252 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3253 circumvent possible incompatibilities when working on ML level.
3255 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3257 * New function listsum :: 'a list => 'a for arbitrary monoids.
3258 Special syntax: "SUM x <- xs. f x" (and latex variants)
3260 * New syntax for Haskell-like list comprehension (input only), eg.
3261 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3263 * The special syntax for function "filter" has changed from [x :
3264 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3265 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3267 * [a..b] is now defined for arbitrary linear orders. It used to be
3268 defined on nat only, as an abbreviation for [a..<Suc b]
3271 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3273 * New functions "sorted" and "sort" in src/HOL/List.thy.
3275 * New lemma collection field_simps (an extension of ring_simps) for
3276 manipulating (in)equations involving division. Multiplies with all
3277 denominators that can be proved to be non-zero (in equations) or
3278 positive/negative (in inequations).
3280 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3281 have been improved and renamed to ring_simps, group_simps and
3282 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3283 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3285 * Theory Library/Commutative_Ring: switched from recdef to function
3286 package; constants add, mul, pow now curried. Infix syntax for
3287 algebraic operations.
3289 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3292 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3295 * HOL/records: generalised field-update to take a function on the
3296 field rather than the new value: r(|A := x|) is translated to A_update
3297 (K x) r The K-combinator that is internally used is called K_record.
3298 INCOMPATIBILITY: Usage of the plain update functions has to be
3301 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3302 * x = 0, which are required for a semiring. Richer structures do not
3303 inherit from semiring_0 anymore, because this property is a theorem
3304 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3305 there is more to prove, but this is mostly trivial.
3307 * Class "recpower" is generalized to arbitrary monoids, not just
3308 commutative semirings. INCOMPATIBILITY: may need to incorporate
3309 commutativity or semiring properties additionally.
3311 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3312 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3313 better use 'abbreviation'.
3315 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3317 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3318 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3319 significant changes for setting up numeral syntax for types:
3320 - New constants Numeral.pred and Numeral.succ instead
3321 of former Numeral.bin_pred and Numeral.bin_succ.
3322 - Use integer operations instead of bin_add, bin_mult and so on.
3323 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3324 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3326 See src/HOL/Integ/IntArith.thy for an example setup.
3328 * Command 'normal_form' computes the normal form of a term that may
3329 contain free variables. For example ``normal_form "rev [a, b, c]"''
3330 produces ``[b, c, a]'' (without proof). This command is suitable for
3331 heavy-duty computations because the functions are compiled to ML
3332 first. Correspondingly, a method "normalization" is provided. See
3333 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3335 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3336 25 like -->); output depends on the "iff" print_mode, the default is
3337 "A = B" (with priority 50).
3339 * Relations less (<) and less_eq (<=) are also available on type bool.
3340 Modified syntax to disallow nesting without explicit parentheses,
3341 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3344 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3346 * Relation composition operator "op O" now has precedence 75 and binds
3347 stronger than union and intersection. INCOMPATIBILITY.
3349 * The old set interval syntax "{m..n(}" (and relatives) has been
3350 removed. Use "{m..<n}" (and relatives) instead.
3352 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3353 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3354 ``declare [[simproc del: neq]]''.
3356 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3359 * Theorem Cons_eq_map_conv no longer declared as "simp".
3361 * Theorem setsum_mult renamed to setsum_right_distrib.
3363 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3366 * Reimplemented methods "sat" and "satx", with several improvements:
3367 goals no longer need to be stated as "<prems> ==> False", equivalences
3368 (i.e. "=" on type bool) are handled, variable names of the form
3369 "lit_<n>" are no longer reserved, significant speedup.
3371 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3372 zChaff is still supported as well.
3374 * 'inductive' and 'datatype': provide projections of mutual rules,
3375 bundled as foo_bar.inducts;
3377 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3380 * Library: moved theory Accessible_Part to main HOL.
3382 * Library: added theory Coinductive_List of potentially infinite lists
3383 as greatest fixed-point.
3385 * Library: added theory AssocList which implements (finite) maps as
3388 * Method "evaluation" solves goals (i.e. a boolean expression)
3389 efficiently by compiling it to ML. The goal is "proved" (via an
3390 oracle) if it evaluates to True.
3392 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3393 also when invoked by the simplifier. This results in the Simplifier
3394 being more powerful on arithmetic goals. INCOMPATIBILITY.
3395 Configuration option fast_arith_split_limit=0 recovers the old
3398 * Support for hex (0x20) and binary (0b1001) numerals.
3400 * New method: reify eqs (t), where eqs are equations for an
3401 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3402 parameter, computes a term s::'b and a list xs::'a list and proves the
3403 theorem I xs s = t. This is also known as reification or quoting. The
3404 resulting theorem is applied to the subgoal to substitute t with I xs
3405 s. If t is omitted, the subgoal itself is reified.
3407 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3408 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3409 where f is supposed to be a computable function (in the sense of code
3410 generattion). The method uses reify to compute s and xs as above then
3411 applies corr_thm and uses normalization by evaluation to "prove" f s =
3412 r and finally gets the theorem t = r, which is again applied to the
3413 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3415 * Reflection: Automatic reification now handels binding, an example is
3416 available in src/HOL/ex/ReflectionEx.thy
3418 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3419 command 'statespace' that is similar to 'record', but introduces an
3420 abstract specification based on the locale infrastructure instead of
3421 HOL types. This leads to extra flexibility in composing state spaces,
3422 in particular multiple inheritance and renaming of components.
3427 * Hyperreal: Functions root and sqrt are now defined on negative real
3428 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3429 Nonnegativity side conditions have been removed from many lemmas, so
3430 that more subgoals may now be solved by simplification; potential
3433 * Real: new type classes formalize real normed vector spaces and
3434 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3435 and norm :: 'a => real.
3437 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3438 reals into other types. The overloaded constant Reals :: 'a set is now
3439 defined as range of_real; potential INCOMPATIBILITY.
3441 * Real: proper support for ML code generation, including 'quickcheck'.
3442 Reals are implemented as arbitrary precision rationals.
3444 * Hyperreal: Several constants that previously worked only for the
3445 reals have been generalized, so they now work over arbitrary vector
3446 spaces. Type annotations may need to be added in some cases; potential
3449 Infinitesimal :: ('a::real_normed_vector) star set
3450 HFinite :: ('a::real_normed_vector) star set
3451 HInfinite :: ('a::real_normed_vector) star set
3452 approx :: ('a::real_normed_vector) star => 'a star => bool
3453 monad :: ('a::real_normed_vector) star => 'a star set
3454 galaxy :: ('a::real_normed_vector) star => 'a star set
3455 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3456 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3457 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3458 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3459 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3460 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3461 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3462 sgn :: 'a::real_normed_vector => 'a
3463 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3465 * Complex: Some complex-specific constants are now abbreviations for
3466 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3467 hnorm. Other constants have been entirely removed in favor of the
3468 polymorphic versions (INCOMPATIBILITY):
3472 HInfinite <-- CInfinite
3473 Infinitesimal <-- CInfinitesimal
3476 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3477 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3478 (ns)deriv <-- (ns)cderiv
3483 * Formalisation of ideals and the quotient construction over rings.
3485 * Order and lattice theory no longer based on records.
3488 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3489 greatest_closed. INCOMPATIBILITY.
3491 * Method algebra is now set up via an attribute. For examples see
3492 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3493 of algebraic structures.
3495 * Renamed theory CRing to Ring.
3500 * Substantial, yet incomplete support for nominal datatypes (binding
3501 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3502 src/HOL/Nominal/Examples. Prospective users should consult
3503 http://isabelle.in.tum.de/nominal/
3508 * ML basics: just one true type int, which coincides with IntInf.int
3511 * ML within Isar: antiquotations allow to embed statically-checked
3512 formal entities in the source, referring to the context available at
3513 compile-time. For example:
3515 ML {* @{sort "{zero,one}"} *}
3516 ML {* @{typ "'a => 'b"} *}
3517 ML {* @{term "%x. x"} *}
3518 ML {* @{prop "x == y"} *}
3519 ML {* @{ctyp "'a => 'b"} *}
3520 ML {* @{cterm "%x. x"} *}
3521 ML {* @{cprop "x == y"} *}
3522 ML {* @{thm asm_rl} *}
3523 ML {* @{thms asm_rl} *}
3524 ML {* @{type_name c} *}
3525 ML {* @{type_syntax c} *}
3526 ML {* @{const_name c} *}
3527 ML {* @{const_syntax c} *}
3530 ML {* @{theory Pure} *}
3531 ML {* @{theory_ref} *}
3532 ML {* @{theory_ref Pure} *}
3535 ML {* @{clasimpset} *}
3537 The same works for sources being ``used'' within an Isar context.
3539 * ML in Isar: improved error reporting; extra verbosity with
3540 ML_Context.trace enabled.
3542 * Pure/General/table.ML: the join operations now works via exceptions
3543 DUP/SAME instead of type option. This is simpler in simple cases, and
3544 admits slightly more efficient complex applications.
3546 * Pure: 'advanced' translation functions (parse_translation etc.) now
3547 use Context.generic instead of just theory.
3549 * Pure: datatype Context.generic joins theory/Proof.context and
3550 provides some facilities for code that works in either kind of
3551 context, notably GenericDataFun for uniform theory and proof data.
3553 * Pure: simplified internal attribute type, which is now always
3554 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3555 local (Proof.context) attributes have been discontinued, while
3556 minimizing code duplication. Thm.rule_attribute and
3557 Thm.declaration_attribute build canonical attributes; see also structure
3558 Context for further operations on Context.generic, notably
3559 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3560 declarations and definitions.
3562 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3563 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3564 init only required for impure data. INCOMPATIBILITY: empty really need
3565 to be empty (no dependencies on theory content!)
3567 * Pure/kernel: consts certification ignores sort constraints given in
3568 signature declarations. (This information is not relevant to the
3569 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3570 potential INCOMPATIBILITY.
3572 * Pure: axiomatic type classes are now purely definitional, with
3573 explicit proofs of class axioms and super class relations performed
3574 internally. See Pure/axclass.ML for the main internal interfaces --
3575 notably AxClass.define_class supercedes AxClass.add_axclass, and
3576 AxClass.axiomatize_class/classrel/arity supersede
3577 Sign.add_classes/classrel/arities.
3579 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3580 global/local versions on theory vs. Proof.context have been
3581 discontinued; Attrib.syntax and Method.syntax have been adapted
3582 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3583 attributes, methods, etc.
3585 * Pure: several functions of signature "... -> theory -> theory * ..."
3586 have been reoriented to "... -> theory -> ... * theory" in order to
3587 allow natural usage in combination with the ||>, ||>>, |-> and
3588 fold_map combinators.
3590 * Pure: official theorem names (closed derivations) and additional
3591 comments (tags) are now strictly separate. Name hints -- which are
3592 maintained as tags -- may be attached any time without affecting the
3595 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3596 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3597 achieve the old behaviour.
3599 * Pure: the "Goal" constant is now called "prop", supporting a
3600 slightly more general idea of ``protecting'' meta-level rule
3603 * Pure: Logic.(un)varify only works in a global context, which is now
3604 enforced instead of silently assumed. INCOMPATIBILITY, may use
3605 Logic.legacy_(un)varify as temporary workaround.
3607 * Pure: structure Name provides scalable operations for generating
3608 internal variable names, notably Name.variants etc. This replaces
3609 some popular functions from term.ML:
3611 Term.variant -> Name.variant
3612 Term.variantlist -> Name.variant_list
3613 Term.invent_names -> Name.invent_list
3615 Note that low-level renaming rarely occurs in new code -- operations
3616 from structure Variable are used instead (see below).
3618 * Pure: structure Variable provides fundamental operations for proper
3619 treatment of fixed/schematic variables in a context. For example,
3620 Variable.import introduces fixes for schematics of given facts and
3621 Variable.export reverses the effect (up to renaming) -- this replaces
3622 various freeze_thaw operations.
3624 * Pure: structure Goal provides simple interfaces for
3625 init/conclude/finish and tactical prove operations (replacing former
3626 Tactic.prove). Goal.prove is the canonical way to prove results
3627 within a given context; Goal.prove_global is a degraded version for
3628 theory level goals, including a global Drule.standard. Note that
3629 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3630 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3631 in a locale context).
3633 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3634 and type checking (Syntax.check_term etc.), with common combinations
3635 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3636 which are considered legacy and await removal.
3638 * Pure/Syntax: generic interfaces for type unchecking
3639 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3640 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3641 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3642 available for convenience, but refer to the very same operations using
3643 a mere theory instead of a full context.
3645 * Isar: simplified treatment of user-level errors, using exception
3646 ERROR of string uniformly. Function error now merely raises ERROR,
3647 without any side effect on output channels. The Isar toplevel takes
3648 care of proper display of ERROR exceptions. ML code may use plain
3649 handle/can/try; cat_error may be used to concatenate errors like this:
3651 ... handle ERROR msg => cat_error msg "..."
3653 Toplevel ML code (run directly or through the Isar toplevel) may be
3654 embedded into the Isar toplevel with exception display/debug like
3657 Isar.toplevel (fn () => ...)
3659 INCOMPATIBILITY, removed special transform_error facilities, removed
3660 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3661 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3662 -- use plain ERROR instead.
3664 * Isar: theory setup now has type (theory -> theory), instead of a
3665 list. INCOMPATIBILITY, may use #> to compose setup functions.
3667 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3668 ProofContext.debug/verbose flags.
3670 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3671 theory before entering a proof state. Transactions now always see a
3672 quasi-functional intermediate checkpoint, both in interactive and
3675 * Isar: simplified interfaces for outer syntax. Renamed
3676 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3677 OuterSyntax.add_parsers -- this functionality is now included in
3678 OuterSyntax.command etc. INCOMPATIBILITY.
3680 * Simplifier: the simpset of a running simplification process now
3681 contains a proof context (cf. Simplifier.the_context), which is the
3682 very context that the initial simpset has been retrieved from (by
3683 simpset_of/local_simpset_of). Consequently, all plug-in components
3684 (solver, looper etc.) may depend on arbitrary proof data.
3686 * Simplifier.inherit_context inherits the proof context (plus the
3687 local bounds) of the current simplification process; any simproc
3688 etc. that calls the Simplifier recursively should do this! Removed
3689 former Simplifier.inherit_bounds, which is already included here --
3690 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3691 specify an explicit context using Simplifier.context/theory_context.
3693 * Simplifier/Classical Reasoner: more abstract interfaces
3694 change_simpset/claset for modifying the simpset/claset reference of a
3695 theory; raw versions simpset/claset_ref etc. have been discontinued --
3698 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3704 * settings: the default heap location within ISABELLE_HOME_USER now
3705 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3706 Isabelle installations.
3708 * isabelle-process: option -S (secure mode) disables some critical
3709 operations, notably runtime compilation and evaluation of ML source
3712 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3714 * Support for parallel execution, using native multicore support of
3715 Poly/ML 5.1. The theory loader exploits parallelism when processing
3716 independent theories, according to the given theory header
3717 specifications. The maximum number of worker threads is specified via
3718 usedir option -M or the "max-threads" setting in Proof General. A
3719 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3720 to 6 on a 8-core machine. User-code needs to observe certain
3721 guidelines for thread-safe programming, see appendix A in the Isar
3722 Implementation manual.
3726 New in Isabelle2005 (October 2005)
3727 ----------------------------------
3731 * Theory headers: the new header syntax for Isar theories is
3734 imports <theory1> ... <theoryN>
3735 uses <file1> ... <fileM>
3738 where the 'uses' part is optional. The previous syntax
3740 theory <name> = <theory1> + ... + <theoryN>:
3742 will disappear in the next release. Use isatool fixheaders to convert
3743 existing theory files. Note that there is no change in ancient
3744 non-Isar theories now, but these will disappear soon.
3746 * Theory loader: parent theories can now also be referred to via
3747 relative and absolute paths.
3749 * Command 'find_theorems' searches for a list of criteria instead of a
3750 list of constants. Known criteria are: intro, elim, dest, name:string,
3751 simp:term, and any term. Criteria can be preceded by '-' to select
3752 theorems that do not match. Intro, elim, dest select theorems that
3753 match the current goal, name:s selects theorems whose fully qualified
3754 name contain s, and simp:term selects all simplification rules whose
3755 lhs match term. Any other term is interpreted as pattern and selects
3756 all theorems matching the pattern. Available in ProofGeneral under
3757 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3759 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3761 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3762 matching the current goal as introduction rule and not having "HOL."
3763 in their name (i.e. not being defined in theory HOL).
3765 * Command 'thms_containing' has been discontinued in favour of
3766 'find_theorems'; INCOMPATIBILITY.
3768 * Communication with Proof General is now 8bit clean, which means that
3769 Unicode text in UTF-8 encoding may be used within theory texts (both
3770 formal and informal parts). Cf. option -U of the Isabelle Proof
3771 General interface. Here are some simple examples (cf. src/HOL/ex):
3773 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3774 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3776 * Improved efficiency of the Simplifier and, to a lesser degree, the
3777 Classical Reasoner. Typical big applications run around 2 times
3781 *** Document preparation ***
3783 * Commands 'display_drafts' and 'print_drafts' perform simple output
3784 of raw sources. Only those symbols that do not require additional
3785 LaTeX packages (depending on comments in isabellesym.sty) are
3786 displayed properly, everything else is left verbatim. isatool display
3787 and isatool print are used as front ends (these are subject to the
3788 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3790 * Command tags control specific markup of certain regions of text,
3791 notably folding and hiding. Predefined tags include "theory" (for
3792 theory begin and end), "proof" for proof commands, and "ML" for
3793 commands involving ML code; the additional tags "visible" and
3794 "invisible" are unused by default. Users may give explicit tag
3795 specifications in the text, e.g. ''by %invisible (auto)''. The
3796 interpretation of tags is determined by the LaTeX job during document
3797 preparation: see option -V of isatool usedir, or options -n and -t of
3798 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3801 Several document versions may be produced at the same time via isatool
3802 usedir (the generated index.html will link all of them). Typical
3803 specifications include ''-V document=theory,proof,ML'' to present
3804 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3805 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3806 these parts without any formal replacement text. The Isabelle site
3807 default settings produce ''document'' and ''outline'' versions as
3810 * Several new antiquotations:
3812 @{term_type term} prints a term with its type annotated;
3814 @{typeof term} prints the type of a term;
3816 @{const const} is the same as @{term const}, but checks that the
3817 argument is a known logical constant;
3819 @{term_style style term} and @{thm_style style thm} print a term or
3820 theorem applying a "style" to it
3824 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3825 definitions, equations, inequations etc., 'concl' printing only the
3826 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3827 to print the specified premise. TermStyle.add_style provides an ML
3828 interface for introducing further styles. See also the "LaTeX Sugar"
3829 document practical applications. The ML antiquotation prints
3830 type-checked ML expressions verbatim.
3832 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3833 and 'text' support optional locale specification '(in loc)', which
3834 specifies the default context for interpreting antiquotations. For
3835 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3837 * Option 'locale=NAME' of antiquotations specifies an alternative
3838 context interpreting the subsequent argument. For example: @{thm
3839 [locale=lattice] inf_assoc}.
3841 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3844 * Proper output of antiquotations for theory commands involving a
3845 proof context (such as 'locale' or 'theorem (in loc) ...').
3847 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3848 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3850 * isatool usedir: new option -C (default true) controls whether option
3851 -D should include a copy of the original document directory; -C false
3852 prevents unwanted effects such as copying of administrative CVS data.
3857 * Considerably improved version of 'constdefs' command. Now performs
3858 automatic type-inference of declared constants; additional support for
3859 local structure declarations (cf. locales and HOL records), see also
3860 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3861 sequential dependencies of definitions within a single 'constdefs'
3862 section; moreover, the declared name needs to be an identifier. If
3863 all fails, consider to fall back on 'consts' and 'defs' separately.
3865 * Improved indexed syntax and implicit structures. First of all,
3866 indexed syntax provides a notational device for subscripted
3867 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3868 expressions. Secondly, in a local context with structure
3869 declarations, number indexes \<^sub>n or the empty index (default
3870 number 1) refer to a certain fixed variable implicitly; option
3871 show_structs controls printing of implicit structures. Typical
3872 applications of these concepts involve record types and locales.
3874 * New command 'no_syntax' removes grammar declarations (and
3875 translations) resulting from the given syntax specification, which is
3876 interpreted in the same manner as for the 'syntax' command.
3878 * 'Advanced' translation functions (parse_translation etc.) may depend
3879 on the signature of the theory context being presently used for
3880 parsing/printing, see also isar-ref manual.
3882 * Improved 'oracle' command provides a type-safe interface to turn an
3883 ML expression of type theory -> T -> term into a primitive rule of
3884 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3885 is already included here); see also FOL/ex/IffExample.thy;
3888 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3889 before); "cI" is no longer bound, use "c.intro" instead.
3890 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3891 axclasses vs. locales.
3893 * Improved internal renaming of symbolic identifiers -- attach primes
3894 instead of base 26 numbers.
3896 * New flag show_question_marks controls printing of leading question
3897 marks in schematic variable names.
3899 * In schematic variable names, *any* symbol following \<^isub> or
3900 \<^isup> is now treated as part of the base name. For example, the
3901 following works without printing of awkward ".0" indexes:
3903 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3906 * Inner syntax includes (*(*nested*) comments*).
3908 * Pretty printer now supports unbreakable blocks, specified in mixfix
3909 annotations as "(00...)".
3911 * Clear separation of logical types and nonterminals, where the latter
3912 may only occur in 'syntax' specifications or type abbreviations.
3913 Before that distinction was only partially implemented via type class
3914 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3915 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3916 exotic syntax specifications may require further adaption
3917 (e.g. Cube/Cube.thy).
3919 * Removed obsolete type class "logic", use the top sort {} instead.
3920 Note that non-logical types should be declared as 'nonterminals'
3921 rather than 'types'. INCOMPATIBILITY for new object-logic
3924 * Attributes 'induct' and 'cases': type or set names may now be
3925 locally fixed variables as well.
3927 * Simplifier: can now control the depth to which conditional rewriting
3928 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3931 * Simplifier: simplification procedures may now take the current
3932 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3933 interface), which is very useful for calling the Simplifier
3934 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3935 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3936 low-level mk_simproc no longer applies Logic.varify internally, to
3937 allow for use in a context of fixed variables.
3939 * thin_tac now works even if the assumption being deleted contains !!
3940 or ==>. More generally, erule now works even if the major premise of
3941 the elimination rule contains !! or ==>.
3943 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3945 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3946 from Pure, which contains all common declarations already. Both
3947 theories are defined via plain Isabelle/Isar .thy files.
3948 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3949 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3950 use isatool fixcpure to adapt your theory and ML sources.
3952 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3953 selections of theorems in named facts via index ranges.
3955 * 'print_theorems': in theory mode, really print the difference
3956 wrt. the last state (works for interactive theory development only),
3957 in proof mode print all local facts (cf. 'print_facts');
3959 * 'hide': option '(open)' hides only base names.
3961 * More efficient treatment of intermediate checkpoints in interactive
3964 * Code generator is now invoked via code_module (incremental code
3965 generation) and code_library (modular code generation, ML structures
3966 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3967 must be quoted when used as identifiers.
3969 * New 'value' command for reading, evaluating and printing terms using
3970 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3971 quoted when used as identifier.
3976 * New commands for the interpretation of locale expressions in
3977 theories (1), locales (2) and proof contexts (3). These generate
3978 proof obligations from the expression specification. After the
3979 obligations have been discharged, theorems of the expression are added
3980 to the theory, target locale or proof context. The synopsis of the
3981 commands is a follows:
3983 (1) interpretation expr inst
3984 (2) interpretation target < expr
3985 (3) interpret expr inst
3987 Interpretation in theories and proof contexts require a parameter
3988 instantiation of terms from the current context. This is applied to
3989 specifications and theorems of the interpreted expression.
3990 Interpretation in locales only permits parameter renaming through the
3991 locale expression. Interpretation is smart in that interpretations
3992 that are active already do not occur in proof obligations, neither are
3993 instantiated theorems stored in duplicate. Use 'print_interps' to
3994 inspect active interpretations of a particular locale. For details,
3995 see the Isar Reference manual. Examples can be found in
3996 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3998 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3999 'interpret' instead.
4001 * New context element 'constrains' for adding type constraints to
4004 * Context expressions: renaming of parameters with syntax
4007 * Locale declaration: 'includes' disallowed.
4009 * Proper static binding of attribute syntax -- i.e. types / terms /
4010 facts mentioned as arguments are always those of the locale definition
4011 context, independently of the context of later invocations. Moreover,
4012 locale operations (renaming and type / term instantiation) are applied
4013 to attribute arguments as expected.
4015 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
4016 actual attributes; rare situations may require Attrib.attribute to
4017 embed those attributes into Attrib.src that lack concrete syntax.
4018 Attribute implementations need to cooperate properly with the static
4019 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
4020 Attrib.XXX_thm etc. already do the right thing without further
4021 intervention. Only unusual applications -- such as "where" or "of"
4022 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
4023 on the context and the facts involved -- may have to assign parsed
4024 values to argument tokens explicitly.
4026 * Changed parameter management in theorem generation for long goal
4027 statements with 'includes'. INCOMPATIBILITY: produces a different
4028 theorem statement in rare situations.
4030 * Locale inspection command 'print_locale' omits notes elements. Use
4031 'print_locale!' to have them included in the output.
4036 * Provers/hypsubst.ML: improved version of the subst method, for
4037 single-step rewriting: it now works in bound variable contexts. New is
4038 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4039 rewrite a different subterm than the original subst method, which is
4040 still available as 'simplesubst'.
4042 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4045 * Provers/trancl.ML: new transitivity reasoner for transitive and
4046 reflexive-transitive closure of relations.
4048 * Provers/blast.ML: new reference depth_limit to make blast's depth
4049 limit (previously hard-coded with a value of 20) user-definable.
4051 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4052 is peformed already. Object-logics merely need to finish their
4053 initial simpset configuration as before. INCOMPATIBILITY.
4058 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4061 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4063 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4064 and x-symbol; use option '-m epsilon' to get it actually printed.
4065 Moreover, the mathematically important symbolic identifier \<epsilon>
4066 becomes available as variable, constant etc. INCOMPATIBILITY,
4068 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4069 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4070 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4071 support corresponding Isar calculations.
4073 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4076 * theory SetInterval: changed the syntax for open intervals:
4085 The old syntax is still supported but will disappear in the next
4086 release. For conversion use the following Emacs search and replace
4087 patterns (these are not perfect but work quite well):
4089 {)\([^\.]*\)\.\. -> {\1<\.\.}
4090 \.\.\([^(}]*\)(} -> \.\.<\1}
4092 * Theory Commutative_Ring (in Library): method comm_ring for proving
4093 equalities in commutative rings; method 'algebra' provides a generic
4096 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4097 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4098 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4101 Some new syntax forms are available:
4103 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4104 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4105 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4106 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4108 The latter form "\<Sum>x < k. e" used to be based on a separate
4109 function "Summation", which has been discontinued.
4111 * theory Finite_Set: in structured induction proofs, the insert case
4112 is now 'case (insert x F)' instead of the old counterintuitive 'case
4115 * The 'refute' command has been extended to support a much larger
4116 fragment of HOL, including axiomatic type classes, constdefs and
4117 typedefs, inductive datatypes and recursion.
4119 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4120 Requires zChaff with proof generation to be installed. See
4121 HOL/ex/SAT_Examples.thy for examples.
4123 * Datatype induction via method 'induct' now preserves the name of the
4124 induction variable. For example, when proving P(xs::'a list) by
4125 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4126 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4127 in unstructured proof scripts.
4129 * Reworked implementation of records. Improved scalability for
4130 records with many fields, avoiding performance problems for type
4131 inference. Records are no longer composed of nested field types, but
4132 of nested extension types. Therefore the record type only grows linear
4133 in the number of extensions and not in the number of fields. The
4134 top-level (users) view on records is preserved. Potential
4135 INCOMPATIBILITY only in strange cases, where the theory depends on the
4136 old record representation. The type generated for a record is called
4137 <record_name>_ext_type.
4139 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4140 proofs triggered by a record definition or a simproc (if
4141 quick_and_dirty is enabled). Definitions of large records can take
4144 New simproc record_upd_simproc for simplification of multiple record
4145 updates enabled by default. Moreover, trivial updates are also
4146 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4147 occasionally, since simplification is more powerful by default.
4149 * typedef: proper support for polymorphic sets, which contain extra
4150 type-variables in the term.
4152 * Simplifier: automatically reasons about transitivity chains
4153 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4154 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4155 old proofs break occasionally as simplification may now solve more
4156 goals than previously.
4158 * Simplifier: converts x <= y into x = y if assumption y <= x is
4159 present. Works for all partial orders (class "order"), in particular
4160 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4163 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4164 bound variable or a constant then the let is unfolded. Otherwise
4165 first a is simplified to b, and then f b is simplified to g. If
4166 possible we abstract b from g arriving at "let x = b in h x",
4167 otherwise we unfold the let and arrive at g. The simproc can be
4168 enabled/disabled by the reference use_let_simproc. Potential
4169 INCOMPATIBILITY since simplification is more powerful by default.
4171 * Classical reasoning: the meson method now accepts theorems as arguments.
4173 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4174 jobs to provide advice on the provability of subgoals.
4176 * Theory OrderedGroup and Ring_and_Field: various additions and
4177 improvements to faciliate calculations involving equalities and
4180 The following theorems have been eliminated or modified
4183 abs_eq now named abs_of_nonneg
4184 abs_of_ge_0 now named abs_of_nonneg
4185 abs_minus_eq now named abs_of_nonpos
4186 imp_abs_id now named abs_of_nonneg
4187 imp_abs_neg_id now named abs_of_nonpos
4188 mult_pos now named mult_pos_pos
4189 mult_pos_le now named mult_nonneg_nonneg
4190 mult_pos_neg_le now named mult_nonneg_nonpos
4191 mult_pos_neg2_le now named mult_nonneg_nonpos2
4192 mult_neg now named mult_neg_neg
4193 mult_neg_le now named mult_nonpos_nonpos
4195 * The following lemmas in Ring_and_Field have been added to the simplifier:
4198 not_square_less_zero
4200 The following lemmas have been deleted from Real/RealPow:
4210 * Theory Parity: added rules for simplifying exponents.
4214 The following theorems have been eliminated or modified
4217 list_all_Nil now named list_all.simps(1)
4218 list_all_Cons now named list_all.simps(2)
4219 list_all_conv now named list_all_iff
4220 set_mem_eq now named mem_iff
4222 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4223 asymptotic "big O" calculations. See the notes in BigO.thy.
4228 * Theory RealDef: better support for embedding natural numbers and
4229 integers in the reals.
4231 The following theorems have been eliminated or modified
4234 exp_ge_add_one_self now requires no hypotheses
4235 real_of_int_add reversed direction of equality (use [symmetric])
4236 real_of_int_minus reversed direction of equality (use [symmetric])
4237 real_of_int_diff reversed direction of equality (use [symmetric])
4238 real_of_int_mult reversed direction of equality (use [symmetric])
4240 * Theory RComplete: expanded support for floor and ceiling functions.
4242 * Theory Ln is new, with properties of the natural logarithm
4244 * Hyperreal: There is a new type constructor "star" for making
4245 nonstandard types. The old type names are now type synonyms:
4249 hcomplex = complex star
4251 * Hyperreal: Many groups of similarly-defined constants have been
4252 replaced by polymorphic versions (INCOMPATIBILITY):
4254 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4256 starset <-- starsetNat, starsetC
4257 *s* <-- *sNat*, *sc*
4258 starset_n <-- starsetNat_n, starsetC_n
4259 *sn* <-- *sNatn*, *scn*
4260 InternalSets <-- InternalNatSets, InternalCSets
4262 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4263 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4264 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4265 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4266 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4268 * Hyperreal: Many type-specific theorems have been removed in favor of
4269 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4271 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4272 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4273 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4274 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4275 right_minus <-- hypreal_add_minus
4276 left_minus <-- {hypreal,hcomplex}_add_minus_left
4277 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4278 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4279 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4280 mult_1_right <-- hcomplex_mult_one_right
4281 mult_zero_left <-- hcomplex_mult_zero_left
4282 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4283 right_distrib <-- hypnat_add_mult_distrib2
4284 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4285 right_inverse <-- hypreal_mult_inverse
4286 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4287 order_refl <-- {hypreal,hypnat}_le_refl
4288 order_trans <-- {hypreal,hypnat}_le_trans
4289 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4290 order_less_le <-- {hypreal,hypnat}_less_le
4291 linorder_linear <-- {hypreal,hypnat}_le_linear
4292 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4293 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4294 add_nonneg_nonneg <-- hypreal_le_add_order
4296 * Hyperreal: Separate theorems having to do with type-specific
4297 versions of constants have been merged into theorems that apply to the
4298 new polymorphic constants (INCOMPATIBILITY):
4300 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4301 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4302 STAR_Un <-- {STAR,NatStar,STARC}_Un
4303 STAR_Int <-- {STAR,NatStar,STARC}_Int
4304 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4305 STAR_subset <-- {STAR,NatStar,STARC}_subset
4306 STAR_mem <-- {STAR,NatStar,STARC}_mem
4307 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4308 STAR_diff <-- {STAR,STARC}_diff
4309 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4310 STARC_hcomplex_of_complex}_image_subset
4311 starset_n_Un <-- starset{Nat,C}_n_Un
4312 starset_n_Int <-- starset{Nat,C}_n_Int
4313 starset_n_Compl <-- starset{Nat,C}_n_Compl
4314 starset_n_diff <-- starset{Nat,C}_n_diff
4315 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4316 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4317 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4318 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4319 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4320 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4321 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4322 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4323 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4324 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4325 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4326 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4327 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4328 starfun_diff <-- starfun{C,RC,CR}_diff
4329 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4330 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4331 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4332 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4333 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4334 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4335 starfun_Id <-- starfunC_Id
4336 starfun_approx <-- starfun{Nat,CR}_approx
4337 starfun_capprox <-- starfun{C,RC}_capprox
4338 starfun_abs <-- starfunNat_rabs
4339 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4340 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4341 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4342 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4343 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4344 starfun_add_approx <-- starfunCR_add_approx
4345 starfun_inverse_inverse <-- starfunC_inverse_inverse
4346 starfun_divide <-- starfun{C,CR,RC}_divide
4347 starfun_n <-- starfun{Nat,C}_n
4348 starfun_n_mult <-- starfun{Nat,C}_n_mult
4349 starfun_n_add <-- starfun{Nat,C}_n_add
4350 starfun_n_add_minus <-- starfunNat_n_add_minus
4351 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4352 starfun_n_minus <-- starfun{Nat,C}_n_minus
4353 starfun_n_eq <-- starfun{Nat,C}_n_eq
4355 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4356 star_n_minus <-- {hypreal,hcomplex}_minus
4357 star_n_diff <-- {hypreal,hcomplex}_diff
4358 star_n_mult <-- {hypreal,hcomplex}_mult
4359 star_n_inverse <-- {hypreal,hcomplex}_inverse
4360 star_n_le <-- {hypreal,hypnat}_le
4361 star_n_less <-- {hypreal,hypnat}_less
4362 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4363 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4364 star_n_abs <-- hypreal_hrabs
4365 star_n_divide <-- hcomplex_divide
4367 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4368 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4369 star_of_diff <-- hypreal_of_real_diff
4370 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4371 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4372 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4373 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4374 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4375 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4376 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4377 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4378 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4379 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4380 star_of_number_of <-- {hypreal,hcomplex}_number_of
4381 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4382 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4383 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4384 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4385 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4386 star_of_power <-- hypreal_of_real_power
4387 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4389 * Hyperreal: new method "transfer" that implements the transfer
4390 principle of nonstandard analysis. With a subgoal that mentions
4391 nonstandard types like "'a star", the command "apply transfer"
4392 replaces it with an equivalent one that mentions only standard types.
4393 To be successful, all free variables must have standard types; non-
4394 standard variables must have explicit universal quantifiers.
4396 * Hyperreal: A theory of Taylor series.
4401 * Discontinued special version of 'constdefs' (which used to support
4402 continuous functions) in favor of the general Pure one with full
4405 * New simplification procedure for solving continuity conditions; it
4406 is much faster on terms with many nested lambda abstractions (cubic
4407 instead of exponential time).
4409 * New syntax for domain package: selector names are now optional.
4410 Parentheses should be omitted unless argument is lazy, for example:
4412 domain 'a stream = cons "'a" (lazy "'a stream")
4414 * New command 'fixrec' for defining recursive functions with pattern
4415 matching; defining multiple functions with mutual recursion is also
4416 supported. Patterns may include the constants cpair, spair, up, sinl,
4417 sinr, or any data constructor defined by the domain package. The given
4418 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4419 syntax and examples.
4421 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4422 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4423 but the proof obligation additionally includes an admissibility
4424 requirement. The packages generate instances of class cpo or pcpo,
4425 with continuity and strictness theorems for Rep and Abs.
4427 * HOLCF: Many theorems have been renamed according to a more standard naming
4428 scheme (INCOMPATIBILITY):
4430 foo_inject: "foo$x = foo$y ==> x = y"
4431 foo_eq: "(foo$x = foo$y) = (x = y)"
4432 foo_less: "(foo$x << foo$y) = (x << y)"
4433 foo_strict: "foo$UU = UU"
4434 foo_defined: "... ==> foo$x ~= UU"
4435 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4440 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4441 including the First Isomorphism Theorem (on quotienting by the kernel
4444 * ZF/Simplifier: install second copy of type solver that actually
4445 makes use of TC rules declared to Isar proof contexts (or locales);
4446 the old version is still required for ML proof scripts.
4451 * Converted to Isar theory format; use locales instead of axiomatic
4457 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4460 * Pure/library.ML no longer defines its own option datatype, but uses
4461 that of the SML basis, which has constructors NONE and SOME instead of
4462 None and Some, as well as exception Option.Option instead of OPTION.
4463 The functions the, if_none, is_some, is_none have been adapted
4464 accordingly, while Option.map replaces apsome.
4466 * Pure/library.ML: the exception LIST has been given up in favour of
4467 the standard exceptions Empty and Subscript, as well as
4468 Library.UnequalLengths. Function like Library.hd and Library.tl are
4469 superceded by the standard hd and tl functions etc.
4471 A number of basic list functions are no longer exported to the ML
4472 toplevel, as they are variants of predefined functions. The following
4473 suggests how one can translate existing code:
4475 rev_append xs ys = List.revAppend (xs, ys)
4476 nth_elem (i, xs) = List.nth (xs, i)
4477 last_elem xs = List.last xs
4478 flat xss = List.concat xss
4479 seq fs = List.app fs
4480 partition P xs = List.partition P xs
4481 mapfilter f xs = List.mapPartial f xs
4483 * Pure/library.ML: several combinators for linear functional
4484 transformations, notably reverse application and composition:
4487 (x, y) |-> f f #-> g
4489 * Pure/library.ML: introduced/changed precedence of infix operators:
4491 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4493 infix 3 o oo ooo oooo;
4494 infix 4 ~~ upto downto;
4496 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4499 * Pure/library.ML: natural list combinators fold, fold_rev, and
4500 fold_map support linear functional transformations and nesting. For
4503 fold f [x1, ..., xN] y =
4504 y |> f x1 |> ... |> f xN
4506 (fold o fold) f [xs1, ..., xsN] y =
4507 y |> fold f xs1 |> ... |> fold f xsN
4509 fold f [x1, ..., xN] =
4512 (fold o fold) f [xs1, ..., xsN] =
4513 fold f xs1 #> ... #> fold f xsN
4515 * Pure/library.ML: the following selectors on type 'a option are
4518 the: 'a option -> 'a (*partial*)
4519 these: 'a option -> 'a where 'a = 'b list
4520 the_default: 'a -> 'a option -> 'a
4521 the_list: 'a option -> 'a list
4523 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4524 basic operations for association lists, following natural argument
4525 order; moreover the explicit equality predicate passed here avoids
4526 potentially expensive polymorphic runtime equality checks.
4527 The old functions may be expressed as follows:
4529 assoc = uncurry (AList.lookup (op =))
4530 assocs = these oo AList.lookup (op =)
4531 overwrite = uncurry (AList.update (op =)) o swap
4533 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4535 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4536 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4538 replacing make_keylist and keyfilter (occassionally used)
4541 make_keylist = AList.make
4542 keyfilter = AList.find (op =)
4544 * eq_fst and eq_snd now take explicit equality parameter, thus
4545 avoiding eqtypes. Naive rewrites:
4547 eq_fst = eq_fst (op =)
4548 eq_snd = eq_snd (op =)
4550 * Removed deprecated apl and apr (rarely used).
4553 apl (n, op) =>>= curry op n
4554 apr (op, m) =>>= fn n => op (n, m)
4556 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4557 provides a reasonably efficient light-weight implementation of sets as
4560 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4561 few new operations; existing lookup and update are now curried to
4562 follow natural argument order (for use with fold etc.);
4563 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4565 * Pure/General: output via the Isabelle channels of
4566 writeln/warning/error etc. is now passed through Output.output, with a
4567 hook for arbitrary transformations depending on the print_mode
4568 (cf. Output.add_mode -- the first active mode that provides a output
4569 function wins). Already formatted output may be embedded into further
4570 text via Output.raw; the result of Pretty.string_of/str_of and derived
4571 functions (string_of_term/cterm/thm etc.) is already marked raw to
4572 accommodate easy composition of diagnostic messages etc. Programmers
4573 rarely need to care about Output.output or Output.raw at all, with
4574 some notable exceptions: Output.output is required when bypassing the
4575 standard channels (writeln etc.), or in token translations to produce
4576 properly formatted results; Output.raw is required when capturing
4577 already output material that will eventually be presented to the user
4578 a second time. For the default print mode, both Output.output and
4579 Output.raw have no effect.
4581 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4582 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4583 cumulative results are displayed at the end of a batch session.
4585 * Pure/General: File.sysify_path and File.quote_sysify path have been
4586 replaced by File.platform_path and File.shell_path (with appropriate
4587 hooks). This provides a clean interface for unusual systems where the
4588 internal and external process view of file names are different.
4590 * Pure: more efficient orders for basic syntactic entities: added
4591 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4592 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4593 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4594 orders now -- potential INCOMPATIBILITY for code that depends on a
4595 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4596 Library.sort_strings on result).
4598 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4599 fold_types traverse types/terms from left to right, observing natural
4600 argument order. Supercedes previous foldl_XXX versions, add_frees,
4601 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4603 * Pure: name spaces have been refined, with significant changes of the
4604 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4605 to extern(_table). The plain name entry path is superceded by a
4606 general 'naming' context, which also includes the 'policy' to produce
4607 a fully qualified name and external accesses of a fully qualified
4608 name; NameSpace.extend is superceded by context dependent
4609 Sign.declare_name. Several theory and proof context operations modify
4610 the naming context. Especially note Theory.restore_naming and
4611 ProofContext.restore_naming to get back to a sane state; note that
4612 Theory.add_path is no longer sufficient to recover from
4613 Theory.absolute_path in particular.
4615 * Pure: new flags short_names (default false) and unique_names
4616 (default true) for controlling output of qualified names. If
4617 short_names is set, names are printed unqualified. If unique_names is
4618 reset, the name prefix is reduced to the minimum required to achieve
4619 the original result when interning again, even if there is an overlap
4620 with earlier declarations.
4622 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4623 now 'extend', and 'merge' gets an additional Pretty.pp argument
4624 (useful for printing error messages). INCOMPATIBILITY.
4626 * Pure: major reorganization of the theory context. Type Sign.sg and
4627 Theory.theory are now identified, referring to the universal
4628 Context.theory (see Pure/context.ML). Actual signature and theory
4629 content is managed as theory data. The old code and interfaces were
4630 spread over many files and structures; the new arrangement introduces
4631 considerable INCOMPATIBILITY to gain more clarity:
4633 Context -- theory management operations (name, identity, inclusion,
4634 parents, ancestors, merge, etc.), plus generic theory data;
4636 Sign -- logical signature and syntax operations (declaring consts,
4637 types, etc.), plus certify/read for common entities;
4639 Theory -- logical theory operations (stating axioms, definitions,
4640 oracles), plus a copy of logical signature operations (consts,
4641 types, etc.); also a few basic management operations (Theory.copy,
4644 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4645 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4646 for convenience -- they merely return the theory.
4648 * Pure: type Type.tsig is superceded by theory in most interfaces.
4650 * Pure: the Isar proof context type is already defined early in Pure
4651 as Context.proof (note that ProofContext.context and Proof.context are
4652 aliases, where the latter is the preferred name). This enables other
4653 Isabelle components to refer to that type even before Isar is present.
4655 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4656 typeK, constK, axiomK, oracleK), but provide explicit operations for
4657 any of these kinds. For example, Sign.intern typeK is now
4658 Sign.intern_type, Theory.hide_space Sign.typeK is now
4659 Theory.hide_types. Also note that former
4660 Theory.hide_classes/types/consts are now
4661 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4662 internalize their arguments! INCOMPATIBILITY.
4664 * Pure: get_thm interface (of PureThy and ProofContext) expects
4665 datatype thmref (with constructors Name and NameSelection) instead of
4666 plain string -- INCOMPATIBILITY;
4668 * Pure: cases produced by proof methods specify options, where NONE
4669 means to remove case bindings -- INCOMPATIBILITY in
4672 * Pure: the following operations retrieve axioms or theorems from a
4673 theory node or theory hierarchy, respectively:
4675 Theory.axioms_of: theory -> (string * term) list
4676 Theory.all_axioms_of: theory -> (string * term) list
4677 PureThy.thms_of: theory -> (string * thm) list
4678 PureThy.all_thms_of: theory -> (string * thm) list
4680 * Pure: print_tac now outputs the goal through the trace channel.
4682 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4683 Reference Toplevel.debug (default false) controls detailed printing
4684 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4685 controls execution profiling -- set to 1 for time and 2 for space
4686 (both increase the runtime).
4688 * Isar session: The initial use of ROOT.ML is now always timed,
4689 i.e. the log will show the actual process times, in contrast to the
4690 elapsed wall-clock time that the outer shell wrapper produces.
4692 * Simplifier: improved handling of bound variables (nameless
4693 representation, avoid allocating new strings). Simprocs that invoke
4694 the Simplifier recursively should use Simplifier.inherit_bounds to
4695 avoid local name clashes. Failure to do so produces warnings
4696 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4697 for further details.
4699 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4700 bindings for all theorems stored within a given theory; this may help
4701 in porting non-Isar theories to Isar ones, while keeping ML proof
4702 scripts for the time being.
4704 * ML operator HTML.with_charset specifies the charset begin used for
4705 generated HTML files. For example:
4707 HTML.with_charset "utf-8" use_thy "Hebrew";
4708 HTML.with_charset "utf-8" use_thy "Chinese";
4713 * Allow symlinks to all proper Isabelle executables (Isabelle,
4714 isabelle, isatool etc.).
4716 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4717 isatool doc, isatool mkdir, display_drafts etc.).
4719 * isatool usedir: option -f allows specification of the ML file to be
4720 used by Isabelle; default is ROOT.ML.
4722 * New isatool version outputs the version identifier of the Isabelle
4723 distribution being used.
4725 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4726 (containing Boolean satisfiability problems) into Isabelle/HOL
4731 New in Isabelle2004 (April 2004)
4732 --------------------------------
4736 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4737 Replaces linorder.ML.
4739 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4740 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4741 (\<a>...\<z>), are now considered normal letters, and can therefore
4742 be used anywhere where an ASCII letter (a...zA...Z) has until
4743 now. COMPATIBILITY: This obviously changes the parsing of some
4744 terms, especially where a symbol has been used as a binder, say
4745 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4746 as an identifier. Fix it by inserting a space around former
4747 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4748 existing theory and ML files.
4750 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4752 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4753 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4754 a normal (but invisible) letter. For multiple letter subscripts repeat
4755 \<^isub> like this: x\<^isub>1\<^isub>2.
4757 * Pure: There are now sub-/superscripts that can span more than one
4758 character. Text between \<^bsub> and \<^esub> is set in subscript in
4759 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4760 superscript. The new control characters are not identifier parts.
4762 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4763 content of "..." to the latex file instead of \isacntrl... . The "..."
4764 may consist of any printable characters excluding the end bracket >.
4766 * Pure: Using new Isar command "finalconsts" (or the ML functions
4767 Theory.add_finals or Theory.add_finals_i) it is now possible to
4768 declare constants "final", which prevents their being given a definition
4769 later. It is useful for constants whose behaviour is fixed axiomatically
4770 rather than definitionally, such as the meta-logic connectives.
4772 * Pure: 'instance' now handles general arities with general sorts
4773 (i.e. intersections of classes),
4775 * Presentation: generated HTML now uses a CSS style sheet to make layout
4776 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4777 It can be changed to alter the colors/layout of generated pages.
4782 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4783 cut_tac, subgoal_tac and thin_tac:
4784 - Now understand static (Isar) contexts. As a consequence, users of Isar
4785 locales are no longer forced to write Isar proof scripts.
4786 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4788 - INCOMPATIBILITY: names of variables to be instantiated may no
4789 longer be enclosed in quotes. Instead, precede variable name with `?'.
4790 This is consistent with the instantiation attribute "where".
4792 * Attributes "where" and "of":
4793 - Now take type variables of instantiated theorem into account when reading
4794 the instantiation string. This fixes a bug that caused instantiated
4795 theorems to have too special types in some circumstances.
4796 - "where" permits explicit instantiations of type variables.
4798 * Calculation commands "moreover" and "also" no longer interfere with
4799 current facts ("this"), admitting arbitrary combinations with "then"
4803 - Goal statements involving the context element "includes" no longer
4804 generate theorems with internal delta predicates (those ending on
4805 "_axioms") in the premise.
4806 Resolve particular premise with <locale>.intro to obtain old form.
4807 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4808 specification and "includes" elements in goal statement.
4809 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4810 [intro?] and [elim?] (respectively) by default.
4811 - Experimental command for instantiation of locales in proof contexts:
4812 instantiate <label>[<attrs>]: <loc>
4813 Instantiates locale <loc> and adds all its theorems to the current context
4814 taking into account their attributes. Label and attrs are optional
4815 modifiers, like in theorem declarations. If present, names of
4816 instantiated theorems are qualified with <label>, and the attributes
4817 <attrs> are applied after any attributes these theorems might have already.
4818 If the locale has assumptions, a chained fact of the form
4819 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4820 are derived. The command does not support old-style locales declared
4821 with "locale (open)".
4822 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4824 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4830 * Proof import: new image HOL4 contains the imported library from
4831 the HOL4 system with about 2500 theorems. It is imported by
4832 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4833 can be used like any other Isabelle image. See
4834 HOL/Import/HOL/README for more information.
4837 - Much improved handling of linear and partial orders.
4838 Reasoners for linear and partial orders are set up for type classes
4839 "linorder" and "order" respectively, and are added to the default simpset
4840 as solvers. This means that the simplifier can build transitivity chains
4841 to solve goals from the assumptions.
4842 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4843 of blast or auto after simplification become unnecessary because the goal
4844 is solved by simplification already.
4846 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4847 all proved in axiomatic type classes for semirings, rings and fields.
4850 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4851 now formalized using the Ring_and_Field theory mentioned above.
4852 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4853 than before, because now they are set up once in a generic manner.
4854 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4855 Look for the general versions in Ring_and_Field (and Power if they concern
4858 * Type "rat" of the rational numbers is now available in HOL-Complex.
4861 - Record types are now by default printed with their type abbreviation
4862 instead of the list of all field types. This can be configured via
4863 the reference "print_record_type_abbr".
4864 - Simproc "record_upd_simproc" for simplification of multiple updates added
4865 (not enabled by default).
4866 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4867 EX x. x = sel r to True (not enabled by default).
4868 - Tactic "record_split_simp_tac" to split and simplify records added.
4870 * 'specification' command added, allowing for definition by
4871 specification. There is also an 'ax_specification' command that
4872 introduces the new constants axiomatically.
4874 * arith(_tac) is now able to generate counterexamples for reals as well.
4876 * HOL-Algebra: new locale "ring" for non-commutative rings.
4878 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4879 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4881 * HOL-Matrix: a first theory for matrices in HOL with an application of
4882 matrix theory to linear programming.
4884 * Unions and Intersections:
4885 The latex output syntax of UN and INT has been changed
4886 from "\Union x \in A. B" to "\Union_{x \in A} B"
4887 i.e. the index formulae has become a subscript.
4888 Similarly for "\Union x. B", and for \Inter instead of \Union.
4890 * Unions and Intersections over Intervals:
4891 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4892 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4893 like in normal math, and corresponding versions for < and for intersection.
4895 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4896 lexicographic dictonary ordering has been added as "lexord".
4898 * ML: the legacy theory structures Int and List have been removed. They had
4899 conflicted with ML Basis Library structures having the same names.
4901 * 'refute' command added to search for (finite) countermodels. Only works
4902 for a fragment of HOL. The installation of an external SAT solver is
4903 highly recommended. See "HOL/Refute.thy" for details.
4905 * 'quickcheck' command: Allows to find counterexamples by evaluating
4906 formulae under an assignment of free variables to random values.
4907 In contrast to 'refute', it can deal with inductive datatypes,
4908 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4914 * Streams now come with concatenation and are part of the HOLCF image
4918 New in Isabelle2003 (May 2003)
4919 ------------------------------
4923 * Provers/simplifier:
4925 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4926 Assumptions are now subject to complete mutual simplification,
4927 not just from left to right. The simplifier now preserves
4928 the order of assumptions.
4930 Potential INCOMPATIBILITY:
4932 -- simp sometimes diverges where the old version did
4933 not, e.g. invoking simp on the goal
4935 [| P (f x); y = x; f x = f y |] ==> Q
4937 now gives rise to the infinite reduction sequence
4939 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4941 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4944 -- Tactics combining classical reasoner and simplification (such as auto)
4945 are also affected by this change, because many of them rely on
4946 simp. They may sometimes diverge as well or yield a different numbers
4947 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4948 in case of problems. Sometimes subsequent calls to the classical
4949 reasoner will fail because a preceeding call to the simplifier too
4950 eagerly simplified the goal, e.g. deleted redundant premises.
4952 - The simplifier trace now shows the names of the applied rewrite rules
4954 - You can limit the number of recursive invocations of the simplifier
4955 during conditional rewriting (where the simplifie tries to solve the
4956 conditions before applying the rewrite rule):
4957 ML "simp_depth_limit := n"
4958 where n is an integer. Thus you can force termination where previously
4959 the simplifier would diverge.
4961 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4963 - No longer aborts on failed congruence proof. Instead, the
4964 congruence is ignored.
4966 * Pure: New generic framework for extracting programs from constructive
4967 proofs. See HOL/Extraction.thy for an example instantiation, as well
4968 as HOL/Extraction for some case studies.
4970 * Pure: The main goal of the proof state is no longer shown by default, only
4971 the subgoals. This behaviour is controlled by a new flag.
4972 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4973 (ML: Proof.show_main_goal).
4975 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4976 rules whose conclusion matches subgoal 1:
4977 PG menu: Isabelle/Isar -> Show me -> matching rules
4978 The rules are ordered by how closely they match the subgoal.
4979 In particular, rules that solve a subgoal outright are displayed first
4980 (or rather last, the way they are printed).
4981 (ML: ProofGeneral.print_intros())
4983 * Pure: New flag trace_unify_fail causes unification to print
4984 diagnostic information (PG: in trace buffer) when it fails. This is
4985 useful for figuring out why single step proofs like rule, erule or
4988 * Pure: Locale specifications now produce predicate definitions
4989 according to the body of text (covering assumptions modulo local
4990 definitions); predicate "loc_axioms" covers newly introduced text,
4991 while "loc" is cumulative wrt. all included locale expressions; the
4992 latter view is presented only on export into the global theory
4993 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4994 on the old view without predicates;
4996 * Pure: predefined locales "var" and "struct" are useful for sharing
4997 parameters (as in CASL, for example); just specify something like
4998 ``var x + var y + struct M'' as import;
5000 * Pure: improved thms_containing: proper indexing of facts instead of
5001 raw theorems; check validity of results wrt. current name space;
5002 include local facts of proof configuration (also covers active
5003 locales), cover fixed variables in index; may use "_" in term
5004 specification; an optional limit for the number of printed facts may
5005 be given (the default is 40);
5007 * Pure: disallow duplicate fact bindings within new-style theory files
5010 * Provers: improved induct method: assumptions introduced by case
5011 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
5012 the goal statement); "foo" still refers to all facts collectively;
5014 * Provers: the function blast.overloaded has been removed: all constants
5015 are regarded as potentially overloaded, which improves robustness in exchange
5016 for slight decrease in efficiency;
5018 * Provers/linorder: New generic prover for transitivity reasoning over
5019 linear orders. Note: this prover is not efficient!
5021 * Isar: preview of problems to finish 'show' now produce an error
5022 rather than just a warning (in interactive mode);
5029 - Produces a counter example if it cannot prove a goal.
5030 Note that the counter example may be spurious if the goal is not a formula
5031 of quantifier-free linear arithmetic.
5032 In ProofGeneral the counter example appears in the trace buffer.
5034 - Knows about div k and mod k where k is a numeral of type nat or int.
5036 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5037 linear arithmetic fails. This takes account of quantifiers and divisibility.
5038 Presburger arithmetic can also be called explicitly via presburger(_tac).
5040 * simp's arithmetic capabilities have been enhanced a bit: it now
5041 takes ~= in premises into account (by performing a case split);
5043 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5044 are distributed over a sum of terms;
5046 * New tactic "trans_tac" and method "trans" instantiate
5047 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5050 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5051 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5053 * 'typedef' command has new option "open" to suppress the set
5056 * functions Min and Max on finite sets have been introduced (theory
5059 * attribute [symmetric] now works for relations as well; it turns
5060 (x,y) : R^-1 into (y,x) : R, and vice versa;
5062 * induct over a !!-quantified statement (say !!x1..xn):
5063 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5065 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5066 %x. None. Warning: empty_def now refers to the previously hidden definition
5069 * Algebra: formalization of classical algebra. Intended as base for
5070 any algebraic development in Isabelle. Currently covers group theory
5071 (up to Sylow's theorem) and ring theory (Universal Property of
5072 Univariate Polynomials). Contributions welcome;
5074 * GroupTheory: deleted, since its material has been moved to Algebra;
5076 * Complex: new directory of the complex numbers with numeric constants,
5077 nonstandard complex numbers, and some complex analysis, standard and
5078 nonstandard (Jacques Fleuriot);
5080 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5082 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5085 * Real/HahnBanach: updated and adapted to locales;
5087 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5090 * UNITY: added the Meier-Sanders theory of progress sets;
5092 * MicroJava: bytecode verifier and lightweight bytecode verifier
5093 as abstract algorithms, instantiated to the JVM;
5095 * Bali: Java source language formalization. Type system, operational
5096 semantics, axiomatic semantics. Supported language features:
5097 classes, interfaces, objects,virtual methods, static methods,
5098 static/instance fields, arrays, access modifiers, definite
5099 assignment, exceptions.
5104 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5107 * Main ZF: virtually all theories converted to new-style format;
5112 * Pure: Tactic.prove provides sane interface for internal proofs;
5113 omits the infamous "standard" operation, so this is more appropriate
5114 than prove_goalw_cterm in many situations (e.g. in simprocs);
5116 * Pure: improved error reporting of simprocs;
5118 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5122 *** Document preparation ***
5124 * uses \par instead of \\ for line breaks in theory text. This may
5125 shift some page breaks in large documents. To get the old behaviour
5126 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5128 * minimized dependencies of isabelle.sty and isabellesym.sty on
5131 * \<euro> now needs package babel/greek instead of marvosym (which
5134 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5139 New in Isabelle2002 (March 2002)
5140 --------------------------------
5142 *** Document preparation ***
5144 * greatly simplified document preparation setup, including more
5145 graceful interpretation of isatool usedir -i/-d/-D options, and more
5146 instructive isatool mkdir; users should basically be able to get
5147 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5148 users may run a separate document processing stage manually like this:
5149 "isatool usedir -D output HOL Test && isatool document Test/output";
5151 * theory dependency graph may now be incorporated into documents;
5152 isatool usedir -g true will produce session_graph.eps/.pdf for use
5153 with \includegraphics of LaTeX;
5155 * proper spacing of consecutive markup elements, especially text
5156 blocks after section headings;
5158 * support bold style (for single symbols only), input syntax is like
5159 this: "\<^bold>\<alpha>" or "\<^bold>A";
5161 * \<bullet> is now output as bold \cdot by default, which looks much
5162 better in printed text;
5164 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5165 note that these symbols are currently unavailable in Proof General /
5166 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5168 * isatool latex no longer depends on changed TEXINPUTS, instead
5169 isatool document copies the Isabelle style files to the target
5175 * Pure/Provers: improved proof by cases and induction;
5176 - 'case' command admits impromptu naming of parameters (such as
5178 - 'induct' method divinates rule instantiation from the inductive
5179 claim; no longer requires excessive ?P bindings for proper
5180 instantiation of cases;
5181 - 'induct' method properly enumerates all possibilities of set/type
5182 rules; as a consequence facts may be also passed through *type*
5183 rules without further ado;
5184 - 'induct' method now derives symbolic cases from the *rulified*
5185 rule (before it used to rulify cases stemming from the internal
5186 atomized version); this means that the context of a non-atomic
5187 statement becomes is included in the hypothesis, avoiding the
5188 slightly cumbersome show "PROP ?case" form;
5189 - 'induct' may now use elim-style induction rules without chaining
5190 facts, using ``missing'' premises from the goal state; this allows
5191 rules stemming from inductive sets to be applied in unstructured
5192 scripts, while still benefitting from proper handling of non-atomic
5193 statements; NB: major inductive premises need to be put first, all
5194 the rest of the goal is passed through the induction;
5195 - 'induct' proper support for mutual induction involving non-atomic
5196 rule statements (uses the new concept of simultaneous goals, see
5198 - append all possible rule selections, but only use the first
5199 success (no backtracking);
5200 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5201 - undeclared rule case names default to numbers 1, 2, 3, ...;
5202 - added 'print_induct_rules' (covered by help item in recent Proof
5204 - moved induct/cases attributes to Pure, methods to Provers;
5205 - generic method setup instantiated for FOL and HOL;
5207 * Pure: support multiple simultaneous goal statements, for example
5208 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5209 meta-level mechanism, this acts as if several individual goals had
5210 been stated separately; in particular common proof methods need to be
5211 repeated in order to cover all claims; note that a single elimination
5212 step is *not* sufficient to establish the two conjunctions, so this
5215 assume "A & B" then have A and B .. (*".." fails*)
5217 better use "obtain" in situations as above; alternative refer to
5218 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5220 * Pure: proper integration with ``locales''; unlike the original
5221 version by Florian Kammller, Isar locales package high-level proof
5222 contexts rather than raw logical ones (e.g. we admit to include
5223 attributes everywhere); operations on locales include merge and
5224 rename; support for implicit arguments (``structures''); simultaneous
5225 type-inference over imports and text; see also HOL/ex/Locales.thy for
5228 * Pure: the following commands have been ``localized'', supporting a
5229 target locale specification "(in name)": 'lemma', 'theorem',
5230 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5231 stored both within the locale and at the theory level (exported and
5232 qualified by the locale name);
5234 * Pure: theory goals may now be specified in ``long'' form, with
5235 ad-hoc contexts consisting of arbitrary locale elements. for example
5236 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5237 definitions may be given, too); the result is a meta-level rule with
5238 the context elements being discharged in the obvious way;
5240 * Pure: new proof command 'using' allows to augment currently used
5241 facts after a goal statement ('using' is syntactically analogous to
5242 'apply', but acts on the goal's facts only); this allows chained facts
5243 to be separated into parts given before and after a claim, as in
5244 ``from a and b have C using d and e <proof>'';
5246 * Pure: renamed "antecedent" case to "rule_context";
5248 * Pure: new 'judgment' command records explicit information about the
5249 object-logic embedding (used by several tools internally); no longer
5250 use hard-wired "Trueprop";
5252 * Pure: added 'corollary' command;
5254 * Pure: fixed 'token_translation' command;
5256 * Pure: removed obsolete 'exported' attribute;
5258 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5259 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5260 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5262 * Pure: method 'atomize' presents local goal premises as object-level
5263 statements (atomic meta-level propositions); setup controlled via
5264 rewrite rules declarations of 'atomize' attribute; example
5265 application: 'induct' method with proper rule statements in improper
5268 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5269 now consider the syntactic context of assumptions, giving a better
5270 chance to get type-inference of the arguments right (this is
5271 especially important for locales);
5273 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5276 * Pure/obtain: the formal conclusion "thesis", being marked as
5277 ``internal'', may no longer be reference directly in the text;
5278 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5281 * Pure: generic 'sym' attribute which declares a rule both as pure
5282 'elim?' and for the 'symmetric' operation;
5284 * Pure: marginal comments ``--'' may now occur just anywhere in the
5285 text; the fixed correlation with particular command syntax has been
5288 * Pure: new method 'rules' is particularly well-suited for proof
5289 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5290 but often produces more compact proof terms with less detours;
5292 * Pure/Provers/classical: simplified integration with pure rule
5293 attributes and methods; the classical "intro?/elim?/dest?"
5294 declarations coincide with the pure ones; the "rule" method no longer
5295 includes classically swapped intros; "intro" and "elim" methods no
5296 longer pick rules from the context; also got rid of ML declarations
5297 AddXIs/AddXEs/AddXDs; all of this has some potential for
5300 * Provers/classical: attribute 'swapped' produces classical inversions
5301 of introduction rules;
5303 * Provers/simplifier: 'simplified' attribute may refer to explicit
5304 rules instead of full simplifier context; 'iff' attribute handles
5307 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5309 * HOL: 'recdef' now fails on unfinished automated proofs, use
5310 "(permissive)" option to recover old behavior;
5312 * HOL: 'inductive' no longer features separate (collective) attributes
5313 for 'intros' (was found too confusing);
5315 * HOL: properly declared induction rules less_induct and
5321 * HOL: moved over to sane numeral syntax; the new policy is as
5324 - 0 and 1 are polymorphic constants, which are defined on any
5325 numeric type (nat, int, real etc.);
5327 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5328 binary representation internally;
5330 - type nat has special constructor Suc, and generally prefers Suc 0
5331 over 1::nat and Suc (Suc 0) over 2::nat;
5333 This change may cause significant problems of INCOMPATIBILITY; here
5334 are some hints on converting existing sources:
5336 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5337 entities, so expressions involving "-" (unary or binary minus) need
5338 to be spaced properly;
5340 - existing occurrences of "1" may need to be constraint "1::nat" or
5341 even replaced by Suc 0; similar for old "2";
5343 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5345 - remove all special provisions on numerals in proofs;
5347 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5348 representation (depends on bin_arith_simps in the default context);
5350 * HOL: symbolic syntax for x^2 (numeral 2);
5352 * HOL: the class of all HOL types is now called "type" rather than
5353 "term"; INCOMPATIBILITY, need to adapt references to this type class
5354 in axclass/classes, instance/arities, and (usually rare) occurrences
5355 in typings (of consts etc.); internally the class is called
5356 "HOL.type", ML programs should refer to HOLogic.typeS;
5358 * HOL/record package improvements:
5359 - new derived operations "fields" to build a partial record section,
5360 "extend" to promote a fixed record to a record scheme, and
5361 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5362 declared as simp by default;
5363 - shared operations ("more", "fields", etc.) now need to be always
5364 qualified) --- potential INCOMPATIBILITY;
5365 - removed "make_scheme" operations (use "make" with "extend") --
5367 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5368 - provides cases/induct rules for use with corresponding Isar
5369 methods (for concrete records, record schemes, concrete more
5370 parts, and schematic more parts -- in that order);
5371 - internal definitions directly based on a light-weight abstract
5372 theory of product types over typedef rather than datatype;
5374 * HOL: generic code generator for generating executable ML code from
5375 specifications; specific support for HOL constructs such as inductive
5376 datatypes and sets, as well as recursive functions; can be invoked
5377 via 'generate_code' theory section;
5379 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5381 * HOL: consolidated and renamed several theories. In particular:
5382 Ord.thy has been absorbed into HOL.thy
5383 String.thy has been absorbed into List.thy
5385 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5386 (beware of argument permutation!);
5388 * HOL: linorder_less_split superseded by linorder_cases;
5390 * HOL/List: "nodups" renamed to "distinct";
5392 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5393 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5394 - Ex_def has changed, now need to use some_eq_ex
5396 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5397 in this (rare) case use:
5399 delSWrapper "split_all_tac"
5400 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5402 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5405 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5406 Isabelle's type classes, ^ on functions and relations has too general
5407 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5408 necessary to attach explicit type constraints;
5410 * HOL/Relation: the prefix name of the infix "O" has been changed from
5411 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5412 renamed accordingly (eg "compI" -> "rel_compI").
5414 * HOL: syntax translations now work properly with numerals and records
5417 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5418 of "lam" -- INCOMPATIBILITY;
5420 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5421 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5422 renamed "Product_Type.unit";
5424 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5426 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5427 the "cases" method);
5429 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5432 * HOL/IMP: updated and converted to new-style theory format; several
5433 parts turned into readable document, with proper Isar proof texts and
5434 some explanations (by Gerwin Klein);
5436 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5438 * HOL-Hyperreal is now a logic image;
5443 * Isar: consts/constdefs supports mixfix syntax for continuous
5446 * Isar: domain package adapted to new-style theory format, e.g. see
5449 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5450 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5451 lift.induct_tac, always use UU instead of Undef;
5453 * HOLCF/IMP: updated and converted to new-style theory;
5458 * Isar: proper integration of logic-specific tools and packages,
5459 including theory commands '(co)inductive', '(co)datatype',
5460 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5461 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5463 * theory Main no longer includes AC; for the Axiom of Choice, base
5464 your theory on Main_ZFC;
5466 * the integer library now covers quotients and remainders, with many
5467 laws relating division to addition, multiplication, etc.;
5469 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5470 typeless version of the formalism;
5472 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5475 * ZF/Induct: new directory for examples of inductive definitions,
5476 including theory Multiset for multiset orderings; converted to
5477 new-style theory format;
5479 * ZF: many new theorems about lists, ordinals, etc.;
5484 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5485 variable proof controls level of detail: 0 = no proofs (only oracle
5486 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5487 also ref manual for further ML interfaces;
5489 * Pure/axclass: removed obsolete ML interface
5490 goal_subclass/goal_arity;
5492 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5493 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5494 separate tokens, so expressions involving minus need to be spaced
5497 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5498 rather than "infixl" or "infixr";
5500 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5501 sort constraint specifications in type inference; e.g. "x::_::foo"
5502 ensures that the type of "x" is of sort "foo" (but not necessarily a
5505 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5506 control output of nested => (types); the default behavior is
5509 * Pure/syntax: builtin parse translation for "_constify" turns valued
5510 tokens into AST constants;
5512 * Pure/syntax: prefer later declarations of translations and print
5513 translation functions; potential INCOMPATIBILITY: need to reverse
5514 multiple declarations for same syntax element constant;
5516 * Pure/show_hyps reset by default (in accordance to existing Isar
5519 * Provers/classical: renamed addaltern to addafter, addSaltern to
5522 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5525 * system: tested support for MacOS X; should be able to get Isabelle +
5526 Proof General to work in a plain Terminal after installing Poly/ML
5527 (e.g. from the Isabelle distribution area) and GNU bash alone
5528 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5529 support requires further installations, e.g. from
5530 http://fink.sourceforge.net/);
5532 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5534 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5535 of 40 MB), cf. ML_OPTIONS;
5537 * system: Proof General keywords specification is now part of the
5538 Isabelle distribution (see etc/isar-keywords.el);
5540 * system: support for persistent Proof General sessions (refrain from
5541 outdating all loaded theories on startup); user may create writable
5542 logic images like this: ``isabelle -q HOL Test'';
5544 * system: smart selection of Isabelle process versus Isabelle
5545 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5546 run both "isabelle" and "Isabelle" even if file names are badly
5547 damaged (executable inspects the case of the first letter of its own
5548 name); added separate "isabelle-process" and "isabelle-interface";
5550 * system: refrain from any attempt at filtering input streams; no
5551 longer support ``8bit'' encoding of old isabelle font, instead proper
5552 iso-latin characters may now be used; the related isatools
5553 "symbolinput" and "nonascii" have disappeared as well;
5555 * system: removed old "xterm" interface (the print modes "xterm" and
5556 "xterm_color" are still available for direct use in a suitable
5561 New in Isabelle99-2 (February 2001)
5562 -----------------------------------
5564 *** Overview of INCOMPATIBILITIES ***
5566 * HOL: please note that theories in the Library and elsewhere often use the
5567 new-style (Isar) format; to refer to their theorems in an ML script you must
5568 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5570 * HOL: inductive package no longer splits induction rule aggressively,
5571 but only as far as specified by the introductions given; the old
5572 format may be recovered via ML function complete_split_rule or attribute
5573 'split_rule (complete)';
5575 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5576 gfp_Tarski to gfp_unfold;
5578 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5580 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5581 relation); infix "^^" has been renamed "``"; infix "``" has been
5582 renamed "`"; "univalent" has been renamed "single_valued";
5584 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5587 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5589 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5591 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5592 consequence, it is no longer monotonic wrt. the local goal context
5593 (which is now passed through the inductive cases);
5595 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5596 \<gg> to \<ggreater>;
5599 *** Document preparation ***
5601 * \isabellestyle{NAME} selects version of Isabelle output (currently
5602 available: are "it" for near math-mode best-style output, "sl" for
5603 slanted text style, and "tt" for plain type-writer; if no
5604 \isabellestyle command is given, output is according to slanted
5607 * support sub/super scripts (for single symbols only), input syntax is
5608 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5610 * some more standard symbols; see Appendix A of the system manual for
5611 the complete list of symbols defined in isabellesym.sty;
5613 * improved isabelle style files; more abstract symbol implementation
5614 (should now use \isamath{...} and \isatext{...} in custom symbol
5617 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5618 state; Note that presentation of goal states does not conform to
5619 actual human-readable proof documents. Please do not include goal
5620 states into document output unless you really know what you are doing!
5622 * proper indentation of antiquoted output with proportional LaTeX
5625 * no_document ML operator temporarily disables LaTeX document
5628 * isatool unsymbolize tunes sources for plain ASCII communication;
5633 * Pure: Isar now suffers initial goal statements to contain unbound
5634 schematic variables (this does not conform to actual readable proof
5635 documents, due to unpredictable outcome and non-compositional proof
5636 checking); users who know what they are doing may use schematic goals
5637 for Prolog-style synthesis of proven results;
5639 * Pure: assumption method (an implicit finishing) now handles actual
5642 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5643 initial goal, declare "that" only as Pure intro (only for single
5644 steps); the "that" rule assumption may now be involved in implicit
5645 finishing, thus ".." becomes a feasible for trivial obtains;
5647 * Pure: default proof step now includes 'intro_classes'; thus trivial
5648 instance proofs may be performed by "..";
5650 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5653 * Pure: more robust selection of calculational rules;
5655 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5656 rule (as well as the assumption rule);
5658 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5659 lemmas, using the graph browser tool;
5661 * Pure: predict failure of "show" in interactive mode;
5663 * Pure: 'thms_containing' now takes actual terms as arguments;
5665 * HOL: improved method 'induct' --- now handles non-atomic goals
5666 (potential INCOMPATIBILITY); tuned error handling;
5668 * HOL: cases and induct rules now provide explicit hints about the
5669 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5670 any remaining facts are inserted into the goal verbatim;
5672 * HOL: local contexts (aka cases) may now contain term bindings as
5673 well; the 'cases' and 'induct' methods new provide a ?case binding for
5674 the result to be shown in each case;
5676 * HOL: added 'recdef_tc' command;
5678 * isatool convert assists in eliminating legacy ML scripts;
5683 * HOL/Library: a collection of generic theories to be used together
5684 with main HOL; the theory loader path already includes this directory
5685 by default; the following existing theories have been moved here:
5686 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5687 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5689 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5690 modelling and verification task performed in Isabelle/HOL +
5691 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5693 * HOL/Algebra: special summation operator SUM no longer exists, it has
5694 been replaced by setsum; infix 'assoc' now has priority 50 (like
5695 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5696 'domain', this makes the theory consistent with mathematical
5699 * HOL basics: added overloaded operations "inverse" and "divide"
5700 (infix "/"), syntax for generic "abs" operation, generic summation
5703 * HOL/typedef: simplified package, provide more useful rules (see also
5706 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5707 now expressed as a proper nested rule (old-style tactic scripts may
5708 require atomize_strip_tac to cope with non-atomic premises);
5710 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5711 to "split_conv" (old name still available for compatibility);
5713 * HOL: improved concrete syntax for strings (e.g. allows translation
5714 rules with string literals);
5716 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5717 and Fleuriot's mechanization of analysis, including the transcendental
5718 functions for the reals;
5720 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5725 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5726 "lam" is displayed as TWO lambda-symbols
5728 * CTT: theory Main now available, containing everything (that is, Bool
5734 * Pure: the Simplifier has been implemented properly as a derived rule
5735 outside of the actual kernel (at last!); the overall performance
5736 penalty in practical applications is about 50%, while reliability of
5737 the Isabelle inference kernel has been greatly improved;
5739 * print modes "brackets" and "no_brackets" control output of nested =>
5740 (types) and ==> (props); the default behaviour is "brackets";
5742 * Provers: fast_tac (and friends) now handle actual object-logic rules
5743 as assumptions as well;
5745 * system: support Poly/ML 4.0;
5747 * system: isatool install handles KDE version 1 or 2;
5751 New in Isabelle99-1 (October 2000)
5752 ----------------------------------
5754 *** Overview of INCOMPATIBILITIES ***
5756 * HOL: simplification of natural numbers is much changed; to partly
5757 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5758 issue the following ML commands:
5760 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5761 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5763 * HOL: simplification no longer dives into case-expressions; this is
5764 controlled by "t.weak_case_cong" for each datatype t;
5766 * HOL: nat_less_induct renamed to less_induct;
5768 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5769 fixsome to patch .thy and .ML sources automatically;
5771 select_equality -> some_equality
5772 select_eq_Ex -> some_eq_ex
5773 selectI2EX -> someI2_ex
5776 select1_equality -> some1_equality
5777 Eps_sym_eq -> some_sym_eq_trivial
5778 Eps_eq -> some_eq_trivial
5780 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5782 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5785 * HOL: the recursion equations generated by 'recdef' are now called
5786 f.simps instead of f.rules;
5788 * HOL: qed_spec_mp now also handles bounded ALL as well;
5790 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5791 sometimes be needed;
5793 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5795 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5797 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5798 product is now "<*>" instead of "Times"; the lexicographic product is
5799 now "<*lex*>" instead of "**";
5801 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5802 of main HOL, but was unused); better use HOL's datatype package;
5804 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5805 the old syntax may be recovered as follows:
5808 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5809 (infixl "\\<oplus>" 100)
5811 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5813 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5814 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5817 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5818 changed from A/r to A//r;
5820 * ZF: new treatment of arithmetic (nat & int) may break some old
5823 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5824 rulify -> rule_format, elimify -> elim_format, ...);
5826 * Isar/Provers: intro/elim/dest attributes changed; renamed
5827 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5828 should have to change intro!! to intro? only); replaced "delrule" by
5831 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5833 * Provers: strengthened force_tac by using new first_best_tac;
5835 * LaTeX document preparation: several changes of isabelle.sty (see
5839 *** Document preparation ***
5841 * formal comments (text blocks etc.) in new-style theories may now
5842 contain antiquotations of thm/prop/term/typ/text to be presented
5843 according to latex print mode; concrete syntax is like this:
5844 @{term[show_types] "f(x) = a + x"};
5846 * isatool mkdir provides easy setup of Isabelle session directories,
5847 including proper document sources;
5849 * generated LaTeX sources are now deleted after successful run
5850 (isatool document -c); may retain a copy somewhere else via -D option
5853 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5854 style files, achieving self-contained LaTeX sources and simplifying
5857 * old-style theories now produce (crude) LaTeX output as well;
5859 * browser info session directories are now self-contained (may be put
5860 on WWW server seperately); improved graphs of nested sessions; removed
5861 graph for 'all sessions';
5863 * several improvements in isabelle style files; \isabellestyle{it}
5864 produces fake math mode output; \isamarkupheader is now \section by
5865 default; see lib/texinputs/isabelle.sty etc.;
5870 * Isar/Pure: local results and corresponding term bindings are now
5871 subject to Hindley-Milner polymorphism (similar to ML); this
5872 accommodates incremental type-inference very nicely;
5874 * Isar/Pure: new derived language element 'obtain' supports
5875 generalized existence reasoning;
5877 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5878 support accumulation of results, without applying any rules yet;
5879 useful to collect intermediate results without explicit name
5880 references, and for use with transitivity rules with more than 2
5883 * Isar/Pure: scalable support for case-analysis type proofs: new
5884 'case' language element refers to local contexts symbolically, as
5885 produced by certain proof methods; internally, case names are attached
5886 to theorems as "tags";
5888 * Isar/Pure: theory command 'hide' removes declarations from
5889 class/type/const name spaces;
5891 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5892 indicate potential overloading;
5894 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5896 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5897 "{a,b,c}" instead of {a,b,c};
5899 * Isar/Pure now provides its own version of intro/elim/dest
5900 attributes; useful for building new logics, but beware of confusion
5901 with the version in Provers/classical;
5903 * Isar/Pure: the local context of (non-atomic) goals is provided via
5904 case name 'antecedent';
5906 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5907 to the current context is now done automatically);
5909 * Isar/Pure: theory command 'method_setup' provides a simple interface
5910 for definining proof methods in ML;
5912 * Isar/Provers: intro/elim/dest attributes changed; renamed
5913 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5914 most cases, one should have to change intro!! to intro? only);
5915 replaced "delrule" by "rule del";
5917 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5918 'symmetric' attribute (the latter supercedes [RS sym]);
5920 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5921 method modifier); 'simp' method: 'only:' modifier removes loopers as
5922 well (including splits);
5924 * Isar/Provers: Simplifier and Classical methods now support all kind
5925 of modifiers used in the past, including 'cong', 'iff', etc.
5927 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5928 of Simplifier and Classical reasoner);
5930 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5931 now support named cases; major packages (inductive, datatype, primrec,
5932 recdef) support case names and properly name parameters;
5934 * Isar/HOL: new transitivity rules for substitution in inequalities --
5935 monotonicity conditions are extracted to be proven at end of
5938 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5941 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5942 split_if split_if_asm; datatype package provides theorems foo.splits =
5943 foo.split foo.split_asm for each datatype;
5945 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5946 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5947 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5948 use "(cases (simplified))" method in proper proof texts);
5950 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5952 * Isar: names of theorems etc. may be natural numbers as well;
5954 * Isar: 'pr' command: optional arguments for goals_limit and
5955 ProofContext.prems_limit; no longer prints theory contexts, but only
5958 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5959 additional print modes to be specified; e.g. "pr(latex)" will print
5960 proof state according to the Isabelle LaTeX style;
5962 * Isar: improved support for emulating tactic scripts, including proof
5963 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5964 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5965 (for HOL datatypes);
5967 * Isar: simplified (more robust) goal selection of proof methods: 1st
5968 goal, all goals, or explicit goal specifier (tactic emulation); thus
5969 'proof method scripts' have to be in depth-first order;
5971 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5973 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5974 should instead use individual commands for printing items
5975 (print_commands, print_methods etc.);
5977 * Isar: added 'nothing' --- the empty list of theorems;
5982 * HOL/MicroJava: formalization of a fragment of Java, together with a
5983 corresponding virtual machine and a specification of its bytecode
5984 verifier and a lightweight bytecode verifier, including proofs of
5985 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5986 Cornelia Pusch (see also the homepage of project Bali at
5987 http://isabelle.in.tum.de/Bali/);
5989 * HOL/Algebra: new theory of rings and univariate polynomials, by
5992 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5993 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5996 * HOL/Lattice: fundamental concepts of lattice theory and order
5997 structures, including duals, properties of bounds versus algebraic
5998 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5999 Theorem for complete lattices etc.; may also serve as a demonstration
6000 for abstract algebraic reasoning using axiomatic type classes, and
6001 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
6003 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
6006 * HOL/IMPP: extension of IMP with local variables and mutually
6007 recursive procedures, by David von Oheimb;
6009 * HOL/Lambda: converted into new-style theory and document;
6011 * HOL/ex/Multiquote: example of multiple nested quotations and
6012 anti-quotations -- basically a generalized version of de-Bruijn
6013 representation; very useful in avoiding lifting of operations;
6015 * HOL/record: added general record equality rule to simpset; fixed
6016 select-update simplification procedure to handle extended records as
6017 well; admit "r" as field name;
6019 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
6020 other numeric types and also as the identity of groups, rings, etc.;
6022 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
6023 Types nat and int belong to this axclass;
6025 * HOL: greatly improved simplification involving numerals of type nat, int, real:
6026 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
6027 i*j + k + j*#3*i simplifies to #4*(i*j) + k
6028 two terms #m*u and #n*u are replaced by #(m+n)*u
6029 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6030 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6031 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6033 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6034 powerful prover for predicate logic but knows nothing of clasets; see
6035 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6037 * HOL: new version of "case_tac" subsumes both boolean case split and
6038 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6039 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6041 * HOL: simplification no longer dives into case-expressions: only the
6042 selector expression is simplified, but not the remaining arms; to
6043 enable full simplification of case-expressions for datatype t, you may
6044 remove t.weak_case_cong from the simpset, either globally (Delcongs
6045 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6047 * HOL/recdef: the recursion equations generated by 'recdef' for
6048 function 'f' are now called f.simps instead of f.rules; if all
6049 termination conditions are proved automatically, these simplification
6050 rules are added to the simpset, as in primrec; rules may be named
6051 individually as well, resulting in a separate list of theorems for
6054 * HOL/While is a new theory that provides a while-combinator. It
6055 permits the definition of tail-recursive functions without the
6056 provision of a termination measure. The latter is necessary once the
6057 invariant proof rule for while is applied.
6059 * HOL: new (overloaded) notation for the set of elements below/above
6060 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6062 * HOL: theorems impI, allI, ballI bound as "strip";
6064 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6065 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6066 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6068 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6070 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6071 main HOL, but was unused);
6073 * HOL: fewer consts declared as global (e.g. have to refer to
6074 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6076 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6077 in case of overlap with user translations (e.g. judgements over
6078 tuples); (note that the underlying logical represenation is still
6084 * ZF: simplification automatically cancels common terms in arithmetic
6085 expressions over nat and int;
6087 * ZF: new treatment of nat to minimize type-checking: all operators
6088 coerce their operands to a natural number using the function natify,
6089 making the algebraic laws unconditional;
6091 * ZF: as above, for int: operators coerce their operands to an integer
6092 using the function intify;
6094 * ZF: the integer library now contains many of the usual laws for the
6095 orderings, including $<=, and monotonicity laws for $+ and $*;
6097 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6100 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6101 to the simplifier and classical reasoner simultaneously;
6106 * Provers: blast_tac now handles actual object-logic rules as
6107 assumptions; note that auto_tac uses blast_tac internally as well;
6109 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6110 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6112 * Provers: delrules now handles destruct rules as well (no longer need
6113 explicit make_elim);
6115 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6116 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6117 use instead the strong form,
6118 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6119 in HOL, FOL and ZF the function cla_make_elim will create such rules
6120 from destruct-rules;
6122 * Provers: Simplifier.easy_setup provides a fast path to basic
6123 Simplifier setup for new object-logics;
6125 * Pure: AST translation rules no longer require constant head on LHS;
6127 * Pure: improved name spaces: ambiguous output is qualified; support
6128 for hiding of names;
6130 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6131 XSYMBOL_HOME; no longer need to do manual configuration in most
6134 * system: compression of ML heaps images may now be controlled via -c
6135 option of isabelle and isatool usedir (currently only observed by
6138 * system: isatool installfonts may handle X-Symbol fonts as well (very
6139 useful for remote X11);
6141 * system: provide TAGS file for Isabelle sources;
6143 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6146 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6147 timing flag supersedes proof_timing and Toplevel.trace;
6149 * ML: new combinators |>> and |>>> for incremental transformations
6150 with secondary results (e.g. certain theory extensions):
6152 * ML: PureThy.add_defs gets additional argument to indicate potential
6153 overloading (usually false);
6155 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6160 New in Isabelle99 (October 1999)
6161 --------------------------------
6163 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6165 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6166 are no longer simplified. (This allows the simplifier to unfold recursive
6167 functional programs.) To restore the old behaviour, declare
6169 Delcongs [if_weak_cong];
6171 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6174 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6176 * HOL/datatype: mutual_induct_tac no longer exists --
6177 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6179 * HOL/typedef: fixed type inference for representing set; type
6180 arguments now have to occur explicitly on the rhs as type constraints;
6182 * ZF: The con_defs part of an inductive definition may no longer refer
6183 to constants declared in the same theory;
6185 * HOL, ZF: the function mk_cases, generated by the inductive
6186 definition package, has lost an argument. To simplify its result, it
6187 uses the default simpset instead of a supplied list of theorems.
6189 * HOL/List: the constructors of type list are now Nil and Cons;
6191 * Simplifier: the type of the infix ML functions
6192 setSSolver addSSolver setSolver addSolver
6193 is now simpset * solver -> simpset where `solver' is a new abstract type
6194 for packaging solvers. A solver is created via
6195 mk_solver: string -> (thm list -> int -> tactic) -> solver
6196 where the string argument is only a comment.
6201 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6202 decision procedure for linear arithmetic. Currently it is used for
6203 types `nat', `int', and `real' in HOL (see below); it can, should and
6204 will be instantiated for other types and logics as well.
6206 * The simplifier now accepts rewrite rules with flexible heads, eg
6207 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6208 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6214 * New Isabelle/Isar subsystem provides an alternative to traditional
6215 tactical theorem proving; together with the ProofGeneral/isar user
6216 interface it offers an interactive environment for developing human
6217 readable proof documents (Isar == Intelligible semi-automated
6218 reasoning); for further information see isatool doc isar-ref,
6219 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6221 * improved and simplified presentation of theories: better HTML markup
6222 (including colors), graph views in several sizes; isatool usedir now
6223 provides a proper interface for user theories (via -P option); actual
6224 document preparation based on (PDF)LaTeX is available as well (for
6225 new-style theories only); see isatool doc system for more information;
6227 * native support for Proof General, both for classic Isabelle and
6230 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6231 using the graph browser tool;
6233 * Isabelle manuals now also available as PDF;
6235 * theory loader rewritten from scratch (may not be fully
6236 bug-compatible); old loadpath variable has been replaced by show_path,
6237 add_path, del_path, reset_path functions; new operations such as
6238 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6241 * improved isatool install: option -k creates KDE application icon,
6242 option -p DIR installs standalone binaries;
6244 * added ML_PLATFORM setting (useful for cross-platform installations);
6245 more robust handling of platform specific ML images for SML/NJ;
6247 * the settings environment is now statically scoped, i.e. it is never
6248 created again in sub-processes invoked from isabelle, isatool, or
6251 * path element specification '~~' refers to '$ISABELLE_HOME';
6253 * in locales, the "assumes" and "defines" parts may be omitted if
6256 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6259 * new print_mode "HTML";
6261 * new flag show_tags controls display of tags of theorems (which are
6262 basically just comments that may be attached by some tools);
6264 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6265 mode and goal output format:
6267 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6269 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6271 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6272 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6274 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6276 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6278 * function bind_thms stores lists of theorems (cf. bind_thm);
6280 * new shorthand tactics ftac, eatac, datac, fatac;
6282 * qed (and friends) now accept "" as result name; in that case the
6283 theorem is not stored, but proper checks and presentation of the
6286 * theorem database now also indexes constants "Trueprop", "all",
6287 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6292 ** HOL arithmetic **
6294 * There are now decision procedures for linear arithmetic over nat and
6297 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6298 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6299 are treated as atomic; subformulae not involving type `nat' or `int'
6300 are ignored; quantified subformulae are ignored unless they are
6301 positive universal or negative existential. The tactic has to be
6302 invoked by hand and can be a little bit slow. In particular, the
6303 running time is exponential in the number of occurrences of `min' and
6304 `max', and `-' on `nat'.
6306 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6307 (negated) (in)equalities among the premises and the conclusion into
6308 account (i.e. no compound formulae) and does not know about `min' and
6309 `max', and `-' on `nat'. It is fast and is used automatically by the
6312 NB: At the moment, these decision procedures do not cope with mixed
6313 nat/int formulae where the two parts interact, such as `m < n ==>
6316 * HOL/Numeral provides a generic theory of numerals (encoded
6317 efficiently as bit strings); setup for types nat/int/real is in place;
6318 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6319 int, existing theories and proof scripts may require a few additional
6322 * integer division and remainder can now be performed on constant
6325 * many properties of integer multiplication, division and remainder
6328 * An interface to the Stanford Validity Checker (SVC) is available through the
6329 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6330 are proved automatically. SVC must be installed separately, and its results
6331 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6332 invocation of the underlying oracle). For SVC see
6333 http://verify.stanford.edu/SVC
6335 * IsaMakefile: the HOL-Real target now builds an actual image;
6340 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6341 (in Isabelle/Isar) -- by Gertrud Bauer;
6343 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6344 analysis for assembly languages with subtypes;
6346 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6347 -- avoids syntactic ambiguities and treats state, transition, and
6348 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6349 changed syntax and (many) tactics;
6351 * HOL/inductive: Now also handles more general introduction rules such
6352 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6353 theorems are now maintained within the theory (maintained via the
6356 * HOL/datatype: Now also handles arbitrarily branching datatypes
6357 (using function types) such as
6359 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6361 * HOL/record: record_simproc (part of the default simpset) takes care
6362 of selectors applied to updated records; record_split_tac is no longer
6363 part of the default claset; update_defs may now be removed from the
6364 simpset in many cases; COMPATIBILITY: old behavior achieved by
6366 claset_ref () := claset() addSWrapper record_split_wrapper;
6367 Delsimprocs [record_simproc]
6369 * HOL/typedef: fixed type inference for representing set; type
6370 arguments now have to occur explicitly on the rhs as type constraints;
6372 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6373 names rather than an ML expression;
6375 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6376 supplied later. Program schemes can be defined, such as
6377 "While B C s = (if B s then While B C (C s) else s)"
6378 where the well-founded relation can be chosen after B and C have been given.
6380 * HOL/List: the constructors of type list are now Nil and Cons;
6381 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6382 course, ML tools referring to List.list.op # etc. have to be adapted;
6384 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6385 disabled by default; run isabelle with option -m HOL to get back to
6386 the original Gordon/HOL-style output;
6388 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6389 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6391 * HOL basic syntax simplified (more orthogonal): all variants of
6392 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6393 Eps operator is provided as well: "SOME x. P[x]";
6395 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6397 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6398 thus available for user theories;
6400 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6401 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6404 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6405 several times and then mp;
6410 * the notation <<...>> is now available as a notation for sequences of
6413 * the simplifier is now installed
6415 * the axiom system has been generalized (thanks to Soren Heilmann)
6417 * the classical reasoner now has a default rule database
6422 * new primrec section allows primitive recursive functions to be given
6423 directly (as in HOL) over datatypes and the natural numbers;
6425 * new tactics induct_tac and exhaust_tac for induction (or case
6426 analysis) over datatypes and the natural numbers;
6428 * the datatype declaration of type T now defines the recursor T_rec;
6430 * simplification automatically does freeness reasoning for datatype
6433 * automatic type-inference, with AddTCs command to insert new
6434 type-checking rules;
6436 * datatype introduction rules are now added as Safe Introduction rules
6439 * the syntax "if P then x else y" is now available in addition to
6443 *** Internal programming interfaces ***
6445 * tuned simplifier trace output; new flag debug_simp;
6447 * structures Vartab / Termtab (instances of TableFun) offer efficient
6448 tables indexed by indexname_ord / term_ord (compatible with aconv);
6450 * AxClass.axclass_tac lost the theory argument;
6452 * tuned current_goals_markers semantics: begin / end goal avoids
6453 printing empty lines;
6455 * removed prs and prs_fn hook, which was broken because it did not
6456 include \n in its semantics, forcing writeln to add one
6457 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6458 string -> unit if you really want to output text without newline;
6460 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6461 plain output, interface builders may have to enable 'isabelle_font'
6462 mode to get Isabelle font glyphs as before;
6464 * refined token_translation interface; INCOMPATIBILITY: output length
6465 now of type real instead of int;
6467 * theory loader actions may be traced via new ThyInfo.add_hook
6468 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6469 your own database of information attached to *whole* theories -- as
6470 opposed to intra-theory data slots offered via TheoryDataFun;
6472 * proper handling of dangling sort hypotheses (at last!);
6473 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6474 extra sort hypotheses that can be witnessed from the type signature;
6475 the force_strip_shyps flag is gone, any remaining shyps are simply
6476 left in the theorem (with a warning issued by strip_shyps_warning);
6480 New in Isabelle98-1 (October 1998)
6481 ----------------------------------
6483 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6485 * several changes of automated proof tools;
6487 * HOL: major changes to the inductive and datatype packages, including
6488 some minor incompatibilities of theory syntax;
6490 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6493 * HOL: removed duplicate thms in Arith:
6494 less_imp_add_less should be replaced by trans_less_add1
6495 le_imp_add_le should be replaced by trans_le_add1
6497 * HOL: unary minus is now overloaded (new type constraints may be
6500 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6501 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6502 now taken as an integer constant.
6504 * Pure: ML function 'theory_of' renamed to 'theory';
6510 1. Asm_full_simp_tac is now more aggressive.
6511 1. It will sometimes reorient premises if that increases their power to
6513 2. It does no longer proceed strictly from left to right but may also
6514 rotate premises to achieve further simplification.
6515 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6516 old Asm_full_simp_tac in that it does not rotate premises.
6517 2. The simplifier now knows a little bit about nat-arithmetic.
6519 * Classical reasoner: wrapper mechanism for the classical reasoner now
6520 allows for selected deletion of wrappers, by introduction of names for
6521 wrapper functionals. This implies that addbefore, addSbefore,
6522 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6523 and that adding two tactics with the same name overwrites the first
6524 one (emitting a warning).
6525 type wrapper = (int -> tactic) -> (int -> tactic)
6526 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6527 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6528 delWrapper, delSWrapper: claset * string -> claset
6529 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6531 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6532 semantics; addbefore now affects only the unsafe part of step_tac
6533 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6534 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6537 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6538 compWrapper; added safe wrapper (and access functions for it);
6540 * HOL/split_all_tac is now much faster and fails if there is nothing
6541 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6542 and the names of the automatically generated variables have changed.
6543 split_all_tac has moved within claset() from unsafe wrappers to safe
6544 wrappers, which means that !!-bound variables are split much more
6545 aggressively, and safe_tac and clarify_tac now split such variables.
6546 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6547 Note: the same holds for record_split_tac, which does the job of
6548 split_all_tac for record fields.
6550 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6551 permanently to the default simpset using Addsplits just like
6552 Addsimps. They can be removed via Delsplits just like
6553 Delsimps. Lower-case versions are also available.
6555 * HOL/Simplifier: The rule split_if is now part of the default
6556 simpset. This means that the simplifier will eliminate all occurrences
6557 of if-then-else in the conclusion of a goal. To prevent this, you can
6558 either remove split_if completely from the default simpset by
6559 `Delsplits [split_if]' or remove it in a specific call of the
6560 simplifier using `... delsplits [split_if]'. You can also add/delete
6561 other case splitting rules to/from the default simpset: every datatype
6562 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6563 t is the name of the datatype).
6565 * Classical reasoner / Simplifier combination: new force_tac (and
6566 derivatives Force_tac, force) combines rewriting and classical
6567 reasoning (and whatever other tools) similarly to auto_tac, but is
6568 aimed to solve the given subgoal completely.
6573 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6574 and `goalw': the theory is no longer needed as an explicit argument -
6575 the current theory context is used; assumptions are no longer returned
6576 at the ML-level unless one of them starts with ==> or !!; it is
6577 recommended to convert to these new commands using isatool fixgoal
6578 (backup your sources first!);
6580 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6581 the current theory context, and 'theory' to lookup stored theories;
6583 * new theory section 'locale' for declaring constants, assumptions and
6584 definitions that have local scope;
6586 * new theory section 'nonterminals' for purely syntactic types;
6588 * new theory section 'setup' for generic ML setup functions
6589 (e.g. package initialization);
6591 * the distribution now includes Isabelle icons: see
6592 lib/logo/isabelle-{small,tiny}.xpm;
6594 * isatool install - install binaries with absolute references to
6597 * isatool logo -- create instances of the Isabelle logo (as EPS);
6599 * print mode 'emacs' reserved for Isamode;
6601 * support multiple print (ast) translations per constant name;
6603 * theorems involving oracles are now printed with a suffixed [!];
6608 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6610 * HOL/inductive package reorganized and improved: now supports mutual
6616 oddI "n : EVEN ==> Suc n : ODD"
6617 evenI "n : ODD ==> Suc n : EVEN"
6619 new theorem list "elims" contains an elimination rule for each of the
6620 recursive sets; inductive definitions now handle disjunctive premises
6621 correctly (also ZF);
6623 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6624 "mutual_induct" no longer exists - the induction rule is always
6625 contained in "induct";
6628 * HOL/datatype package re-implemented and greatly improved: now
6629 supports mutually recursive datatypes such as
6632 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6633 | SUM ('a aexp) ('a aexp)
6634 | DIFF ('a aexp) ('a aexp)
6637 'a bexp = LESS ('a aexp) ('a aexp)
6638 | AND ('a bexp) ('a bexp)
6639 | OR ('a bexp) ('a bexp)
6641 as well as indirectly recursive datatypes such as
6644 ('a, 'b) term = Var 'a
6645 | App 'b ((('a, 'b) term) list)
6647 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6648 induction on mutually / indirectly recursive datatypes.
6650 Primrec equations are now stored in theory and can be accessed via
6651 <function_name>.simps.
6655 - Theories using datatypes must now have theory Datatype as an
6657 - The specific <typename>.induct_tac no longer exists - use the
6658 generic induct_tac instead.
6659 - natE has been renamed to nat.exhaust - use exhaust_tac
6660 instead of res_inst_tac ... natE. Note that the variable
6661 names in nat.exhaust differ from the names in natE, this
6662 may cause some "fragile" proofs to fail.
6663 - The theorems split_<typename>_case and split_<typename>_case_asm
6664 have been renamed to <typename>.split and <typename>.split_asm.
6665 - Since default sorts of type variables are now handled correctly,
6666 some datatype definitions may have to be annotated with explicit
6668 - Primrec definitions no longer require function name and type
6669 of recursive argument.
6671 Consider using isatool fixdatatype to adapt your theories and proof
6672 scripts to the new package (backup your sources first!).
6675 * HOL/record package: considerably improved implementation; now
6676 includes concrete syntax for record types, terms, updates; theorems
6677 for surjective pairing and splitting !!-bound record variables; proof
6678 support is as follows:
6680 1) standard conversions (selectors or updates applied to record
6681 constructor terms) are part of the standard simpset;
6683 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6684 made part of standard simpset and claset via addIffs;
6686 3) a tactic for record field splitting (record_split_tac) is part of
6687 the standard claset (addSWrapper);
6689 To get a better idea about these rules you may retrieve them via
6690 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6691 the name of your record type.
6693 The split tactic 3) conceptually simplifies by the following rule:
6695 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6697 Thus any record variable that is bound by meta-all will automatically
6698 blow up into some record constructor term, consequently the
6699 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6700 solve record problems automatically.
6703 * reorganized the main HOL image: HOL/Integ and String loaded by
6704 default; theory Main includes everything;
6706 * automatic simplification of integer sums and comparisons, using cancellation;
6708 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6710 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6712 * many new identities for unions, intersections, set difference, etc.;
6714 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6715 called split_if, split_split, split_sum_case and split_nat_case (to go
6716 with add/delsplits);
6718 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6719 (?x::unit) = (); this is made part of the default simpset, which COULD
6720 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6721 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6722 unit_abs_eta_conv is added in order to counter the effect of
6723 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6726 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6729 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6730 It and 'sym RS equals0D' are now in the default claset, giving automatic
6731 disjointness reasoning but breaking a few old proofs.
6733 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6734 to 'converse' from 'inverse' (for compatibility with ZF and some
6737 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6738 the well-founded relation;
6740 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6741 Compl A. The "Compl" syntax remains available as input syntax for this
6744 * HOL/Update: new theory of function updates:
6745 f(a:=b) == %x. if x=a then b else f x
6746 may also be iterated as in f(a:=b,c:=d,...);
6748 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6751 - new function list_update written xs[i:=v] that updates the i-th
6752 list position. May also be iterated as in xs[i:=a,j:=b,...].
6753 - new function `upt' written [i..j(] which generates the list
6754 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6755 bound write [i..j], which is a shorthand for [i..j+1(].
6756 - new lexicographic orderings and corresponding wellfoundedness theorems.
6759 - removed 'pred' (predecessor) function;
6760 - generalized some theorems about n-1;
6761 - many new laws about "div" and "mod";
6762 - new laws about greatest common divisors (see theory ex/Primes);
6764 * HOL/Relation: renamed the relational operator r^-1 "converse"
6765 instead of "inverse";
6767 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6768 of the multiset ordering;
6770 * directory HOL/Real: a construction of the reals using Dedekind cuts
6771 (not included by default);
6773 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6775 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6776 programs, i.e. different program variables may have different types.
6778 * calling (stac rew i) now fails if "rew" has no effect on the goal
6779 [previously, this check worked only if the rewrite rule was unconditional]
6780 Now rew can involve either definitions or equalities (either == or =).
6785 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6786 only the theorems proved on ZF.ML;
6788 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6789 It and 'sym RS equals0D' are now in the default claset, giving automatic
6790 disjointness reasoning but breaking a few old proofs.
6792 * ZF/Update: new theory of function updates
6793 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6794 may also be iterated as in f(a:=b,c:=d,...);
6796 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6798 * calling (stac rew i) now fails if "rew" has no effect on the goal
6799 [previously, this check worked only if the rewrite rule was unconditional]
6800 Now rew can involve either definitions or equalities (either == or =).
6802 * case_tac provided for compatibility with HOL
6803 (like the old excluded_middle_tac, but with subgoals swapped)
6806 *** Internal programming interfaces ***
6808 * Pure: several new basic modules made available for general use, see
6809 also src/Pure/README;
6811 * improved the theory data mechanism to support encapsulation (data
6812 kind name replaced by private Object.kind, acting as authorization
6813 key); new type-safe user interface via functor TheoryDataFun; generic
6814 print_data function becomes basically useless;
6816 * removed global_names compatibility flag -- all theory declarations
6817 are qualified by default;
6819 * module Pure/Syntax now offers quote / antiquote translation
6820 functions (useful for Hoare logic etc. with implicit dependencies);
6821 see HOL/ex/Antiquote for an example use;
6823 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6826 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6829 * Display.print_goals function moved to Locale.print_goals;
6831 * standard print function for goals supports current_goals_markers
6832 variable for marking begin of proof, end of proof, start of goal; the
6833 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6834 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6839 New in Isabelle98 (January 1998)
6840 --------------------------------
6842 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6844 * changed lexical syntax of terms / types: dots made part of long
6845 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6847 * simpset (and claset) reference variable replaced by functions
6848 simpset / simpset_ref;
6850 * no longer supports theory aliases (via merge) and non-trivial
6851 implicit merge of thms' signatures;
6853 * most internal names of constants changed due to qualified names;
6855 * changed Pure/Sequence interface (see Pure/seq.ML);
6858 *** General Changes ***
6860 * hierachically structured name spaces (for consts, types, axms, thms
6861 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6862 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6863 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6864 long_names for fully qualified output names; NOTE: ML programs
6865 (special tactics, packages etc.) referring to internal names may have
6866 to be adapted to cope with fully qualified names; in case of severe
6867 backward campatibility problems try setting 'global_names' at compile
6868 time to have enrything declared within a flat name space; one may also
6869 fine tune name declarations in theories via the 'global' and 'local'
6872 * reimplemented the implicit simpset and claset using the new anytype
6873 data filed in signatures; references simpset:simpset ref etc. are
6874 replaced by functions simpset:unit->simpset and
6875 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6876 to patch your ML files accordingly;
6878 * HTML output now includes theory graph data for display with Java
6879 applet or isatool browser; data generated automatically via isatool
6880 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6882 * defs may now be conditional; improved rewrite_goals_tac to handle
6883 conditional equations;
6885 * defs now admits additional type arguments, using TYPE('a) syntax;
6887 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6888 creates a new theory node; implicit merge of thms' signatures is
6889 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6890 transfer:theory->thm->thm in (rare) cases;
6892 * improved handling of draft signatures / theories; draft thms (and
6893 ctyps, cterms) are automatically promoted to real ones;
6895 * slightly changed interfaces for oracles: admit many per theory, named
6896 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6898 * print_goals: optional output of const types (set show_consts and
6901 * improved output of warnings (###) and errors (***);
6903 * subgoal_tac displays a warning if the new subgoal has type variables;
6905 * removed old README and Makefiles;
6907 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6909 * removed obsolete init_pps and init_database;
6911 * deleted the obsolete tactical STATE, which was declared by
6912 fun STATE tacfun st = tacfun st st;
6914 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6915 (which abbreviates $HOME);
6917 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6918 use isatool fixseq to adapt your ML programs (this works for fully
6919 qualified references to the Sequence structure only!);
6921 * use_thy no longer requires writable current directory; it always
6922 reloads .ML *and* .thy file, if either one is out of date;
6925 *** Classical Reasoner ***
6927 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6928 tactics that use classical reasoning to simplify a subgoal without
6929 splitting it into several subgoals;
6931 * Safe_tac: like safe_tac but uses the default claset;
6936 * added simplification meta rules:
6937 (asm_)(full_)simplify: simpset -> thm -> thm;
6939 * simplifier.ML no longer part of Pure -- has to be loaded by object
6942 * added prems argument to simplification procedures;
6944 * HOL, FOL, ZF: added infix function `addsplits':
6945 instead of `<simpset> setloop (split_tac <thms>)'
6946 you can simply write `<simpset> addsplits <thms>'
6951 * TYPE('a) syntax for type reflection terms;
6953 * no longer handles consts with name "" -- declare as 'syntax' instead;
6955 * pretty printer: changed order of mixfix annotation preference (again!);
6957 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6962 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6963 with `addloop' of the simplifier to faciliate case splitting in premises.
6965 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6967 * HOL/Auth: new protocol proofs including some for the Internet
6970 * HOL/Map: new theory of `maps' a la VDM;
6972 * HOL/simplifier: simplification procedures nat_cancel_sums for
6973 cancelling out common nat summands from =, <, <= (in)equalities, or
6974 differences; simplification procedures nat_cancel_factor for
6975 cancelling common factor from =, <, <= (in)equalities over natural
6976 sums; nat_cancel contains both kinds of procedures, it is installed by
6977 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6979 * HOL/simplifier: terms of the form
6980 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6982 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6983 and those of the form
6984 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6986 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6989 Each datatype `t' now comes with a theorem `split_t_case' of the form
6991 P(t_case f1 ... fn x) =
6992 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6994 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6997 and a theorem `split_t_case_asm' of the form
6999 P(t_case f1 ... fn x) =
7000 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
7002 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
7004 which can be added to a simpset via `addsplits'. The existing theorems
7005 expand_list_case and expand_option_case have been renamed to
7006 split_list_case and split_option_case.
7009 - `pred n' is automatically converted to `n-1'.
7010 Users are strongly encouraged not to use `pred' any longer,
7011 because it will disappear altogether at some point.
7012 - Users are strongly encouraged to write "0 < n" rather than
7013 "n ~= 0". Theorems and proof tools have been modified towards this
7017 the function "set_of_list" has been renamed "set" (and its theorems too);
7018 the function "nth" now takes its arguments in the reverse order and
7019 has acquired the infix notation "!" as in "xs!n".
7021 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
7023 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
7024 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
7026 * HOL/record: extensible records with schematic structural subtyping
7027 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
7028 still lacks various theorems and concrete record syntax;
7033 * removed "axioms" and "generated by" sections;
7035 * replaced "ops" section by extended "consts" section, which is capable of
7036 handling the continuous function space "->" directly;
7039 . proves theorems immediately and stores them in the theory,
7040 . creates hierachical name space,
7041 . now uses normal mixfix annotations (instead of cinfix...),
7042 . minor changes to some names and values (for consistency),
7043 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7044 . separator between mutual domain defs: changed "," to "and",
7045 . improved handling of sort constraints; now they have to
7046 appear on the left-hand side of the equations only;
7048 * fixed LAM <x,y,zs>.b syntax;
7050 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7051 adm (%x. P (t x)), where P is chainfinite and t continuous;
7056 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7057 with `addloop' of the simplifier to faciliate case splitting in premises.
7059 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7060 in HOL, they strip ALL and --> from proved theorems;
7064 New in Isabelle94-8 (May 1997)
7065 ------------------------------
7067 *** General Changes ***
7069 * new utilities to build / run / maintain Isabelle etc. (in parts
7070 still somewhat experimental); old Makefiles etc. still functional;
7072 * new 'Isabelle System Manual';
7074 * INSTALL text, together with ./configure and ./build scripts;
7076 * reimplemented type inference for greater efficiency, better error
7077 messages and clean internal interface;
7079 * prlim command for dealing with lots of subgoals (an easier way of
7080 setting goals_limit);
7085 * supports alternative (named) syntax tables (parser and pretty
7086 printer); internal interface is provided by add_modesyntax(_i);
7088 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7089 be used in conjunction with the Isabelle symbol font; uses the
7090 "symbols" syntax table;
7092 * added token_translation interface (may translate name tokens in
7093 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7094 the current print_mode); IMPORTANT: user print translation functions
7095 are responsible for marking newly introduced bounds
7096 (Syntax.mark_boundT);
7098 * token translations for modes "xterm" and "xterm_color" that display
7099 names in bold, underline etc. or colors (which requires a color
7102 * infixes may now be declared with names independent of their syntax;
7104 * added typed_print_translation (like print_translation, but may
7105 access type of constant);
7108 *** Classical Reasoner ***
7110 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7111 some limitations. Blast_tac...
7112 + ignores addss, addbefore, addafter; this restriction is intrinsic
7113 + ignores elimination rules that don't have the correct format
7114 (the conclusion MUST be a formula variable)
7115 + ignores types, which can make HOL proofs fail
7116 + rules must not require higher-order unification, e.g. apply_type in ZF
7117 [message "Function Var's argument not a bound variable" relates to this]
7118 + its proof strategy is more general but can actually be slower
7120 * substitution with equality assumptions no longer permutes other
7123 * minor changes in semantics of addafter (now called addaltern); renamed
7124 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7125 (and access functions for it);
7127 * improved combination of classical reasoner and simplifier:
7128 + functions for handling clasimpsets
7129 + improvement of addss: now the simplifier is called _after_ the
7131 + safe variant of addss called addSss: uses safe simplifications
7132 _during_ the safe steps. It is more complete as it allows multiple
7133 instantiations of unknowns (e.g. with slow_tac).
7137 * added interface for simplification procedures (functions that
7138 produce *proven* rewrite rules on the fly, depending on current
7141 * ordering on terms as parameter (used for ordered rewriting);
7143 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7145 * the solver is now split into a safe and an unsafe part.
7146 This should be invisible for the normal user, except that the
7147 functions setsolver and addsolver have been renamed to setSolver and
7148 addSolver; added safe_asm_full_simp_tac;
7153 * a generic induction tactic `induct_tac' which works for all datatypes and
7154 also for type `nat';
7156 * a generic case distinction tactic `exhaust_tac' which works for all
7157 datatypes and also for type `nat';
7159 * each datatype comes with a function `size';
7161 * patterns in case expressions allow tuple patterns as arguments to
7162 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7164 * primrec now also works with type nat;
7166 * recdef: a new declaration form, allows general recursive functions to be
7167 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7169 * the constant for negation has been renamed from "not" to "Not" to
7170 harmonize with FOL, ZF, LK, etc.;
7172 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7175 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7177 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7178 problems in commutative rings, using axiomatic type classes for + and *;
7180 * more examples in HOL/MiniML and HOL/Auth;
7182 * more default rewrite rules for quantifiers, union/intersection;
7184 * a new constant `arbitrary == @x.False';
7186 * HOLCF/IOA replaces old HOL/IOA;
7188 * HOLCF changes: derived all rules and arities
7189 + axiomatic type classes instead of classes
7190 + typedef instead of faking type definitions
7191 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7192 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7193 + eliminated the types void, one, tr
7194 + use unit lift and bool lift (with translations) instead of one and tr
7195 + eliminated blift from Lift3.thy (use Def instead of blift)
7196 all eliminated rules are derived as theorems --> no visible changes ;
7201 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7202 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7203 as ZF_cs addSIs [equalityI];
7207 New in Isabelle94-7 (November 96)
7208 ---------------------------------
7210 * allowing negative levels (as offsets) in prlev and choplev;
7212 * super-linear speedup for large simplifications;
7214 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7215 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7216 FAIL); can suppress it using the command Delsimps (ex_simps @
7217 all_simps); De Morgan laws are also now included, by default;
7219 * improved printing of ==> : ~:
7221 * new object-logic "Sequents" adds linear logic, while replacing LK
7222 and Modal (thanks to Sara Kalvala);
7224 * HOL/Auth: correctness proofs for authentication protocols;
7226 * HOL: new auto_tac combines rewriting and classical reasoning (many
7227 examples on HOL/Auth);
7229 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7230 the rewriter and classical reasoner simultaneously;
7232 * function uresult no longer returns theorems in "standard" format;
7233 regain previous version by: val uresult = standard o uresult;
7240 * oracles -- these establish an interface between Isabelle and trusted
7241 external reasoners, which may deliver results as theorems;
7243 * proof objects (in particular record all uses of oracles);
7245 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7247 * "constdefs" section in theory files;
7249 * "primrec" section (HOL) no longer requires names;
7251 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7258 * reduced space requirements;
7260 * automatic HTML generation from theories;
7262 * theory files no longer require "..." (quotes) around most types;
7264 * new examples, including two proofs of the Church-Rosser theorem;
7266 * non-curried (1994) version of HOL is no longer distributed;
7273 * greatly reduced space requirements;
7275 * theory files (.thy) no longer require \...\ escapes at line breaks;
7277 * searchable theorem database (see the section "Retrieving theorems" on
7278 page 8 of the Reference Manual);
7280 * new examples, including Grabczewski's monumental case study of the
7283 * The previous version of HOL renamed to Old_HOL;
7285 * The new version of HOL (previously called CHOL) uses a curried syntax
7286 for functions. Application looks like f a b instead of f(a,b);
7288 * Mutually recursive inductive definitions finally work in HOL;
7290 * In ZF, pattern-matching on tuples is now available in all abstractions and
7291 translates to the operator "split";
7298 * new infix operator, addss, allowing the classical reasoner to
7299 perform simplification at each step of its search. Example:
7300 fast_tac (cs addss ss)
7302 * a new logic, CHOL, the same as HOL, but with a curried syntax
7303 for functions. Application looks like f a b instead of f(a,b). Also pairs
7304 look like (a,b) instead of <a,b>;
7306 * PLEASE NOTE: CHOL will eventually replace HOL!
7308 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7309 It translates to the operator "split". A new theory of integers is available;
7311 * In ZF, integer numerals now denote two's-complement binary integers.
7312 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7314 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7315 of the Axiom of Choice;
7322 * Significantly faster resolution;
7324 * the different sections in a .thy file can now be mixed and repeated
7327 * Database of theorems for FOL, HOL and ZF. New
7328 commands including qed, qed_goal and bind_thm store theorems in the database.
7330 * Simple database queries: return a named theorem (get_thm) or all theorems of
7331 a given theory (thms_of), or find out what theory a theorem was proved in
7334 * Bugs fixed in the inductive definition and datatype packages;
7336 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7337 and HOL_dup_cs obsolete;
7339 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7342 * Simpler definition of function space in ZF;
7344 * new results about cardinal and ordinal arithmetic in ZF;
7346 * 'subtype' facility in HOL for introducing new types as subsets of existing
7349 :mode=text:wrap=hard:maxLineLen=72: