1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Some previously unqualified names have been qualified:
20 Pair ~> Product_Type.Pair
21 fst ~> Product_Type.fst
22 snd ~> Product_Type.snd
23 split ~> Product_Type.split
24 curry ~> Product_Type.curry
28 * Datatype package: theorems generated for executable equality
29 (class eq) carry proper names and are treated as default code
32 * List.thy: use various operations from the Haskell prelude when
33 generating Haskell code.
36 New in Isabelle2009-2 (June 2010)
37 ---------------------------------
41 * Authentic syntax for *all* logical entities (type classes, type
42 constructors, term constants): provides simple and robust
43 correspondence between formal entities and concrete syntax. Within
44 the parse tree / AST representations, "constants" are decorated by
45 their category (class, type, const) and spelled out explicitly with
46 their full internal name.
48 Substantial INCOMPATIBILITY concerning low-level syntax declarations
49 and translations (translation rules and translation functions in ML).
50 Some hints on upgrading:
52 - Many existing uses of 'syntax' and 'translations' can be replaced
53 by more modern 'type_notation', 'notation' and 'abbreviation',
54 which are independent of this issue.
56 - 'translations' require markup within the AST; the term syntax
57 provides the following special forms:
59 CONST c -- produces syntax version of constant c from context
60 XCONST c -- literally c, checked as constant from context
61 c -- literally c, if declared by 'syntax'
63 Plain identifiers are treated as AST variables -- occasionally the
64 system indicates accidental variables via the error "rhs contains
67 Type classes and type constructors are marked according to their
68 concrete syntax. Some old translations rules need to be written
69 for the "type" category, using type constructor application
70 instead of pseudo-term application of the default category
73 - 'parse_translation' etc. in ML may use the following
76 @{class_syntax c} -- type class c within parse tree / AST
77 @{term_syntax c} -- type constructor c within parse tree / AST
78 @{const_syntax c} -- ML version of "CONST c" above
79 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
81 - Literal types within 'typed_print_translations', i.e. those *not*
82 represented as pseudo-terms are represented verbatim. Use @{class
83 c} or @{type_name c} here instead of the above syntax
86 Note that old non-authentic syntax was based on unqualified base
87 names, so all of the above "constant" names would coincide. Recall
88 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
89 diagnose syntax problems.
91 * Type constructors admit general mixfix syntax, not just infix.
93 * Concrete syntax may be attached to local entities without a proof
94 body, too. This works via regular mixfix annotations for 'fix',
95 'def', 'obtain' etc. or via the explicit 'write' command, which is
96 similar to the 'notation' command in theory specifications.
98 * Discontinued unnamed infix syntax (legacy feature for many years) --
99 need to specify constant name and syntax separately. Internal ML
100 datatype constructors have been renamed from InfixName to Infix etc.
101 Minor INCOMPATIBILITY.
103 * Schematic theorem statements need to be explicitly markup as such,
104 via commands 'schematic_lemma', 'schematic_theorem',
105 'schematic_corollary'. Thus the relevance of the proof is made
106 syntactically clear, which impacts performance in a parallel or
107 asynchronous interactive environment. Minor INCOMPATIBILITY.
109 * Use of cumulative prems via "!" in some proof methods has been
110 discontinued (old legacy feature).
112 * References 'trace_simp' and 'debug_simp' have been replaced by
113 configuration options stored in the context. Enabling tracing (the
114 case of debugging is similar) in proofs works via
116 using [[trace_simp = true]]
118 Tracing is then active for all invocations of the simplifier in
119 subsequent goal refinement steps. Tracing may also still be enabled or
120 disabled via the ProofGeneral settings menu.
122 * Separate commands 'hide_class', 'hide_type', 'hide_const',
123 'hide_fact' replace the former 'hide' KIND command. Minor
126 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
127 more efficient than combinations with -q1 or -q2.
132 * Proofterms record type-class reasoning explicitly, using the
133 "unconstrain" operation internally. This eliminates all sort
134 constraints from a theorem and proof, introducing explicit
135 OFCLASS-premises. On the proof term level, this operation is
136 automatically applied at theorem boundaries, such that closed proofs
137 are always free of sort constraints. INCOMPATIBILITY for tools that
140 * Local theory specifications may depend on extra type variables that
141 are not present in the result type -- arguments TYPE('a) :: 'a itself
142 are added internally. For example:
144 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
146 * Predicates of locales introduced by classes carry a mandatory
147 "class" prefix. INCOMPATIBILITY.
149 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
151 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
154 * Command 'code_reflect' allows to incorporate generated ML code into
155 runtime environment; replaces immature code_datatype antiquotation.
158 * Code generator: simple concept for abstract datatypes obeying
161 * Code generator: details of internal data cache have no impact on the
162 user space functionality any longer.
164 * Methods "unfold_locales" and "intro_locales" ignore non-locale
165 subgoals. This is more appropriate for interpretations with 'where'.
168 * Command 'example_proof' opens an empty proof body. This allows to
169 experiment with Isar, without producing any persistent result.
171 * Commands 'type_notation' and 'no_type_notation' declare type syntax
172 within a local theory context, with explicit checking of the
173 constructors involved (in contrast to the raw 'syntax' versions).
175 * Commands 'types' and 'typedecl' now work within a local theory
176 context -- without introducing dependencies on parameters or
177 assumptions, which is not possible in Isabelle/Pure.
179 * Command 'defaultsort' has been renamed to 'default_sort', it works
180 within a local theory context. Minor INCOMPATIBILITY.
185 * Command 'typedef' now works within a local theory context -- without
186 introducing dependencies on parameters or assumptions, which is not
187 possible in Isabelle/Pure/HOL. Note that the logical environment may
188 contain multiple interpretations of local typedefs (with different
189 non-emptiness proofs), even in a global theory context.
191 * New package for quotient types. Commands 'quotient_type' and
192 'quotient_definition' may be used for defining types and constants by
193 quotient constructions. An example is the type of integers created by
194 quotienting pairs of natural numbers:
197 intrel :: "(nat * nat) => (nat * nat) => bool"
199 "intrel (x, y) (u, v) = (x + v = u + y)"
201 quotient_type int = "nat × nat" / intrel
202 by (auto simp add: equivp_def expand_fun_eq)
205 "0::int" is "(0::nat, 0::nat)"
207 The method "lifting" can be used to lift of theorems from the
208 underlying "raw" type to the quotient type. The example
209 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
210 construction and provides a reasoning infrastructure for finite sets.
212 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
213 clash with new theory Quotient in Main HOL.
215 * Moved the SMT binding into the main HOL session, eliminating
216 separate HOL-SMT session.
218 * List membership infix mem operation is only an input abbreviation.
221 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
222 for future developements; former Library/Word.thy is still present in
223 the AFP entry RSAPPS.
225 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
226 longer shadowed. INCOMPATIBILITY.
228 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
231 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
234 * Dropped normalizing_semiring etc; use the facts in semiring classes
235 instead. INCOMPATIBILITY.
237 * Dropped several real-specific versions of lemmas about floor and
238 ceiling; use the generic lemmas from theory "Archimedean_Field"
239 instead. INCOMPATIBILITY.
241 floor_number_of_eq ~> floor_number_of
242 le_floor_eq_number_of ~> number_of_le_floor
243 le_floor_eq_zero ~> zero_le_floor
244 le_floor_eq_one ~> one_le_floor
245 floor_less_eq_number_of ~> floor_less_number_of
246 floor_less_eq_zero ~> floor_less_zero
247 floor_less_eq_one ~> floor_less_one
248 less_floor_eq_number_of ~> number_of_less_floor
249 less_floor_eq_zero ~> zero_less_floor
250 less_floor_eq_one ~> one_less_floor
251 floor_le_eq_number_of ~> floor_le_number_of
252 floor_le_eq_zero ~> floor_le_zero
253 floor_le_eq_one ~> floor_le_one
254 floor_subtract_number_of ~> floor_diff_number_of
255 floor_subtract_one ~> floor_diff_one
256 ceiling_number_of_eq ~> ceiling_number_of
257 ceiling_le_eq_number_of ~> ceiling_le_number_of
258 ceiling_le_zero_eq ~> ceiling_le_zero
259 ceiling_le_eq_one ~> ceiling_le_one
260 less_ceiling_eq_number_of ~> number_of_less_ceiling
261 less_ceiling_eq_zero ~> zero_less_ceiling
262 less_ceiling_eq_one ~> one_less_ceiling
263 ceiling_less_eq_number_of ~> ceiling_less_number_of
264 ceiling_less_eq_zero ~> ceiling_less_zero
265 ceiling_less_eq_one ~> ceiling_less_one
266 le_ceiling_eq_number_of ~> number_of_le_ceiling
267 le_ceiling_eq_zero ~> zero_le_ceiling
268 le_ceiling_eq_one ~> one_le_ceiling
269 ceiling_subtract_number_of ~> ceiling_diff_number_of
270 ceiling_subtract_one ~> ceiling_diff_one
272 * Theory "Finite_Set": various folding_XXX locales facilitate the
273 application of the various fold combinators on finite sets.
275 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
276 provides abstract red-black tree type which is backed by "RBT_Impl" as
277 implementation. INCOMPATIBILTY.
279 * Theory Library/Coinductive_List has been removed -- superseded by
280 AFP/thys/Coinductive.
282 * Theory PReal, including the type "preal" and related operations, has
283 been removed. INCOMPATIBILITY.
285 * Split off theory "Big_Operators" containing setsum, setprod,
286 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
288 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
289 "Int" etc. INCOMPATIBILITY.
291 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
293 * New set of rules "ac_simps" provides combined assoc / commute
294 rewrites for all interpretations of the appropriate generic locales.
296 * Renamed theory "OrderedGroup" to "Groups" and split theory
297 "Ring_and_Field" into theories "Rings" and "Fields"; for more
298 appropriate and more consistent names suitable for name prefixes
299 within the HOL theories. INCOMPATIBILITY.
301 * Some generic constants have been put to appropriate theories:
302 - less_eq, less: Orderings
303 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
304 - inverse, divide: Rings
307 * More consistent naming of type classes involving orderings (and
310 lower_semilattice ~> semilattice_inf
311 upper_semilattice ~> semilattice_sup
313 dense_linear_order ~> dense_linorder
315 pordered_ab_group_add ~> ordered_ab_group_add
316 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
317 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
318 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
319 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
320 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
321 pordered_cancel_semiring ~> ordered_cancel_semiring
322 pordered_comm_monoid_add ~> ordered_comm_monoid_add
323 pordered_comm_ring ~> ordered_comm_ring
324 pordered_comm_semiring ~> ordered_comm_semiring
325 pordered_ring ~> ordered_ring
326 pordered_ring_abs ~> ordered_ring_abs
327 pordered_semiring ~> ordered_semiring
329 ordered_ab_group_add ~> linordered_ab_group_add
330 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
331 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
332 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
333 ordered_field ~> linordered_field
334 ordered_field_no_lb ~> linordered_field_no_lb
335 ordered_field_no_ub ~> linordered_field_no_ub
336 ordered_field_dense_linear_order ~> dense_linordered_field
337 ordered_idom ~> linordered_idom
338 ordered_ring ~> linordered_ring
339 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
340 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
341 ordered_ring_strict ~> linordered_ring_strict
342 ordered_semidom ~> linordered_semidom
343 ordered_semiring ~> linordered_semiring
344 ordered_semiring_1 ~> linordered_semiring_1
345 ordered_semiring_1_strict ~> linordered_semiring_1_strict
346 ordered_semiring_strict ~> linordered_semiring_strict
348 The following slightly odd type classes have been moved to a
349 separate theory Library/Lattice_Algebras:
351 lordered_ab_group_add ~> lattice_ab_group_add
352 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
353 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
354 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
355 lordered_ring ~> lattice_ring
359 * Refined field classes:
360 - classes division_ring_inverse_zero, field_inverse_zero,
361 linordered_field_inverse_zero include rule inverse 0 = 0 --
362 subsumes former division_by_zero class;
363 - numerous lemmas have been ported from field to division_ring.
366 * Refined algebra theorem collections:
367 - dropped theorem group group_simps, use algebra_simps instead;
368 - dropped theorem group ring_simps, use field_simps instead;
369 - proper theorem collection field_simps subsumes former theorem
370 groups field_eq_simps and field_simps;
371 - dropped lemma eq_minus_self_iff which is a duplicate for
375 * Theory Finite_Set and List: some lemmas have been generalized from
378 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
379 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
380 inter_Inter_fold_inter ~> inf_Inf_fold_inf
381 union_Union_fold_union ~> sup_Sup_fold_sup
382 Inter_fold_inter ~> Inf_fold_inf
383 Union_fold_union ~> Sup_fold_sup
384 inter_INTER_fold_inter ~> inf_INFI_fold_inf
385 union_UNION_fold_union ~> sup_SUPR_fold_sup
386 INTER_fold_inter ~> INFI_fold_inf
387 UNION_fold_union ~> SUPR_fold_sup
389 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
390 replaced by the more convenient lemmas Inf_empty and Sup_empty.
391 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
392 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
393 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
394 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
396 * Reorganized theory Multiset: swapped notation of pointwise and
399 - pointwise ordering is instance of class order with standard syntax
401 - multiset ordering has syntax <=# and <#; partial order properties
402 are provided by means of interpretation with prefix
404 - less duplication, less historical organization of sections,
405 conversion from associations lists to multisets, rudimentary code
407 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
412 multiset_eq_conv_count_eq ~> multiset_ext_iff
413 multi_count_ext ~> multiset_ext
414 diff_union_inverse2 ~> diff_union_cancelR
418 * Theory Permutation: replaced local "remove" by List.remove1.
420 * Code generation: ML and OCaml code is decorated with signatures.
422 * Theory List: added transpose.
424 * Library/Nat_Bijection.thy is a collection of bijective functions
425 between nat and other types, which supersedes the older libraries
426 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
429 Nat_Int_Bij.nat2_to_nat ~> prod_encode
430 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
431 Nat_Int_Bij.int_to_nat_bij ~> int_encode
432 Nat_Int_Bij.nat_to_int_bij ~> int_decode
433 Countable.pair_encode ~> prod_encode
434 NatIso.prod2nat ~> prod_encode
435 NatIso.nat2prod ~> prod_decode
436 NatIso.sum2nat ~> sum_encode
437 NatIso.nat2sum ~> sum_decode
438 NatIso.list2nat ~> list_encode
439 NatIso.nat2list ~> list_decode
440 NatIso.set2nat ~> set_encode
441 NatIso.nat2set ~> set_decode
444 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
445 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
446 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
447 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
448 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
449 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
450 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
451 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
452 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
453 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
454 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
455 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
456 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
459 - Renamed ATP commands:
460 atp_info ~> sledgehammer running_atps
461 atp_kill ~> sledgehammer kill_atps
462 atp_messages ~> sledgehammer messages
463 atp_minimize ~> sledgehammer minimize
464 print_atps ~> sledgehammer available_atps
466 - Added user's manual ("isabelle doc sledgehammer").
467 - Added option syntax and "sledgehammer_params" to customize
468 Sledgehammer's behavior. See the manual for details.
469 - Modified the Isar proof reconstruction code so that it produces
470 direct proofs rather than proofs by contradiction. (This feature
471 is still experimental.)
472 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
474 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
477 - Added and implemented "binary_ints" and "bits" options.
478 - Added "std" option and implemented support for nonstandard models.
479 - Added and implemented "finitize" option to improve the precision
480 of infinite datatypes based on a monotonicity analysis.
481 - Added support for quotient types.
482 - Added support for "specification" and "ax_specification"
484 - Added support for local definitions (for "function" and
485 "termination" proofs).
486 - Added support for term postprocessors.
487 - Optimized "Multiset.multiset" and "FinFun.finfun".
488 - Improved efficiency of "destroy_constrs" optimization.
489 - Fixed soundness bugs related to "destroy_constrs" optimization and
491 - Fixed soundness bug related to higher-order constructors.
492 - Fixed soundness bug when "full_descrs" is enabled.
493 - Improved precision of set constructs.
494 - Added "atoms" option.
495 - Added cache to speed up repeated Kodkod invocations on the same
497 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
498 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
499 "SAT4J_Light". INCOMPATIBILITY.
500 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
501 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
502 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
507 * Variable names in lemmas generated by the domain package have
508 changed; the naming scheme is now consistent with the HOL datatype
509 package. Some proof scripts may be affected, INCOMPATIBILITY.
511 * The domain package no longer defines the function "foo_copy" for
512 recursive domain "foo". The reach lemma is now stated directly in
513 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
514 be reformulated in terms of "foo_take", INCOMPATIBILITY.
516 * Most definedness lemmas generated by the domain package (previously
517 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
518 like "foo$x = UU <-> x = UU", which works better as a simp rule.
519 Proofs that used definedness lemmas as intro rules may break,
520 potential INCOMPATIBILITY.
522 * Induction and casedist rules generated by the domain package now
523 declare proper case_names (one called "bottom", and one named for each
524 constructor). INCOMPATIBILITY.
526 * For mutually-recursive domains, separate "reach" and "take_lemma"
527 rules are generated for each domain, INCOMPATIBILITY.
529 foo_bar.reach ~> foo.reach bar.reach
530 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
532 * Some lemmas generated by the domain package have been renamed for
533 consistency with the datatype package, INCOMPATIBILITY.
535 foo.ind ~> foo.induct
536 foo.finite_ind ~> foo.finite_induct
537 foo.coind ~> foo.coinduct
538 foo.casedist ~> foo.exhaust
539 foo.exhaust ~> foo.nchotomy
541 * For consistency with other definition packages, the fixrec package
542 now generates qualified theorem names, INCOMPATIBILITY.
544 foo_simps ~> foo.simps
545 foo_unfold ~> foo.unfold
546 foo_induct ~> foo.induct
548 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
549 method and internal fixrec proofs now use the default simpset instead.
552 * The "contlub" predicate has been removed. Proof scripts should use
553 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
555 * The "admw" predicate has been removed, INCOMPATIBILITY.
557 * The constants cpair, cfst, and csnd have been removed in favor of
558 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
563 * Antiquotations for basic formal entities:
565 @{class NAME} -- type class
566 @{class_syntax NAME} -- syntax representation of the above
568 @{type_name NAME} -- logical type
569 @{type_abbrev NAME} -- type abbreviation
570 @{nonterminal NAME} -- type of concrete syntactic category
571 @{type_syntax NAME} -- syntax representation of any of the above
573 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
574 @{const_abbrev NAME} -- abbreviated constant
575 @{const_syntax NAME} -- syntax representation of any of the above
577 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
578 syntax constant (cf. 'syntax' command).
580 * Antiquotation @{make_string} inlines a function to print arbitrary
581 values similar to the ML toplevel. The result is compiler dependent
582 and may fall back on "?" in certain situations.
584 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
585 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
586 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
587 not work with the asynchronous Isar document model.
589 * Configuration options now admit dynamic default values, depending on
590 the context or even global references.
592 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
593 uses an efficient external library if available (for Poly/ML).
595 * Renamed some important ML structures, while keeping the old names
596 for some time as aliases within the structure Legacy:
598 OuterKeyword ~> Keyword
601 OuterSyntax ~> Outer_Syntax
602 PrintMode ~> Print_Mode
603 SpecParse ~> Parse_Spec
606 ThyOutput ~> Thy_Output
607 TypeInfer ~> Type_Infer
609 Note that "open Legacy" simplifies porting of sources, but forgetting
610 to remove it again will complicate porting again in the future.
612 * Most operations that refer to a global context are named
613 accordingly, e.g. Simplifier.global_context or
614 ProofContext.init_global. There are some situations where a global
615 context actually works, but under normal circumstances one needs to
616 pass the proper local context through the code!
618 * Discontinued old TheoryDataFun with its copy/init operation -- data
619 needs to be pure. Functor Theory_Data_PP retains the traditional
620 Pretty.pp argument to merge, which is absent in the standard
623 * Sorts.certify_sort and derived "cert" operations for types and terms
624 no longer minimize sorts. Thus certification at the boundary of the
625 inference kernel becomes invariant under addition of class relations,
626 which is an important monotonicity principle. Sorts are now minimized
627 in the syntax layer only, at the boundary between the end-user and the
628 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
629 explicitly in rare situations.
631 * Renamed old-style Drule.standard to Drule.export_without_context, to
632 emphasize that this is in no way a standard operation.
635 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
636 usual for resolution. Rare INCOMPATIBILITY.
638 * Renamed varify/unvarify operations to varify_global/unvarify_global
639 to emphasize that these only work in a global situation (which is
642 * Curried take and drop in library.ML; negative length is interpreted
643 as infinity (as in chop). Subtle INCOMPATIBILITY.
645 * Proof terms: type substitutions on proof constants now use canonical
646 order of type variables. INCOMPATIBILITY for tools working with proof
649 * Raw axioms/defs may no longer carry sort constraints, and raw defs
650 may no longer carry premises. User-level specifications are
651 transformed accordingly by Thm.add_axiom/add_def.
656 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
657 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
658 proof terms are enabled unconditionally in the new HOL-Proofs image.
660 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
661 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
664 * Old lib/scripts/polyml-platform is superseded by the
665 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
666 variant, even on a 64 bit machine. The following example setting
667 prefers 64 bit if available:
669 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
671 * The preliminary Isabelle/jEdit application demonstrates the emerging
672 Isabelle/Scala layer for advanced prover interaction and integration.
673 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
678 New in Isabelle2009-1 (December 2009)
679 -------------------------------------
683 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
684 one backslash should be used, even in ML sources.
689 * Locale interpretation propagates mixins along the locale hierarchy.
690 The currently only available mixins are the equations used to map
691 local definitions to terms of the target domain of an interpretation.
693 * Reactivated diagnostic command 'print_interps'. Use "print_interps
694 loc" to print all interpretations of locale "loc" in the theory.
695 Interpretations in proofs are not shown.
697 * Thoroughly revised locales tutorial. New section on conditional
700 * On instantiation of classes, remaining undefined class parameters
701 are formally declared. INCOMPATIBILITY.
704 *** Document preparation ***
706 * New generalized style concept for printing terms: @{foo (style) ...}
707 instead of @{foo_style style ...} (old form is still retained for
708 backward compatibility). Styles can be also applied for
709 antiquotations prop, term_type and typeof.
714 * New proof method "smt" for a combination of first-order logic with
715 equality, linear and nonlinear (natural/integer/real) arithmetic, and
716 fixed-size bitvectors; there is also basic support for higher-order
717 features (esp. lambda abstractions). It is an incomplete decision
718 procedure based on external SMT solvers using the oracle mechanism;
719 for the SMT solver Z3, this method is proof-producing. Certificates
720 are provided to avoid calling the external solvers solely for
721 re-checking proofs. Due to a remote SMT service there is no need for
722 installing SMT solvers locally. See src/HOL/SMT.
724 * New commands to load and prove verification conditions generated by
725 the Boogie program verifier or derived systems (e.g. the Verifying C
726 Compiler (VCC) or Spec#). See src/HOL/Boogie.
728 * New counterexample generator tool 'nitpick' based on the Kodkod
729 relational model finder. See src/HOL/Tools/Nitpick and
730 src/HOL/Nitpick_Examples.
732 * New commands 'code_pred' and 'values' to invoke the predicate
733 compiler and to enumerate values of inductive predicates.
735 * A tabled implementation of the reflexive transitive closure.
737 * New implementation of quickcheck uses generic code generator;
738 default generators are provided for all suitable HOL types, records
739 and datatypes. Old quickcheck can be re-activated importing theory
740 Library/SML_Quickcheck.
742 * New testing tool Mirabelle for automated proof tools. Applies
743 several tools and tactics like sledgehammer, metis, or quickcheck, to
744 every proof step in a theory. To be used in batch mode via the
747 * New proof method "sos" (sum of squares) for nonlinear real
748 arithmetic (originally due to John Harison). It requires theory
749 Library/Sum_Of_Squares. It is not a complete decision procedure but
750 works well in practice on quantifier-free real arithmetic with +, -,
751 *, ^, =, <= and <, i.e. boolean combinations of equalities and
752 inequalities between polynomials. It makes use of external
753 semidefinite programming solvers. Method "sos" generates a
754 certificate that can be pasted into the proof thus avoiding the need
755 to call an external tool every time the proof is checked. See
756 src/HOL/Library/Sum_Of_Squares.
758 * New method "linarith" invokes existing linear arithmetic decision
761 * New command 'atp_minimal' reduces result produced by Sledgehammer.
763 * New Sledgehammer option "Full Types" in Proof General settings menu.
764 Causes full type information to be output to the ATPs. This slows
765 ATPs down considerably but eliminates a source of unsound "proofs"
768 * New method "metisFT": A version of metis that uses full type
769 information in order to avoid failures of proof reconstruction.
771 * New evaluator "approximate" approximates an real valued term using
772 the same method as the approximation method.
774 * Method "approximate" now supports arithmetic expressions as
775 boundaries of intervals and implements interval splitting and Taylor
778 * ML antiquotation @{code_datatype} inserts definition of a datatype
779 generated by the code generator; e.g. see src/HOL/Predicate.thy.
781 * New theory SupInf of the supremum and infimum operators for sets of
784 * New theory Probability, which contains a development of measure
785 theory, eventually leading to Lebesgue integration and probability.
787 * Extended Multivariate Analysis to include derivation and Brouwer's
790 * Reorganization of number theory, INCOMPATIBILITY:
791 - new number theory development for nat and int, in theories Divides
792 and GCD as well as in new session Number_Theory
793 - some constants and facts now suffixed with _nat and _int
795 - former session NumberTheory now named Old_Number_Theory, including
796 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
797 - moved theory Pocklington from src/HOL/Library to
798 src/HOL/Old_Number_Theory
800 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
801 lcm of finite and infinite sets. It is shown that they form a complete
804 * Class semiring_div requires superclass no_zero_divisors and proof of
805 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
806 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
807 generalized to class semiring_div, subsuming former theorems
808 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
809 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
812 * Refinements to lattice classes and sets:
813 - less default intro/elim rules in locale variant, more default
814 intro/elim rules in class variant: more uniformity
815 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
817 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
819 - renamed ACI to inf_sup_aci
820 - new class "boolean_algebra"
821 - class "complete_lattice" moved to separate theory
822 "Complete_Lattice"; corresponding constants (and abbreviations)
823 renamed and with authentic syntax:
824 Set.Inf ~> Complete_Lattice.Inf
825 Set.Sup ~> Complete_Lattice.Sup
826 Set.INFI ~> Complete_Lattice.INFI
827 Set.SUPR ~> Complete_Lattice.SUPR
828 Set.Inter ~> Complete_Lattice.Inter
829 Set.Union ~> Complete_Lattice.Union
830 Set.INTER ~> Complete_Lattice.INTER
831 Set.UNION ~> Complete_Lattice.UNION
832 - authentic syntax for
835 - mere abbreviations:
838 Set.inter (for inf, formerly Set.Int)
839 Set.union (for sup, formerly Set.Un)
840 Complete_Lattice.Inter (for Inf)
841 Complete_Lattice.Union (for Sup)
842 Complete_Lattice.INTER (for INFI)
843 Complete_Lattice.UNION (for SUPR)
844 - object-logic definitions as far as appropriate
846 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
847 Un_subset_iff are explicitly deleted as default simp rules; then also
848 their lattice counterparts le_inf_iff and le_sup_iff have to be
849 deleted to achieve the desired effect.
851 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
852 rules by default any longer; the same applies to min_max.inf_absorb1
853 etc. INCOMPATIBILITY.
855 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
856 pred_set_conv by default. INCOMPATIBILITY.
858 * Power operations on relations and functions are now one dedicated
859 constant "compow" with infix syntax "^^". Power operation on
860 multiplicative monoids retains syntax "^" and is now defined generic
861 in class power. INCOMPATIBILITY.
863 * Relation composition "R O S" now has a more standard argument order:
864 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
865 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
866 break, since the O_assoc rule was not rewritten like this. Fix using
867 O_assoc[symmetric]. The same applies to the curried version "R OO S".
869 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
870 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
873 * Most rules produced by inductive and datatype package have mandatory
874 prefixes. INCOMPATIBILITY.
876 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
877 the attribute of the same name. Each of the theorems in the list
878 DERIV_intros assumes composition with an additional function and
879 matches a variable to the derivative, which has to be solved by the
880 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
881 of most elementary terms. Former Maclauren.DERIV_tac and
882 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
885 * Code generator attributes follow the usual underscore convention:
886 code_unfold replaces code unfold
887 code_post replaces code post
892 sizechange -> size_change
893 induct_scheme -> induction_schema
896 * Discontinued abbreviation "arbitrary" of constant "undefined".
897 INCOMPATIBILITY, use "undefined" directly.
900 Suc_eq_add_numeral_1 -> Suc_eq_plus1
901 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
902 Suc_plus1 -> Suc_eq_plus1
903 *anti_sym -> *antisym*
904 vector_less_eq_def -> vector_le_def
907 * Added theorem List.map_map as [simp]. Removed List.map_compose.
910 * Removed predicate "M hassize n" (<--> card M = n & finite M).
916 * Theory Representable defines a class "rep" of domains that are
917 representable (via an ep-pair) in the universal domain type "udom".
918 Instances are provided for all type constructors defined in HOLCF.
920 * The 'new_domain' command is a purely definitional version of the
921 domain package, for representable domains. Syntax is identical to the
922 old domain package. The 'new_domain' package also supports indirect
923 recursion using previously-defined type constructors. See
924 src/HOLCF/ex/New_Domain.thy for examples.
926 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
927 on the left-hand side of an equation, and then performs
928 simplification. Rewriting is done using rules declared with the
929 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
930 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
932 * The pattern-match compiler in 'fixrec' can now handle constructors
933 with HOL function types. Pattern-match combinators for the Pair
934 constructor are pre-configured.
936 * The 'fixrec' package now produces better fixed-point induction rules
937 for mutually-recursive definitions: Induction rules have conclusions
938 of the form "P foo bar" instead of "P <foo, bar>".
940 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
941 been renamed to "below". The name "below" now replaces "less" in many
942 theorem names. (Legacy theorem names using "less" are still supported
945 * The 'fixrec' package now supports "bottom patterns". Bottom
946 patterns can be used to generate strictness rules, or to make
947 functions more strict (much like the bang-patterns supported by the
948 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
954 * Support for Poly/ML 5.3.0, with improved reporting of compiler
955 errors and run-time exceptions, including detailed source positions.
957 * Structure Name_Space (formerly NameSpace) now manages uniquely
958 identified entries, with some additional information such as source
959 position, logical grouping etc.
961 * Theory and context data is now introduced by the simplified and
962 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
963 to be pure, but the old TheoryDataFun for mutable data (with explicit
964 copy operation) is still available for some time.
966 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
967 provides a high-level programming interface to synchronized state
968 variables with atomic update. This works via pure function
969 application within a critical section -- its runtime should be as
970 short as possible; beware of deadlocks if critical code is nested,
971 either directly or indirectly via other synchronized variables!
973 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
974 wraps raw ML references, explicitly indicating their non-thread-safe
975 behaviour. The Isar toplevel keeps this structure open, to
976 accommodate Proof General as well as quick and dirty interactive
977 experiments with references.
979 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
980 parallel tactical reasoning.
982 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
983 are similar to SUBPROOF, but are slightly more flexible: only the
984 specified parts of the subgoal are imported into the context, and the
985 body tactic may introduce new subgoals and schematic variables.
987 * Old tactical METAHYPS, which does not observe the proof context, has
988 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
989 or Subgoal.FOCUS etc.
991 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
992 functors have their own ML name space there is no point to mark them
993 separately.) Minor INCOMPATIBILITY.
995 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
997 * Renamed several structures FooBar to Foo_Bar. Occasional,
1000 * Operations of structure Skip_Proof no longer require quick_and_dirty
1001 mode, which avoids critical setmp.
1003 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1004 combinators for "args". INCOMPATIBILITY, need to use simplified
1005 Attrib/Method.setup introduced in Isabelle2009.
1007 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1008 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1009 last resort. INCOMPATIBILITY.
1011 * Display.pretty_thm now requires a proper context (cf. former
1012 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1013 or even Display.pretty_thm_without_context as last resort.
1016 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1017 Syntax.pretty_typ/term directly, preferably with proper context
1018 instead of global theory.
1023 * Further fine tuning of parallel proof checking, scales up to 8 cores
1024 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1027 * Support for additional "Isabelle components" via etc/components, see
1028 also the system manual.
1030 * The isabelle makeall tool now operates on all components with
1031 IsaMakefile, not just hardwired "logics".
1033 * Removed "compress" option from isabelle-process and isabelle usedir;
1034 this is always enabled.
1036 * Discontinued support for Poly/ML 4.x versions.
1038 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1039 on a given logic image. This requires the lighttpd webserver and is
1040 currently supported on Linux only.
1044 New in Isabelle2009 (April 2009)
1045 --------------------------------
1049 * Simplified main Isabelle executables, with less surprises on
1050 case-insensitive file-systems (such as Mac OS).
1052 - The main Isabelle tool wrapper is now called "isabelle" instead of
1055 - The former "isabelle" alias for "isabelle-process" has been
1056 removed (should rarely occur to regular users).
1058 - The former "isabelle-interface" and its alias "Isabelle" have been
1059 removed (interfaces are now regular Isabelle tools).
1061 Within scripts and make files, the Isabelle environment variables
1062 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1063 respectively. (The latter are still available as legacy feature.)
1065 The old isabelle-interface wrapper could react in confusing ways if
1066 the interface was uninstalled or changed otherwise. Individual
1067 interface tool configuration is now more explicit, see also the
1068 Isabelle system manual. In particular, Proof General is now available
1069 via "isabelle emacs".
1071 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1072 purge installed copies of Isabelle executables and re-run "isabelle
1073 install -p ...", or use symlinks.
1075 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1076 old ~/isabelle, which was slightly non-standard and apt to cause
1077 surprises on case-insensitive file-systems (such as Mac OS).
1079 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1080 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1081 care is required when using older releases of Isabelle. Note that
1082 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1083 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1085 * Proofs of fully specified statements are run in parallel on
1086 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1087 a regular 4-core machine, if the initial heap space is made reasonably
1088 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1090 * The main reference manuals ("isar-ref", "implementation", and
1091 "system") have been updated and extended. Formally checked references
1092 as hyperlinks are now available uniformly.
1097 * Complete re-implementation of locales. INCOMPATIBILITY in several
1098 respects. The most important changes are listed below. See the
1099 Tutorial on Locales ("locales" manual) for details.
1101 - In locale expressions, instantiation replaces renaming. Parameters
1102 must be declared in a for clause. To aid compatibility with previous
1103 parameter inheritance, in locale declarations, parameters that are not
1104 'touched' (instantiation position "_" or omitted) are implicitly added
1105 with their syntax at the beginning of the for clause.
1107 - Syntax from abbreviations and definitions in locales is available in
1108 locale expressions and context elements. The latter is particularly
1109 useful in locale declarations.
1111 - More flexible mechanisms to qualify names generated by locale
1112 expressions. Qualifiers (prefixes) may be specified in locale
1113 expressions, and can be marked as mandatory (syntax: "name!:") or
1114 optional (syntax "name?:"). The default depends for plain "name:"
1115 depends on the situation where a locale expression is used: in
1116 commands 'locale' and 'sublocale' prefixes are optional, in
1117 'interpretation' and 'interpret' prefixes are mandatory. The old
1118 implicit qualifiers derived from the parameter names of a locale are
1119 no longer generated.
1121 - Command "sublocale l < e" replaces "interpretation l < e". The
1122 instantiation clause in "interpretation" and "interpret" (square
1123 brackets) is no longer available. Use locale expressions.
1125 - When converting proof scripts, mandatory qualifiers in
1126 'interpretation' and 'interpret' should be retained by default, even
1127 if this is an INCOMPATIBILITY compared to former behavior. In the
1128 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1129 in locale expressions range over a single locale instance only.
1131 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1132 In existing theorem specifications replace the includes element by the
1133 respective context elements of the included locale, omitting those
1134 that are already present in the theorem specification. Multiple
1135 assume elements of a locale should be replaced by a single one
1136 involving the locale predicate. In the proof body, declarations (most
1137 notably theorems) may be regained by interpreting the respective
1138 locales in the proof context as required (command "interpret").
1140 If using "includes" in replacement of a target solely because the
1141 parameter types in the theorem are not as general as in the target,
1142 consider declaring a new locale with additional type constraints on
1143 the parameters (context element "constrains").
1145 - Discontinued "locale (open)". INCOMPATIBILITY.
1147 - Locale interpretation commands no longer attempt to simplify goal.
1148 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1149 methods intro_locales and unfold_locales to clarify.
1151 - Locale interpretation commands no longer accept interpretation
1152 attributes. INCOMPATIBILITY.
1154 * Class declaration: so-called "base sort" must not be given in import
1155 list any longer, but is inferred from the specification. Particularly
1162 class foo = type + ...
1164 * Class target: global versions of theorems stemming do not carry a
1165 parameter prefix any longer. INCOMPATIBILITY.
1167 * Class 'instance' command no longer accepts attached definitions.
1168 INCOMPATIBILITY, use proper 'instantiation' target instead.
1170 * Recovered hiding of consts, which was accidentally broken in
1171 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1172 makes c inaccessible; consider using ``hide (open) const c'' instead.
1174 * Slightly more coherent Pure syntax, with updated documentation in
1175 isar-ref manual. Removed locales meta_term_syntax and
1176 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1177 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1178 directly in regular applications.
1180 * There is a new syntactic category "float_const" for signed decimal
1181 fractions (e.g. 123.45 or -123.45).
1183 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1184 interface with 'setup' command instead.
1186 * Command 'local_setup' is similar to 'setup', but operates on a local
1189 * The 'axiomatization' command now only works within a global theory
1190 context. INCOMPATIBILITY.
1192 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1193 hypotheses. Sorts required in the course of reasoning need to be
1194 covered by the constraints in the initial statement, completed by the
1195 type instance information of the background theory. Non-trivial sort
1196 hypotheses, which rarely occur in practice, may be specified via
1197 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1199 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1201 The result contains an implicit sort hypotheses as before --
1202 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1205 * Generalized Isar history, with support for linear undo, direct state
1208 * Changed defaults for unify configuration options:
1210 unify_trace_bound = 50 (formerly 25)
1211 unify_search_bound = 60 (formerly 30)
1213 * Different bookkeeping for code equations (INCOMPATIBILITY):
1215 a) On theory merge, the last set of code equations for a particular
1216 constant is taken (in accordance with the policy applied by other
1217 parts of the code generator framework).
1219 b) Code equations stemming from explicit declarations (e.g. code
1220 attribute) gain priority over default code equations stemming
1221 from definition, primrec, fun etc.
1223 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1225 * Unified theorem tables for both code generators. Thus [code
1226 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1228 * Command 'find_consts' searches for constants based on type and name
1231 find_consts "_ => bool"
1233 By default, matching is against subtypes, but it may be restricted to
1234 the whole type. Searching by name is possible. Multiple queries are
1235 conjunctive and queries may be negated by prefixing them with a
1238 find_consts strict: "_ => bool" name: "Int" -"int => int"
1240 * New 'find_theorems' criterion "solves" matches theorems that
1241 directly solve the current goal (modulo higher-order unification).
1243 * Auto solve feature for main theorem statements: whenever a new goal
1244 is stated, "find_theorems solves" is called; any theorems that could
1245 solve the lemma directly are listed as part of the goal state.
1246 Cf. associated options in Proof General Isabelle settings menu,
1247 enabled by default, with reasonable timeout for pathological cases of
1248 higher-order unification.
1251 *** Document preparation ***
1253 * Antiquotation @{lemma} now imitates a regular terminal proof,
1254 demanding keyword 'by' and supporting the full method expression
1255 syntax just like the Isar command 'by'.
1260 * Integrated main parts of former image HOL-Complex with HOL. Entry
1261 points Main and Complex_Main remain as before.
1263 * Logic image HOL-Plain provides a minimal HOL with the most important
1264 tools available (inductive, datatype, primrec, ...). This facilitates
1265 experimentation and tool development. Note that user applications
1266 (and library theories) should never refer to anything below theory
1269 * Logic image HOL-Main stops at theory Main, and thus facilitates
1270 experimentation due to shorter build times.
1272 * Logic image HOL-NSA contains theories of nonstandard analysis which
1273 were previously part of former HOL-Complex. Entry point Hyperreal
1274 remains valid, but theories formerly using Complex_Main should now use
1275 new entry point Hypercomplex.
1277 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1278 Posix processes. Avoids potentially expensive forking of the ML
1279 process. New thread-based implementation also works on non-Unix
1280 platforms (Cygwin). Provers are no longer hardwired, but defined
1281 within the theory via plain ML wrapper functions. Basic Sledgehammer
1282 commands are covered in the isar-ref manual.
1284 * Wrapper scripts for remote SystemOnTPTP service allows to use
1285 sledgehammer without local ATP installation (Vampire etc.). Other
1286 provers may be included via suitable ML wrappers, see also
1287 src/HOL/ATP_Linkup.thy.
1289 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1292 * The metis method no longer fails because the theorem is too trivial
1293 (contains the empty clause).
1295 * The metis method now fails in the usual manner, rather than raising
1296 an exception, if it determines that it cannot prove the theorem.
1298 * Method "coherent" implements a prover for coherent logic (see also
1299 src/Tools/coherent.ML).
1301 * Constants "undefined" and "default" replace "arbitrary". Usually
1302 "undefined" is the right choice to replace "arbitrary", though
1303 logically there is no difference. INCOMPATIBILITY.
1305 * Command "value" now integrates different evaluation mechanisms. The
1306 result of the first successful evaluation mechanism is printed. In
1307 square brackets a particular named evaluation mechanisms may be
1308 specified (currently, [SML], [code] or [nbe]). See further
1309 src/HOL/ex/Eval_Examples.thy.
1311 * Normalization by evaluation now allows non-leftlinear equations.
1312 Declare with attribute [code nbe].
1314 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1315 as the structured Isar versions "cases" and "induct", cf. the
1316 corresponding "cases" and "induct" attributes. Mutual induction rules
1317 are now presented as a list of individual projections
1318 (e.g. foo_bar.inducts for types foo and bar); the old format with
1319 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1320 rare situations a different rule is selected --- notably nested tuple
1321 elimination instead of former prod.exhaust: use explicit (case_tac t
1322 rule: prod.exhaust) here.
1324 * Attributes "cases", "induct", "coinduct" support "del" option.
1326 * Removed fact "case_split_thm", which duplicates "case_split".
1328 * The option datatype has been moved to a new theory Option. Renamed
1329 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1331 * New predicate "strict_mono" classifies strict functions on partial
1332 orders. With strict functions on linear orders, reasoning about
1333 (in)equalities is facilitated by theorems "strict_mono_eq",
1334 "strict_mono_less_eq" and "strict_mono_less".
1336 * Some set operations are now proper qualified constants with
1337 authentic syntax. INCOMPATIBILITY:
1348 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1351 * Auxiliary class "itself" has disappeared -- classes without any
1352 parameter are treated as expected by the 'class' command.
1354 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1356 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1357 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1359 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1360 method "approximation". It proves formulas on real values by using
1361 interval arithmetic. In the formulas are also the transcendental
1362 functions sin, cos, tan, atan, ln, exp and the constant pi are
1363 allowed. For examples see
1364 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1366 * Theory "Reflection" now resides in HOL/Library.
1368 * Entry point to Word library now simply named "Word".
1371 * Made source layout more coherent with logical distribution
1374 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1375 src/HOL/Library/Code_Message.thy ~> src/HOL/
1376 src/HOL/Library/GCD.thy ~> src/HOL/
1377 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1378 src/HOL/Library/Parity.thy ~> src/HOL/
1379 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1380 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1381 src/HOL/Real/Lubs.thy ~> src/HOL/
1382 src/HOL/Real/PReal.thy ~> src/HOL/
1383 src/HOL/Real/Rational.thy ~> src/HOL/
1384 src/HOL/Real/RComplete.thy ~> src/HOL/
1385 src/HOL/Real/RealDef.thy ~> src/HOL/
1386 src/HOL/Real/RealPow.thy ~> src/HOL/
1387 src/HOL/Real/Real.thy ~> src/HOL/
1388 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1389 src/HOL/Complex/Complex.thy ~> src/HOL/
1390 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1391 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1392 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1393 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1394 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1395 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1396 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1397 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1398 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1399 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1400 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1401 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1402 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1403 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1404 src/HOL/Real/Float ~> src/HOL/Library/
1405 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1406 src/HOL/Real/RealVector.thy ~> src/HOL/
1408 src/HOL/arith_data.ML ~> src/HOL/Tools
1409 src/HOL/hologic.ML ~> src/HOL/Tools
1410 src/HOL/simpdata.ML ~> src/HOL/Tools
1411 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1412 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1413 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1414 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1415 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1416 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1417 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1419 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1420 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1421 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1422 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1423 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1424 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1426 * If methods "eval" and "evaluation" encounter a structured proof
1427 state with !!/==>, only the conclusion is evaluated to True (if
1428 possible), avoiding strange error messages.
1430 * Method "sizechange" automates termination proofs using (a
1431 modification of) the size-change principle. Requires SAT solver. See
1432 src/HOL/ex/Termination.thy for examples.
1434 * Simplifier: simproc for let expressions now unfolds if bound
1435 variable occurs at most once in let expression body. INCOMPATIBILITY.
1437 * Method "arith": Linear arithmetic now ignores all inequalities when
1438 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1440 * New attribute "arith" for facts that should always be used
1441 automatically by arithmetic. It is intended to be used locally in
1444 assumes [arith]: "x > 0"
1446 Global usage is discouraged because of possible performance impact.
1448 * New classes "top" and "bot" with corresponding operations "top" and
1449 "bot" in theory Orderings; instantiation of class "complete_lattice"
1450 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1452 * Changed definition lemma "less_fun_def" in order to provide an
1453 instance for preorders on functions; use lemma "less_le" instead.
1456 * Theory Orderings: class "wellorder" moved here, with explicit
1457 induction rule "less_induct" as assumption. For instantiation of
1458 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1461 * Theory Orderings: added class "preorder" as superclass of "order".
1462 INCOMPATIBILITY: Instantiation proofs for order, linorder
1463 etc. slightly changed. Some theorems named order_class.* now named
1466 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1469 * Theory Finite_Set: added a new fold combinator of type
1471 ('a => 'b => 'b) => 'b => 'a set => 'b
1473 Occasionally this is more convenient than the old fold combinator
1474 which is now defined in terms of the new one and renamed to
1477 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1478 and "ring_simps" have been replaced by "algebra_simps" (which can be
1479 extended with further lemmas!). At the moment both still exist but
1480 the former will disappear at some point.
1482 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1483 class recpower. Type-specific simp rules for various recpower types
1484 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1486 rat_power_0 -> power_0
1487 rat_power_Suc -> power_Suc
1488 realpow_0 -> power_0
1489 realpow_Suc -> power_Suc
1490 complexpow_0 -> power_0
1491 complexpow_Suc -> power_Suc
1492 power_poly_0 -> power_0
1493 power_poly_Suc -> power_Suc
1495 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1496 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1497 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1498 of lemmas from Divides has been generalized from nat to class
1499 semiring_div. INCOMPATIBILITY. This involves the following theorem
1500 renames resulting from duplicate elimination:
1502 dvd_def_mod ~> dvd_eq_mod_eq_0
1503 zero_dvd_iff ~> dvd_0_left_iff
1504 dvd_0 ~> dvd_0_right
1505 DIVISION_BY_ZERO_DIV ~> div_by_0
1506 DIVISION_BY_ZERO_MOD ~> mod_by_0
1507 mult_div ~> div_mult_self2_is_id
1508 mult_mod ~> mod_mult_self2_is_0
1510 * Theory IntDiv: removed many lemmas that are instances of class-based
1511 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1512 rename old lemmas as follows:
1514 dvd_diff -> nat_dvd_diff
1515 dvd_zminus_iff -> dvd_minus_iff
1516 mod_add1_eq -> mod_add_eq
1517 mod_mult1_eq -> mod_mult_right_eq
1518 mod_mult1_eq' -> mod_mult_left_eq
1519 mod_mult_distrib_mod -> mod_mult_eq
1520 nat_mod_add_left_eq -> mod_add_left_eq
1521 nat_mod_add_right_eq -> mod_add_right_eq
1522 nat_mod_div_trivial -> mod_div_trivial
1523 nat_mod_mod_trivial -> mod_mod_trivial
1524 zdiv_zadd_self1 -> div_add_self1
1525 zdiv_zadd_self2 -> div_add_self2
1526 zdiv_zmult_self1 -> div_mult_self2_is_id
1527 zdiv_zmult_self2 -> div_mult_self1_is_id
1528 zdvd_triv_left -> dvd_triv_left
1529 zdvd_triv_right -> dvd_triv_right
1530 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1531 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1532 zmod_zadd_left_eq -> mod_add_left_eq
1533 zmod_zadd_right_eq -> mod_add_right_eq
1534 zmod_zadd_self1 -> mod_add_self1
1535 zmod_zadd_self2 -> mod_add_self2
1536 zmod_zadd1_eq -> mod_add_eq
1537 zmod_zdiff1_eq -> mod_diff_eq
1538 zmod_zdvd_zmod -> mod_mod_cancel
1539 zmod_zmod_cancel -> mod_mod_cancel
1540 zmod_zmult_self1 -> mod_mult_self2_is_0
1541 zmod_zmult_self2 -> mod_mult_self1_is_0
1544 zdvd_abs1 -> abs_dvd_iff
1545 zdvd_abs2 -> dvd_abs_iff
1546 zdvd_refl -> dvd_refl
1547 zdvd_trans -> dvd_trans
1548 zdvd_zadd -> dvd_add
1549 zdvd_zdiff -> dvd_diff
1550 zdvd_zminus_iff -> dvd_minus_iff
1551 zdvd_zminus2_iff -> minus_dvd_iff
1552 zdvd_zmultD -> dvd_mult_right
1553 zdvd_zmultD2 -> dvd_mult_left
1554 zdvd_zmult_mono -> mult_dvd_mono
1555 zdvd_0_right -> dvd_0_right
1556 zdvd_0_left -> dvd_0_left_iff
1557 zdvd_1_left -> one_dvd
1558 zminus_dvd_iff -> minus_dvd_iff
1560 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1562 * The real numbers offer decimal input syntax: 12.34 is translated
1563 into 1234/10^2. This translation is not reversed upon output.
1565 * Theory Library/Polynomial defines an abstract type 'a poly of
1566 univariate polynomials with coefficients of type 'a. In addition to
1567 the standard ring operations, it also supports div and mod. Code
1568 generation is also supported, using list-style constructors.
1570 * Theory Library/Inner_Product defines a class of real_inner for real
1571 inner product spaces, with an overloaded operation inner :: 'a => 'a
1572 => real. Class real_inner is a subclass of real_normed_vector from
1575 * Theory Library/Product_Vector provides instances for the product
1576 type 'a * 'b of several classes from RealVector and Inner_Product.
1577 Definitions of addition, subtraction, scalar multiplication, norms,
1578 and inner products are included.
1580 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1581 addition to the field operations, numerals and case syntax are also
1584 * Theory Library/Diagonalize provides constructive version of Cantor's
1585 first diagonalization argument.
1587 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1588 zlcm (for int); carried together from various gcd/lcm developements in
1589 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1590 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1591 may recover tupled syntax as follows:
1593 hide (open) const gcd
1594 abbreviation gcd where
1595 "gcd == (%(a, b). GCD.gcd a b)"
1597 GCD.gcd ("gcd '(_, _')")
1599 The same works for lcm, zgcd, zlcm.
1601 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1602 instantiations for algebraic structures. Removed some duplicate
1603 theorems. Changes in simp rules. INCOMPATIBILITY.
1605 * ML antiquotation @{code} takes a constant as argument and generates
1606 corresponding code in background and inserts name of the corresponding
1607 resulting ML value/function/datatype constructor binding in place.
1608 All occurrences of @{code} with a single ML block are generated
1609 simultaneously. Provides a generic and safe interface for
1610 instrumentalizing code generation. See
1611 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1612 In future you ought to refrain from ad-hoc compiling generated SML
1613 code on the ML toplevel. Note that (for technical reasons) @{code}
1614 cannot refer to constants for which user-defined serializations are
1615 set. Refer to the corresponding ML counterpart directly in that
1618 * Command 'rep_datatype': instead of theorem names the command now
1619 takes a list of terms denoting the constructors of the type to be
1620 represented as datatype. The characteristic theorems have to be
1621 proven. INCOMPATIBILITY. Also observe that the following theorems
1622 have disappeared in favour of existing ones:
1624 unit_induct ~> unit.induct
1625 prod_induct ~> prod.induct
1626 sum_induct ~> sum.induct
1627 Suc_Suc_eq ~> nat.inject
1628 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1633 * New locales for orders and lattices where the equivalence relation
1634 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1635 locales use a record structure with field eq for the equivalence.
1637 * New theory of factorial domains.
1639 * Units_l_inv and Units_r_inv are now simp rules by default.
1640 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1641 and/or r_inv will now also require deletion of these lemmas.
1643 * Renamed the following theorems, INCOMPATIBILITY:
1645 UpperD ~> Upper_memD
1646 LowerD ~> Lower_memD
1647 least_carrier ~> least_closed
1648 greatest_carrier ~> greatest_closed
1649 greatest_Lower_above ~> greatest_Lower_below
1650 one_zero ~> carrier_one_zero
1651 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1656 * Nominal datatypes can now contain type-variables.
1658 * Commands 'nominal_inductive' and 'equivariance' work with local
1661 * Nominal primrec can now works with local theory targets and its
1662 specification syntax now conforms to the general format as seen in
1665 * Method "perm_simp" honours the standard simplifier attributes
1666 (no_asm), (no_asm_use) etc.
1668 * The new predicate #* is defined like freshness, except that on the
1669 left hand side can be a set or list of atoms.
1671 * Experimental command 'nominal_inductive2' derives strong induction
1672 principles for inductive definitions. In contrast to
1673 'nominal_inductive', which can only deal with a fixed number of
1674 binders, it can deal with arbitrary expressions standing for sets of
1675 atoms to be avoided. The only inductive definition we have at the
1676 moment that needs this generalisation is the typing rule for Lets in
1679 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1680 -----------------------------------------------------------------
1681 Gamma |- Let x be t1 in t2 : T2
1683 In this rule one wants to avoid all the binders that are introduced by
1684 "close Gamma T1". We are looking for other examples where this
1685 feature might be useful. Please let us know.
1690 * Reimplemented the simplification procedure for proving continuity
1691 subgoals. The new simproc is extensible; users can declare additional
1692 continuity introduction rules with the attribute [cont2cont].
1694 * The continuity simproc now uses a different introduction rule for
1695 solving continuity subgoals on terms with lambda abstractions. In
1696 some rare cases the new simproc may fail to solve subgoals that the
1697 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1698 Potential INCOMPATIBILITY.
1700 * Command 'fixrec': specification syntax now conforms to the general
1701 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1702 examples. INCOMPATIBILITY.
1707 * Proof of Zorn's Lemma for partial orders.
1712 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1713 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1714 depends on multithreading, so timouts will not work before Poly/ML
1717 * High-level support for concurrent ML programming, see
1718 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1719 particularly convenient to organize independent functional
1720 computations. The concept of "synchronized variables" provides a
1721 higher-order interface for components with shared state, avoiding the
1722 delicate details of mutexes and condition variables. (Requires
1723 Poly/ML 5.2.1 or later.)
1725 * ML bindings produced via Isar commands are stored within the Isar
1726 context (theory or proof). Consequently, commands like 'use' and 'ML'
1727 become thread-safe and work with undo as expected (concerning
1728 top-level bindings, not side-effects on global references).
1729 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1730 compiler at runtime; really global bindings need to be given outside a
1731 theory. (Requires Poly/ML 5.2 or later.)
1733 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1734 context. Top-level ML bindings are stored within the proof context in
1735 a purely sequential fashion, disregarding the nested proof structure.
1736 ML bindings introduced by 'ML_prf' are discarded at the end of the
1737 proof. (Requires Poly/ML 5.2 or later.)
1739 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1740 and Method.setup, as well as Isar commands 'attribute_setup' and
1741 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1742 existing code accordingly, or use plain 'setup' together with old
1745 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1746 to 'a -> thm, while results are always tagged with an authentic oracle
1747 name. The Isar command 'oracle' is now polymorphic, no argument type
1748 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1749 accordingly. Note that extra performance may be gained by producing
1750 the cterm carefully, avoiding slow Thm.cterm_of.
1752 * Simplified interface for defining document antiquotations via
1753 ThyOutput.antiquotation, ThyOutput.output, and optionally
1754 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1755 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1758 * More systematic treatment of long names, abstract name bindings, and
1759 name space operations. Basic operations on qualified names have been
1760 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1761 Long_Name.append. Old type bstring has been mostly replaced by
1762 abstract type binding (see structure Binding), which supports precise
1763 qualification by packages and local theory targets, as well as proper
1764 tracking of source positions. INCOMPATIBILITY, need to wrap old
1765 bstring values into Binding.name, or better pass through abstract
1766 bindings everywhere. See further src/Pure/General/long_name.ML,
1767 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1769 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1770 LocalTheory.note etc.) now refer to the *full* internal name, not the
1771 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1773 * Disposed old type and term read functions (Sign.read_def_typ,
1774 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1775 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1776 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1777 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1778 resort for legacy applications.
1780 * Disposed old declarations, tactics, tactic combinators that refer to
1781 the simpset or claset of an implicit theory (such as Addsimps,
1782 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1783 embedded ML text, or local_simpset_of with a proper context passed as
1784 explicit runtime argument.
1786 * Rules and tactics that read instantiations (read_instantiate,
1787 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1788 context, which is required for parsing and type-checking. Moreover,
1789 the variables are specified as plain indexnames, not string encodings
1790 thereof. INCOMPATIBILITY.
1792 * Generic Toplevel.add_hook interface allows to analyze the result of
1793 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1794 for theorem dependency output of transactions resulting in a new
1797 * ML antiquotations: block-structured compilation context indicated by
1798 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1800 @{binding name} - basic name binding
1801 @{let ?pat = term} - term abbreviation (HO matching)
1802 @{note name = fact} - fact abbreviation
1803 @{thm fact} - singleton fact (with attributes)
1804 @{thms fact} - general fact (with attributes)
1805 @{lemma prop by method} - singleton goal
1806 @{lemma prop by meth1 meth2} - singleton goal
1807 @{lemma prop1 ... propN by method} - general goal
1808 @{lemma prop1 ... propN by meth1 meth2} - general goal
1809 @{lemma (open) ...} - open derivation
1814 * The Isabelle "emacs" tool provides a specific interface to invoke
1815 Proof General / Emacs, with more explicit failure if that is not
1816 installed (the old isabelle-interface script silently falls back on
1817 isabelle-process). The PROOFGENERAL_HOME setting determines the
1818 installation location of the Proof General distribution.
1820 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1821 the Isabelle process into a JVM/Scala application. See
1822 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1823 process wrapper has been discontinued.)
1825 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1827 * Various status messages (with exact source position information) are
1828 emitted, if proper markup print mode is enabled. This allows
1829 user-interface components to provide detailed feedback on internal
1834 New in Isabelle2008 (June 2008)
1835 -------------------------------
1839 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1840 and updated, with formally checked references as hyperlinks.
1842 * Theory loader: use_thy (and similar operations) no longer set the
1843 implicit ML context, which was occasionally hard to predict and in
1844 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1845 provides a proper context already.
1847 * Theory loader: old-style ML proof scripts being *attached* to a thy
1848 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1849 'use' within a theory file will do the job.
1851 * Name space merge now observes canonical order, i.e. the second space
1852 is inserted into the first one, while existing entries in the first
1853 space take precedence. INCOMPATIBILITY in rare situations, may try to
1854 swap theory imports.
1856 * Syntax: symbol \<chi> is now considered a letter. Potential
1857 INCOMPATIBILITY in identifier syntax etc.
1859 * Outer syntax: string tokens no longer admit escaped white space,
1860 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1861 white space without escapes.
1863 * Outer syntax: string tokens may contain arbitrary character codes
1864 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1870 * Context-dependent token translations. Default setup reverts locally
1871 fixed variables, and adds hilite markup for undeclared frees.
1873 * Unused theorems can be found using the new command 'unused_thms'.
1874 There are three ways of invoking it:
1877 Only finds unused theorems in the current theory.
1879 (2) unused_thms thy_1 ... thy_n -
1880 Finds unused theorems in the current theory and all of its ancestors,
1881 excluding the theories thy_1 ... thy_n and all of their ancestors.
1883 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1884 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1885 their ancestors, excluding the theories thy_1 ... thy_n and all of
1888 In order to increase the readability of the list produced by
1889 unused_thms, theorems that have been created by a particular instance
1890 of a theory command such as 'inductive' or 'function' are considered
1891 to belong to the same "group", meaning that if at least one theorem in
1892 this group is used, the other theorems in the same group are no longer
1893 reported as unused. Moreover, if all theorems in the group are
1894 unused, only one theorem in the group is displayed.
1896 Note that proof objects have to be switched on in order for
1897 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1898 usually the case when using Proof General with the default settings).
1900 * Authentic naming of facts disallows ad-hoc overwriting of previous
1901 theorems within the same name space. INCOMPATIBILITY, need to remove
1902 duplicate fact bindings, or even accidental fact duplications. Note
1903 that tools may maintain dynamically scoped facts systematically, using
1904 PureThy.add_thms_dynamic.
1906 * Command 'hide' now allows to hide from "fact" name space as well.
1908 * Eliminated destructive theorem database, simpset, claset, and
1909 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1910 update of theories within ML code.
1912 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1913 INCOMPATIBILITY, object-logics depending on former Pure require
1914 additional setup PureThy.old_appl_syntax_setup; object-logics
1915 depending on former CPure need to refer to Pure.
1917 * Commands 'use' and 'ML' are now purely functional, operating on
1918 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1919 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1922 * Command 'setup': discontinued implicit version with ML reference.
1924 * Instantiation target allows for simultaneous specification of class
1925 instance operations together with an instantiation proof.
1926 Type-checking phase allows to refer to class operations uniformly.
1927 See src/HOL/Complex/Complex.thy for an Isar example and
1928 src/HOL/Library/Eval.thy for an ML example.
1930 * Indexing of literal facts: be more serious about including only
1931 facts from the visible specification/proof context, but not the
1932 background context (locale etc.). Affects `prop` notation and method
1933 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1936 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1937 "(open)" option, which used to expose internal bound variables to the
1940 * Isar statements: removed obsolete case "rule_context".
1941 INCOMPATIBILITY, better use explicit fixes/assumes.
1943 * Locale proofs: default proof step now includes 'unfold_locales';
1944 hence 'proof' without argument may be used to unfold locale
1948 *** Document preparation ***
1950 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1951 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1952 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1953 spot); renamed link color from "darkblue" to "linkcolor" (default
1954 value unchanged, can be redefined via \definecolor); no longer sets
1955 "a4paper" option (unnecessary or even intrusive).
1957 * Antiquotation @{lemma A method} proves proposition A by the given
1958 method (either a method name or a method name plus (optional) method
1959 arguments in parentheses) and prints A just like @{prop A}.
1964 * New primrec package. Specification syntax conforms in style to
1965 definition/function/.... No separate induction rule is provided. The
1966 "primrec" command distinguishes old-style and new-style specifications
1967 by syntax. The former primrec package is now named OldPrimrecPackage.
1968 When adjusting theories, beware: constants stemming from new-style
1969 primrec specifications have authentic syntax.
1971 * Metis prover is now an order of magnitude faster, and also works
1972 with multithreading.
1974 * Metis: the maximum number of clauses that can be produced from a
1975 theorem is now given by the attribute max_clauses. Theorems that
1976 exceed this number are ignored, with a warning printed.
1978 * Sledgehammer no longer produces structured proofs by default. To
1979 enable, declare [[sledgehammer_full = true]]. Attributes
1980 reconstruction_modulus, reconstruction_sorts renamed
1981 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1983 * Method "induct_scheme" derives user-specified induction rules
1984 from well-founded induction and completeness of patterns. This factors
1985 out some operations that are done internally by the function package
1986 and makes them available separately. See
1987 src/HOL/ex/Induction_Scheme.thy for examples.
1989 * More flexible generation of measure functions for termination
1990 proofs: Measure functions can be declared by proving a rule of the
1991 form "is_measure f" and giving it the [measure_function] attribute.
1992 The "is_measure" predicate is logically meaningless (always true), and
1993 just guides the heuristic. To find suitable measure functions, the
1994 termination prover sets up the goal "is_measure ?f" of the appropriate
1995 type and generates all solutions by prolog-style backwards proof using
1998 This setup also deals with rules like
2000 "is_measure f ==> is_measure (list_size f)"
2002 which accommodates nested datatypes that recurse through lists.
2003 Similar rules are predeclared for products and option types.
2005 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2009 - Definitions of overloaded constants on sets have to be replaced by
2010 definitions on => and bool.
2012 - Some definitions of overloaded operators on sets can now be proved
2013 using the definitions of the operators on => and bool. Therefore,
2014 the following theorems have been renamed:
2016 subset_def -> subset_eq
2017 psubset_def -> psubset_eq
2018 set_diff_def -> set_diff_eq
2019 Compl_def -> Compl_eq
2020 Sup_set_def -> Sup_set_eq
2021 Inf_set_def -> Inf_set_eq
2022 sup_set_def -> sup_set_eq
2023 inf_set_def -> inf_set_eq
2025 - Due to the incompleteness of the HO unification algorithm, some
2026 rules such as subst may require manual instantiation, if some of
2027 the unknowns in the rule is a set.
2029 - Higher order unification and forward proofs:
2032 have "P (S::'a set)" <...>
2033 then have "EX S. P S" ..
2035 no longer works (due to the incompleteness of the HO unification
2036 algorithm) and must be replaced by the pattern
2043 - Calculational reasoning with subst (or similar rules):
2046 have "P (S::'a set)" <...>
2047 also have "S = T" <...>
2048 finally have "P T" .
2050 no longer works (for similar reasons as the previous example) and
2051 must be replaced by something like
2053 have "P (S::'a set)" <...>
2054 moreover have "S = T" <...>
2055 ultimately have "P T" by simp
2057 - Tactics or packages written in ML code:
2058 Code performing pattern matching on types via
2060 Type ("set", [T]) => ...
2062 must be rewritten. Moreover, functions like strip_type or
2063 binder_types no longer return the right value when applied to a
2066 T1 => ... => Tn => U => bool
2070 T1 => ... => Tn => U set
2072 * Merged theories Wellfounded_Recursion, Accessible_Part and
2073 Wellfounded_Relations to theory Wellfounded.
2075 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2077 * Class finite no longer treats UNIV as class parameter. Use class
2078 enum from theory Library/Enum instead to achieve a similar effect.
2081 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2082 and "Cons". INCOMPATIBILITY.
2084 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2085 Potential INCOMPATIBILITY.
2087 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2088 injective_fst_snd removed, use split_eta and prod_eqI instead.
2089 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2091 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2092 the same name in theory Orderings:
2102 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2103 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2104 and different variable names.
2106 * Library/Option_ord.thy: Canonical order on option type.
2108 * Library/RBT.thy: Red-black trees, an efficient implementation of
2111 * Library/Countable.thy: Type class for countable types.
2113 * Theory Int: The representation of numerals has changed. The infix
2114 operator BIT and the bit datatype with constructors B0 and B1 have
2115 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2116 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2117 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2120 * Theory Nat: definition of <= and < on natural numbers no longer
2121 depend on well-founded relations. INCOMPATIBILITY. Definitions
2122 le_def and less_def have disappeared. Consider lemmas not_less
2123 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2125 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2126 (whose purpose mainly is for various fold_set functionals) have been
2127 abandoned in favor of the existing algebraic classes
2128 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2129 lower_semilattice (resp. upper_semilattice) and linorder.
2132 * Theory Transitive_Closure: induct and cases rules now declare proper
2133 case_names ("base" and "step"). INCOMPATIBILITY.
2135 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2136 lattices. The form set-specific version is available as
2137 Inductive.lfp_ordinal_induct_set.
2139 * Renamed theorems "power.simps" to "power_int.simps".
2142 * Class semiring_div provides basic abstract properties of semirings
2143 with division and modulo operations. Subsumes former class dvd_mod.
2145 * Merged theories IntDef, Numeral and IntArith into unified theory
2146 Int. INCOMPATIBILITY.
2148 * Theory Library/Code_Index: type "index" now represents natural
2149 numbers rather than integers. INCOMPATIBILITY.
2151 * New class "uminus" with operation "uminus" (split of from class
2152 "minus" which now only has operation "minus", binary).
2155 * Constants "card", "internal_split", "option_map" now with authentic
2156 syntax. INCOMPATIBILITY.
2158 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2159 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2160 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2161 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2162 Sup_set_def, le_def, less_def, option_map_def now with object
2163 equality. INCOMPATIBILITY.
2165 * Records. Removed K_record, and replaced it by pure lambda term
2166 %x. c. The simplifier setup is now more robust against eta expansion.
2167 INCOMPATIBILITY: in cases explicitly referring to K_record.
2169 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2171 * Library/ListVector: new theory of arithmetic vector operations.
2173 * Library/Order_Relation: new theory of various orderings as sets of
2174 pairs. Defines preorders, partial orders, linear orders and
2175 well-orders on sets and on types.
2180 * Renamed some theories to allow to loading both ZF and HOL in the
2183 Datatype -> Datatype_ZF
2184 Inductive -> Inductive_ZF
2191 INCOMPATIBILITY: ZF theories that import individual theories below
2192 Main might need to be adapted. Regular theory Main is still
2193 available, as trivial extension of Main_ZF.
2198 * ML within Isar: antiquotation @{const name} or @{const
2199 name(typargs)} produces statically-checked Const term.
2201 * Functor NamedThmsFun: data is available to the user as dynamic fact
2202 (of the same name). Removed obsolete print command.
2204 * Removed obsolete "use_legacy_bindings" function.
2206 * The ``print mode'' is now a thread-local value derived from a global
2207 template (the former print_mode reference), thus access becomes
2208 non-critical. The global print_mode reference is for session
2209 management only; user-code should use print_mode_value,
2210 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2212 * Functions system/system_out provide a robust way to invoke external
2213 shell commands, with propagation of interrupts (requires Poly/ML
2214 5.2.1). Do not use OS.Process.system etc. from the basis library!
2219 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2220 in accordance with Proof General 3.7, which prefers GNU emacs.
2222 * isatool tty runs Isabelle process with plain tty interaction;
2223 optional line editor may be specified via ISABELLE_LINE_EDITOR
2224 setting, the default settings attempt to locate "ledit" and "rlwrap".
2226 * isatool browser now works with Cygwin as well, using general
2227 "javapath" function defined in Isabelle process environment.
2229 * YXML notation provides a simple and efficient alternative to
2230 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2231 isatool yxml as described in the Isabelle system manual.
2233 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2234 provides general wrapper for managing an Isabelle process in a robust
2235 fashion, with ``cooked'' output from stdin/stderr.
2237 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2238 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2240 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2241 way of changing the user's settings is via
2242 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2245 * Multithreading.max_threads := 0 refers to the number of actual CPU
2246 cores of the underlying machine, which is a good starting point for
2247 optimal performance tuning. The corresponding usedir option -M allows
2248 "max" as an alias for "0". WARNING: does not work on certain versions
2249 of Mac OS (with Poly/ML 5.1).
2251 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2252 adverse effect of Isabelle flooding interactive front-ends (notably
2253 ProofGeneral / XEmacs).
2257 New in Isabelle2007 (November 2007)
2258 -----------------------------------
2262 * More uniform information about legacy features, notably a
2263 warning/error of "Legacy feature: ...", depending on the state of the
2264 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2265 legacy features will disappear eventually.
2267 * Theory syntax: the header format ``theory A = B + C:'' has been
2268 discontinued in favour of ``theory A imports B C begin''. Use isatool
2269 fixheaders to convert existing theory files. INCOMPATIBILITY.
2271 * Theory syntax: the old non-Isar theory file format has been
2272 discontinued altogether. Note that ML proof scripts may still be used
2273 with Isar theories; migration is usually quite simple with the ML
2274 function use_legacy_bindings. INCOMPATIBILITY.
2276 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2277 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2280 * Theory loader: be more serious about observing the static theory
2281 header specifications (including optional directories), but not the
2282 accidental file locations of previously successful loads. The strict
2283 update policy of former update_thy is now already performed by
2284 use_thy, so the former has been removed; use_thys updates several
2285 theories simultaneously, just as 'imports' within a theory header
2286 specification, but without merging the results. Potential
2287 INCOMPATIBILITY: may need to refine theory headers and commands
2288 ROOT.ML which depend on load order.
2290 * Theory loader: optional support for content-based file
2291 identification, instead of the traditional scheme of full physical
2292 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2293 (cf. the system manual). The new scheme allows to work with
2294 non-finished theories in persistent session images, such that source
2295 files may be moved later on without requiring reloads.
2297 * Theory loader: old-style ML proof scripts being *attached* to a thy
2298 file (with the same base name as the theory) are considered a legacy
2299 feature, which will disappear eventually. Even now, the theory loader
2300 no longer maintains dependencies on such files.
2302 * Syntax: the scope for resolving ambiguities via type-inference is
2303 now limited to individual terms, instead of whole simultaneous
2304 specifications as before. This greatly reduces the complexity of the
2305 syntax module and improves flexibility by separating parsing and
2306 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2307 'fixes' etc.) are required in rare situations.
2309 * Syntax: constants introduced by new-style packages ('definition',
2310 'abbreviation' etc.) are passed through the syntax module in
2311 ``authentic mode''. This means that associated mixfix annotations
2312 really stick to such constants, independently of potential name space
2313 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2314 trees are represented slightly differently, may need to adapt syntax
2315 translations accordingly. Use CONST marker in 'translations' and
2316 @{const_syntax} antiquotation in 'parse_translation' etc.
2318 * Legacy goal package: reduced interface to the bare minimum required
2319 to keep existing proof scripts running. Most other user-level
2320 functions are now part of the OldGoals structure, which is *not* open
2321 by default (consider isatool expandshort before open OldGoals).
2322 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2323 these tend to cause confusion about the actual goal (!) context being
2324 used here, which is not necessarily the same as the_context().
2326 * Command 'find_theorems': supports "*" wild-card in "name:"
2327 criterion; "with_dups" option. Certain ProofGeneral versions might
2328 support a specific search form (see ProofGeneral/CHANGES).
2330 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2331 by default, which means that "prems" (and also "fixed variables") are
2332 suppressed from proof state output. Note that the ProofGeneral
2333 settings mechanism allows to change and save options persistently, but
2334 older versions of Isabelle will fail to start up if a negative prems
2337 * Local theory targets may be specified by non-nested blocks of
2338 ``context/locale/class ... begin'' followed by ``end''. The body may
2339 contain definitions, theorems etc., including any derived mechanism
2340 that has been implemented on top of these primitives. This concept
2341 generalizes the existing ``theorem (in ...)'' towards more versatility
2344 * Proof General interface: proper undo of final 'end' command;
2345 discontinued Isabelle/classic mode (ML proof scripts).
2348 *** Document preparation ***
2350 * Added antiquotation @{theory name} which prints the given name,
2351 after checking that it refers to a valid ancestor theory in the
2354 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2355 check the given source text as ML type/structure, printing verbatim.
2357 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2358 "c args == rhs" given in the current context. (Any number of
2359 arguments may be given on the LHS.)
2364 * The 'class' package offers a combination of axclass and locale to
2365 achieve Haskell-like type classes in Isabelle. Definitions and
2366 theorems within a class context produce both relative results (with
2367 implicit parameters according to the locale context), and polymorphic
2368 constants with qualified polymorphism (according to the class
2369 context). Within the body context of a 'class' target, a separate
2370 syntax layer ("user space type system") takes care of converting
2371 between global polymorphic consts and internal locale representation.
2372 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2373 "isatool doc classes" provides a tutorial.
2375 * Generic code generator framework allows to generate executable
2376 code for ML and Haskell (including Isabelle classes). A short usage
2379 internal compilation:
2380 export_code <list of constants (term syntax)> in SML
2381 writing SML code to a file:
2382 export_code <list of constants (term syntax)> in SML <filename>
2383 writing OCaml code to a file:
2384 export_code <list of constants (term syntax)> in OCaml <filename>
2385 writing Haskell code to a bunch of files:
2386 export_code <list of constants (term syntax)> in Haskell <filename>
2388 evaluating closed propositions to True/False using code generation:
2391 Reasonable default setup of framework in HOL.
2393 Theorem attributs for selecting and transforming function equations theorems:
2395 [code fun]: select a theorem as function equation for a specific constant
2396 [code fun del]: deselect a theorem as function equation for a specific constant
2397 [code inline]: select an equation theorem for unfolding (inlining) in place
2398 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2400 User-defined serializations (target in {SML, OCaml, Haskell}):
2402 code_const <and-list of constants (term syntax)>
2403 {(target) <and-list of const target syntax>}+
2405 code_type <and-list of type constructors>
2406 {(target) <and-list of type target syntax>}+
2408 code_instance <and-list of instances>
2410 where instance ::= <type constructor> :: <class>
2412 code_class <and_list of classes>
2413 {(target) <and-list of class target syntax>}+
2414 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2416 code_instance and code_class only are effective to target Haskell.
2418 For example usage see src/HOL/ex/Codegenerator.thy and
2419 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2420 generation from Isabelle/HOL theories is available via "isatool doc
2423 * Code generator: consts in 'consts_code' Isar commands are now
2424 referred to by usual term syntax (including optional type
2427 * Command 'no_translations' removes translation rules from theory
2430 * Overloaded definitions are now actually checked for acyclic
2431 dependencies. The overloading scheme is slightly more general than
2432 that of Haskell98, although Isabelle does not demand an exact
2433 correspondence to type class and instance declarations.
2434 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2435 exotic versions of overloading -- at the discretion of the user!
2437 Polymorphic constants are represented via type arguments, i.e. the
2438 instantiation that matches an instance against the most general
2439 declaration given in the signature. For example, with the declaration
2440 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2441 as c(nat). Overloading is essentially simultaneous structural
2442 recursion over such type arguments. Incomplete specification patterns
2443 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2444 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2445 Command 'print_theory' outputs the normalized system of recursive
2446 equations, see section "definitions".
2448 * Configuration options are maintained within the theory or proof
2449 context (with name and type bool/int/string), providing a very simple
2450 interface to a poor-man's version of general context data. Tools may
2451 declare options in ML (e.g. using Attrib.config_int) and then refer to
2452 these values using Config.get etc. Users may change options via an
2453 associated attribute of the same name. This form of context
2454 declaration works particularly well with commands 'declare' or
2455 'using', for example ``declare [[foo = 42]]''. Thus it has become
2456 very easy to avoid global references, which would not observe Isar
2457 toplevel undo/redo and fail to work with multithreading.
2459 Various global ML references of Pure and HOL have been turned into
2460 configuration options:
2462 Unify.search_bound unify_search_bound
2463 Unify.trace_bound unify_trace_bound
2464 Unify.trace_simp unify_trace_simp
2465 Unify.trace_types unify_trace_types
2466 Simplifier.simp_depth_limit simp_depth_limit
2467 Blast.depth_limit blast_depth_limit
2468 DatatypeProp.dtK datatype_distinctness_limit
2469 fast_arith_neq_limit fast_arith_neq_limit
2470 fast_arith_split_limit fast_arith_split_limit
2472 * Named collections of theorems may be easily installed as context
2473 data using the functor NamedThmsFun (see also
2474 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2475 attributes; there is also a toplevel print command. This facility is
2476 just a common case of general context data, which is the preferred way
2477 for anything more complex than just a list of facts in canonical
2480 * Isar: command 'declaration' augments a local theory by generic
2481 declaration functions written in ML. This enables arbitrary content
2482 being added to the context, depending on a morphism that tells the
2483 difference of the original declaration context wrt. the application
2484 context encountered later on.
2486 * Isar: proper interfaces for simplification procedures. Command
2487 'simproc_setup' declares named simprocs (with match patterns, and body
2488 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2489 context. ML antiquotation @{simproc name} retrieves named simprocs.
2491 * Isar: an extra pair of brackets around attribute declarations
2492 abbreviates a theorem reference involving an internal dummy fact,
2493 which will be ignored later --- only the effect of the attribute on
2494 the background context will persist. This form of in-place
2495 declarations is particularly useful with commands like 'declare' and
2496 'using', for example ``have A using [[simproc a]] by simp''.
2498 * Isar: method "assumption" (and implicit closing of subproofs) now
2499 takes simple non-atomic goal assumptions into account: after applying
2500 an assumption as a rule the resulting subgoals are solved by atomic
2501 assumption steps. This is particularly useful to finish 'obtain'
2502 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2503 without referring to the original premise "!!x. P x ==> thesis" in the
2504 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2507 * Isar: implicit use of prems from the Isar proof context is
2508 considered a legacy feature. Common applications like ``have A .''
2509 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2510 referencing facts explicitly here improves readability and
2511 maintainability of proof texts.
2513 * Isar: improper proof element 'guess' is like 'obtain', but derives
2514 the obtained context from the course of reasoning! For example:
2516 assume "EX x y. A x & B y" -- "any previous fact"
2517 then guess x and y by clarify
2519 This technique is potentially adventurous, depending on the facts and
2520 proof tools being involved here.
2522 * Isar: known facts from the proof context may be specified as literal
2523 propositions, using ASCII back-quote syntax. This works wherever
2524 named facts used to be allowed so far, in proof commands, proof
2525 methods, attributes etc. Literal facts are retrieved from the context
2526 according to unification of type and term parameters. For example,
2527 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2528 theorems in the current context, then these are valid literal facts:
2529 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2531 There is also a proof method "fact" which does the same composition
2532 for explicit goal states, e.g. the following proof texts coincide with
2533 certain special cases of literal facts:
2535 have "A" by fact == note `A`
2536 have "A ==> B" by fact == note `A ==> B`
2537 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2538 have "P a ==> Q a" by fact == note `P a ==> Q a`
2540 * Isar: ":" (colon) is no longer a symbolic identifier character in
2541 outer syntax. Thus symbolic identifiers may be used without
2542 additional white space in declarations like this: ``assume *: A''.
2544 * Isar: 'print_facts' prints all local facts of the current context,
2545 both named and unnamed ones.
2547 * Isar: 'def' now admits simultaneous definitions, e.g.:
2549 def x == "t" and y == "u"
2551 * Isar: added command 'unfolding', which is structurally similar to
2552 'using', but affects both the goal state and facts by unfolding given
2553 rewrite rules. Thus many occurrences of the 'unfold' method or
2554 'unfolded' attribute may be replaced by first-class proof text.
2556 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2557 and command 'unfolding' now all support object-level equalities
2558 (potentially conditional). The underlying notion of rewrite rule is
2559 analogous to the 'rule_format' attribute, but *not* that of the
2560 Simplifier (which is usually more generous).
2562 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2563 premises of a theorem by n. Useful in conjunction with drule.
2565 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2566 method expression within a sandbox consisting of the first N
2567 sub-goals, which need to exist. For example, ``simp_all [3]''
2568 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2569 simplifies all new goals that emerge from applying rule foo to the
2570 originally first one.
2572 * Isar: schematic goals are no longer restricted to higher-order
2573 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2576 * Isar: the conclusion of a long theorem statement is now either
2577 'shows' (a simultaneous conjunction, as before), or 'obtains'
2578 (essentially a disjunction of cases with local parameters and
2579 assumptions). The latter allows to express general elimination rules
2580 adequately; in this notation common elimination rules look like this:
2582 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2584 obtains x where "P x"
2586 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2590 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2596 The subsequent classical rules even refer to the formal "thesis"
2599 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2602 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2603 obtains "thesis ==> something"
2605 The actual proof of an 'obtains' statement is analogous to that of the
2606 Isar proof element 'obtain', only that there may be several cases.
2607 Optional case names may be specified in parentheses; these will be
2608 available both in the present proof and as annotations in the
2609 resulting rule, for later use with the 'cases' method (cf. attribute
2612 * Isar: the assumptions of a long theorem statement are available as
2613 "assms" fact in the proof context. This is more appropriate than the
2614 (historical) "prems", which refers to all assumptions of the current
2615 context, including those from the target locale, proof body etc.
2617 * Isar: 'print_statement' prints theorems from the current theory or
2618 proof context in long statement form, according to the syntax of a
2621 * Isar: 'obtain' takes an optional case name for the local context
2622 introduction rule (default "that").
2624 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2625 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2628 * Pure: syntax "CONST name" produces a fully internalized constant
2629 according to the current context. This is particularly useful for
2630 syntax translations that should refer to internal constant
2631 representations independently of name spaces.
2633 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2634 instead of "FOO ". This allows multiple binder declarations to coexist
2635 in the same context. INCOMPATIBILITY.
2637 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2638 primitive that also works in a locale context (both for constants and
2639 fixed variables). Type declaration and internal syntactic representation
2640 of given constants retrieved from the context. Likewise, the
2641 'no_notation' command allows to remove given syntax annotations from the
2644 * Isar/locales: new derived specification elements 'axiomatization',
2645 'definition', 'abbreviation', which support type-inference, admit
2646 object-level specifications (equality, equivalence). See also the
2647 isar-ref manual. Examples:
2650 eq (infix "===" 50) where
2651 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2653 definition "f x y = x + y + 1"
2654 definition g where "g x = f x x"
2657 neq (infix "=!=" 50) where
2658 "x =!= y == ~ (x === y)"
2660 These specifications may be also used in a locale context. Then the
2661 constants being introduced depend on certain fixed parameters, and the
2662 constant name is qualified by the locale base name. An internal
2663 abbreviation takes care for convenient input and output, making the
2664 parameters implicit and using the original short name. See also
2665 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2666 entities from a monomorphic theory.
2668 Presently, abbreviations are only available 'in' a target locale, but
2669 not inherited by general import expressions. Also note that
2670 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2671 'translations' in common applications. The "no_abbrevs" print mode
2672 prevents folding of abbreviations in term output.
2674 Concrete syntax is attached to specified constants in internal form,
2675 independently of name spaces. The parse tree representation is
2676 slightly different -- use 'notation' instead of raw 'syntax', and
2677 'translations' with explicit "CONST" markup to accommodate this.
2679 * Pure/Isar: unified syntax for new-style specification mechanisms
2680 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2681 full type inference and dummy patterns ("_"). For example:
2683 definition "K x _ = x"
2685 inductive conj for A B
2686 where "A ==> B ==> conj A B"
2688 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2689 the current context. Print mode "no_abbrevs" prevents inversion of
2690 abbreviations on output.
2692 * Isar/locales: improved parameter handling: use of locales "var" and
2693 "struct" no longer necessary; - parameter renamings are no longer
2694 required to be injective. For example, this allows to define
2695 endomorphisms as locale endom = homom mult mult h.
2697 * Isar/locales: changed the way locales with predicates are defined.
2698 Instead of accumulating the specification, the imported expression is
2699 now an interpretation. INCOMPATIBILITY: different normal form of
2700 locale expressions. In particular, in interpretations of locales with
2701 predicates, goals repesenting already interpreted fragments are not
2702 removed automatically. Use methods `intro_locales' and
2703 `unfold_locales'; see below.
2705 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2706 provide backward reasoning on locales predicates. The methods are
2707 aware of interpretations and discharge corresponding goals.
2708 `intro_locales' is less aggressive then `unfold_locales' and does not
2709 unfold predicates to assumptions.
2711 * Isar/locales: the order in which locale fragments are accumulated
2712 has changed. This enables to override declarations from fragments due
2713 to interpretations -- for example, unwanted simp rules.
2715 * Isar/locales: interpretation in theories and proof contexts has been
2716 extended. One may now specify (and prove) equations, which are
2717 unfolded in interpreted theorems. This is useful for replacing
2718 defined concepts (constants depending on locale parameters) by
2719 concepts already existing in the target context. Example:
2721 interpretation partial_order ["op <= :: [int, int] => bool"]
2722 where "partial_order.less (op <=) (x::int) y = (x < y)"
2724 Typically, the constant `partial_order.less' is created by a
2725 definition specification element in the context of locale
2728 * Method "induct": improved internal context management to support
2729 local fixes and defines on-the-fly. Thus explicit meta-level
2730 connectives !! and ==> are rarely required anymore in inductive goals
2731 (using object-logic connectives for this purpose has been long
2732 obsolete anyway). Common proof patterns are explained in
2733 src/HOL/Induct/Common_Patterns.thy, see also
2734 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2737 * Method "induct": improved handling of simultaneous goals. Instead of
2738 introducing object-level conjunction, the statement is now split into
2739 several conclusions, while the corresponding symbolic cases are nested
2740 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2741 see src/HOL/Induct/Common_Patterns.thy, for example.
2743 * Method "induct": mutual induction rules are now specified as a list
2744 of rule sharing the same induction cases. HOL packages usually provide
2745 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2746 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2747 mutual induction rules differently, i.e. like this:
2749 (induct rule: foo_bar.inducts)
2750 (induct set: foo bar)
2751 (induct pred: foo bar)
2752 (induct type: foo bar)
2754 The ML function ProjectRule.projections turns old-style rules into the
2757 * Method "coinduct": dual of induction, see
2758 src/HOL/Library/Coinductive_List.thy for various examples.
2760 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2761 considered a legacy feature.
2763 * Attribute "symmetric" produces result with standardized schematic
2764 variables (index 0). Potential INCOMPATIBILITY.
2766 * Simplifier: by default the simplifier trace only shows top level
2767 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2768 default. Thus there is less danger of being flooded by the trace. The
2769 trace indicates where parts have been suppressed.
2771 * Provers/classical: removed obsolete classical version of elim_format
2772 attribute; classical elim/dest rules are now treated uniformly when
2773 manipulating the claset.
2775 * Provers/classical: stricter checks to ensure that supplied intro,
2776 dest and elim rules are well-formed; dest and elim rules must have at
2779 * Provers/classical: attributes dest/elim/intro take an optional
2780 weight argument for the rule (just as the Pure versions). Weights are
2781 ignored by automated tools, but determine the search order of single
2784 * Syntax: input syntax now supports dummy variable binding "%_. b",
2785 where the body does not mention the bound variable. Note that dummy
2786 patterns implicitly depend on their context of bounds, which makes
2787 "{_. _}" match any set comprehension as expected. Potential
2788 INCOMPATIBILITY -- parse translations need to cope with syntactic
2789 constant "_idtdummy" in the binding position.
2791 * Syntax: removed obsolete syntactic constant "_K" and its associated
2792 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2793 for example "A -> B" => "Pi A (%_. B)".
2795 * Pure: 'class_deps' command visualizes the subclass relation, using
2796 the graph browser tool.
2798 * Pure: 'print_theory' now suppresses certain internal declarations by
2799 default; use '!' option for full details.
2804 * Method "metis" proves goals by applying the Metis general-purpose
2805 resolution prover (see also http://gilith.com/software/metis/).
2806 Examples are in the directory MetisExamples. WARNING: the
2807 Isabelle/HOL-Metis integration does not yet work properly with
2810 * Command 'sledgehammer' invokes external automatic theorem provers as
2811 background processes. It generates calls to the "metis" method if
2812 successful. These can be pasted into the proof. Users do not have to
2813 wait for the automatic provers to return. WARNING: does not really
2814 work with multi-threading.
2816 * New "auto_quickcheck" feature tests outermost goal statements for
2817 potential counter-examples. Controlled by ML references
2818 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2819 5000 milliseconds). Fails silently if statements is outside of
2820 executable fragment, or any other codgenerator problem occurs.
2822 * New constant "undefined" with axiom "undefined x = undefined".
2824 * Added class "HOL.eq", allowing for code generation with polymorphic
2827 * Some renaming of class constants due to canonical name prefixing in
2828 the new 'class' package:
2830 HOL.abs ~> HOL.abs_class.abs
2831 HOL.divide ~> HOL.divide_class.divide
2832 0 ~> HOL.zero_class.zero
2833 1 ~> HOL.one_class.one
2834 op + ~> HOL.plus_class.plus
2835 op - ~> HOL.minus_class.minus
2836 uminus ~> HOL.minus_class.uminus
2837 op * ~> HOL.times_class.times
2838 op < ~> HOL.ord_class.less
2839 op <= > HOL.ord_class.less_eq
2840 Nat.power ~> Power.power_class.power
2841 Nat.size ~> Nat.size_class.size
2842 Numeral.number_of ~> Numeral.number_class.number_of
2843 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2844 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2845 Orderings.min ~> Orderings.ord_class.min
2846 Orderings.max ~> Orderings.ord_class.max
2847 Divides.op div ~> Divides.div_class.div
2848 Divides.op mod ~> Divides.div_class.mod
2849 Divides.op dvd ~> Divides.div_class.dvd
2851 INCOMPATIBILITY. Adaptions may be required in the following cases:
2853 a) User-defined constants using any of the names "plus", "minus",
2854 "times", "less" or "less_eq". The standard syntax translations for
2855 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2858 b) Variables named "plus", "minus", "times", "less", "less_eq"
2859 INCOMPATIBILITY: use more specific names.
2861 c) Permutative equations (e.g. "a + b = b + a")
2862 Since the change of names also changes the order of terms, permutative
2863 rewrite rules may get applied in a different order. Experience shows
2864 that this is rarely the case (only two adaptions in the whole Isabelle
2865 distribution). INCOMPATIBILITY: rewrite proofs
2867 d) ML code directly refering to constant names
2868 This in general only affects hand-written proof tactics, simprocs and
2869 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2870 Consider using @{const_name} antiquotation.
2872 * New class "default" with associated constant "default".
2874 * Function "sgn" is now overloaded and available on int, real, complex
2875 (and other numeric types), using class "sgn". Two possible defs of
2876 sgn are given as equational assumptions in the classes sgn_if and
2877 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2880 * Locale "partial_order" now unified with class "order" (cf. theory
2881 Orderings), added parameter "less". INCOMPATIBILITY.
2883 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2884 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2885 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2887 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2888 changed order of proof goals in instance proofs.
2890 * The transitivity reasoner for partial and linear orders is set up
2891 for classes "order" and "linorder". Instances of the reasoner are available
2892 in all contexts importing or interpreting the corresponding locales.
2893 Method "order" invokes the reasoner separately; the reasoner
2894 is also integrated with the Simplifier as a solver. Diagnostic
2895 command 'print_orders' shows the available instances of the reasoner
2896 in the current context.
2898 * Localized monotonicity predicate in theory "Orderings"; integrated
2899 lemmas max_of_mono and min_of_mono with this predicate.
2902 * Formulation of theorem "dense" changed slightly due to integration
2903 with new class dense_linear_order.
2905 * Uniform lattice theory development in HOL.
2907 constants "meet" and "join" now named "inf" and "sup"
2908 constant "Meet" now named "Inf"
2910 classes "meet_semilorder" and "join_semilorder" now named
2911 "lower_semilattice" and "upper_semilattice"
2912 class "lorder" now named "lattice"
2913 class "comp_lat" now named "complete_lattice"
2915 Instantiation of lattice classes allows explicit definitions
2916 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2918 INCOMPATIBILITY. Theorem renames:
2920 meet_left_le ~> inf_le1
2921 meet_right_le ~> inf_le2
2922 join_left_le ~> sup_ge1
2923 join_right_le ~> sup_ge2
2924 meet_join_le ~> inf_sup_ord
2927 le_meet ~> le_inf_iff
2928 le_join ~> ge_sup_conv
2929 meet_idempotent ~> inf_idem
2930 join_idempotent ~> sup_idem
2931 meet_comm ~> inf_commute
2932 join_comm ~> sup_commute
2933 meet_leI1 ~> le_infI1
2934 meet_leI2 ~> le_infI2
2935 le_joinI1 ~> le_supI1
2936 le_joinI2 ~> le_supI2
2937 meet_assoc ~> inf_assoc
2938 join_assoc ~> sup_assoc
2939 meet_left_comm ~> inf_left_commute
2940 meet_left_idempotent ~> inf_left_idem
2941 join_left_comm ~> sup_left_commute
2942 join_left_idempotent ~> sup_left_idem
2945 le_def_meet ~> le_iff_inf
2946 le_def_join ~> le_iff_sup
2947 join_absorp2 ~> sup_absorb2
2948 join_absorp1 ~> sup_absorb1
2949 meet_absorp1 ~> inf_absorb1
2950 meet_absorp2 ~> inf_absorb2
2951 meet_join_absorp ~> inf_sup_absorb
2952 join_meet_absorp ~> sup_inf_absorb
2953 distrib_join_le ~> distrib_sup_le
2954 distrib_meet_le ~> distrib_inf_le
2956 add_meet_distrib_left ~> add_inf_distrib_left
2957 add_join_distrib_left ~> add_sup_distrib_left
2958 is_join_neg_meet ~> is_join_neg_inf
2959 is_meet_neg_join ~> is_meet_neg_sup
2960 add_meet_distrib_right ~> add_inf_distrib_right
2961 add_join_distrib_right ~> add_sup_distrib_right
2962 add_meet_join_distribs ~> add_sup_inf_distribs
2963 join_eq_neg_meet ~> sup_eq_neg_inf
2964 meet_eq_neg_join ~> inf_eq_neg_sup
2965 add_eq_meet_join ~> add_eq_inf_sup
2966 meet_0_imp_0 ~> inf_0_imp_0
2967 join_0_imp_0 ~> sup_0_imp_0
2968 meet_0_eq_0 ~> inf_0_eq_0
2969 join_0_eq_0 ~> sup_0_eq_0
2970 neg_meet_eq_join ~> neg_inf_eq_sup
2971 neg_join_eq_meet ~> neg_sup_eq_inf
2972 join_eq_if ~> sup_eq_if
2974 mono_meet ~> mono_inf
2975 mono_join ~> mono_sup
2976 meet_bool_eq ~> inf_bool_eq
2977 join_bool_eq ~> sup_bool_eq
2978 meet_fun_eq ~> inf_fun_eq
2979 join_fun_eq ~> sup_fun_eq
2980 meet_set_eq ~> inf_set_eq
2981 join_set_eq ~> sup_set_eq
2982 meet1_iff ~> inf1_iff
2983 meet2_iff ~> inf2_iff
2992 join1_iff ~> sup1_iff
2993 join2_iff ~> sup2_iff
3003 is_meet_Meet ~> is_meet_Inf
3004 Meet_bool_def ~> Inf_bool_def
3005 Meet_fun_def ~> Inf_fun_def
3006 Meet_greatest ~> Inf_greatest
3007 Meet_lower ~> Inf_lower
3008 Meet_set_def ~> Inf_set_def
3011 Sup_bool_eq ~> Sup_bool_def
3012 Sup_fun_eq ~> Sup_fun_def
3013 Sup_set_eq ~> Sup_set_def
3015 listsp_meetI ~> listsp_infI
3016 listsp_meet_eq ~> listsp_inf_eq
3021 * Added syntactic class "size"; overloaded constant "size" now has
3022 type "'a::size ==> bool"
3024 * Internal reorganisation of `size' of datatypes: size theorems
3025 "foo.size" are no longer subsumed by "foo.simps" (but are still
3026 simplification rules by default!); theorems "prod.size" now named
3029 * Class "div" now inherits from class "times" rather than "type".
3032 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3033 Linorder etc. have disappeared; operations defined in terms of
3034 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3036 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3038 * HOL-Word: New extensive library and type for generic, fixed size
3039 machine words, with arithemtic, bit-wise, shifting and rotating
3040 operations, reflection into int, nat, and bool lists, automation for
3041 linear arithmetic (by automatic reflection into nat or int), including
3042 lemmas on overflow and monotonicity. Instantiated to all appropriate
3043 arithmetic type classes, supporting automatic simplification of
3044 numerals on all operations.
3046 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3048 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3050 * Code generator library theories:
3051 - Code_Integer represents HOL integers by big integer literals in target
3053 - Code_Char represents HOL characters by character literals in target
3055 - Code_Char_chr like Code_Char, but also offers treatment of character
3056 codes; includes Code_Integer.
3057 - Executable_Set allows to generate code for finite sets using lists.
3058 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3060 - Executable_Real implements a subset of real numbers, namly those
3061 representable by rational numbers.
3062 - Efficient_Nat implements natural numbers by integers, which in general will
3063 result in higher efficency; pattern matching with 0/Suc is eliminated;
3064 includes Code_Integer.
3065 - Code_Index provides an additional datatype index which is mapped to
3066 target-language built-in integers.
3067 - Code_Message provides an additional datatype message_string which is isomorphic to
3068 strings; messages are mapped to target-language strings.
3070 * New package for inductive predicates
3072 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3075 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3076 for z_1 :: U_1 and ... and z_n :: U_m
3078 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3081 with full support for type-inference, rather than
3083 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3085 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3086 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3088 inductive "s z_1 ... z_m"
3090 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3093 For backward compatibility, there is a wrapper allowing inductive
3094 sets to be defined with the new package via
3097 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3098 for z_1 :: U_1 and ... and z_n :: U_m
3100 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3106 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3107 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3108 for z_1 :: U_1 and ... and z_n :: U_m
3110 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3111 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3114 if the additional syntax "p ..." is required.
3116 Numerous examples can be found in the subdirectories src/HOL/Auth,
3117 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3121 - Since declaration and definition of inductive sets or predicates
3122 is no longer separated, abbreviations involving the newly
3123 introduced sets or predicates must be specified together with the
3124 introduction rules after the 'where' keyword (see above), rather
3125 than before the actual inductive definition.
3127 - The variables in induction and elimination rules are now
3128 quantified in the order of their occurrence in the introduction
3129 rules, rather than in alphabetical order. Since this may break
3130 some proofs, these proofs either have to be repaired, e.g. by
3131 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3132 statements of the form
3134 case (rule_i a_i_1 ... a_i_{k_i})
3136 or the old order of quantification has to be restored by explicitly adding
3137 meta-level quantifiers in the introduction rules, i.e.
3139 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3141 - The format of the elimination rules is now
3143 p z_1 ... z_m x_1 ... x_n ==>
3144 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3149 (x_1, ..., x_n) : s z_1 ... z_m ==>
3150 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3153 for sets rather than
3155 x : s z_1 ... z_m ==>
3156 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3159 This may require terms in goals to be expanded to n-tuples
3160 (e.g. using case_tac or simplification with the split_paired_all
3161 rule) before the above elimination rule is applicable.
3163 - The elimination or case analysis rules for (mutually) inductive
3164 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3165 list of rules "p_1_..._p_k.elims" is no longer available.
3167 * New package "function"/"fun" for general recursive functions,
3168 supporting mutual and nested recursion, definitions in local contexts,
3169 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3170 for small examples, and the separate tutorial on the function
3171 package. The old recdef "package" is still available as before, but
3172 users are encouraged to use the new package.
3174 * Method "lexicographic_order" automatically synthesizes termination
3175 relations as lexicographic combinations of size measures.
3177 * Case-expressions allow arbitrary constructor-patterns (including
3178 "_") and take their order into account, like in functional
3179 programming. Internally, this is translated into nested
3180 case-expressions; missing cases are added and mapped to the predefined
3181 constant "undefined". In complicated cases printing may no longer show
3182 the original input but the internal form. Lambda-abstractions allow
3183 the same form of pattern matching: "% pat1 => e1 | ..." is an
3184 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3187 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3188 is an abbreviation for "of_nat :: nat => int". The simplification
3189 rules for "of_nat" have been changed to work like "int" did
3190 previously. Potential INCOMPATIBILITY:
3191 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3192 - of_nat_diff and of_nat_mult are no longer default simp rules
3194 * Method "algebra" solves polynomial equations over (semi)rings using
3195 Groebner bases. The (semi)ring structure is defined by locales and the
3196 tool setup depends on that generic context. Installing the method for
3197 a specific type involves instantiating the locale and possibly adding
3198 declarations for computation on the coefficients. The method is
3199 already instantiated for natural numbers and for the axiomatic class
3200 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3201 CALCULEMUS 2007 for the general principles underlying this
3202 architecture of context-aware proof-tools.
3204 * Method "ferrack" implements quantifier elimination over
3205 special-purpose dense linear orders using locales (analogous to
3206 "algebra"). The method is already installed for class
3207 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3210 * Former constant "List.op @" now named "List.append". Use ML
3211 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3212 circumvent possible incompatibilities when working on ML level.
3214 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3216 * New function listsum :: 'a list => 'a for arbitrary monoids.
3217 Special syntax: "SUM x <- xs. f x" (and latex variants)
3219 * New syntax for Haskell-like list comprehension (input only), eg.
3220 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3222 * The special syntax for function "filter" has changed from [x :
3223 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3224 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3226 * [a..b] is now defined for arbitrary linear orders. It used to be
3227 defined on nat only, as an abbreviation for [a..<Suc b]
3230 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3232 * New functions "sorted" and "sort" in src/HOL/List.thy.
3234 * New lemma collection field_simps (an extension of ring_simps) for
3235 manipulating (in)equations involving division. Multiplies with all
3236 denominators that can be proved to be non-zero (in equations) or
3237 positive/negative (in inequations).
3239 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3240 have been improved and renamed to ring_simps, group_simps and
3241 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3242 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3244 * Theory Library/Commutative_Ring: switched from recdef to function
3245 package; constants add, mul, pow now curried. Infix syntax for
3246 algebraic operations.
3248 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3251 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3254 * HOL/records: generalised field-update to take a function on the
3255 field rather than the new value: r(|A := x|) is translated to A_update
3256 (K x) r The K-combinator that is internally used is called K_record.
3257 INCOMPATIBILITY: Usage of the plain update functions has to be
3260 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3261 * x = 0, which are required for a semiring. Richer structures do not
3262 inherit from semiring_0 anymore, because this property is a theorem
3263 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3264 there is more to prove, but this is mostly trivial.
3266 * Class "recpower" is generalized to arbitrary monoids, not just
3267 commutative semirings. INCOMPATIBILITY: may need to incorporate
3268 commutativity or semiring properties additionally.
3270 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3271 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3272 better use 'abbreviation'.
3274 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3276 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3277 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3278 significant changes for setting up numeral syntax for types:
3279 - New constants Numeral.pred and Numeral.succ instead
3280 of former Numeral.bin_pred and Numeral.bin_succ.
3281 - Use integer operations instead of bin_add, bin_mult and so on.
3282 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3283 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3285 See src/HOL/Integ/IntArith.thy for an example setup.
3287 * Command 'normal_form' computes the normal form of a term that may
3288 contain free variables. For example ``normal_form "rev [a, b, c]"''
3289 produces ``[b, c, a]'' (without proof). This command is suitable for
3290 heavy-duty computations because the functions are compiled to ML
3291 first. Correspondingly, a method "normalization" is provided. See
3292 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3294 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3295 25 like -->); output depends on the "iff" print_mode, the default is
3296 "A = B" (with priority 50).
3298 * Relations less (<) and less_eq (<=) are also available on type bool.
3299 Modified syntax to disallow nesting without explicit parentheses,
3300 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3303 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3305 * Relation composition operator "op O" now has precedence 75 and binds
3306 stronger than union and intersection. INCOMPATIBILITY.
3308 * The old set interval syntax "{m..n(}" (and relatives) has been
3309 removed. Use "{m..<n}" (and relatives) instead.
3311 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3312 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3313 ``declare [[simproc del: neq]]''.
3315 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3318 * Theorem Cons_eq_map_conv no longer declared as "simp".
3320 * Theorem setsum_mult renamed to setsum_right_distrib.
3322 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3325 * Reimplemented methods "sat" and "satx", with several improvements:
3326 goals no longer need to be stated as "<prems> ==> False", equivalences
3327 (i.e. "=" on type bool) are handled, variable names of the form
3328 "lit_<n>" are no longer reserved, significant speedup.
3330 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3331 zChaff is still supported as well.
3333 * 'inductive' and 'datatype': provide projections of mutual rules,
3334 bundled as foo_bar.inducts;
3336 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3339 * Library: moved theory Accessible_Part to main HOL.
3341 * Library: added theory Coinductive_List of potentially infinite lists
3342 as greatest fixed-point.
3344 * Library: added theory AssocList which implements (finite) maps as
3347 * Method "evaluation" solves goals (i.e. a boolean expression)
3348 efficiently by compiling it to ML. The goal is "proved" (via an
3349 oracle) if it evaluates to True.
3351 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3352 also when invoked by the simplifier. This results in the Simplifier
3353 being more powerful on arithmetic goals. INCOMPATIBILITY.
3354 Configuration option fast_arith_split_limit=0 recovers the old
3357 * Support for hex (0x20) and binary (0b1001) numerals.
3359 * New method: reify eqs (t), where eqs are equations for an
3360 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3361 parameter, computes a term s::'b and a list xs::'a list and proves the
3362 theorem I xs s = t. This is also known as reification or quoting. The
3363 resulting theorem is applied to the subgoal to substitute t with I xs
3364 s. If t is omitted, the subgoal itself is reified.
3366 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3367 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3368 where f is supposed to be a computable function (in the sense of code
3369 generattion). The method uses reify to compute s and xs as above then
3370 applies corr_thm and uses normalization by evaluation to "prove" f s =
3371 r and finally gets the theorem t = r, which is again applied to the
3372 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3374 * Reflection: Automatic reification now handels binding, an example is
3375 available in src/HOL/ex/ReflectionEx.thy
3377 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3378 command 'statespace' that is similar to 'record', but introduces an
3379 abstract specification based on the locale infrastructure instead of
3380 HOL types. This leads to extra flexibility in composing state spaces,
3381 in particular multiple inheritance and renaming of components.
3386 * Hyperreal: Functions root and sqrt are now defined on negative real
3387 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3388 Nonnegativity side conditions have been removed from many lemmas, so
3389 that more subgoals may now be solved by simplification; potential
3392 * Real: new type classes formalize real normed vector spaces and
3393 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3394 and norm :: 'a => real.
3396 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3397 reals into other types. The overloaded constant Reals :: 'a set is now
3398 defined as range of_real; potential INCOMPATIBILITY.
3400 * Real: proper support for ML code generation, including 'quickcheck'.
3401 Reals are implemented as arbitrary precision rationals.
3403 * Real: new development using Cauchy Sequences.
3405 * Hyperreal: Several constants that previously worked only for the
3406 reals have been generalized, so they now work over arbitrary vector
3407 spaces. Type annotations may need to be added in some cases; potential
3410 Infinitesimal :: ('a::real_normed_vector) star set
3411 HFinite :: ('a::real_normed_vector) star set
3412 HInfinite :: ('a::real_normed_vector) star set
3413 approx :: ('a::real_normed_vector) star => 'a star => bool
3414 monad :: ('a::real_normed_vector) star => 'a star set
3415 galaxy :: ('a::real_normed_vector) star => 'a star set
3416 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3417 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3418 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3419 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3420 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3421 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3422 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3423 sgn :: 'a::real_normed_vector => 'a
3424 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3426 * Complex: Some complex-specific constants are now abbreviations for
3427 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3428 hnorm. Other constants have been entirely removed in favor of the
3429 polymorphic versions (INCOMPATIBILITY):
3433 HInfinite <-- CInfinite
3434 Infinitesimal <-- CInfinitesimal
3437 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3438 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3439 (ns)deriv <-- (ns)cderiv
3444 * Formalisation of ideals and the quotient construction over rings.
3446 * Order and lattice theory no longer based on records.
3449 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3450 greatest_closed. INCOMPATIBILITY.
3452 * Method algebra is now set up via an attribute. For examples see
3453 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3454 of algebraic structures.
3456 * Renamed theory CRing to Ring.
3461 * Substantial, yet incomplete support for nominal datatypes (binding
3462 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3463 src/HOL/Nominal/Examples. Prospective users should consult
3464 http://isabelle.in.tum.de/nominal/
3469 * ML basics: just one true type int, which coincides with IntInf.int
3472 * ML within Isar: antiquotations allow to embed statically-checked
3473 formal entities in the source, referring to the context available at
3474 compile-time. For example:
3476 ML {* @{sort "{zero,one}"} *}
3477 ML {* @{typ "'a => 'b"} *}
3478 ML {* @{term "%x. x"} *}
3479 ML {* @{prop "x == y"} *}
3480 ML {* @{ctyp "'a => 'b"} *}
3481 ML {* @{cterm "%x. x"} *}
3482 ML {* @{cprop "x == y"} *}
3483 ML {* @{thm asm_rl} *}
3484 ML {* @{thms asm_rl} *}
3485 ML {* @{type_name c} *}
3486 ML {* @{type_syntax c} *}
3487 ML {* @{const_name c} *}
3488 ML {* @{const_syntax c} *}
3491 ML {* @{theory Pure} *}
3492 ML {* @{theory_ref} *}
3493 ML {* @{theory_ref Pure} *}
3496 ML {* @{clasimpset} *}
3498 The same works for sources being ``used'' within an Isar context.
3500 * ML in Isar: improved error reporting; extra verbosity with
3501 ML_Context.trace enabled.
3503 * Pure/General/table.ML: the join operations now works via exceptions
3504 DUP/SAME instead of type option. This is simpler in simple cases, and
3505 admits slightly more efficient complex applications.
3507 * Pure: 'advanced' translation functions (parse_translation etc.) now
3508 use Context.generic instead of just theory.
3510 * Pure: datatype Context.generic joins theory/Proof.context and
3511 provides some facilities for code that works in either kind of
3512 context, notably GenericDataFun for uniform theory and proof data.
3514 * Pure: simplified internal attribute type, which is now always
3515 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3516 local (Proof.context) attributes have been discontinued, while
3517 minimizing code duplication. Thm.rule_attribute and
3518 Thm.declaration_attribute build canonical attributes; see also structure
3519 Context for further operations on Context.generic, notably
3520 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3521 declarations and definitions.
3523 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3524 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3525 init only required for impure data. INCOMPATIBILITY: empty really need
3526 to be empty (no dependencies on theory content!)
3528 * Pure/kernel: consts certification ignores sort constraints given in
3529 signature declarations. (This information is not relevant to the
3530 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3531 potential INCOMPATIBILITY.
3533 * Pure: axiomatic type classes are now purely definitional, with
3534 explicit proofs of class axioms and super class relations performed
3535 internally. See Pure/axclass.ML for the main internal interfaces --
3536 notably AxClass.define_class supercedes AxClass.add_axclass, and
3537 AxClass.axiomatize_class/classrel/arity supersede
3538 Sign.add_classes/classrel/arities.
3540 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3541 global/local versions on theory vs. Proof.context have been
3542 discontinued; Attrib.syntax and Method.syntax have been adapted
3543 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3544 attributes, methods, etc.
3546 * Pure: several functions of signature "... -> theory -> theory * ..."
3547 have been reoriented to "... -> theory -> ... * theory" in order to
3548 allow natural usage in combination with the ||>, ||>>, |-> and
3549 fold_map combinators.
3551 * Pure: official theorem names (closed derivations) and additional
3552 comments (tags) are now strictly separate. Name hints -- which are
3553 maintained as tags -- may be attached any time without affecting the
3556 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3557 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3558 achieve the old behaviour.
3560 * Pure: the "Goal" constant is now called "prop", supporting a
3561 slightly more general idea of ``protecting'' meta-level rule
3564 * Pure: Logic.(un)varify only works in a global context, which is now
3565 enforced instead of silently assumed. INCOMPATIBILITY, may use
3566 Logic.legacy_(un)varify as temporary workaround.
3568 * Pure: structure Name provides scalable operations for generating
3569 internal variable names, notably Name.variants etc. This replaces
3570 some popular functions from term.ML:
3572 Term.variant -> Name.variant
3573 Term.variantlist -> Name.variant_list
3574 Term.invent_names -> Name.invent_list
3576 Note that low-level renaming rarely occurs in new code -- operations
3577 from structure Variable are used instead (see below).
3579 * Pure: structure Variable provides fundamental operations for proper
3580 treatment of fixed/schematic variables in a context. For example,
3581 Variable.import introduces fixes for schematics of given facts and
3582 Variable.export reverses the effect (up to renaming) -- this replaces
3583 various freeze_thaw operations.
3585 * Pure: structure Goal provides simple interfaces for
3586 init/conclude/finish and tactical prove operations (replacing former
3587 Tactic.prove). Goal.prove is the canonical way to prove results
3588 within a given context; Goal.prove_global is a degraded version for
3589 theory level goals, including a global Drule.standard. Note that
3590 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3591 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3592 in a locale context).
3594 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3595 and type checking (Syntax.check_term etc.), with common combinations
3596 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3597 which are considered legacy and await removal.
3599 * Pure/Syntax: generic interfaces for type unchecking
3600 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3601 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3602 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3603 available for convenience, but refer to the very same operations using
3604 a mere theory instead of a full context.
3606 * Isar: simplified treatment of user-level errors, using exception
3607 ERROR of string uniformly. Function error now merely raises ERROR,
3608 without any side effect on output channels. The Isar toplevel takes
3609 care of proper display of ERROR exceptions. ML code may use plain
3610 handle/can/try; cat_error may be used to concatenate errors like this:
3612 ... handle ERROR msg => cat_error msg "..."
3614 Toplevel ML code (run directly or through the Isar toplevel) may be
3615 embedded into the Isar toplevel with exception display/debug like
3618 Isar.toplevel (fn () => ...)
3620 INCOMPATIBILITY, removed special transform_error facilities, removed
3621 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3622 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3623 -- use plain ERROR instead.
3625 * Isar: theory setup now has type (theory -> theory), instead of a
3626 list. INCOMPATIBILITY, may use #> to compose setup functions.
3628 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3629 ProofContext.debug/verbose flags.
3631 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3632 theory before entering a proof state. Transactions now always see a
3633 quasi-functional intermediate checkpoint, both in interactive and
3636 * Isar: simplified interfaces for outer syntax. Renamed
3637 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3638 OuterSyntax.add_parsers -- this functionality is now included in
3639 OuterSyntax.command etc. INCOMPATIBILITY.
3641 * Simplifier: the simpset of a running simplification process now
3642 contains a proof context (cf. Simplifier.the_context), which is the
3643 very context that the initial simpset has been retrieved from (by
3644 simpset_of/local_simpset_of). Consequently, all plug-in components
3645 (solver, looper etc.) may depend on arbitrary proof data.
3647 * Simplifier.inherit_context inherits the proof context (plus the
3648 local bounds) of the current simplification process; any simproc
3649 etc. that calls the Simplifier recursively should do this! Removed
3650 former Simplifier.inherit_bounds, which is already included here --
3651 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3652 specify an explicit context using Simplifier.context/theory_context.
3654 * Simplifier/Classical Reasoner: more abstract interfaces
3655 change_simpset/claset for modifying the simpset/claset reference of a
3656 theory; raw versions simpset/claset_ref etc. have been discontinued --
3659 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3665 * settings: the default heap location within ISABELLE_HOME_USER now
3666 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3667 Isabelle installations.
3669 * isabelle-process: option -S (secure mode) disables some critical
3670 operations, notably runtime compilation and evaluation of ML source
3673 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3675 * Support for parallel execution, using native multicore support of
3676 Poly/ML 5.1. The theory loader exploits parallelism when processing
3677 independent theories, according to the given theory header
3678 specifications. The maximum number of worker threads is specified via
3679 usedir option -M or the "max-threads" setting in Proof General. A
3680 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3681 to 6 on a 8-core machine. User-code needs to observe certain
3682 guidelines for thread-safe programming, see appendix A in the Isar
3683 Implementation manual.
3687 New in Isabelle2005 (October 2005)
3688 ----------------------------------
3692 * Theory headers: the new header syntax for Isar theories is
3695 imports <theory1> ... <theoryN>
3696 uses <file1> ... <fileM>
3699 where the 'uses' part is optional. The previous syntax
3701 theory <name> = <theory1> + ... + <theoryN>:
3703 will disappear in the next release. Use isatool fixheaders to convert
3704 existing theory files. Note that there is no change in ancient
3705 non-Isar theories now, but these will disappear soon.
3707 * Theory loader: parent theories can now also be referred to via
3708 relative and absolute paths.
3710 * Command 'find_theorems' searches for a list of criteria instead of a
3711 list of constants. Known criteria are: intro, elim, dest, name:string,
3712 simp:term, and any term. Criteria can be preceded by '-' to select
3713 theorems that do not match. Intro, elim, dest select theorems that
3714 match the current goal, name:s selects theorems whose fully qualified
3715 name contain s, and simp:term selects all simplification rules whose
3716 lhs match term. Any other term is interpreted as pattern and selects
3717 all theorems matching the pattern. Available in ProofGeneral under
3718 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3720 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3722 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3723 matching the current goal as introduction rule and not having "HOL."
3724 in their name (i.e. not being defined in theory HOL).
3726 * Command 'thms_containing' has been discontinued in favour of
3727 'find_theorems'; INCOMPATIBILITY.
3729 * Communication with Proof General is now 8bit clean, which means that
3730 Unicode text in UTF-8 encoding may be used within theory texts (both
3731 formal and informal parts). Cf. option -U of the Isabelle Proof
3732 General interface. Here are some simple examples (cf. src/HOL/ex):
3734 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3735 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3737 * Improved efficiency of the Simplifier and, to a lesser degree, the
3738 Classical Reasoner. Typical big applications run around 2 times
3742 *** Document preparation ***
3744 * Commands 'display_drafts' and 'print_drafts' perform simple output
3745 of raw sources. Only those symbols that do not require additional
3746 LaTeX packages (depending on comments in isabellesym.sty) are
3747 displayed properly, everything else is left verbatim. isatool display
3748 and isatool print are used as front ends (these are subject to the
3749 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3751 * Command tags control specific markup of certain regions of text,
3752 notably folding and hiding. Predefined tags include "theory" (for
3753 theory begin and end), "proof" for proof commands, and "ML" for
3754 commands involving ML code; the additional tags "visible" and
3755 "invisible" are unused by default. Users may give explicit tag
3756 specifications in the text, e.g. ''by %invisible (auto)''. The
3757 interpretation of tags is determined by the LaTeX job during document
3758 preparation: see option -V of isatool usedir, or options -n and -t of
3759 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3762 Several document versions may be produced at the same time via isatool
3763 usedir (the generated index.html will link all of them). Typical
3764 specifications include ''-V document=theory,proof,ML'' to present
3765 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3766 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3767 these parts without any formal replacement text. The Isabelle site
3768 default settings produce ''document'' and ''outline'' versions as
3771 * Several new antiquotations:
3773 @{term_type term} prints a term with its type annotated;
3775 @{typeof term} prints the type of a term;
3777 @{const const} is the same as @{term const}, but checks that the
3778 argument is a known logical constant;
3780 @{term_style style term} and @{thm_style style thm} print a term or
3781 theorem applying a "style" to it
3785 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3786 definitions, equations, inequations etc., 'concl' printing only the
3787 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3788 to print the specified premise. TermStyle.add_style provides an ML
3789 interface for introducing further styles. See also the "LaTeX Sugar"
3790 document practical applications. The ML antiquotation prints
3791 type-checked ML expressions verbatim.
3793 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3794 and 'text' support optional locale specification '(in loc)', which
3795 specifies the default context for interpreting antiquotations. For
3796 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3798 * Option 'locale=NAME' of antiquotations specifies an alternative
3799 context interpreting the subsequent argument. For example: @{thm
3800 [locale=lattice] inf_assoc}.
3802 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3805 * Proper output of antiquotations for theory commands involving a
3806 proof context (such as 'locale' or 'theorem (in loc) ...').
3808 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3809 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3811 * isatool usedir: new option -C (default true) controls whether option
3812 -D should include a copy of the original document directory; -C false
3813 prevents unwanted effects such as copying of administrative CVS data.
3818 * Considerably improved version of 'constdefs' command. Now performs
3819 automatic type-inference of declared constants; additional support for
3820 local structure declarations (cf. locales and HOL records), see also
3821 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3822 sequential dependencies of definitions within a single 'constdefs'
3823 section; moreover, the declared name needs to be an identifier. If
3824 all fails, consider to fall back on 'consts' and 'defs' separately.
3826 * Improved indexed syntax and implicit structures. First of all,
3827 indexed syntax provides a notational device for subscripted
3828 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3829 expressions. Secondly, in a local context with structure
3830 declarations, number indexes \<^sub>n or the empty index (default
3831 number 1) refer to a certain fixed variable implicitly; option
3832 show_structs controls printing of implicit structures. Typical
3833 applications of these concepts involve record types and locales.
3835 * New command 'no_syntax' removes grammar declarations (and
3836 translations) resulting from the given syntax specification, which is
3837 interpreted in the same manner as for the 'syntax' command.
3839 * 'Advanced' translation functions (parse_translation etc.) may depend
3840 on the signature of the theory context being presently used for
3841 parsing/printing, see also isar-ref manual.
3843 * Improved 'oracle' command provides a type-safe interface to turn an
3844 ML expression of type theory -> T -> term into a primitive rule of
3845 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3846 is already included here); see also FOL/ex/IffExample.thy;
3849 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3850 before); "cI" is no longer bound, use "c.intro" instead.
3851 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3852 axclasses vs. locales.
3854 * Improved internal renaming of symbolic identifiers -- attach primes
3855 instead of base 26 numbers.
3857 * New flag show_question_marks controls printing of leading question
3858 marks in schematic variable names.
3860 * In schematic variable names, *any* symbol following \<^isub> or
3861 \<^isup> is now treated as part of the base name. For example, the
3862 following works without printing of awkward ".0" indexes:
3864 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3867 * Inner syntax includes (*(*nested*) comments*).
3869 * Pretty printer now supports unbreakable blocks, specified in mixfix
3870 annotations as "(00...)".
3872 * Clear separation of logical types and nonterminals, where the latter
3873 may only occur in 'syntax' specifications or type abbreviations.
3874 Before that distinction was only partially implemented via type class
3875 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3876 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3877 exotic syntax specifications may require further adaption
3878 (e.g. Cube/Cube.thy).
3880 * Removed obsolete type class "logic", use the top sort {} instead.
3881 Note that non-logical types should be declared as 'nonterminals'
3882 rather than 'types'. INCOMPATIBILITY for new object-logic
3885 * Attributes 'induct' and 'cases': type or set names may now be
3886 locally fixed variables as well.
3888 * Simplifier: can now control the depth to which conditional rewriting
3889 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3892 * Simplifier: simplification procedures may now take the current
3893 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3894 interface), which is very useful for calling the Simplifier
3895 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3896 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3897 low-level mk_simproc no longer applies Logic.varify internally, to
3898 allow for use in a context of fixed variables.
3900 * thin_tac now works even if the assumption being deleted contains !!
3901 or ==>. More generally, erule now works even if the major premise of
3902 the elimination rule contains !! or ==>.
3904 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3906 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3907 from Pure, which contains all common declarations already. Both
3908 theories are defined via plain Isabelle/Isar .thy files.
3909 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3910 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3911 use isatool fixcpure to adapt your theory and ML sources.
3913 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3914 selections of theorems in named facts via index ranges.
3916 * 'print_theorems': in theory mode, really print the difference
3917 wrt. the last state (works for interactive theory development only),
3918 in proof mode print all local facts (cf. 'print_facts');
3920 * 'hide': option '(open)' hides only base names.
3922 * More efficient treatment of intermediate checkpoints in interactive
3925 * Code generator is now invoked via code_module (incremental code
3926 generation) and code_library (modular code generation, ML structures
3927 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3928 must be quoted when used as identifiers.
3930 * New 'value' command for reading, evaluating and printing terms using
3931 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3932 quoted when used as identifier.
3937 * New commands for the interpretation of locale expressions in
3938 theories (1), locales (2) and proof contexts (3). These generate
3939 proof obligations from the expression specification. After the
3940 obligations have been discharged, theorems of the expression are added
3941 to the theory, target locale or proof context. The synopsis of the
3942 commands is a follows:
3944 (1) interpretation expr inst
3945 (2) interpretation target < expr
3946 (3) interpret expr inst
3948 Interpretation in theories and proof contexts require a parameter
3949 instantiation of terms from the current context. This is applied to
3950 specifications and theorems of the interpreted expression.
3951 Interpretation in locales only permits parameter renaming through the
3952 locale expression. Interpretation is smart in that interpretations
3953 that are active already do not occur in proof obligations, neither are
3954 instantiated theorems stored in duplicate. Use 'print_interps' to
3955 inspect active interpretations of a particular locale. For details,
3956 see the Isar Reference manual. Examples can be found in
3957 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3959 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3960 'interpret' instead.
3962 * New context element 'constrains' for adding type constraints to
3965 * Context expressions: renaming of parameters with syntax
3968 * Locale declaration: 'includes' disallowed.
3970 * Proper static binding of attribute syntax -- i.e. types / terms /
3971 facts mentioned as arguments are always those of the locale definition
3972 context, independently of the context of later invocations. Moreover,
3973 locale operations (renaming and type / term instantiation) are applied
3974 to attribute arguments as expected.
3976 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3977 actual attributes; rare situations may require Attrib.attribute to
3978 embed those attributes into Attrib.src that lack concrete syntax.
3979 Attribute implementations need to cooperate properly with the static
3980 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3981 Attrib.XXX_thm etc. already do the right thing without further
3982 intervention. Only unusual applications -- such as "where" or "of"
3983 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3984 on the context and the facts involved -- may have to assign parsed
3985 values to argument tokens explicitly.
3987 * Changed parameter management in theorem generation for long goal
3988 statements with 'includes'. INCOMPATIBILITY: produces a different
3989 theorem statement in rare situations.
3991 * Locale inspection command 'print_locale' omits notes elements. Use
3992 'print_locale!' to have them included in the output.
3997 * Provers/hypsubst.ML: improved version of the subst method, for
3998 single-step rewriting: it now works in bound variable contexts. New is
3999 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4000 rewrite a different subterm than the original subst method, which is
4001 still available as 'simplesubst'.
4003 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4006 * Provers/trancl.ML: new transitivity reasoner for transitive and
4007 reflexive-transitive closure of relations.
4009 * Provers/blast.ML: new reference depth_limit to make blast's depth
4010 limit (previously hard-coded with a value of 20) user-definable.
4012 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4013 is peformed already. Object-logics merely need to finish their
4014 initial simpset configuration as before. INCOMPATIBILITY.
4019 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4022 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4024 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4025 and x-symbol; use option '-m epsilon' to get it actually printed.
4026 Moreover, the mathematically important symbolic identifier \<epsilon>
4027 becomes available as variable, constant etc. INCOMPATIBILITY,
4029 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4030 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4031 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4032 support corresponding Isar calculations.
4034 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4037 * theory SetInterval: changed the syntax for open intervals:
4046 The old syntax is still supported but will disappear in the next
4047 release. For conversion use the following Emacs search and replace
4048 patterns (these are not perfect but work quite well):
4050 {)\([^\.]*\)\.\. -> {\1<\.\.}
4051 \.\.\([^(}]*\)(} -> \.\.<\1}
4053 * Theory Commutative_Ring (in Library): method comm_ring for proving
4054 equalities in commutative rings; method 'algebra' provides a generic
4057 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4058 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4059 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4062 Some new syntax forms are available:
4064 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4065 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4066 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4067 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4069 The latter form "\<Sum>x < k. e" used to be based on a separate
4070 function "Summation", which has been discontinued.
4072 * theory Finite_Set: in structured induction proofs, the insert case
4073 is now 'case (insert x F)' instead of the old counterintuitive 'case
4076 * The 'refute' command has been extended to support a much larger
4077 fragment of HOL, including axiomatic type classes, constdefs and
4078 typedefs, inductive datatypes and recursion.
4080 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4081 Requires zChaff with proof generation to be installed. See
4082 HOL/ex/SAT_Examples.thy for examples.
4084 * Datatype induction via method 'induct' now preserves the name of the
4085 induction variable. For example, when proving P(xs::'a list) by
4086 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4087 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4088 in unstructured proof scripts.
4090 * Reworked implementation of records. Improved scalability for
4091 records with many fields, avoiding performance problems for type
4092 inference. Records are no longer composed of nested field types, but
4093 of nested extension types. Therefore the record type only grows linear
4094 in the number of extensions and not in the number of fields. The
4095 top-level (users) view on records is preserved. Potential
4096 INCOMPATIBILITY only in strange cases, where the theory depends on the
4097 old record representation. The type generated for a record is called
4098 <record_name>_ext_type.
4100 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4101 proofs triggered by a record definition or a simproc (if
4102 quick_and_dirty is enabled). Definitions of large records can take
4105 New simproc record_upd_simproc for simplification of multiple record
4106 updates enabled by default. Moreover, trivial updates are also
4107 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4108 occasionally, since simplification is more powerful by default.
4110 * typedef: proper support for polymorphic sets, which contain extra
4111 type-variables in the term.
4113 * Simplifier: automatically reasons about transitivity chains
4114 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4115 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4116 old proofs break occasionally as simplification may now solve more
4117 goals than previously.
4119 * Simplifier: converts x <= y into x = y if assumption y <= x is
4120 present. Works for all partial orders (class "order"), in particular
4121 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4124 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4125 bound variable or a constant then the let is unfolded. Otherwise
4126 first a is simplified to b, and then f b is simplified to g. If
4127 possible we abstract b from g arriving at "let x = b in h x",
4128 otherwise we unfold the let and arrive at g. The simproc can be
4129 enabled/disabled by the reference use_let_simproc. Potential
4130 INCOMPATIBILITY since simplification is more powerful by default.
4132 * Classical reasoning: the meson method now accepts theorems as arguments.
4134 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4135 jobs to provide advice on the provability of subgoals.
4137 * Theory OrderedGroup and Ring_and_Field: various additions and
4138 improvements to faciliate calculations involving equalities and
4141 The following theorems have been eliminated or modified
4144 abs_eq now named abs_of_nonneg
4145 abs_of_ge_0 now named abs_of_nonneg
4146 abs_minus_eq now named abs_of_nonpos
4147 imp_abs_id now named abs_of_nonneg
4148 imp_abs_neg_id now named abs_of_nonpos
4149 mult_pos now named mult_pos_pos
4150 mult_pos_le now named mult_nonneg_nonneg
4151 mult_pos_neg_le now named mult_nonneg_nonpos
4152 mult_pos_neg2_le now named mult_nonneg_nonpos2
4153 mult_neg now named mult_neg_neg
4154 mult_neg_le now named mult_nonpos_nonpos
4156 * The following lemmas in Ring_and_Field have been added to the simplifier:
4159 not_square_less_zero
4161 The following lemmas have been deleted from Real/RealPow:
4171 * Theory Parity: added rules for simplifying exponents.
4175 The following theorems have been eliminated or modified
4178 list_all_Nil now named list_all.simps(1)
4179 list_all_Cons now named list_all.simps(2)
4180 list_all_conv now named list_all_iff
4181 set_mem_eq now named mem_iff
4183 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4184 asymptotic "big O" calculations. See the notes in BigO.thy.
4189 * Theory RealDef: better support for embedding natural numbers and
4190 integers in the reals.
4192 The following theorems have been eliminated or modified
4195 exp_ge_add_one_self now requires no hypotheses
4196 real_of_int_add reversed direction of equality (use [symmetric])
4197 real_of_int_minus reversed direction of equality (use [symmetric])
4198 real_of_int_diff reversed direction of equality (use [symmetric])
4199 real_of_int_mult reversed direction of equality (use [symmetric])
4201 * Theory RComplete: expanded support for floor and ceiling functions.
4203 * Theory Ln is new, with properties of the natural logarithm
4205 * Hyperreal: There is a new type constructor "star" for making
4206 nonstandard types. The old type names are now type synonyms:
4210 hcomplex = complex star
4212 * Hyperreal: Many groups of similarly-defined constants have been
4213 replaced by polymorphic versions (INCOMPATIBILITY):
4215 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4217 starset <-- starsetNat, starsetC
4218 *s* <-- *sNat*, *sc*
4219 starset_n <-- starsetNat_n, starsetC_n
4220 *sn* <-- *sNatn*, *scn*
4221 InternalSets <-- InternalNatSets, InternalCSets
4223 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4224 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4225 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4226 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4227 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4229 * Hyperreal: Many type-specific theorems have been removed in favor of
4230 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4232 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4233 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4234 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4235 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4236 right_minus <-- hypreal_add_minus
4237 left_minus <-- {hypreal,hcomplex}_add_minus_left
4238 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4239 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4240 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4241 mult_1_right <-- hcomplex_mult_one_right
4242 mult_zero_left <-- hcomplex_mult_zero_left
4243 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4244 right_distrib <-- hypnat_add_mult_distrib2
4245 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4246 right_inverse <-- hypreal_mult_inverse
4247 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4248 order_refl <-- {hypreal,hypnat}_le_refl
4249 order_trans <-- {hypreal,hypnat}_le_trans
4250 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4251 order_less_le <-- {hypreal,hypnat}_less_le
4252 linorder_linear <-- {hypreal,hypnat}_le_linear
4253 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4254 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4255 add_nonneg_nonneg <-- hypreal_le_add_order
4257 * Hyperreal: Separate theorems having to do with type-specific
4258 versions of constants have been merged into theorems that apply to the
4259 new polymorphic constants (INCOMPATIBILITY):
4261 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4262 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4263 STAR_Un <-- {STAR,NatStar,STARC}_Un
4264 STAR_Int <-- {STAR,NatStar,STARC}_Int
4265 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4266 STAR_subset <-- {STAR,NatStar,STARC}_subset
4267 STAR_mem <-- {STAR,NatStar,STARC}_mem
4268 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4269 STAR_diff <-- {STAR,STARC}_diff
4270 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4271 STARC_hcomplex_of_complex}_image_subset
4272 starset_n_Un <-- starset{Nat,C}_n_Un
4273 starset_n_Int <-- starset{Nat,C}_n_Int
4274 starset_n_Compl <-- starset{Nat,C}_n_Compl
4275 starset_n_diff <-- starset{Nat,C}_n_diff
4276 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4277 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4278 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4279 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4280 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4281 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4282 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4283 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4284 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4285 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4286 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4287 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4288 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4289 starfun_diff <-- starfun{C,RC,CR}_diff
4290 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4291 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4292 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4293 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4294 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4295 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4296 starfun_Id <-- starfunC_Id
4297 starfun_approx <-- starfun{Nat,CR}_approx
4298 starfun_capprox <-- starfun{C,RC}_capprox
4299 starfun_abs <-- starfunNat_rabs
4300 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4301 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4302 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4303 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4304 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4305 starfun_add_approx <-- starfunCR_add_approx
4306 starfun_inverse_inverse <-- starfunC_inverse_inverse
4307 starfun_divide <-- starfun{C,CR,RC}_divide
4308 starfun_n <-- starfun{Nat,C}_n
4309 starfun_n_mult <-- starfun{Nat,C}_n_mult
4310 starfun_n_add <-- starfun{Nat,C}_n_add
4311 starfun_n_add_minus <-- starfunNat_n_add_minus
4312 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4313 starfun_n_minus <-- starfun{Nat,C}_n_minus
4314 starfun_n_eq <-- starfun{Nat,C}_n_eq
4316 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4317 star_n_minus <-- {hypreal,hcomplex}_minus
4318 star_n_diff <-- {hypreal,hcomplex}_diff
4319 star_n_mult <-- {hypreal,hcomplex}_mult
4320 star_n_inverse <-- {hypreal,hcomplex}_inverse
4321 star_n_le <-- {hypreal,hypnat}_le
4322 star_n_less <-- {hypreal,hypnat}_less
4323 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4324 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4325 star_n_abs <-- hypreal_hrabs
4326 star_n_divide <-- hcomplex_divide
4328 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4329 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4330 star_of_diff <-- hypreal_of_real_diff
4331 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4332 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4333 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4334 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4335 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4336 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4337 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4338 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4339 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4340 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4341 star_of_number_of <-- {hypreal,hcomplex}_number_of
4342 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4343 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4344 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4345 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4346 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4347 star_of_power <-- hypreal_of_real_power
4348 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4350 * Hyperreal: new method "transfer" that implements the transfer
4351 principle of nonstandard analysis. With a subgoal that mentions
4352 nonstandard types like "'a star", the command "apply transfer"
4353 replaces it with an equivalent one that mentions only standard types.
4354 To be successful, all free variables must have standard types; non-
4355 standard variables must have explicit universal quantifiers.
4357 * Hyperreal: A theory of Taylor series.
4362 * Discontinued special version of 'constdefs' (which used to support
4363 continuous functions) in favor of the general Pure one with full
4366 * New simplification procedure for solving continuity conditions; it
4367 is much faster on terms with many nested lambda abstractions (cubic
4368 instead of exponential time).
4370 * New syntax for domain package: selector names are now optional.
4371 Parentheses should be omitted unless argument is lazy, for example:
4373 domain 'a stream = cons "'a" (lazy "'a stream")
4375 * New command 'fixrec' for defining recursive functions with pattern
4376 matching; defining multiple functions with mutual recursion is also
4377 supported. Patterns may include the constants cpair, spair, up, sinl,
4378 sinr, or any data constructor defined by the domain package. The given
4379 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4380 syntax and examples.
4382 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4383 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4384 but the proof obligation additionally includes an admissibility
4385 requirement. The packages generate instances of class cpo or pcpo,
4386 with continuity and strictness theorems for Rep and Abs.
4388 * HOLCF: Many theorems have been renamed according to a more standard naming
4389 scheme (INCOMPATIBILITY):
4391 foo_inject: "foo$x = foo$y ==> x = y"
4392 foo_eq: "(foo$x = foo$y) = (x = y)"
4393 foo_less: "(foo$x << foo$y) = (x << y)"
4394 foo_strict: "foo$UU = UU"
4395 foo_defined: "... ==> foo$x ~= UU"
4396 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4401 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4402 including the First Isomorphism Theorem (on quotienting by the kernel
4405 * ZF/Simplifier: install second copy of type solver that actually
4406 makes use of TC rules declared to Isar proof contexts (or locales);
4407 the old version is still required for ML proof scripts.
4412 * Converted to Isar theory format; use locales instead of axiomatic
4418 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4421 * Pure/library.ML no longer defines its own option datatype, but uses
4422 that of the SML basis, which has constructors NONE and SOME instead of
4423 None and Some, as well as exception Option.Option instead of OPTION.
4424 The functions the, if_none, is_some, is_none have been adapted
4425 accordingly, while Option.map replaces apsome.
4427 * Pure/library.ML: the exception LIST has been given up in favour of
4428 the standard exceptions Empty and Subscript, as well as
4429 Library.UnequalLengths. Function like Library.hd and Library.tl are
4430 superceded by the standard hd and tl functions etc.
4432 A number of basic list functions are no longer exported to the ML
4433 toplevel, as they are variants of predefined functions. The following
4434 suggests how one can translate existing code:
4436 rev_append xs ys = List.revAppend (xs, ys)
4437 nth_elem (i, xs) = List.nth (xs, i)
4438 last_elem xs = List.last xs
4439 flat xss = List.concat xss
4440 seq fs = List.app fs
4441 partition P xs = List.partition P xs
4442 mapfilter f xs = List.mapPartial f xs
4444 * Pure/library.ML: several combinators for linear functional
4445 transformations, notably reverse application and composition:
4448 (x, y) |-> f f #-> g
4450 * Pure/library.ML: introduced/changed precedence of infix operators:
4452 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4454 infix 3 o oo ooo oooo;
4455 infix 4 ~~ upto downto;
4457 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4460 * Pure/library.ML: natural list combinators fold, fold_rev, and
4461 fold_map support linear functional transformations and nesting. For
4464 fold f [x1, ..., xN] y =
4465 y |> f x1 |> ... |> f xN
4467 (fold o fold) f [xs1, ..., xsN] y =
4468 y |> fold f xs1 |> ... |> fold f xsN
4470 fold f [x1, ..., xN] =
4473 (fold o fold) f [xs1, ..., xsN] =
4474 fold f xs1 #> ... #> fold f xsN
4476 * Pure/library.ML: the following selectors on type 'a option are
4479 the: 'a option -> 'a (*partial*)
4480 these: 'a option -> 'a where 'a = 'b list
4481 the_default: 'a -> 'a option -> 'a
4482 the_list: 'a option -> 'a list
4484 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4485 basic operations for association lists, following natural argument
4486 order; moreover the explicit equality predicate passed here avoids
4487 potentially expensive polymorphic runtime equality checks.
4488 The old functions may be expressed as follows:
4490 assoc = uncurry (AList.lookup (op =))
4491 assocs = these oo AList.lookup (op =)
4492 overwrite = uncurry (AList.update (op =)) o swap
4494 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4496 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4497 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4499 replacing make_keylist and keyfilter (occassionally used)
4502 make_keylist = AList.make
4503 keyfilter = AList.find (op =)
4505 * eq_fst and eq_snd now take explicit equality parameter, thus
4506 avoiding eqtypes. Naive rewrites:
4508 eq_fst = eq_fst (op =)
4509 eq_snd = eq_snd (op =)
4511 * Removed deprecated apl and apr (rarely used).
4514 apl (n, op) =>>= curry op n
4515 apr (op, m) =>>= fn n => op (n, m)
4517 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4518 provides a reasonably efficient light-weight implementation of sets as
4521 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4522 few new operations; existing lookup and update are now curried to
4523 follow natural argument order (for use with fold etc.);
4524 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4526 * Pure/General: output via the Isabelle channels of
4527 writeln/warning/error etc. is now passed through Output.output, with a
4528 hook for arbitrary transformations depending on the print_mode
4529 (cf. Output.add_mode -- the first active mode that provides a output
4530 function wins). Already formatted output may be embedded into further
4531 text via Output.raw; the result of Pretty.string_of/str_of and derived
4532 functions (string_of_term/cterm/thm etc.) is already marked raw to
4533 accommodate easy composition of diagnostic messages etc. Programmers
4534 rarely need to care about Output.output or Output.raw at all, with
4535 some notable exceptions: Output.output is required when bypassing the
4536 standard channels (writeln etc.), or in token translations to produce
4537 properly formatted results; Output.raw is required when capturing
4538 already output material that will eventually be presented to the user
4539 a second time. For the default print mode, both Output.output and
4540 Output.raw have no effect.
4542 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4543 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4544 cumulative results are displayed at the end of a batch session.
4546 * Pure/General: File.sysify_path and File.quote_sysify path have been
4547 replaced by File.platform_path and File.shell_path (with appropriate
4548 hooks). This provides a clean interface for unusual systems where the
4549 internal and external process view of file names are different.
4551 * Pure: more efficient orders for basic syntactic entities: added
4552 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4553 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4554 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4555 orders now -- potential INCOMPATIBILITY for code that depends on a
4556 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4557 Library.sort_strings on result).
4559 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4560 fold_types traverse types/terms from left to right, observing natural
4561 argument order. Supercedes previous foldl_XXX versions, add_frees,
4562 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4564 * Pure: name spaces have been refined, with significant changes of the
4565 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4566 to extern(_table). The plain name entry path is superceded by a
4567 general 'naming' context, which also includes the 'policy' to produce
4568 a fully qualified name and external accesses of a fully qualified
4569 name; NameSpace.extend is superceded by context dependent
4570 Sign.declare_name. Several theory and proof context operations modify
4571 the naming context. Especially note Theory.restore_naming and
4572 ProofContext.restore_naming to get back to a sane state; note that
4573 Theory.add_path is no longer sufficient to recover from
4574 Theory.absolute_path in particular.
4576 * Pure: new flags short_names (default false) and unique_names
4577 (default true) for controlling output of qualified names. If
4578 short_names is set, names are printed unqualified. If unique_names is
4579 reset, the name prefix is reduced to the minimum required to achieve
4580 the original result when interning again, even if there is an overlap
4581 with earlier declarations.
4583 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4584 now 'extend', and 'merge' gets an additional Pretty.pp argument
4585 (useful for printing error messages). INCOMPATIBILITY.
4587 * Pure: major reorganization of the theory context. Type Sign.sg and
4588 Theory.theory are now identified, referring to the universal
4589 Context.theory (see Pure/context.ML). Actual signature and theory
4590 content is managed as theory data. The old code and interfaces were
4591 spread over many files and structures; the new arrangement introduces
4592 considerable INCOMPATIBILITY to gain more clarity:
4594 Context -- theory management operations (name, identity, inclusion,
4595 parents, ancestors, merge, etc.), plus generic theory data;
4597 Sign -- logical signature and syntax operations (declaring consts,
4598 types, etc.), plus certify/read for common entities;
4600 Theory -- logical theory operations (stating axioms, definitions,
4601 oracles), plus a copy of logical signature operations (consts,
4602 types, etc.); also a few basic management operations (Theory.copy,
4605 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4606 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4607 for convenience -- they merely return the theory.
4609 * Pure: type Type.tsig is superceded by theory in most interfaces.
4611 * Pure: the Isar proof context type is already defined early in Pure
4612 as Context.proof (note that ProofContext.context and Proof.context are
4613 aliases, where the latter is the preferred name). This enables other
4614 Isabelle components to refer to that type even before Isar is present.
4616 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4617 typeK, constK, axiomK, oracleK), but provide explicit operations for
4618 any of these kinds. For example, Sign.intern typeK is now
4619 Sign.intern_type, Theory.hide_space Sign.typeK is now
4620 Theory.hide_types. Also note that former
4621 Theory.hide_classes/types/consts are now
4622 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4623 internalize their arguments! INCOMPATIBILITY.
4625 * Pure: get_thm interface (of PureThy and ProofContext) expects
4626 datatype thmref (with constructors Name and NameSelection) instead of
4627 plain string -- INCOMPATIBILITY;
4629 * Pure: cases produced by proof methods specify options, where NONE
4630 means to remove case bindings -- INCOMPATIBILITY in
4633 * Pure: the following operations retrieve axioms or theorems from a
4634 theory node or theory hierarchy, respectively:
4636 Theory.axioms_of: theory -> (string * term) list
4637 Theory.all_axioms_of: theory -> (string * term) list
4638 PureThy.thms_of: theory -> (string * thm) list
4639 PureThy.all_thms_of: theory -> (string * thm) list
4641 * Pure: print_tac now outputs the goal through the trace channel.
4643 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4644 Reference Toplevel.debug (default false) controls detailed printing
4645 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4646 controls execution profiling -- set to 1 for time and 2 for space
4647 (both increase the runtime).
4649 * Isar session: The initial use of ROOT.ML is now always timed,
4650 i.e. the log will show the actual process times, in contrast to the
4651 elapsed wall-clock time that the outer shell wrapper produces.
4653 * Simplifier: improved handling of bound variables (nameless
4654 representation, avoid allocating new strings). Simprocs that invoke
4655 the Simplifier recursively should use Simplifier.inherit_bounds to
4656 avoid local name clashes. Failure to do so produces warnings
4657 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4658 for further details.
4660 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4661 bindings for all theorems stored within a given theory; this may help
4662 in porting non-Isar theories to Isar ones, while keeping ML proof
4663 scripts for the time being.
4665 * ML operator HTML.with_charset specifies the charset begin used for
4666 generated HTML files. For example:
4668 HTML.with_charset "utf-8" use_thy "Hebrew";
4669 HTML.with_charset "utf-8" use_thy "Chinese";
4674 * Allow symlinks to all proper Isabelle executables (Isabelle,
4675 isabelle, isatool etc.).
4677 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4678 isatool doc, isatool mkdir, display_drafts etc.).
4680 * isatool usedir: option -f allows specification of the ML file to be
4681 used by Isabelle; default is ROOT.ML.
4683 * New isatool version outputs the version identifier of the Isabelle
4684 distribution being used.
4686 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4687 (containing Boolean satisfiability problems) into Isabelle/HOL
4692 New in Isabelle2004 (April 2004)
4693 --------------------------------
4697 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4698 Replaces linorder.ML.
4700 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4701 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4702 (\<a>...\<z>), are now considered normal letters, and can therefore
4703 be used anywhere where an ASCII letter (a...zA...Z) has until
4704 now. COMPATIBILITY: This obviously changes the parsing of some
4705 terms, especially where a symbol has been used as a binder, say
4706 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4707 as an identifier. Fix it by inserting a space around former
4708 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4709 existing theory and ML files.
4711 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4713 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4714 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4715 a normal (but invisible) letter. For multiple letter subscripts repeat
4716 \<^isub> like this: x\<^isub>1\<^isub>2.
4718 * Pure: There are now sub-/superscripts that can span more than one
4719 character. Text between \<^bsub> and \<^esub> is set in subscript in
4720 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4721 superscript. The new control characters are not identifier parts.
4723 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4724 content of "..." to the latex file instead of \isacntrl... . The "..."
4725 may consist of any printable characters excluding the end bracket >.
4727 * Pure: Using new Isar command "finalconsts" (or the ML functions
4728 Theory.add_finals or Theory.add_finals_i) it is now possible to
4729 declare constants "final", which prevents their being given a definition
4730 later. It is useful for constants whose behaviour is fixed axiomatically
4731 rather than definitionally, such as the meta-logic connectives.
4733 * Pure: 'instance' now handles general arities with general sorts
4734 (i.e. intersections of classes),
4736 * Presentation: generated HTML now uses a CSS style sheet to make layout
4737 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4738 It can be changed to alter the colors/layout of generated pages.
4743 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4744 cut_tac, subgoal_tac and thin_tac:
4745 - Now understand static (Isar) contexts. As a consequence, users of Isar
4746 locales are no longer forced to write Isar proof scripts.
4747 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4749 - INCOMPATIBILITY: names of variables to be instantiated may no
4750 longer be enclosed in quotes. Instead, precede variable name with `?'.
4751 This is consistent with the instantiation attribute "where".
4753 * Attributes "where" and "of":
4754 - Now take type variables of instantiated theorem into account when reading
4755 the instantiation string. This fixes a bug that caused instantiated
4756 theorems to have too special types in some circumstances.
4757 - "where" permits explicit instantiations of type variables.
4759 * Calculation commands "moreover" and "also" no longer interfere with
4760 current facts ("this"), admitting arbitrary combinations with "then"
4764 - Goal statements involving the context element "includes" no longer
4765 generate theorems with internal delta predicates (those ending on
4766 "_axioms") in the premise.
4767 Resolve particular premise with <locale>.intro to obtain old form.
4768 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4769 specification and "includes" elements in goal statement.
4770 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4771 [intro?] and [elim?] (respectively) by default.
4772 - Experimental command for instantiation of locales in proof contexts:
4773 instantiate <label>[<attrs>]: <loc>
4774 Instantiates locale <loc> and adds all its theorems to the current context
4775 taking into account their attributes. Label and attrs are optional
4776 modifiers, like in theorem declarations. If present, names of
4777 instantiated theorems are qualified with <label>, and the attributes
4778 <attrs> are applied after any attributes these theorems might have already.
4779 If the locale has assumptions, a chained fact of the form
4780 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4781 are derived. The command does not support old-style locales declared
4782 with "locale (open)".
4783 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4785 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4791 * Proof import: new image HOL4 contains the imported library from
4792 the HOL4 system with about 2500 theorems. It is imported by
4793 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4794 can be used like any other Isabelle image. See
4795 HOL/Import/HOL/README for more information.
4798 - Much improved handling of linear and partial orders.
4799 Reasoners for linear and partial orders are set up for type classes
4800 "linorder" and "order" respectively, and are added to the default simpset
4801 as solvers. This means that the simplifier can build transitivity chains
4802 to solve goals from the assumptions.
4803 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4804 of blast or auto after simplification become unnecessary because the goal
4805 is solved by simplification already.
4807 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4808 all proved in axiomatic type classes for semirings, rings and fields.
4811 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4812 now formalized using the Ring_and_Field theory mentioned above.
4813 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4814 than before, because now they are set up once in a generic manner.
4815 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4816 Look for the general versions in Ring_and_Field (and Power if they concern
4819 * Type "rat" of the rational numbers is now available in HOL-Complex.
4822 - Record types are now by default printed with their type abbreviation
4823 instead of the list of all field types. This can be configured via
4824 the reference "print_record_type_abbr".
4825 - Simproc "record_upd_simproc" for simplification of multiple updates added
4826 (not enabled by default).
4827 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4828 EX x. x = sel r to True (not enabled by default).
4829 - Tactic "record_split_simp_tac" to split and simplify records added.
4831 * 'specification' command added, allowing for definition by
4832 specification. There is also an 'ax_specification' command that
4833 introduces the new constants axiomatically.
4835 * arith(_tac) is now able to generate counterexamples for reals as well.
4837 * HOL-Algebra: new locale "ring" for non-commutative rings.
4839 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4840 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4842 * HOL-Matrix: a first theory for matrices in HOL with an application of
4843 matrix theory to linear programming.
4845 * Unions and Intersections:
4846 The latex output syntax of UN and INT has been changed
4847 from "\Union x \in A. B" to "\Union_{x \in A} B"
4848 i.e. the index formulae has become a subscript.
4849 Similarly for "\Union x. B", and for \Inter instead of \Union.
4851 * Unions and Intersections over Intervals:
4852 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4853 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4854 like in normal math, and corresponding versions for < and for intersection.
4856 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4857 lexicographic dictonary ordering has been added as "lexord".
4859 * ML: the legacy theory structures Int and List have been removed. They had
4860 conflicted with ML Basis Library structures having the same names.
4862 * 'refute' command added to search for (finite) countermodels. Only works
4863 for a fragment of HOL. The installation of an external SAT solver is
4864 highly recommended. See "HOL/Refute.thy" for details.
4866 * 'quickcheck' command: Allows to find counterexamples by evaluating
4867 formulae under an assignment of free variables to random values.
4868 In contrast to 'refute', it can deal with inductive datatypes,
4869 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4875 * Streams now come with concatenation and are part of the HOLCF image
4879 New in Isabelle2003 (May 2003)
4880 ------------------------------
4884 * Provers/simplifier:
4886 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4887 Assumptions are now subject to complete mutual simplification,
4888 not just from left to right. The simplifier now preserves
4889 the order of assumptions.
4891 Potential INCOMPATIBILITY:
4893 -- simp sometimes diverges where the old version did
4894 not, e.g. invoking simp on the goal
4896 [| P (f x); y = x; f x = f y |] ==> Q
4898 now gives rise to the infinite reduction sequence
4900 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4902 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4905 -- Tactics combining classical reasoner and simplification (such as auto)
4906 are also affected by this change, because many of them rely on
4907 simp. They may sometimes diverge as well or yield a different numbers
4908 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4909 in case of problems. Sometimes subsequent calls to the classical
4910 reasoner will fail because a preceeding call to the simplifier too
4911 eagerly simplified the goal, e.g. deleted redundant premises.
4913 - The simplifier trace now shows the names of the applied rewrite rules
4915 - You can limit the number of recursive invocations of the simplifier
4916 during conditional rewriting (where the simplifie tries to solve the
4917 conditions before applying the rewrite rule):
4918 ML "simp_depth_limit := n"
4919 where n is an integer. Thus you can force termination where previously
4920 the simplifier would diverge.
4922 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4924 - No longer aborts on failed congruence proof. Instead, the
4925 congruence is ignored.
4927 * Pure: New generic framework for extracting programs from constructive
4928 proofs. See HOL/Extraction.thy for an example instantiation, as well
4929 as HOL/Extraction for some case studies.
4931 * Pure: The main goal of the proof state is no longer shown by default, only
4932 the subgoals. This behaviour is controlled by a new flag.
4933 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4934 (ML: Proof.show_main_goal).
4936 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4937 rules whose conclusion matches subgoal 1:
4938 PG menu: Isabelle/Isar -> Show me -> matching rules
4939 The rules are ordered by how closely they match the subgoal.
4940 In particular, rules that solve a subgoal outright are displayed first
4941 (or rather last, the way they are printed).
4942 (ML: ProofGeneral.print_intros())
4944 * Pure: New flag trace_unify_fail causes unification to print
4945 diagnostic information (PG: in trace buffer) when it fails. This is
4946 useful for figuring out why single step proofs like rule, erule or
4949 * Pure: Locale specifications now produce predicate definitions
4950 according to the body of text (covering assumptions modulo local
4951 definitions); predicate "loc_axioms" covers newly introduced text,
4952 while "loc" is cumulative wrt. all included locale expressions; the
4953 latter view is presented only on export into the global theory
4954 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4955 on the old view without predicates;
4957 * Pure: predefined locales "var" and "struct" are useful for sharing
4958 parameters (as in CASL, for example); just specify something like
4959 ``var x + var y + struct M'' as import;
4961 * Pure: improved thms_containing: proper indexing of facts instead of
4962 raw theorems; check validity of results wrt. current name space;
4963 include local facts of proof configuration (also covers active
4964 locales), cover fixed variables in index; may use "_" in term
4965 specification; an optional limit for the number of printed facts may
4966 be given (the default is 40);
4968 * Pure: disallow duplicate fact bindings within new-style theory files
4971 * Provers: improved induct method: assumptions introduced by case
4972 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4973 the goal statement); "foo" still refers to all facts collectively;
4975 * Provers: the function blast.overloaded has been removed: all constants
4976 are regarded as potentially overloaded, which improves robustness in exchange
4977 for slight decrease in efficiency;
4979 * Provers/linorder: New generic prover for transitivity reasoning over
4980 linear orders. Note: this prover is not efficient!
4982 * Isar: preview of problems to finish 'show' now produce an error
4983 rather than just a warning (in interactive mode);
4990 - Produces a counter example if it cannot prove a goal.
4991 Note that the counter example may be spurious if the goal is not a formula
4992 of quantifier-free linear arithmetic.
4993 In ProofGeneral the counter example appears in the trace buffer.
4995 - Knows about div k and mod k where k is a numeral of type nat or int.
4997 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4998 linear arithmetic fails. This takes account of quantifiers and divisibility.
4999 Presburger arithmetic can also be called explicitly via presburger(_tac).
5001 * simp's arithmetic capabilities have been enhanced a bit: it now
5002 takes ~= in premises into account (by performing a case split);
5004 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5005 are distributed over a sum of terms;
5007 * New tactic "trans_tac" and method "trans" instantiate
5008 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5011 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5012 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5014 * 'typedef' command has new option "open" to suppress the set
5017 * functions Min and Max on finite sets have been introduced (theory
5020 * attribute [symmetric] now works for relations as well; it turns
5021 (x,y) : R^-1 into (y,x) : R, and vice versa;
5023 * induct over a !!-quantified statement (say !!x1..xn):
5024 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5026 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5027 %x. None. Warning: empty_def now refers to the previously hidden definition
5030 * Algebra: formalization of classical algebra. Intended as base for
5031 any algebraic development in Isabelle. Currently covers group theory
5032 (up to Sylow's theorem) and ring theory (Universal Property of
5033 Univariate Polynomials). Contributions welcome;
5035 * GroupTheory: deleted, since its material has been moved to Algebra;
5037 * Complex: new directory of the complex numbers with numeric constants,
5038 nonstandard complex numbers, and some complex analysis, standard and
5039 nonstandard (Jacques Fleuriot);
5041 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5043 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5046 * Real/HahnBanach: updated and adapted to locales;
5048 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5051 * UNITY: added the Meier-Sanders theory of progress sets;
5053 * MicroJava: bytecode verifier and lightweight bytecode verifier
5054 as abstract algorithms, instantiated to the JVM;
5056 * Bali: Java source language formalization. Type system, operational
5057 semantics, axiomatic semantics. Supported language features:
5058 classes, interfaces, objects,virtual methods, static methods,
5059 static/instance fields, arrays, access modifiers, definite
5060 assignment, exceptions.
5065 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5068 * Main ZF: virtually all theories converted to new-style format;
5073 * Pure: Tactic.prove provides sane interface for internal proofs;
5074 omits the infamous "standard" operation, so this is more appropriate
5075 than prove_goalw_cterm in many situations (e.g. in simprocs);
5077 * Pure: improved error reporting of simprocs;
5079 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5083 *** Document preparation ***
5085 * uses \par instead of \\ for line breaks in theory text. This may
5086 shift some page breaks in large documents. To get the old behaviour
5087 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5089 * minimized dependencies of isabelle.sty and isabellesym.sty on
5092 * \<euro> now needs package babel/greek instead of marvosym (which
5095 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5100 New in Isabelle2002 (March 2002)
5101 --------------------------------
5103 *** Document preparation ***
5105 * greatly simplified document preparation setup, including more
5106 graceful interpretation of isatool usedir -i/-d/-D options, and more
5107 instructive isatool mkdir; users should basically be able to get
5108 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5109 users may run a separate document processing stage manually like this:
5110 "isatool usedir -D output HOL Test && isatool document Test/output";
5112 * theory dependency graph may now be incorporated into documents;
5113 isatool usedir -g true will produce session_graph.eps/.pdf for use
5114 with \includegraphics of LaTeX;
5116 * proper spacing of consecutive markup elements, especially text
5117 blocks after section headings;
5119 * support bold style (for single symbols only), input syntax is like
5120 this: "\<^bold>\<alpha>" or "\<^bold>A";
5122 * \<bullet> is now output as bold \cdot by default, which looks much
5123 better in printed text;
5125 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5126 note that these symbols are currently unavailable in Proof General /
5127 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5129 * isatool latex no longer depends on changed TEXINPUTS, instead
5130 isatool document copies the Isabelle style files to the target
5136 * Pure/Provers: improved proof by cases and induction;
5137 - 'case' command admits impromptu naming of parameters (such as
5139 - 'induct' method divinates rule instantiation from the inductive
5140 claim; no longer requires excessive ?P bindings for proper
5141 instantiation of cases;
5142 - 'induct' method properly enumerates all possibilities of set/type
5143 rules; as a consequence facts may be also passed through *type*
5144 rules without further ado;
5145 - 'induct' method now derives symbolic cases from the *rulified*
5146 rule (before it used to rulify cases stemming from the internal
5147 atomized version); this means that the context of a non-atomic
5148 statement becomes is included in the hypothesis, avoiding the
5149 slightly cumbersome show "PROP ?case" form;
5150 - 'induct' may now use elim-style induction rules without chaining
5151 facts, using ``missing'' premises from the goal state; this allows
5152 rules stemming from inductive sets to be applied in unstructured
5153 scripts, while still benefitting from proper handling of non-atomic
5154 statements; NB: major inductive premises need to be put first, all
5155 the rest of the goal is passed through the induction;
5156 - 'induct' proper support for mutual induction involving non-atomic
5157 rule statements (uses the new concept of simultaneous goals, see
5159 - append all possible rule selections, but only use the first
5160 success (no backtracking);
5161 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5162 - undeclared rule case names default to numbers 1, 2, 3, ...;
5163 - added 'print_induct_rules' (covered by help item in recent Proof
5165 - moved induct/cases attributes to Pure, methods to Provers;
5166 - generic method setup instantiated for FOL and HOL;
5168 * Pure: support multiple simultaneous goal statements, for example
5169 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5170 meta-level mechanism, this acts as if several individual goals had
5171 been stated separately; in particular common proof methods need to be
5172 repeated in order to cover all claims; note that a single elimination
5173 step is *not* sufficient to establish the two conjunctions, so this
5176 assume "A & B" then have A and B .. (*".." fails*)
5178 better use "obtain" in situations as above; alternative refer to
5179 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5181 * Pure: proper integration with ``locales''; unlike the original
5182 version by Florian Kammller, Isar locales package high-level proof
5183 contexts rather than raw logical ones (e.g. we admit to include
5184 attributes everywhere); operations on locales include merge and
5185 rename; support for implicit arguments (``structures''); simultaneous
5186 type-inference over imports and text; see also HOL/ex/Locales.thy for
5189 * Pure: the following commands have been ``localized'', supporting a
5190 target locale specification "(in name)": 'lemma', 'theorem',
5191 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5192 stored both within the locale and at the theory level (exported and
5193 qualified by the locale name);
5195 * Pure: theory goals may now be specified in ``long'' form, with
5196 ad-hoc contexts consisting of arbitrary locale elements. for example
5197 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5198 definitions may be given, too); the result is a meta-level rule with
5199 the context elements being discharged in the obvious way;
5201 * Pure: new proof command 'using' allows to augment currently used
5202 facts after a goal statement ('using' is syntactically analogous to
5203 'apply', but acts on the goal's facts only); this allows chained facts
5204 to be separated into parts given before and after a claim, as in
5205 ``from a and b have C using d and e <proof>'';
5207 * Pure: renamed "antecedent" case to "rule_context";
5209 * Pure: new 'judgment' command records explicit information about the
5210 object-logic embedding (used by several tools internally); no longer
5211 use hard-wired "Trueprop";
5213 * Pure: added 'corollary' command;
5215 * Pure: fixed 'token_translation' command;
5217 * Pure: removed obsolete 'exported' attribute;
5219 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5220 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5221 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5223 * Pure: method 'atomize' presents local goal premises as object-level
5224 statements (atomic meta-level propositions); setup controlled via
5225 rewrite rules declarations of 'atomize' attribute; example
5226 application: 'induct' method with proper rule statements in improper
5229 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5230 now consider the syntactic context of assumptions, giving a better
5231 chance to get type-inference of the arguments right (this is
5232 especially important for locales);
5234 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5237 * Pure/obtain: the formal conclusion "thesis", being marked as
5238 ``internal'', may no longer be reference directly in the text;
5239 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5242 * Pure: generic 'sym' attribute which declares a rule both as pure
5243 'elim?' and for the 'symmetric' operation;
5245 * Pure: marginal comments ``--'' may now occur just anywhere in the
5246 text; the fixed correlation with particular command syntax has been
5249 * Pure: new method 'rules' is particularly well-suited for proof
5250 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5251 but often produces more compact proof terms with less detours;
5253 * Pure/Provers/classical: simplified integration with pure rule
5254 attributes and methods; the classical "intro?/elim?/dest?"
5255 declarations coincide with the pure ones; the "rule" method no longer
5256 includes classically swapped intros; "intro" and "elim" methods no
5257 longer pick rules from the context; also got rid of ML declarations
5258 AddXIs/AddXEs/AddXDs; all of this has some potential for
5261 * Provers/classical: attribute 'swapped' produces classical inversions
5262 of introduction rules;
5264 * Provers/simplifier: 'simplified' attribute may refer to explicit
5265 rules instead of full simplifier context; 'iff' attribute handles
5268 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5270 * HOL: 'recdef' now fails on unfinished automated proofs, use
5271 "(permissive)" option to recover old behavior;
5273 * HOL: 'inductive' no longer features separate (collective) attributes
5274 for 'intros' (was found too confusing);
5276 * HOL: properly declared induction rules less_induct and
5282 * HOL: moved over to sane numeral syntax; the new policy is as
5285 - 0 and 1 are polymorphic constants, which are defined on any
5286 numeric type (nat, int, real etc.);
5288 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5289 binary representation internally;
5291 - type nat has special constructor Suc, and generally prefers Suc 0
5292 over 1::nat and Suc (Suc 0) over 2::nat;
5294 This change may cause significant problems of INCOMPATIBILITY; here
5295 are some hints on converting existing sources:
5297 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5298 entities, so expressions involving "-" (unary or binary minus) need
5299 to be spaced properly;
5301 - existing occurrences of "1" may need to be constraint "1::nat" or
5302 even replaced by Suc 0; similar for old "2";
5304 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5306 - remove all special provisions on numerals in proofs;
5308 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5309 representation (depends on bin_arith_simps in the default context);
5311 * HOL: symbolic syntax for x^2 (numeral 2);
5313 * HOL: the class of all HOL types is now called "type" rather than
5314 "term"; INCOMPATIBILITY, need to adapt references to this type class
5315 in axclass/classes, instance/arities, and (usually rare) occurrences
5316 in typings (of consts etc.); internally the class is called
5317 "HOL.type", ML programs should refer to HOLogic.typeS;
5319 * HOL/record package improvements:
5320 - new derived operations "fields" to build a partial record section,
5321 "extend" to promote a fixed record to a record scheme, and
5322 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5323 declared as simp by default;
5324 - shared operations ("more", "fields", etc.) now need to be always
5325 qualified) --- potential INCOMPATIBILITY;
5326 - removed "make_scheme" operations (use "make" with "extend") --
5328 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5329 - provides cases/induct rules for use with corresponding Isar
5330 methods (for concrete records, record schemes, concrete more
5331 parts, and schematic more parts -- in that order);
5332 - internal definitions directly based on a light-weight abstract
5333 theory of product types over typedef rather than datatype;
5335 * HOL: generic code generator for generating executable ML code from
5336 specifications; specific support for HOL constructs such as inductive
5337 datatypes and sets, as well as recursive functions; can be invoked
5338 via 'generate_code' theory section;
5340 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5342 * HOL: consolidated and renamed several theories. In particular:
5343 Ord.thy has been absorbed into HOL.thy
5344 String.thy has been absorbed into List.thy
5346 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5347 (beware of argument permutation!);
5349 * HOL: linorder_less_split superseded by linorder_cases;
5351 * HOL/List: "nodups" renamed to "distinct";
5353 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5354 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5355 - Ex_def has changed, now need to use some_eq_ex
5357 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5358 in this (rare) case use:
5360 delSWrapper "split_all_tac"
5361 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5363 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5366 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5367 Isabelle's type classes, ^ on functions and relations has too general
5368 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5369 necessary to attach explicit type constraints;
5371 * HOL/Relation: the prefix name of the infix "O" has been changed from
5372 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5373 renamed accordingly (eg "compI" -> "rel_compI").
5375 * HOL: syntax translations now work properly with numerals and records
5378 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5379 of "lam" -- INCOMPATIBILITY;
5381 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5382 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5383 renamed "Product_Type.unit";
5385 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5387 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5388 the "cases" method);
5390 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5393 * HOL/IMP: updated and converted to new-style theory format; several
5394 parts turned into readable document, with proper Isar proof texts and
5395 some explanations (by Gerwin Klein);
5397 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5399 * HOL-Hyperreal is now a logic image;
5404 * Isar: consts/constdefs supports mixfix syntax for continuous
5407 * Isar: domain package adapted to new-style theory format, e.g. see
5410 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5411 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5412 lift.induct_tac, always use UU instead of Undef;
5414 * HOLCF/IMP: updated and converted to new-style theory;
5419 * Isar: proper integration of logic-specific tools and packages,
5420 including theory commands '(co)inductive', '(co)datatype',
5421 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5422 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5424 * theory Main no longer includes AC; for the Axiom of Choice, base
5425 your theory on Main_ZFC;
5427 * the integer library now covers quotients and remainders, with many
5428 laws relating division to addition, multiplication, etc.;
5430 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5431 typeless version of the formalism;
5433 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5436 * ZF/Induct: new directory for examples of inductive definitions,
5437 including theory Multiset for multiset orderings; converted to
5438 new-style theory format;
5440 * ZF: many new theorems about lists, ordinals, etc.;
5445 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5446 variable proof controls level of detail: 0 = no proofs (only oracle
5447 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5448 also ref manual for further ML interfaces;
5450 * Pure/axclass: removed obsolete ML interface
5451 goal_subclass/goal_arity;
5453 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5454 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5455 separate tokens, so expressions involving minus need to be spaced
5458 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5459 rather than "infixl" or "infixr";
5461 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5462 sort constraint specifications in type inference; e.g. "x::_::foo"
5463 ensures that the type of "x" is of sort "foo" (but not necessarily a
5466 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5467 control output of nested => (types); the default behavior is
5470 * Pure/syntax: builtin parse translation for "_constify" turns valued
5471 tokens into AST constants;
5473 * Pure/syntax: prefer later declarations of translations and print
5474 translation functions; potential INCOMPATIBILITY: need to reverse
5475 multiple declarations for same syntax element constant;
5477 * Pure/show_hyps reset by default (in accordance to existing Isar
5480 * Provers/classical: renamed addaltern to addafter, addSaltern to
5483 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5486 * system: tested support for MacOS X; should be able to get Isabelle +
5487 Proof General to work in a plain Terminal after installing Poly/ML
5488 (e.g. from the Isabelle distribution area) and GNU bash alone
5489 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5490 support requires further installations, e.g. from
5491 http://fink.sourceforge.net/);
5493 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5495 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5496 of 40 MB), cf. ML_OPTIONS;
5498 * system: Proof General keywords specification is now part of the
5499 Isabelle distribution (see etc/isar-keywords.el);
5501 * system: support for persistent Proof General sessions (refrain from
5502 outdating all loaded theories on startup); user may create writable
5503 logic images like this: ``isabelle -q HOL Test'';
5505 * system: smart selection of Isabelle process versus Isabelle
5506 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5507 run both "isabelle" and "Isabelle" even if file names are badly
5508 damaged (executable inspects the case of the first letter of its own
5509 name); added separate "isabelle-process" and "isabelle-interface";
5511 * system: refrain from any attempt at filtering input streams; no
5512 longer support ``8bit'' encoding of old isabelle font, instead proper
5513 iso-latin characters may now be used; the related isatools
5514 "symbolinput" and "nonascii" have disappeared as well;
5516 * system: removed old "xterm" interface (the print modes "xterm" and
5517 "xterm_color" are still available for direct use in a suitable
5522 New in Isabelle99-2 (February 2001)
5523 -----------------------------------
5525 *** Overview of INCOMPATIBILITIES ***
5527 * HOL: please note that theories in the Library and elsewhere often use the
5528 new-style (Isar) format; to refer to their theorems in an ML script you must
5529 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5531 * HOL: inductive package no longer splits induction rule aggressively,
5532 but only as far as specified by the introductions given; the old
5533 format may be recovered via ML function complete_split_rule or attribute
5534 'split_rule (complete)';
5536 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5537 gfp_Tarski to gfp_unfold;
5539 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5541 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5542 relation); infix "^^" has been renamed "``"; infix "``" has been
5543 renamed "`"; "univalent" has been renamed "single_valued";
5545 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5548 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5550 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5552 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5553 consequence, it is no longer monotonic wrt. the local goal context
5554 (which is now passed through the inductive cases);
5556 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5557 \<gg> to \<ggreater>;
5560 *** Document preparation ***
5562 * \isabellestyle{NAME} selects version of Isabelle output (currently
5563 available: are "it" for near math-mode best-style output, "sl" for
5564 slanted text style, and "tt" for plain type-writer; if no
5565 \isabellestyle command is given, output is according to slanted
5568 * support sub/super scripts (for single symbols only), input syntax is
5569 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5571 * some more standard symbols; see Appendix A of the system manual for
5572 the complete list of symbols defined in isabellesym.sty;
5574 * improved isabelle style files; more abstract symbol implementation
5575 (should now use \isamath{...} and \isatext{...} in custom symbol
5578 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5579 state; Note that presentation of goal states does not conform to
5580 actual human-readable proof documents. Please do not include goal
5581 states into document output unless you really know what you are doing!
5583 * proper indentation of antiquoted output with proportional LaTeX
5586 * no_document ML operator temporarily disables LaTeX document
5589 * isatool unsymbolize tunes sources for plain ASCII communication;
5594 * Pure: Isar now suffers initial goal statements to contain unbound
5595 schematic variables (this does not conform to actual readable proof
5596 documents, due to unpredictable outcome and non-compositional proof
5597 checking); users who know what they are doing may use schematic goals
5598 for Prolog-style synthesis of proven results;
5600 * Pure: assumption method (an implicit finishing) now handles actual
5603 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5604 initial goal, declare "that" only as Pure intro (only for single
5605 steps); the "that" rule assumption may now be involved in implicit
5606 finishing, thus ".." becomes a feasible for trivial obtains;
5608 * Pure: default proof step now includes 'intro_classes'; thus trivial
5609 instance proofs may be performed by "..";
5611 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5614 * Pure: more robust selection of calculational rules;
5616 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5617 rule (as well as the assumption rule);
5619 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5620 lemmas, using the graph browser tool;
5622 * Pure: predict failure of "show" in interactive mode;
5624 * Pure: 'thms_containing' now takes actual terms as arguments;
5626 * HOL: improved method 'induct' --- now handles non-atomic goals
5627 (potential INCOMPATIBILITY); tuned error handling;
5629 * HOL: cases and induct rules now provide explicit hints about the
5630 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5631 any remaining facts are inserted into the goal verbatim;
5633 * HOL: local contexts (aka cases) may now contain term bindings as
5634 well; the 'cases' and 'induct' methods new provide a ?case binding for
5635 the result to be shown in each case;
5637 * HOL: added 'recdef_tc' command;
5639 * isatool convert assists in eliminating legacy ML scripts;
5644 * HOL/Library: a collection of generic theories to be used together
5645 with main HOL; the theory loader path already includes this directory
5646 by default; the following existing theories have been moved here:
5647 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5648 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5650 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5651 modelling and verification task performed in Isabelle/HOL +
5652 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5654 * HOL/Algebra: special summation operator SUM no longer exists, it has
5655 been replaced by setsum; infix 'assoc' now has priority 50 (like
5656 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5657 'domain', this makes the theory consistent with mathematical
5660 * HOL basics: added overloaded operations "inverse" and "divide"
5661 (infix "/"), syntax for generic "abs" operation, generic summation
5664 * HOL/typedef: simplified package, provide more useful rules (see also
5667 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5668 now expressed as a proper nested rule (old-style tactic scripts may
5669 require atomize_strip_tac to cope with non-atomic premises);
5671 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5672 to "split_conv" (old name still available for compatibility);
5674 * HOL: improved concrete syntax for strings (e.g. allows translation
5675 rules with string literals);
5677 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5678 and Fleuriot's mechanization of analysis, including the transcendental
5679 functions for the reals;
5681 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5686 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5687 "lam" is displayed as TWO lambda-symbols
5689 * CTT: theory Main now available, containing everything (that is, Bool
5695 * Pure: the Simplifier has been implemented properly as a derived rule
5696 outside of the actual kernel (at last!); the overall performance
5697 penalty in practical applications is about 50%, while reliability of
5698 the Isabelle inference kernel has been greatly improved;
5700 * print modes "brackets" and "no_brackets" control output of nested =>
5701 (types) and ==> (props); the default behaviour is "brackets";
5703 * Provers: fast_tac (and friends) now handle actual object-logic rules
5704 as assumptions as well;
5706 * system: support Poly/ML 4.0;
5708 * system: isatool install handles KDE version 1 or 2;
5712 New in Isabelle99-1 (October 2000)
5713 ----------------------------------
5715 *** Overview of INCOMPATIBILITIES ***
5717 * HOL: simplification of natural numbers is much changed; to partly
5718 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5719 issue the following ML commands:
5721 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5722 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5724 * HOL: simplification no longer dives into case-expressions; this is
5725 controlled by "t.weak_case_cong" for each datatype t;
5727 * HOL: nat_less_induct renamed to less_induct;
5729 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5730 fixsome to patch .thy and .ML sources automatically;
5732 select_equality -> some_equality
5733 select_eq_Ex -> some_eq_ex
5734 selectI2EX -> someI2_ex
5737 select1_equality -> some1_equality
5738 Eps_sym_eq -> some_sym_eq_trivial
5739 Eps_eq -> some_eq_trivial
5741 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5743 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5746 * HOL: the recursion equations generated by 'recdef' are now called
5747 f.simps instead of f.rules;
5749 * HOL: qed_spec_mp now also handles bounded ALL as well;
5751 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5752 sometimes be needed;
5754 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5756 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5758 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5759 product is now "<*>" instead of "Times"; the lexicographic product is
5760 now "<*lex*>" instead of "**";
5762 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5763 of main HOL, but was unused); better use HOL's datatype package;
5765 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5766 the old syntax may be recovered as follows:
5769 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5770 (infixl "\\<oplus>" 100)
5772 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5774 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5775 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5778 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5779 changed from A/r to A//r;
5781 * ZF: new treatment of arithmetic (nat & int) may break some old
5784 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5785 rulify -> rule_format, elimify -> elim_format, ...);
5787 * Isar/Provers: intro/elim/dest attributes changed; renamed
5788 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5789 should have to change intro!! to intro? only); replaced "delrule" by
5792 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5794 * Provers: strengthened force_tac by using new first_best_tac;
5796 * LaTeX document preparation: several changes of isabelle.sty (see
5800 *** Document preparation ***
5802 * formal comments (text blocks etc.) in new-style theories may now
5803 contain antiquotations of thm/prop/term/typ/text to be presented
5804 according to latex print mode; concrete syntax is like this:
5805 @{term[show_types] "f(x) = a + x"};
5807 * isatool mkdir provides easy setup of Isabelle session directories,
5808 including proper document sources;
5810 * generated LaTeX sources are now deleted after successful run
5811 (isatool document -c); may retain a copy somewhere else via -D option
5814 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5815 style files, achieving self-contained LaTeX sources and simplifying
5818 * old-style theories now produce (crude) LaTeX output as well;
5820 * browser info session directories are now self-contained (may be put
5821 on WWW server seperately); improved graphs of nested sessions; removed
5822 graph for 'all sessions';
5824 * several improvements in isabelle style files; \isabellestyle{it}
5825 produces fake math mode output; \isamarkupheader is now \section by
5826 default; see lib/texinputs/isabelle.sty etc.;
5831 * Isar/Pure: local results and corresponding term bindings are now
5832 subject to Hindley-Milner polymorphism (similar to ML); this
5833 accommodates incremental type-inference very nicely;
5835 * Isar/Pure: new derived language element 'obtain' supports
5836 generalized existence reasoning;
5838 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5839 support accumulation of results, without applying any rules yet;
5840 useful to collect intermediate results without explicit name
5841 references, and for use with transitivity rules with more than 2
5844 * Isar/Pure: scalable support for case-analysis type proofs: new
5845 'case' language element refers to local contexts symbolically, as
5846 produced by certain proof methods; internally, case names are attached
5847 to theorems as "tags";
5849 * Isar/Pure: theory command 'hide' removes declarations from
5850 class/type/const name spaces;
5852 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5853 indicate potential overloading;
5855 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5857 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5858 "{a,b,c}" instead of {a,b,c};
5860 * Isar/Pure now provides its own version of intro/elim/dest
5861 attributes; useful for building new logics, but beware of confusion
5862 with the version in Provers/classical;
5864 * Isar/Pure: the local context of (non-atomic) goals is provided via
5865 case name 'antecedent';
5867 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5868 to the current context is now done automatically);
5870 * Isar/Pure: theory command 'method_setup' provides a simple interface
5871 for definining proof methods in ML;
5873 * Isar/Provers: intro/elim/dest attributes changed; renamed
5874 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5875 most cases, one should have to change intro!! to intro? only);
5876 replaced "delrule" by "rule del";
5878 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5879 'symmetric' attribute (the latter supercedes [RS sym]);
5881 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5882 method modifier); 'simp' method: 'only:' modifier removes loopers as
5883 well (including splits);
5885 * Isar/Provers: Simplifier and Classical methods now support all kind
5886 of modifiers used in the past, including 'cong', 'iff', etc.
5888 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5889 of Simplifier and Classical reasoner);
5891 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5892 now support named cases; major packages (inductive, datatype, primrec,
5893 recdef) support case names and properly name parameters;
5895 * Isar/HOL: new transitivity rules for substitution in inequalities --
5896 monotonicity conditions are extracted to be proven at end of
5899 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5902 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5903 split_if split_if_asm; datatype package provides theorems foo.splits =
5904 foo.split foo.split_asm for each datatype;
5906 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5907 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5908 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5909 use "(cases (simplified))" method in proper proof texts);
5911 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5913 * Isar: names of theorems etc. may be natural numbers as well;
5915 * Isar: 'pr' command: optional arguments for goals_limit and
5916 ProofContext.prems_limit; no longer prints theory contexts, but only
5919 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5920 additional print modes to be specified; e.g. "pr(latex)" will print
5921 proof state according to the Isabelle LaTeX style;
5923 * Isar: improved support for emulating tactic scripts, including proof
5924 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5925 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5926 (for HOL datatypes);
5928 * Isar: simplified (more robust) goal selection of proof methods: 1st
5929 goal, all goals, or explicit goal specifier (tactic emulation); thus
5930 'proof method scripts' have to be in depth-first order;
5932 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5934 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5935 should instead use individual commands for printing items
5936 (print_commands, print_methods etc.);
5938 * Isar: added 'nothing' --- the empty list of theorems;
5943 * HOL/MicroJava: formalization of a fragment of Java, together with a
5944 corresponding virtual machine and a specification of its bytecode
5945 verifier and a lightweight bytecode verifier, including proofs of
5946 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5947 Cornelia Pusch (see also the homepage of project Bali at
5948 http://isabelle.in.tum.de/Bali/);
5950 * HOL/Algebra: new theory of rings and univariate polynomials, by
5953 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5954 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5957 * HOL/Lattice: fundamental concepts of lattice theory and order
5958 structures, including duals, properties of bounds versus algebraic
5959 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5960 Theorem for complete lattices etc.; may also serve as a demonstration
5961 for abstract algebraic reasoning using axiomatic type classes, and
5962 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5964 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5967 * HOL/IMPP: extension of IMP with local variables and mutually
5968 recursive procedures, by David von Oheimb;
5970 * HOL/Lambda: converted into new-style theory and document;
5972 * HOL/ex/Multiquote: example of multiple nested quotations and
5973 anti-quotations -- basically a generalized version of de-Bruijn
5974 representation; very useful in avoiding lifting of operations;
5976 * HOL/record: added general record equality rule to simpset; fixed
5977 select-update simplification procedure to handle extended records as
5978 well; admit "r" as field name;
5980 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5981 other numeric types and also as the identity of groups, rings, etc.;
5983 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5984 Types nat and int belong to this axclass;
5986 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5987 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5988 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5989 two terms #m*u and #n*u are replaced by #(m+n)*u
5990 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5991 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5992 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5994 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5995 powerful prover for predicate logic but knows nothing of clasets; see
5996 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5998 * HOL: new version of "case_tac" subsumes both boolean case split and
5999 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6000 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6002 * HOL: simplification no longer dives into case-expressions: only the
6003 selector expression is simplified, but not the remaining arms; to
6004 enable full simplification of case-expressions for datatype t, you may
6005 remove t.weak_case_cong from the simpset, either globally (Delcongs
6006 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6008 * HOL/recdef: the recursion equations generated by 'recdef' for
6009 function 'f' are now called f.simps instead of f.rules; if all
6010 termination conditions are proved automatically, these simplification
6011 rules are added to the simpset, as in primrec; rules may be named
6012 individually as well, resulting in a separate list of theorems for
6015 * HOL/While is a new theory that provides a while-combinator. It
6016 permits the definition of tail-recursive functions without the
6017 provision of a termination measure. The latter is necessary once the
6018 invariant proof rule for while is applied.
6020 * HOL: new (overloaded) notation for the set of elements below/above
6021 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6023 * HOL: theorems impI, allI, ballI bound as "strip";
6025 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6026 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6027 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6029 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6031 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6032 main HOL, but was unused);
6034 * HOL: fewer consts declared as global (e.g. have to refer to
6035 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6037 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6038 in case of overlap with user translations (e.g. judgements over
6039 tuples); (note that the underlying logical represenation is still
6045 * ZF: simplification automatically cancels common terms in arithmetic
6046 expressions over nat and int;
6048 * ZF: new treatment of nat to minimize type-checking: all operators
6049 coerce their operands to a natural number using the function natify,
6050 making the algebraic laws unconditional;
6052 * ZF: as above, for int: operators coerce their operands to an integer
6053 using the function intify;
6055 * ZF: the integer library now contains many of the usual laws for the
6056 orderings, including $<=, and monotonicity laws for $+ and $*;
6058 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6061 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6062 to the simplifier and classical reasoner simultaneously;
6067 * Provers: blast_tac now handles actual object-logic rules as
6068 assumptions; note that auto_tac uses blast_tac internally as well;
6070 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6071 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6073 * Provers: delrules now handles destruct rules as well (no longer need
6074 explicit make_elim);
6076 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6077 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6078 use instead the strong form,
6079 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6080 in HOL, FOL and ZF the function cla_make_elim will create such rules
6081 from destruct-rules;
6083 * Provers: Simplifier.easy_setup provides a fast path to basic
6084 Simplifier setup for new object-logics;
6086 * Pure: AST translation rules no longer require constant head on LHS;
6088 * Pure: improved name spaces: ambiguous output is qualified; support
6089 for hiding of names;
6091 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6092 XSYMBOL_HOME; no longer need to do manual configuration in most
6095 * system: compression of ML heaps images may now be controlled via -c
6096 option of isabelle and isatool usedir (currently only observed by
6099 * system: isatool installfonts may handle X-Symbol fonts as well (very
6100 useful for remote X11);
6102 * system: provide TAGS file for Isabelle sources;
6104 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6107 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6108 timing flag supersedes proof_timing and Toplevel.trace;
6110 * ML: new combinators |>> and |>>> for incremental transformations
6111 with secondary results (e.g. certain theory extensions):
6113 * ML: PureThy.add_defs gets additional argument to indicate potential
6114 overloading (usually false);
6116 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6121 New in Isabelle99 (October 1999)
6122 --------------------------------
6124 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6126 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6127 are no longer simplified. (This allows the simplifier to unfold recursive
6128 functional programs.) To restore the old behaviour, declare
6130 Delcongs [if_weak_cong];
6132 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6135 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6137 * HOL/datatype: mutual_induct_tac no longer exists --
6138 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6140 * HOL/typedef: fixed type inference for representing set; type
6141 arguments now have to occur explicitly on the rhs as type constraints;
6143 * ZF: The con_defs part of an inductive definition may no longer refer
6144 to constants declared in the same theory;
6146 * HOL, ZF: the function mk_cases, generated by the inductive
6147 definition package, has lost an argument. To simplify its result, it
6148 uses the default simpset instead of a supplied list of theorems.
6150 * HOL/List: the constructors of type list are now Nil and Cons;
6152 * Simplifier: the type of the infix ML functions
6153 setSSolver addSSolver setSolver addSolver
6154 is now simpset * solver -> simpset where `solver' is a new abstract type
6155 for packaging solvers. A solver is created via
6156 mk_solver: string -> (thm list -> int -> tactic) -> solver
6157 where the string argument is only a comment.
6162 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6163 decision procedure for linear arithmetic. Currently it is used for
6164 types `nat', `int', and `real' in HOL (see below); it can, should and
6165 will be instantiated for other types and logics as well.
6167 * The simplifier now accepts rewrite rules with flexible heads, eg
6168 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6169 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6175 * New Isabelle/Isar subsystem provides an alternative to traditional
6176 tactical theorem proving; together with the ProofGeneral/isar user
6177 interface it offers an interactive environment for developing human
6178 readable proof documents (Isar == Intelligible semi-automated
6179 reasoning); for further information see isatool doc isar-ref,
6180 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6182 * improved and simplified presentation of theories: better HTML markup
6183 (including colors), graph views in several sizes; isatool usedir now
6184 provides a proper interface for user theories (via -P option); actual
6185 document preparation based on (PDF)LaTeX is available as well (for
6186 new-style theories only); see isatool doc system for more information;
6188 * native support for Proof General, both for classic Isabelle and
6191 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6192 using the graph browser tool;
6194 * Isabelle manuals now also available as PDF;
6196 * theory loader rewritten from scratch (may not be fully
6197 bug-compatible); old loadpath variable has been replaced by show_path,
6198 add_path, del_path, reset_path functions; new operations such as
6199 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6202 * improved isatool install: option -k creates KDE application icon,
6203 option -p DIR installs standalone binaries;
6205 * added ML_PLATFORM setting (useful for cross-platform installations);
6206 more robust handling of platform specific ML images for SML/NJ;
6208 * the settings environment is now statically scoped, i.e. it is never
6209 created again in sub-processes invoked from isabelle, isatool, or
6212 * path element specification '~~' refers to '$ISABELLE_HOME';
6214 * in locales, the "assumes" and "defines" parts may be omitted if
6217 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6220 * new print_mode "HTML";
6222 * new flag show_tags controls display of tags of theorems (which are
6223 basically just comments that may be attached by some tools);
6225 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6226 mode and goal output format:
6228 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6230 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6232 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6233 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6235 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6237 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6239 * function bind_thms stores lists of theorems (cf. bind_thm);
6241 * new shorthand tactics ftac, eatac, datac, fatac;
6243 * qed (and friends) now accept "" as result name; in that case the
6244 theorem is not stored, but proper checks and presentation of the
6247 * theorem database now also indexes constants "Trueprop", "all",
6248 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6253 ** HOL arithmetic **
6255 * There are now decision procedures for linear arithmetic over nat and
6258 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6259 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6260 are treated as atomic; subformulae not involving type `nat' or `int'
6261 are ignored; quantified subformulae are ignored unless they are
6262 positive universal or negative existential. The tactic has to be
6263 invoked by hand and can be a little bit slow. In particular, the
6264 running time is exponential in the number of occurrences of `min' and
6265 `max', and `-' on `nat'.
6267 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6268 (negated) (in)equalities among the premises and the conclusion into
6269 account (i.e. no compound formulae) and does not know about `min' and
6270 `max', and `-' on `nat'. It is fast and is used automatically by the
6273 NB: At the moment, these decision procedures do not cope with mixed
6274 nat/int formulae where the two parts interact, such as `m < n ==>
6277 * HOL/Numeral provides a generic theory of numerals (encoded
6278 efficiently as bit strings); setup for types nat/int/real is in place;
6279 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6280 int, existing theories and proof scripts may require a few additional
6283 * integer division and remainder can now be performed on constant
6286 * many properties of integer multiplication, division and remainder
6289 * An interface to the Stanford Validity Checker (SVC) is available through the
6290 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6291 are proved automatically. SVC must be installed separately, and its results
6292 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6293 invocation of the underlying oracle). For SVC see
6294 http://verify.stanford.edu/SVC
6296 * IsaMakefile: the HOL-Real target now builds an actual image;
6301 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6302 (in Isabelle/Isar) -- by Gertrud Bauer;
6304 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6305 analysis for assembly languages with subtypes;
6307 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6308 -- avoids syntactic ambiguities and treats state, transition, and
6309 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6310 changed syntax and (many) tactics;
6312 * HOL/inductive: Now also handles more general introduction rules such
6313 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6314 theorems are now maintained within the theory (maintained via the
6317 * HOL/datatype: Now also handles arbitrarily branching datatypes
6318 (using function types) such as
6320 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6322 * HOL/record: record_simproc (part of the default simpset) takes care
6323 of selectors applied to updated records; record_split_tac is no longer
6324 part of the default claset; update_defs may now be removed from the
6325 simpset in many cases; COMPATIBILITY: old behavior achieved by
6327 claset_ref () := claset() addSWrapper record_split_wrapper;
6328 Delsimprocs [record_simproc]
6330 * HOL/typedef: fixed type inference for representing set; type
6331 arguments now have to occur explicitly on the rhs as type constraints;
6333 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6334 names rather than an ML expression;
6336 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6337 supplied later. Program schemes can be defined, such as
6338 "While B C s = (if B s then While B C (C s) else s)"
6339 where the well-founded relation can be chosen after B and C have been given.
6341 * HOL/List: the constructors of type list are now Nil and Cons;
6342 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6343 course, ML tools referring to List.list.op # etc. have to be adapted;
6345 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6346 disabled by default; run isabelle with option -m HOL to get back to
6347 the original Gordon/HOL-style output;
6349 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6350 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6352 * HOL basic syntax simplified (more orthogonal): all variants of
6353 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6354 Eps operator is provided as well: "SOME x. P[x]";
6356 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6358 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6359 thus available for user theories;
6361 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6362 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6365 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6366 several times and then mp;
6371 * the notation <<...>> is now available as a notation for sequences of
6374 * the simplifier is now installed
6376 * the axiom system has been generalized (thanks to Soren Heilmann)
6378 * the classical reasoner now has a default rule database
6383 * new primrec section allows primitive recursive functions to be given
6384 directly (as in HOL) over datatypes and the natural numbers;
6386 * new tactics induct_tac and exhaust_tac for induction (or case
6387 analysis) over datatypes and the natural numbers;
6389 * the datatype declaration of type T now defines the recursor T_rec;
6391 * simplification automatically does freeness reasoning for datatype
6394 * automatic type-inference, with AddTCs command to insert new
6395 type-checking rules;
6397 * datatype introduction rules are now added as Safe Introduction rules
6400 * the syntax "if P then x else y" is now available in addition to
6404 *** Internal programming interfaces ***
6406 * tuned simplifier trace output; new flag debug_simp;
6408 * structures Vartab / Termtab (instances of TableFun) offer efficient
6409 tables indexed by indexname_ord / term_ord (compatible with aconv);
6411 * AxClass.axclass_tac lost the theory argument;
6413 * tuned current_goals_markers semantics: begin / end goal avoids
6414 printing empty lines;
6416 * removed prs and prs_fn hook, which was broken because it did not
6417 include \n in its semantics, forcing writeln to add one
6418 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6419 string -> unit if you really want to output text without newline;
6421 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6422 plain output, interface builders may have to enable 'isabelle_font'
6423 mode to get Isabelle font glyphs as before;
6425 * refined token_translation interface; INCOMPATIBILITY: output length
6426 now of type real instead of int;
6428 * theory loader actions may be traced via new ThyInfo.add_hook
6429 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6430 your own database of information attached to *whole* theories -- as
6431 opposed to intra-theory data slots offered via TheoryDataFun;
6433 * proper handling of dangling sort hypotheses (at last!);
6434 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6435 extra sort hypotheses that can be witnessed from the type signature;
6436 the force_strip_shyps flag is gone, any remaining shyps are simply
6437 left in the theorem (with a warning issued by strip_shyps_warning);
6441 New in Isabelle98-1 (October 1998)
6442 ----------------------------------
6444 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6446 * several changes of automated proof tools;
6448 * HOL: major changes to the inductive and datatype packages, including
6449 some minor incompatibilities of theory syntax;
6451 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6454 * HOL: removed duplicate thms in Arith:
6455 less_imp_add_less should be replaced by trans_less_add1
6456 le_imp_add_le should be replaced by trans_le_add1
6458 * HOL: unary minus is now overloaded (new type constraints may be
6461 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6462 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6463 now taken as an integer constant.
6465 * Pure: ML function 'theory_of' renamed to 'theory';
6471 1. Asm_full_simp_tac is now more aggressive.
6472 1. It will sometimes reorient premises if that increases their power to
6474 2. It does no longer proceed strictly from left to right but may also
6475 rotate premises to achieve further simplification.
6476 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6477 old Asm_full_simp_tac in that it does not rotate premises.
6478 2. The simplifier now knows a little bit about nat-arithmetic.
6480 * Classical reasoner: wrapper mechanism for the classical reasoner now
6481 allows for selected deletion of wrappers, by introduction of names for
6482 wrapper functionals. This implies that addbefore, addSbefore,
6483 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6484 and that adding two tactics with the same name overwrites the first
6485 one (emitting a warning).
6486 type wrapper = (int -> tactic) -> (int -> tactic)
6487 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6488 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6489 delWrapper, delSWrapper: claset * string -> claset
6490 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6492 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6493 semantics; addbefore now affects only the unsafe part of step_tac
6494 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6495 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6498 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6499 compWrapper; added safe wrapper (and access functions for it);
6501 * HOL/split_all_tac is now much faster and fails if there is nothing
6502 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6503 and the names of the automatically generated variables have changed.
6504 split_all_tac has moved within claset() from unsafe wrappers to safe
6505 wrappers, which means that !!-bound variables are split much more
6506 aggressively, and safe_tac and clarify_tac now split such variables.
6507 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6508 Note: the same holds for record_split_tac, which does the job of
6509 split_all_tac for record fields.
6511 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6512 permanently to the default simpset using Addsplits just like
6513 Addsimps. They can be removed via Delsplits just like
6514 Delsimps. Lower-case versions are also available.
6516 * HOL/Simplifier: The rule split_if is now part of the default
6517 simpset. This means that the simplifier will eliminate all occurrences
6518 of if-then-else in the conclusion of a goal. To prevent this, you can
6519 either remove split_if completely from the default simpset by
6520 `Delsplits [split_if]' or remove it in a specific call of the
6521 simplifier using `... delsplits [split_if]'. You can also add/delete
6522 other case splitting rules to/from the default simpset: every datatype
6523 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6524 t is the name of the datatype).
6526 * Classical reasoner / Simplifier combination: new force_tac (and
6527 derivatives Force_tac, force) combines rewriting and classical
6528 reasoning (and whatever other tools) similarly to auto_tac, but is
6529 aimed to solve the given subgoal completely.
6534 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6535 and `goalw': the theory is no longer needed as an explicit argument -
6536 the current theory context is used; assumptions are no longer returned
6537 at the ML-level unless one of them starts with ==> or !!; it is
6538 recommended to convert to these new commands using isatool fixgoal
6539 (backup your sources first!);
6541 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6542 the current theory context, and 'theory' to lookup stored theories;
6544 * new theory section 'locale' for declaring constants, assumptions and
6545 definitions that have local scope;
6547 * new theory section 'nonterminals' for purely syntactic types;
6549 * new theory section 'setup' for generic ML setup functions
6550 (e.g. package initialization);
6552 * the distribution now includes Isabelle icons: see
6553 lib/logo/isabelle-{small,tiny}.xpm;
6555 * isatool install - install binaries with absolute references to
6558 * isatool logo -- create instances of the Isabelle logo (as EPS);
6560 * print mode 'emacs' reserved for Isamode;
6562 * support multiple print (ast) translations per constant name;
6564 * theorems involving oracles are now printed with a suffixed [!];
6569 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6571 * HOL/inductive package reorganized and improved: now supports mutual
6577 oddI "n : EVEN ==> Suc n : ODD"
6578 evenI "n : ODD ==> Suc n : EVEN"
6580 new theorem list "elims" contains an elimination rule for each of the
6581 recursive sets; inductive definitions now handle disjunctive premises
6582 correctly (also ZF);
6584 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6585 "mutual_induct" no longer exists - the induction rule is always
6586 contained in "induct";
6589 * HOL/datatype package re-implemented and greatly improved: now
6590 supports mutually recursive datatypes such as
6593 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6594 | SUM ('a aexp) ('a aexp)
6595 | DIFF ('a aexp) ('a aexp)
6598 'a bexp = LESS ('a aexp) ('a aexp)
6599 | AND ('a bexp) ('a bexp)
6600 | OR ('a bexp) ('a bexp)
6602 as well as indirectly recursive datatypes such as
6605 ('a, 'b) term = Var 'a
6606 | App 'b ((('a, 'b) term) list)
6608 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6609 induction on mutually / indirectly recursive datatypes.
6611 Primrec equations are now stored in theory and can be accessed via
6612 <function_name>.simps.
6616 - Theories using datatypes must now have theory Datatype as an
6618 - The specific <typename>.induct_tac no longer exists - use the
6619 generic induct_tac instead.
6620 - natE has been renamed to nat.exhaust - use exhaust_tac
6621 instead of res_inst_tac ... natE. Note that the variable
6622 names in nat.exhaust differ from the names in natE, this
6623 may cause some "fragile" proofs to fail.
6624 - The theorems split_<typename>_case and split_<typename>_case_asm
6625 have been renamed to <typename>.split and <typename>.split_asm.
6626 - Since default sorts of type variables are now handled correctly,
6627 some datatype definitions may have to be annotated with explicit
6629 - Primrec definitions no longer require function name and type
6630 of recursive argument.
6632 Consider using isatool fixdatatype to adapt your theories and proof
6633 scripts to the new package (backup your sources first!).
6636 * HOL/record package: considerably improved implementation; now
6637 includes concrete syntax for record types, terms, updates; theorems
6638 for surjective pairing and splitting !!-bound record variables; proof
6639 support is as follows:
6641 1) standard conversions (selectors or updates applied to record
6642 constructor terms) are part of the standard simpset;
6644 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6645 made part of standard simpset and claset via addIffs;
6647 3) a tactic for record field splitting (record_split_tac) is part of
6648 the standard claset (addSWrapper);
6650 To get a better idea about these rules you may retrieve them via
6651 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6652 the name of your record type.
6654 The split tactic 3) conceptually simplifies by the following rule:
6656 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6658 Thus any record variable that is bound by meta-all will automatically
6659 blow up into some record constructor term, consequently the
6660 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6661 solve record problems automatically.
6664 * reorganized the main HOL image: HOL/Integ and String loaded by
6665 default; theory Main includes everything;
6667 * automatic simplification of integer sums and comparisons, using cancellation;
6669 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6671 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6673 * many new identities for unions, intersections, set difference, etc.;
6675 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6676 called split_if, split_split, split_sum_case and split_nat_case (to go
6677 with add/delsplits);
6679 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6680 (?x::unit) = (); this is made part of the default simpset, which COULD
6681 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6682 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6683 unit_abs_eta_conv is added in order to counter the effect of
6684 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6687 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6690 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6691 It and 'sym RS equals0D' are now in the default claset, giving automatic
6692 disjointness reasoning but breaking a few old proofs.
6694 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6695 to 'converse' from 'inverse' (for compatibility with ZF and some
6698 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6699 the well-founded relation;
6701 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6702 Compl A. The "Compl" syntax remains available as input syntax for this
6705 * HOL/Update: new theory of function updates:
6706 f(a:=b) == %x. if x=a then b else f x
6707 may also be iterated as in f(a:=b,c:=d,...);
6709 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6712 - new function list_update written xs[i:=v] that updates the i-th
6713 list position. May also be iterated as in xs[i:=a,j:=b,...].
6714 - new function `upt' written [i..j(] which generates the list
6715 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6716 bound write [i..j], which is a shorthand for [i..j+1(].
6717 - new lexicographic orderings and corresponding wellfoundedness theorems.
6720 - removed 'pred' (predecessor) function;
6721 - generalized some theorems about n-1;
6722 - many new laws about "div" and "mod";
6723 - new laws about greatest common divisors (see theory ex/Primes);
6725 * HOL/Relation: renamed the relational operator r^-1 "converse"
6726 instead of "inverse";
6728 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6729 of the multiset ordering;
6731 * directory HOL/Real: a construction of the reals using Dedekind cuts
6732 (not included by default);
6734 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6736 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6737 programs, i.e. different program variables may have different types.
6739 * calling (stac rew i) now fails if "rew" has no effect on the goal
6740 [previously, this check worked only if the rewrite rule was unconditional]
6741 Now rew can involve either definitions or equalities (either == or =).
6746 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6747 only the theorems proved on ZF.ML;
6749 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6750 It and 'sym RS equals0D' are now in the default claset, giving automatic
6751 disjointness reasoning but breaking a few old proofs.
6753 * ZF/Update: new theory of function updates
6754 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6755 may also be iterated as in f(a:=b,c:=d,...);
6757 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6759 * calling (stac rew i) now fails if "rew" has no effect on the goal
6760 [previously, this check worked only if the rewrite rule was unconditional]
6761 Now rew can involve either definitions or equalities (either == or =).
6763 * case_tac provided for compatibility with HOL
6764 (like the old excluded_middle_tac, but with subgoals swapped)
6767 *** Internal programming interfaces ***
6769 * Pure: several new basic modules made available for general use, see
6770 also src/Pure/README;
6772 * improved the theory data mechanism to support encapsulation (data
6773 kind name replaced by private Object.kind, acting as authorization
6774 key); new type-safe user interface via functor TheoryDataFun; generic
6775 print_data function becomes basically useless;
6777 * removed global_names compatibility flag -- all theory declarations
6778 are qualified by default;
6780 * module Pure/Syntax now offers quote / antiquote translation
6781 functions (useful for Hoare logic etc. with implicit dependencies);
6782 see HOL/ex/Antiquote for an example use;
6784 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6787 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6790 * Display.print_goals function moved to Locale.print_goals;
6792 * standard print function for goals supports current_goals_markers
6793 variable for marking begin of proof, end of proof, start of goal; the
6794 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6795 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6800 New in Isabelle98 (January 1998)
6801 --------------------------------
6803 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6805 * changed lexical syntax of terms / types: dots made part of long
6806 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6808 * simpset (and claset) reference variable replaced by functions
6809 simpset / simpset_ref;
6811 * no longer supports theory aliases (via merge) and non-trivial
6812 implicit merge of thms' signatures;
6814 * most internal names of constants changed due to qualified names;
6816 * changed Pure/Sequence interface (see Pure/seq.ML);
6819 *** General Changes ***
6821 * hierachically structured name spaces (for consts, types, axms, thms
6822 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6823 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6824 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6825 long_names for fully qualified output names; NOTE: ML programs
6826 (special tactics, packages etc.) referring to internal names may have
6827 to be adapted to cope with fully qualified names; in case of severe
6828 backward campatibility problems try setting 'global_names' at compile
6829 time to have enrything declared within a flat name space; one may also
6830 fine tune name declarations in theories via the 'global' and 'local'
6833 * reimplemented the implicit simpset and claset using the new anytype
6834 data filed in signatures; references simpset:simpset ref etc. are
6835 replaced by functions simpset:unit->simpset and
6836 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6837 to patch your ML files accordingly;
6839 * HTML output now includes theory graph data for display with Java
6840 applet or isatool browser; data generated automatically via isatool
6841 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6843 * defs may now be conditional; improved rewrite_goals_tac to handle
6844 conditional equations;
6846 * defs now admits additional type arguments, using TYPE('a) syntax;
6848 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6849 creates a new theory node; implicit merge of thms' signatures is
6850 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6851 transfer:theory->thm->thm in (rare) cases;
6853 * improved handling of draft signatures / theories; draft thms (and
6854 ctyps, cterms) are automatically promoted to real ones;
6856 * slightly changed interfaces for oracles: admit many per theory, named
6857 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6859 * print_goals: optional output of const types (set show_consts and
6862 * improved output of warnings (###) and errors (***);
6864 * subgoal_tac displays a warning if the new subgoal has type variables;
6866 * removed old README and Makefiles;
6868 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6870 * removed obsolete init_pps and init_database;
6872 * deleted the obsolete tactical STATE, which was declared by
6873 fun STATE tacfun st = tacfun st st;
6875 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6876 (which abbreviates $HOME);
6878 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6879 use isatool fixseq to adapt your ML programs (this works for fully
6880 qualified references to the Sequence structure only!);
6882 * use_thy no longer requires writable current directory; it always
6883 reloads .ML *and* .thy file, if either one is out of date;
6886 *** Classical Reasoner ***
6888 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6889 tactics that use classical reasoning to simplify a subgoal without
6890 splitting it into several subgoals;
6892 * Safe_tac: like safe_tac but uses the default claset;
6897 * added simplification meta rules:
6898 (asm_)(full_)simplify: simpset -> thm -> thm;
6900 * simplifier.ML no longer part of Pure -- has to be loaded by object
6903 * added prems argument to simplification procedures;
6905 * HOL, FOL, ZF: added infix function `addsplits':
6906 instead of `<simpset> setloop (split_tac <thms>)'
6907 you can simply write `<simpset> addsplits <thms>'
6912 * TYPE('a) syntax for type reflection terms;
6914 * no longer handles consts with name "" -- declare as 'syntax' instead;
6916 * pretty printer: changed order of mixfix annotation preference (again!);
6918 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6923 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6924 with `addloop' of the simplifier to faciliate case splitting in premises.
6926 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6928 * HOL/Auth: new protocol proofs including some for the Internet
6931 * HOL/Map: new theory of `maps' a la VDM;
6933 * HOL/simplifier: simplification procedures nat_cancel_sums for
6934 cancelling out common nat summands from =, <, <= (in)equalities, or
6935 differences; simplification procedures nat_cancel_factor for
6936 cancelling common factor from =, <, <= (in)equalities over natural
6937 sums; nat_cancel contains both kinds of procedures, it is installed by
6938 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6940 * HOL/simplifier: terms of the form
6941 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6943 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6944 and those of the form
6945 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6947 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6950 Each datatype `t' now comes with a theorem `split_t_case' of the form
6952 P(t_case f1 ... fn x) =
6953 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6955 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6958 and a theorem `split_t_case_asm' of the form
6960 P(t_case f1 ... fn x) =
6961 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6963 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6965 which can be added to a simpset via `addsplits'. The existing theorems
6966 expand_list_case and expand_option_case have been renamed to
6967 split_list_case and split_option_case.
6970 - `pred n' is automatically converted to `n-1'.
6971 Users are strongly encouraged not to use `pred' any longer,
6972 because it will disappear altogether at some point.
6973 - Users are strongly encouraged to write "0 < n" rather than
6974 "n ~= 0". Theorems and proof tools have been modified towards this
6978 the function "set_of_list" has been renamed "set" (and its theorems too);
6979 the function "nth" now takes its arguments in the reverse order and
6980 has acquired the infix notation "!" as in "xs!n".
6982 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6984 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6985 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6987 * HOL/record: extensible records with schematic structural subtyping
6988 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6989 still lacks various theorems and concrete record syntax;
6994 * removed "axioms" and "generated by" sections;
6996 * replaced "ops" section by extended "consts" section, which is capable of
6997 handling the continuous function space "->" directly;
7000 . proves theorems immediately and stores them in the theory,
7001 . creates hierachical name space,
7002 . now uses normal mixfix annotations (instead of cinfix...),
7003 . minor changes to some names and values (for consistency),
7004 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7005 . separator between mutual domain defs: changed "," to "and",
7006 . improved handling of sort constraints; now they have to
7007 appear on the left-hand side of the equations only;
7009 * fixed LAM <x,y,zs>.b syntax;
7011 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7012 adm (%x. P (t x)), where P is chainfinite and t continuous;
7017 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7018 with `addloop' of the simplifier to faciliate case splitting in premises.
7020 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7021 in HOL, they strip ALL and --> from proved theorems;
7025 New in Isabelle94-8 (May 1997)
7026 ------------------------------
7028 *** General Changes ***
7030 * new utilities to build / run / maintain Isabelle etc. (in parts
7031 still somewhat experimental); old Makefiles etc. still functional;
7033 * new 'Isabelle System Manual';
7035 * INSTALL text, together with ./configure and ./build scripts;
7037 * reimplemented type inference for greater efficiency, better error
7038 messages and clean internal interface;
7040 * prlim command for dealing with lots of subgoals (an easier way of
7041 setting goals_limit);
7046 * supports alternative (named) syntax tables (parser and pretty
7047 printer); internal interface is provided by add_modesyntax(_i);
7049 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7050 be used in conjunction with the Isabelle symbol font; uses the
7051 "symbols" syntax table;
7053 * added token_translation interface (may translate name tokens in
7054 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7055 the current print_mode); IMPORTANT: user print translation functions
7056 are responsible for marking newly introduced bounds
7057 (Syntax.mark_boundT);
7059 * token translations for modes "xterm" and "xterm_color" that display
7060 names in bold, underline etc. or colors (which requires a color
7063 * infixes may now be declared with names independent of their syntax;
7065 * added typed_print_translation (like print_translation, but may
7066 access type of constant);
7069 *** Classical Reasoner ***
7071 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7072 some limitations. Blast_tac...
7073 + ignores addss, addbefore, addafter; this restriction is intrinsic
7074 + ignores elimination rules that don't have the correct format
7075 (the conclusion MUST be a formula variable)
7076 + ignores types, which can make HOL proofs fail
7077 + rules must not require higher-order unification, e.g. apply_type in ZF
7078 [message "Function Var's argument not a bound variable" relates to this]
7079 + its proof strategy is more general but can actually be slower
7081 * substitution with equality assumptions no longer permutes other
7084 * minor changes in semantics of addafter (now called addaltern); renamed
7085 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7086 (and access functions for it);
7088 * improved combination of classical reasoner and simplifier:
7089 + functions for handling clasimpsets
7090 + improvement of addss: now the simplifier is called _after_ the
7092 + safe variant of addss called addSss: uses safe simplifications
7093 _during_ the safe steps. It is more complete as it allows multiple
7094 instantiations of unknowns (e.g. with slow_tac).
7098 * added interface for simplification procedures (functions that
7099 produce *proven* rewrite rules on the fly, depending on current
7102 * ordering on terms as parameter (used for ordered rewriting);
7104 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7106 * the solver is now split into a safe and an unsafe part.
7107 This should be invisible for the normal user, except that the
7108 functions setsolver and addsolver have been renamed to setSolver and
7109 addSolver; added safe_asm_full_simp_tac;
7114 * a generic induction tactic `induct_tac' which works for all datatypes and
7115 also for type `nat';
7117 * a generic case distinction tactic `exhaust_tac' which works for all
7118 datatypes and also for type `nat';
7120 * each datatype comes with a function `size';
7122 * patterns in case expressions allow tuple patterns as arguments to
7123 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7125 * primrec now also works with type nat;
7127 * recdef: a new declaration form, allows general recursive functions to be
7128 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7130 * the constant for negation has been renamed from "not" to "Not" to
7131 harmonize with FOL, ZF, LK, etc.;
7133 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7136 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7138 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7139 problems in commutative rings, using axiomatic type classes for + and *;
7141 * more examples in HOL/MiniML and HOL/Auth;
7143 * more default rewrite rules for quantifiers, union/intersection;
7145 * a new constant `arbitrary == @x.False';
7147 * HOLCF/IOA replaces old HOL/IOA;
7149 * HOLCF changes: derived all rules and arities
7150 + axiomatic type classes instead of classes
7151 + typedef instead of faking type definitions
7152 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7153 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7154 + eliminated the types void, one, tr
7155 + use unit lift and bool lift (with translations) instead of one and tr
7156 + eliminated blift from Lift3.thy (use Def instead of blift)
7157 all eliminated rules are derived as theorems --> no visible changes ;
7162 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7163 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7164 as ZF_cs addSIs [equalityI];
7168 New in Isabelle94-7 (November 96)
7169 ---------------------------------
7171 * allowing negative levels (as offsets) in prlev and choplev;
7173 * super-linear speedup for large simplifications;
7175 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7176 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7177 FAIL); can suppress it using the command Delsimps (ex_simps @
7178 all_simps); De Morgan laws are also now included, by default;
7180 * improved printing of ==> : ~:
7182 * new object-logic "Sequents" adds linear logic, while replacing LK
7183 and Modal (thanks to Sara Kalvala);
7185 * HOL/Auth: correctness proofs for authentication protocols;
7187 * HOL: new auto_tac combines rewriting and classical reasoning (many
7188 examples on HOL/Auth);
7190 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7191 the rewriter and classical reasoner simultaneously;
7193 * function uresult no longer returns theorems in "standard" format;
7194 regain previous version by: val uresult = standard o uresult;
7201 * oracles -- these establish an interface between Isabelle and trusted
7202 external reasoners, which may deliver results as theorems;
7204 * proof objects (in particular record all uses of oracles);
7206 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7208 * "constdefs" section in theory files;
7210 * "primrec" section (HOL) no longer requires names;
7212 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7219 * reduced space requirements;
7221 * automatic HTML generation from theories;
7223 * theory files no longer require "..." (quotes) around most types;
7225 * new examples, including two proofs of the Church-Rosser theorem;
7227 * non-curried (1994) version of HOL is no longer distributed;
7234 * greatly reduced space requirements;
7236 * theory files (.thy) no longer require \...\ escapes at line breaks;
7238 * searchable theorem database (see the section "Retrieving theorems" on
7239 page 8 of the Reference Manual);
7241 * new examples, including Grabczewski's monumental case study of the
7244 * The previous version of HOL renamed to Old_HOL;
7246 * The new version of HOL (previously called CHOL) uses a curried syntax
7247 for functions. Application looks like f a b instead of f(a,b);
7249 * Mutually recursive inductive definitions finally work in HOL;
7251 * In ZF, pattern-matching on tuples is now available in all abstractions and
7252 translates to the operator "split";
7259 * new infix operator, addss, allowing the classical reasoner to
7260 perform simplification at each step of its search. Example:
7261 fast_tac (cs addss ss)
7263 * a new logic, CHOL, the same as HOL, but with a curried syntax
7264 for functions. Application looks like f a b instead of f(a,b). Also pairs
7265 look like (a,b) instead of <a,b>;
7267 * PLEASE NOTE: CHOL will eventually replace HOL!
7269 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7270 It translates to the operator "split". A new theory of integers is available;
7272 * In ZF, integer numerals now denote two's-complement binary integers.
7273 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7275 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7276 of the Axiom of Choice;
7283 * Significantly faster resolution;
7285 * the different sections in a .thy file can now be mixed and repeated
7288 * Database of theorems for FOL, HOL and ZF. New
7289 commands including qed, qed_goal and bind_thm store theorems in the database.
7291 * Simple database queries: return a named theorem (get_thm) or all theorems of
7292 a given theory (thms_of), or find out what theory a theorem was proved in
7295 * Bugs fixed in the inductive definition and datatype packages;
7297 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7298 and HOL_dup_cs obsolete;
7300 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7303 * Simpler definition of function space in ZF;
7305 * new results about cardinal and ordinal arithmetic in ZF;
7307 * 'subtype' facility in HOL for introducing new types as subsets of existing
7310 :mode=text:wrap=hard:maxLineLen=72: