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 * Removed simplifier congruence rule of "prod_case", as has for long
29 been the case with "split".
32 New in Isabelle2009-2 (June 2010)
33 ---------------------------------
37 * Authentic syntax for *all* logical entities (type classes, type
38 constructors, term constants): provides simple and robust
39 correspondence between formal entities and concrete syntax. Within
40 the parse tree / AST representations, "constants" are decorated by
41 their category (class, type, const) and spelled out explicitly with
42 their full internal name.
44 Substantial INCOMPATIBILITY concerning low-level syntax declarations
45 and translations (translation rules and translation functions in ML).
46 Some hints on upgrading:
48 - Many existing uses of 'syntax' and 'translations' can be replaced
49 by more modern 'type_notation', 'notation' and 'abbreviation',
50 which are independent of this issue.
52 - 'translations' require markup within the AST; the term syntax
53 provides the following special forms:
55 CONST c -- produces syntax version of constant c from context
56 XCONST c -- literally c, checked as constant from context
57 c -- literally c, if declared by 'syntax'
59 Plain identifiers are treated as AST variables -- occasionally the
60 system indicates accidental variables via the error "rhs contains
63 Type classes and type constructors are marked according to their
64 concrete syntax. Some old translations rules need to be written
65 for the "type" category, using type constructor application
66 instead of pseudo-term application of the default category
69 - 'parse_translation' etc. in ML may use the following
72 @{class_syntax c} -- type class c within parse tree / AST
73 @{term_syntax c} -- type constructor c within parse tree / AST
74 @{const_syntax c} -- ML version of "CONST c" above
75 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
77 - Literal types within 'typed_print_translations', i.e. those *not*
78 represented as pseudo-terms are represented verbatim. Use @{class
79 c} or @{type_name c} here instead of the above syntax
82 Note that old non-authentic syntax was based on unqualified base
83 names, so all of the above "constant" names would coincide. Recall
84 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
85 diagnose syntax problems.
87 * Type constructors admit general mixfix syntax, not just infix.
89 * Concrete syntax may be attached to local entities without a proof
90 body, too. This works via regular mixfix annotations for 'fix',
91 'def', 'obtain' etc. or via the explicit 'write' command, which is
92 similar to the 'notation' command in theory specifications.
94 * Discontinued unnamed infix syntax (legacy feature for many years) --
95 need to specify constant name and syntax separately. Internal ML
96 datatype constructors have been renamed from InfixName to Infix etc.
97 Minor INCOMPATIBILITY.
99 * Schematic theorem statements need to be explicitly markup as such,
100 via commands 'schematic_lemma', 'schematic_theorem',
101 'schematic_corollary'. Thus the relevance of the proof is made
102 syntactically clear, which impacts performance in a parallel or
103 asynchronous interactive environment. Minor INCOMPATIBILITY.
105 * Use of cumulative prems via "!" in some proof methods has been
106 discontinued (old legacy feature).
108 * References 'trace_simp' and 'debug_simp' have been replaced by
109 configuration options stored in the context. Enabling tracing (the
110 case of debugging is similar) in proofs works via
112 using [[trace_simp = true]]
114 Tracing is then active for all invocations of the simplifier in
115 subsequent goal refinement steps. Tracing may also still be enabled or
116 disabled via the ProofGeneral settings menu.
118 * Separate commands 'hide_class', 'hide_type', 'hide_const',
119 'hide_fact' replace the former 'hide' KIND command. Minor
122 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
123 more efficient than combinations with -q1 or -q2.
128 * Proofterms record type-class reasoning explicitly, using the
129 "unconstrain" operation internally. This eliminates all sort
130 constraints from a theorem and proof, introducing explicit
131 OFCLASS-premises. On the proof term level, this operation is
132 automatically applied at theorem boundaries, such that closed proofs
133 are always free of sort constraints. INCOMPATIBILITY for tools that
136 * Local theory specifications may depend on extra type variables that
137 are not present in the result type -- arguments TYPE('a) :: 'a itself
138 are added internally. For example:
140 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
142 * Predicates of locales introduced by classes carry a mandatory
143 "class" prefix. INCOMPATIBILITY.
145 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
147 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
150 * Command 'code_reflect' allows to incorporate generated ML code into
151 runtime environment; replaces immature code_datatype antiquotation.
154 * Code generator: simple concept for abstract datatypes obeying
157 * Code generator: details of internal data cache have no impact on the
158 user space functionality any longer.
160 * Methods "unfold_locales" and "intro_locales" ignore non-locale
161 subgoals. This is more appropriate for interpretations with 'where'.
164 * Command 'example_proof' opens an empty proof body. This allows to
165 experiment with Isar, without producing any persistent result.
167 * Commands 'type_notation' and 'no_type_notation' declare type syntax
168 within a local theory context, with explicit checking of the
169 constructors involved (in contrast to the raw 'syntax' versions).
171 * Commands 'types' and 'typedecl' now work within a local theory
172 context -- without introducing dependencies on parameters or
173 assumptions, which is not possible in Isabelle/Pure.
175 * Command 'defaultsort' has been renamed to 'default_sort', it works
176 within a local theory context. Minor INCOMPATIBILITY.
181 * Command 'typedef' now works within a local theory context -- without
182 introducing dependencies on parameters or assumptions, which is not
183 possible in Isabelle/Pure/HOL. Note that the logical environment may
184 contain multiple interpretations of local typedefs (with different
185 non-emptiness proofs), even in a global theory context.
187 * New package for quotient types. Commands 'quotient_type' and
188 'quotient_definition' may be used for defining types and constants by
189 quotient constructions. An example is the type of integers created by
190 quotienting pairs of natural numbers:
193 intrel :: "(nat * nat) => (nat * nat) => bool"
195 "intrel (x, y) (u, v) = (x + v = u + y)"
197 quotient_type int = "nat × nat" / intrel
198 by (auto simp add: equivp_def expand_fun_eq)
201 "0::int" is "(0::nat, 0::nat)"
203 The method "lifting" can be used to lift of theorems from the
204 underlying "raw" type to the quotient type. The example
205 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
206 construction and provides a reasoning infrastructure for finite sets.
208 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
209 clash with new theory Quotient in Main HOL.
211 * Moved the SMT binding into the main HOL session, eliminating
212 separate HOL-SMT session.
214 * List membership infix mem operation is only an input abbreviation.
217 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
218 for future developements; former Library/Word.thy is still present in
219 the AFP entry RSAPPS.
221 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
222 longer shadowed. INCOMPATIBILITY.
224 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
227 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
230 * Dropped normalizing_semiring etc; use the facts in semiring classes
231 instead. INCOMPATIBILITY.
233 * Dropped several real-specific versions of lemmas about floor and
234 ceiling; use the generic lemmas from theory "Archimedean_Field"
235 instead. INCOMPATIBILITY.
237 floor_number_of_eq ~> floor_number_of
238 le_floor_eq_number_of ~> number_of_le_floor
239 le_floor_eq_zero ~> zero_le_floor
240 le_floor_eq_one ~> one_le_floor
241 floor_less_eq_number_of ~> floor_less_number_of
242 floor_less_eq_zero ~> floor_less_zero
243 floor_less_eq_one ~> floor_less_one
244 less_floor_eq_number_of ~> number_of_less_floor
245 less_floor_eq_zero ~> zero_less_floor
246 less_floor_eq_one ~> one_less_floor
247 floor_le_eq_number_of ~> floor_le_number_of
248 floor_le_eq_zero ~> floor_le_zero
249 floor_le_eq_one ~> floor_le_one
250 floor_subtract_number_of ~> floor_diff_number_of
251 floor_subtract_one ~> floor_diff_one
252 ceiling_number_of_eq ~> ceiling_number_of
253 ceiling_le_eq_number_of ~> ceiling_le_number_of
254 ceiling_le_zero_eq ~> ceiling_le_zero
255 ceiling_le_eq_one ~> ceiling_le_one
256 less_ceiling_eq_number_of ~> number_of_less_ceiling
257 less_ceiling_eq_zero ~> zero_less_ceiling
258 less_ceiling_eq_one ~> one_less_ceiling
259 ceiling_less_eq_number_of ~> ceiling_less_number_of
260 ceiling_less_eq_zero ~> ceiling_less_zero
261 ceiling_less_eq_one ~> ceiling_less_one
262 le_ceiling_eq_number_of ~> number_of_le_ceiling
263 le_ceiling_eq_zero ~> zero_le_ceiling
264 le_ceiling_eq_one ~> one_le_ceiling
265 ceiling_subtract_number_of ~> ceiling_diff_number_of
266 ceiling_subtract_one ~> ceiling_diff_one
268 * Theory "Finite_Set": various folding_XXX locales facilitate the
269 application of the various fold combinators on finite sets.
271 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
272 provides abstract red-black tree type which is backed by "RBT_Impl" as
273 implementation. INCOMPATIBILTY.
275 * Theory Library/Coinductive_List has been removed -- superseded by
276 AFP/thys/Coinductive.
278 * Theory PReal, including the type "preal" and related operations, has
279 been removed. INCOMPATIBILITY.
281 * Split off theory "Big_Operators" containing setsum, setprod,
282 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
284 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
285 "Int" etc. INCOMPATIBILITY.
287 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
289 * New set of rules "ac_simps" provides combined assoc / commute
290 rewrites for all interpretations of the appropriate generic locales.
292 * Renamed theory "OrderedGroup" to "Groups" and split theory
293 "Ring_and_Field" into theories "Rings" and "Fields"; for more
294 appropriate and more consistent names suitable for name prefixes
295 within the HOL theories. INCOMPATIBILITY.
297 * Some generic constants have been put to appropriate theories:
298 - less_eq, less: Orderings
299 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
300 - inverse, divide: Rings
303 * More consistent naming of type classes involving orderings (and
306 lower_semilattice ~> semilattice_inf
307 upper_semilattice ~> semilattice_sup
309 dense_linear_order ~> dense_linorder
311 pordered_ab_group_add ~> ordered_ab_group_add
312 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
313 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
314 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
315 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
316 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
317 pordered_cancel_semiring ~> ordered_cancel_semiring
318 pordered_comm_monoid_add ~> ordered_comm_monoid_add
319 pordered_comm_ring ~> ordered_comm_ring
320 pordered_comm_semiring ~> ordered_comm_semiring
321 pordered_ring ~> ordered_ring
322 pordered_ring_abs ~> ordered_ring_abs
323 pordered_semiring ~> ordered_semiring
325 ordered_ab_group_add ~> linordered_ab_group_add
326 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
327 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
328 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
329 ordered_field ~> linordered_field
330 ordered_field_no_lb ~> linordered_field_no_lb
331 ordered_field_no_ub ~> linordered_field_no_ub
332 ordered_field_dense_linear_order ~> dense_linordered_field
333 ordered_idom ~> linordered_idom
334 ordered_ring ~> linordered_ring
335 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
336 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
337 ordered_ring_strict ~> linordered_ring_strict
338 ordered_semidom ~> linordered_semidom
339 ordered_semiring ~> linordered_semiring
340 ordered_semiring_1 ~> linordered_semiring_1
341 ordered_semiring_1_strict ~> linordered_semiring_1_strict
342 ordered_semiring_strict ~> linordered_semiring_strict
344 The following slightly odd type classes have been moved to a
345 separate theory Library/Lattice_Algebras:
347 lordered_ab_group_add ~> lattice_ab_group_add
348 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
349 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
350 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
351 lordered_ring ~> lattice_ring
355 * Refined field classes:
356 - classes division_ring_inverse_zero, field_inverse_zero,
357 linordered_field_inverse_zero include rule inverse 0 = 0 --
358 subsumes former division_by_zero class;
359 - numerous lemmas have been ported from field to division_ring.
362 * Refined algebra theorem collections:
363 - dropped theorem group group_simps, use algebra_simps instead;
364 - dropped theorem group ring_simps, use field_simps instead;
365 - proper theorem collection field_simps subsumes former theorem
366 groups field_eq_simps and field_simps;
367 - dropped lemma eq_minus_self_iff which is a duplicate for
371 * Theory Finite_Set and List: some lemmas have been generalized from
374 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
375 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
376 inter_Inter_fold_inter ~> inf_Inf_fold_inf
377 union_Union_fold_union ~> sup_Sup_fold_sup
378 Inter_fold_inter ~> Inf_fold_inf
379 Union_fold_union ~> Sup_fold_sup
380 inter_INTER_fold_inter ~> inf_INFI_fold_inf
381 union_UNION_fold_union ~> sup_SUPR_fold_sup
382 INTER_fold_inter ~> INFI_fold_inf
383 UNION_fold_union ~> SUPR_fold_sup
385 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
386 replaced by the more convenient lemmas Inf_empty and Sup_empty.
387 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
388 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
389 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
390 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
392 * Reorganized theory Multiset: swapped notation of pointwise and
395 - pointwise ordering is instance of class order with standard syntax
397 - multiset ordering has syntax <=# and <#; partial order properties
398 are provided by means of interpretation with prefix
400 - less duplication, less historical organization of sections,
401 conversion from associations lists to multisets, rudimentary code
403 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
408 multiset_eq_conv_count_eq ~> multiset_ext_iff
409 multi_count_ext ~> multiset_ext
410 diff_union_inverse2 ~> diff_union_cancelR
414 * Theory Permutation: replaced local "remove" by List.remove1.
416 * Code generation: ML and OCaml code is decorated with signatures.
418 * Theory List: added transpose.
420 * Library/Nat_Bijection.thy is a collection of bijective functions
421 between nat and other types, which supersedes the older libraries
422 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
425 Nat_Int_Bij.nat2_to_nat ~> prod_encode
426 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
427 Nat_Int_Bij.int_to_nat_bij ~> int_encode
428 Nat_Int_Bij.nat_to_int_bij ~> int_decode
429 Countable.pair_encode ~> prod_encode
430 NatIso.prod2nat ~> prod_encode
431 NatIso.nat2prod ~> prod_decode
432 NatIso.sum2nat ~> sum_encode
433 NatIso.nat2sum ~> sum_decode
434 NatIso.list2nat ~> list_encode
435 NatIso.nat2list ~> list_decode
436 NatIso.set2nat ~> set_encode
437 NatIso.nat2set ~> set_decode
440 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
441 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
442 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
443 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
444 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
445 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
446 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
447 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
448 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
449 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
450 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
451 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
452 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
455 - Renamed ATP commands:
456 atp_info ~> sledgehammer running_atps
457 atp_kill ~> sledgehammer kill_atps
458 atp_messages ~> sledgehammer messages
459 atp_minimize ~> sledgehammer minimize
460 print_atps ~> sledgehammer available_atps
462 - Added user's manual ("isabelle doc sledgehammer").
463 - Added option syntax and "sledgehammer_params" to customize
464 Sledgehammer's behavior. See the manual for details.
465 - Modified the Isar proof reconstruction code so that it produces
466 direct proofs rather than proofs by contradiction. (This feature
467 is still experimental.)
468 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
470 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
473 - Added and implemented "binary_ints" and "bits" options.
474 - Added "std" option and implemented support for nonstandard models.
475 - Added and implemented "finitize" option to improve the precision
476 of infinite datatypes based on a monotonicity analysis.
477 - Added support for quotient types.
478 - Added support for "specification" and "ax_specification"
480 - Added support for local definitions (for "function" and
481 "termination" proofs).
482 - Added support for term postprocessors.
483 - Optimized "Multiset.multiset" and "FinFun.finfun".
484 - Improved efficiency of "destroy_constrs" optimization.
485 - Fixed soundness bugs related to "destroy_constrs" optimization and
487 - Fixed soundness bug related to higher-order constructors.
488 - Fixed soundness bug when "full_descrs" is enabled.
489 - Improved precision of set constructs.
490 - Added "atoms" option.
491 - Added cache to speed up repeated Kodkod invocations on the same
493 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
494 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
495 "SAT4J_Light". INCOMPATIBILITY.
496 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
497 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
498 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
503 * Variable names in lemmas generated by the domain package have
504 changed; the naming scheme is now consistent with the HOL datatype
505 package. Some proof scripts may be affected, INCOMPATIBILITY.
507 * The domain package no longer defines the function "foo_copy" for
508 recursive domain "foo". The reach lemma is now stated directly in
509 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
510 be reformulated in terms of "foo_take", INCOMPATIBILITY.
512 * Most definedness lemmas generated by the domain package (previously
513 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
514 like "foo$x = UU <-> x = UU", which works better as a simp rule.
515 Proofs that used definedness lemmas as intro rules may break,
516 potential INCOMPATIBILITY.
518 * Induction and casedist rules generated by the domain package now
519 declare proper case_names (one called "bottom", and one named for each
520 constructor). INCOMPATIBILITY.
522 * For mutually-recursive domains, separate "reach" and "take_lemma"
523 rules are generated for each domain, INCOMPATIBILITY.
525 foo_bar.reach ~> foo.reach bar.reach
526 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
528 * Some lemmas generated by the domain package have been renamed for
529 consistency with the datatype package, INCOMPATIBILITY.
531 foo.ind ~> foo.induct
532 foo.finite_ind ~> foo.finite_induct
533 foo.coind ~> foo.coinduct
534 foo.casedist ~> foo.exhaust
535 foo.exhaust ~> foo.nchotomy
537 * For consistency with other definition packages, the fixrec package
538 now generates qualified theorem names, INCOMPATIBILITY.
540 foo_simps ~> foo.simps
541 foo_unfold ~> foo.unfold
542 foo_induct ~> foo.induct
544 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
545 method and internal fixrec proofs now use the default simpset instead.
548 * The "contlub" predicate has been removed. Proof scripts should use
549 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
551 * The "admw" predicate has been removed, INCOMPATIBILITY.
553 * The constants cpair, cfst, and csnd have been removed in favor of
554 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
559 * Antiquotations for basic formal entities:
561 @{class NAME} -- type class
562 @{class_syntax NAME} -- syntax representation of the above
564 @{type_name NAME} -- logical type
565 @{type_abbrev NAME} -- type abbreviation
566 @{nonterminal NAME} -- type of concrete syntactic category
567 @{type_syntax NAME} -- syntax representation of any of the above
569 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
570 @{const_abbrev NAME} -- abbreviated constant
571 @{const_syntax NAME} -- syntax representation of any of the above
573 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
574 syntax constant (cf. 'syntax' command).
576 * Antiquotation @{make_string} inlines a function to print arbitrary
577 values similar to the ML toplevel. The result is compiler dependent
578 and may fall back on "?" in certain situations.
580 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
581 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
582 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
583 not work with the asynchronous Isar document model.
585 * Configuration options now admit dynamic default values, depending on
586 the context or even global references.
588 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
589 uses an efficient external library if available (for Poly/ML).
591 * Renamed some important ML structures, while keeping the old names
592 for some time as aliases within the structure Legacy:
594 OuterKeyword ~> Keyword
597 OuterSyntax ~> Outer_Syntax
598 PrintMode ~> Print_Mode
599 SpecParse ~> Parse_Spec
602 ThyOutput ~> Thy_Output
603 TypeInfer ~> Type_Infer
605 Note that "open Legacy" simplifies porting of sources, but forgetting
606 to remove it again will complicate porting again in the future.
608 * Most operations that refer to a global context are named
609 accordingly, e.g. Simplifier.global_context or
610 ProofContext.init_global. There are some situations where a global
611 context actually works, but under normal circumstances one needs to
612 pass the proper local context through the code!
614 * Discontinued old TheoryDataFun with its copy/init operation -- data
615 needs to be pure. Functor Theory_Data_PP retains the traditional
616 Pretty.pp argument to merge, which is absent in the standard
619 * Sorts.certify_sort and derived "cert" operations for types and terms
620 no longer minimize sorts. Thus certification at the boundary of the
621 inference kernel becomes invariant under addition of class relations,
622 which is an important monotonicity principle. Sorts are now minimized
623 in the syntax layer only, at the boundary between the end-user and the
624 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
625 explicitly in rare situations.
627 * Renamed old-style Drule.standard to Drule.export_without_context, to
628 emphasize that this is in no way a standard operation.
631 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
632 usual for resolution. Rare INCOMPATIBILITY.
634 * Renamed varify/unvarify operations to varify_global/unvarify_global
635 to emphasize that these only work in a global situation (which is
638 * Curried take and drop in library.ML; negative length is interpreted
639 as infinity (as in chop). Subtle INCOMPATIBILITY.
641 * Proof terms: type substitutions on proof constants now use canonical
642 order of type variables. INCOMPATIBILITY for tools working with proof
645 * Raw axioms/defs may no longer carry sort constraints, and raw defs
646 may no longer carry premises. User-level specifications are
647 transformed accordingly by Thm.add_axiom/add_def.
652 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
653 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
654 proof terms are enabled unconditionally in the new HOL-Proofs image.
656 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
657 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
660 * Old lib/scripts/polyml-platform is superseded by the
661 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
662 variant, even on a 64 bit machine. The following example setting
663 prefers 64 bit if available:
665 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
667 * The preliminary Isabelle/jEdit application demonstrates the emerging
668 Isabelle/Scala layer for advanced prover interaction and integration.
669 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
674 New in Isabelle2009-1 (December 2009)
675 -------------------------------------
679 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
680 one backslash should be used, even in ML sources.
685 * Locale interpretation propagates mixins along the locale hierarchy.
686 The currently only available mixins are the equations used to map
687 local definitions to terms of the target domain of an interpretation.
689 * Reactivated diagnostic command 'print_interps'. Use "print_interps
690 loc" to print all interpretations of locale "loc" in the theory.
691 Interpretations in proofs are not shown.
693 * Thoroughly revised locales tutorial. New section on conditional
696 * On instantiation of classes, remaining undefined class parameters
697 are formally declared. INCOMPATIBILITY.
700 *** Document preparation ***
702 * New generalized style concept for printing terms: @{foo (style) ...}
703 instead of @{foo_style style ...} (old form is still retained for
704 backward compatibility). Styles can be also applied for
705 antiquotations prop, term_type and typeof.
710 * New proof method "smt" for a combination of first-order logic with
711 equality, linear and nonlinear (natural/integer/real) arithmetic, and
712 fixed-size bitvectors; there is also basic support for higher-order
713 features (esp. lambda abstractions). It is an incomplete decision
714 procedure based on external SMT solvers using the oracle mechanism;
715 for the SMT solver Z3, this method is proof-producing. Certificates
716 are provided to avoid calling the external solvers solely for
717 re-checking proofs. Due to a remote SMT service there is no need for
718 installing SMT solvers locally. See src/HOL/SMT.
720 * New commands to load and prove verification conditions generated by
721 the Boogie program verifier or derived systems (e.g. the Verifying C
722 Compiler (VCC) or Spec#). See src/HOL/Boogie.
724 * New counterexample generator tool 'nitpick' based on the Kodkod
725 relational model finder. See src/HOL/Tools/Nitpick and
726 src/HOL/Nitpick_Examples.
728 * New commands 'code_pred' and 'values' to invoke the predicate
729 compiler and to enumerate values of inductive predicates.
731 * A tabled implementation of the reflexive transitive closure.
733 * New implementation of quickcheck uses generic code generator;
734 default generators are provided for all suitable HOL types, records
735 and datatypes. Old quickcheck can be re-activated importing theory
736 Library/SML_Quickcheck.
738 * New testing tool Mirabelle for automated proof tools. Applies
739 several tools and tactics like sledgehammer, metis, or quickcheck, to
740 every proof step in a theory. To be used in batch mode via the
743 * New proof method "sos" (sum of squares) for nonlinear real
744 arithmetic (originally due to John Harison). It requires theory
745 Library/Sum_Of_Squares. It is not a complete decision procedure but
746 works well in practice on quantifier-free real arithmetic with +, -,
747 *, ^, =, <= and <, i.e. boolean combinations of equalities and
748 inequalities between polynomials. It makes use of external
749 semidefinite programming solvers. Method "sos" generates a
750 certificate that can be pasted into the proof thus avoiding the need
751 to call an external tool every time the proof is checked. See
752 src/HOL/Library/Sum_Of_Squares.
754 * New method "linarith" invokes existing linear arithmetic decision
757 * New command 'atp_minimal' reduces result produced by Sledgehammer.
759 * New Sledgehammer option "Full Types" in Proof General settings menu.
760 Causes full type information to be output to the ATPs. This slows
761 ATPs down considerably but eliminates a source of unsound "proofs"
764 * New method "metisFT": A version of metis that uses full type
765 information in order to avoid failures of proof reconstruction.
767 * New evaluator "approximate" approximates an real valued term using
768 the same method as the approximation method.
770 * Method "approximate" now supports arithmetic expressions as
771 boundaries of intervals and implements interval splitting and Taylor
774 * ML antiquotation @{code_datatype} inserts definition of a datatype
775 generated by the code generator; e.g. see src/HOL/Predicate.thy.
777 * New theory SupInf of the supremum and infimum operators for sets of
780 * New theory Probability, which contains a development of measure
781 theory, eventually leading to Lebesgue integration and probability.
783 * Extended Multivariate Analysis to include derivation and Brouwer's
786 * Reorganization of number theory, INCOMPATIBILITY:
787 - new number theory development for nat and int, in theories Divides
788 and GCD as well as in new session Number_Theory
789 - some constants and facts now suffixed with _nat and _int
791 - former session NumberTheory now named Old_Number_Theory, including
792 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
793 - moved theory Pocklington from src/HOL/Library to
794 src/HOL/Old_Number_Theory
796 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
797 lcm of finite and infinite sets. It is shown that they form a complete
800 * Class semiring_div requires superclass no_zero_divisors and proof of
801 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
802 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
803 generalized to class semiring_div, subsuming former theorems
804 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
805 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
808 * Refinements to lattice classes and sets:
809 - less default intro/elim rules in locale variant, more default
810 intro/elim rules in class variant: more uniformity
811 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
813 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
815 - renamed ACI to inf_sup_aci
816 - new class "boolean_algebra"
817 - class "complete_lattice" moved to separate theory
818 "Complete_Lattice"; corresponding constants (and abbreviations)
819 renamed and with authentic syntax:
820 Set.Inf ~> Complete_Lattice.Inf
821 Set.Sup ~> Complete_Lattice.Sup
822 Set.INFI ~> Complete_Lattice.INFI
823 Set.SUPR ~> Complete_Lattice.SUPR
824 Set.Inter ~> Complete_Lattice.Inter
825 Set.Union ~> Complete_Lattice.Union
826 Set.INTER ~> Complete_Lattice.INTER
827 Set.UNION ~> Complete_Lattice.UNION
828 - authentic syntax for
831 - mere abbreviations:
834 Set.inter (for inf, formerly Set.Int)
835 Set.union (for sup, formerly Set.Un)
836 Complete_Lattice.Inter (for Inf)
837 Complete_Lattice.Union (for Sup)
838 Complete_Lattice.INTER (for INFI)
839 Complete_Lattice.UNION (for SUPR)
840 - object-logic definitions as far as appropriate
842 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
843 Un_subset_iff are explicitly deleted as default simp rules; then also
844 their lattice counterparts le_inf_iff and le_sup_iff have to be
845 deleted to achieve the desired effect.
847 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
848 rules by default any longer; the same applies to min_max.inf_absorb1
849 etc. INCOMPATIBILITY.
851 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
852 pred_set_conv by default. INCOMPATIBILITY.
854 * Power operations on relations and functions are now one dedicated
855 constant "compow" with infix syntax "^^". Power operation on
856 multiplicative monoids retains syntax "^" and is now defined generic
857 in class power. INCOMPATIBILITY.
859 * Relation composition "R O S" now has a more standard argument order:
860 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
861 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
862 break, since the O_assoc rule was not rewritten like this. Fix using
863 O_assoc[symmetric]. The same applies to the curried version "R OO S".
865 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
866 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
869 * Most rules produced by inductive and datatype package have mandatory
870 prefixes. INCOMPATIBILITY.
872 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
873 the attribute of the same name. Each of the theorems in the list
874 DERIV_intros assumes composition with an additional function and
875 matches a variable to the derivative, which has to be solved by the
876 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
877 of most elementary terms. Former Maclauren.DERIV_tac and
878 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
881 * Code generator attributes follow the usual underscore convention:
882 code_unfold replaces code unfold
883 code_post replaces code post
888 sizechange -> size_change
889 induct_scheme -> induction_schema
892 * Discontinued abbreviation "arbitrary" of constant "undefined".
893 INCOMPATIBILITY, use "undefined" directly.
896 Suc_eq_add_numeral_1 -> Suc_eq_plus1
897 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
898 Suc_plus1 -> Suc_eq_plus1
899 *anti_sym -> *antisym*
900 vector_less_eq_def -> vector_le_def
903 * Added theorem List.map_map as [simp]. Removed List.map_compose.
906 * Removed predicate "M hassize n" (<--> card M = n & finite M).
912 * Theory Representable defines a class "rep" of domains that are
913 representable (via an ep-pair) in the universal domain type "udom".
914 Instances are provided for all type constructors defined in HOLCF.
916 * The 'new_domain' command is a purely definitional version of the
917 domain package, for representable domains. Syntax is identical to the
918 old domain package. The 'new_domain' package also supports indirect
919 recursion using previously-defined type constructors. See
920 src/HOLCF/ex/New_Domain.thy for examples.
922 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
923 on the left-hand side of an equation, and then performs
924 simplification. Rewriting is done using rules declared with the
925 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
926 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
928 * The pattern-match compiler in 'fixrec' can now handle constructors
929 with HOL function types. Pattern-match combinators for the Pair
930 constructor are pre-configured.
932 * The 'fixrec' package now produces better fixed-point induction rules
933 for mutually-recursive definitions: Induction rules have conclusions
934 of the form "P foo bar" instead of "P <foo, bar>".
936 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
937 been renamed to "below". The name "below" now replaces "less" in many
938 theorem names. (Legacy theorem names using "less" are still supported
941 * The 'fixrec' package now supports "bottom patterns". Bottom
942 patterns can be used to generate strictness rules, or to make
943 functions more strict (much like the bang-patterns supported by the
944 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
950 * Support for Poly/ML 5.3.0, with improved reporting of compiler
951 errors and run-time exceptions, including detailed source positions.
953 * Structure Name_Space (formerly NameSpace) now manages uniquely
954 identified entries, with some additional information such as source
955 position, logical grouping etc.
957 * Theory and context data is now introduced by the simplified and
958 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
959 to be pure, but the old TheoryDataFun for mutable data (with explicit
960 copy operation) is still available for some time.
962 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
963 provides a high-level programming interface to synchronized state
964 variables with atomic update. This works via pure function
965 application within a critical section -- its runtime should be as
966 short as possible; beware of deadlocks if critical code is nested,
967 either directly or indirectly via other synchronized variables!
969 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
970 wraps raw ML references, explicitly indicating their non-thread-safe
971 behaviour. The Isar toplevel keeps this structure open, to
972 accommodate Proof General as well as quick and dirty interactive
973 experiments with references.
975 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
976 parallel tactical reasoning.
978 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
979 are similar to SUBPROOF, but are slightly more flexible: only the
980 specified parts of the subgoal are imported into the context, and the
981 body tactic may introduce new subgoals and schematic variables.
983 * Old tactical METAHYPS, which does not observe the proof context, has
984 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
985 or Subgoal.FOCUS etc.
987 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
988 functors have their own ML name space there is no point to mark them
989 separately.) Minor INCOMPATIBILITY.
991 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
993 * Renamed several structures FooBar to Foo_Bar. Occasional,
996 * Operations of structure Skip_Proof no longer require quick_and_dirty
997 mode, which avoids critical setmp.
999 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1000 combinators for "args". INCOMPATIBILITY, need to use simplified
1001 Attrib/Method.setup introduced in Isabelle2009.
1003 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1004 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1005 last resort. INCOMPATIBILITY.
1007 * Display.pretty_thm now requires a proper context (cf. former
1008 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1009 or even Display.pretty_thm_without_context as last resort.
1012 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1013 Syntax.pretty_typ/term directly, preferably with proper context
1014 instead of global theory.
1019 * Further fine tuning of parallel proof checking, scales up to 8 cores
1020 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1023 * Support for additional "Isabelle components" via etc/components, see
1024 also the system manual.
1026 * The isabelle makeall tool now operates on all components with
1027 IsaMakefile, not just hardwired "logics".
1029 * Removed "compress" option from isabelle-process and isabelle usedir;
1030 this is always enabled.
1032 * Discontinued support for Poly/ML 4.x versions.
1034 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1035 on a given logic image. This requires the lighttpd webserver and is
1036 currently supported on Linux only.
1040 New in Isabelle2009 (April 2009)
1041 --------------------------------
1045 * Simplified main Isabelle executables, with less surprises on
1046 case-insensitive file-systems (such as Mac OS).
1048 - The main Isabelle tool wrapper is now called "isabelle" instead of
1051 - The former "isabelle" alias for "isabelle-process" has been
1052 removed (should rarely occur to regular users).
1054 - The former "isabelle-interface" and its alias "Isabelle" have been
1055 removed (interfaces are now regular Isabelle tools).
1057 Within scripts and make files, the Isabelle environment variables
1058 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1059 respectively. (The latter are still available as legacy feature.)
1061 The old isabelle-interface wrapper could react in confusing ways if
1062 the interface was uninstalled or changed otherwise. Individual
1063 interface tool configuration is now more explicit, see also the
1064 Isabelle system manual. In particular, Proof General is now available
1065 via "isabelle emacs".
1067 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1068 purge installed copies of Isabelle executables and re-run "isabelle
1069 install -p ...", or use symlinks.
1071 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1072 old ~/isabelle, which was slightly non-standard and apt to cause
1073 surprises on case-insensitive file-systems (such as Mac OS).
1075 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1076 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1077 care is required when using older releases of Isabelle. Note that
1078 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1079 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1081 * Proofs of fully specified statements are run in parallel on
1082 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1083 a regular 4-core machine, if the initial heap space is made reasonably
1084 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1086 * The main reference manuals ("isar-ref", "implementation", and
1087 "system") have been updated and extended. Formally checked references
1088 as hyperlinks are now available uniformly.
1093 * Complete re-implementation of locales. INCOMPATIBILITY in several
1094 respects. The most important changes are listed below. See the
1095 Tutorial on Locales ("locales" manual) for details.
1097 - In locale expressions, instantiation replaces renaming. Parameters
1098 must be declared in a for clause. To aid compatibility with previous
1099 parameter inheritance, in locale declarations, parameters that are not
1100 'touched' (instantiation position "_" or omitted) are implicitly added
1101 with their syntax at the beginning of the for clause.
1103 - Syntax from abbreviations and definitions in locales is available in
1104 locale expressions and context elements. The latter is particularly
1105 useful in locale declarations.
1107 - More flexible mechanisms to qualify names generated by locale
1108 expressions. Qualifiers (prefixes) may be specified in locale
1109 expressions, and can be marked as mandatory (syntax: "name!:") or
1110 optional (syntax "name?:"). The default depends for plain "name:"
1111 depends on the situation where a locale expression is used: in
1112 commands 'locale' and 'sublocale' prefixes are optional, in
1113 'interpretation' and 'interpret' prefixes are mandatory. The old
1114 implicit qualifiers derived from the parameter names of a locale are
1115 no longer generated.
1117 - Command "sublocale l < e" replaces "interpretation l < e". The
1118 instantiation clause in "interpretation" and "interpret" (square
1119 brackets) is no longer available. Use locale expressions.
1121 - When converting proof scripts, mandatory qualifiers in
1122 'interpretation' and 'interpret' should be retained by default, even
1123 if this is an INCOMPATIBILITY compared to former behavior. In the
1124 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1125 in locale expressions range over a single locale instance only.
1127 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1128 In existing theorem specifications replace the includes element by the
1129 respective context elements of the included locale, omitting those
1130 that are already present in the theorem specification. Multiple
1131 assume elements of a locale should be replaced by a single one
1132 involving the locale predicate. In the proof body, declarations (most
1133 notably theorems) may be regained by interpreting the respective
1134 locales in the proof context as required (command "interpret").
1136 If using "includes" in replacement of a target solely because the
1137 parameter types in the theorem are not as general as in the target,
1138 consider declaring a new locale with additional type constraints on
1139 the parameters (context element "constrains").
1141 - Discontinued "locale (open)". INCOMPATIBILITY.
1143 - Locale interpretation commands no longer attempt to simplify goal.
1144 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1145 methods intro_locales and unfold_locales to clarify.
1147 - Locale interpretation commands no longer accept interpretation
1148 attributes. INCOMPATIBILITY.
1150 * Class declaration: so-called "base sort" must not be given in import
1151 list any longer, but is inferred from the specification. Particularly
1158 class foo = type + ...
1160 * Class target: global versions of theorems stemming do not carry a
1161 parameter prefix any longer. INCOMPATIBILITY.
1163 * Class 'instance' command no longer accepts attached definitions.
1164 INCOMPATIBILITY, use proper 'instantiation' target instead.
1166 * Recovered hiding of consts, which was accidentally broken in
1167 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1168 makes c inaccessible; consider using ``hide (open) const c'' instead.
1170 * Slightly more coherent Pure syntax, with updated documentation in
1171 isar-ref manual. Removed locales meta_term_syntax and
1172 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1173 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1174 directly in regular applications.
1176 * There is a new syntactic category "float_const" for signed decimal
1177 fractions (e.g. 123.45 or -123.45).
1179 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1180 interface with 'setup' command instead.
1182 * Command 'local_setup' is similar to 'setup', but operates on a local
1185 * The 'axiomatization' command now only works within a global theory
1186 context. INCOMPATIBILITY.
1188 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1189 hypotheses. Sorts required in the course of reasoning need to be
1190 covered by the constraints in the initial statement, completed by the
1191 type instance information of the background theory. Non-trivial sort
1192 hypotheses, which rarely occur in practice, may be specified via
1193 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1195 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1197 The result contains an implicit sort hypotheses as before --
1198 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1201 * Generalized Isar history, with support for linear undo, direct state
1204 * Changed defaults for unify configuration options:
1206 unify_trace_bound = 50 (formerly 25)
1207 unify_search_bound = 60 (formerly 30)
1209 * Different bookkeeping for code equations (INCOMPATIBILITY):
1211 a) On theory merge, the last set of code equations for a particular
1212 constant is taken (in accordance with the policy applied by other
1213 parts of the code generator framework).
1215 b) Code equations stemming from explicit declarations (e.g. code
1216 attribute) gain priority over default code equations stemming
1217 from definition, primrec, fun etc.
1219 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1221 * Unified theorem tables for both code generators. Thus [code
1222 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1224 * Command 'find_consts' searches for constants based on type and name
1227 find_consts "_ => bool"
1229 By default, matching is against subtypes, but it may be restricted to
1230 the whole type. Searching by name is possible. Multiple queries are
1231 conjunctive and queries may be negated by prefixing them with a
1234 find_consts strict: "_ => bool" name: "Int" -"int => int"
1236 * New 'find_theorems' criterion "solves" matches theorems that
1237 directly solve the current goal (modulo higher-order unification).
1239 * Auto solve feature for main theorem statements: whenever a new goal
1240 is stated, "find_theorems solves" is called; any theorems that could
1241 solve the lemma directly are listed as part of the goal state.
1242 Cf. associated options in Proof General Isabelle settings menu,
1243 enabled by default, with reasonable timeout for pathological cases of
1244 higher-order unification.
1247 *** Document preparation ***
1249 * Antiquotation @{lemma} now imitates a regular terminal proof,
1250 demanding keyword 'by' and supporting the full method expression
1251 syntax just like the Isar command 'by'.
1256 * Integrated main parts of former image HOL-Complex with HOL. Entry
1257 points Main and Complex_Main remain as before.
1259 * Logic image HOL-Plain provides a minimal HOL with the most important
1260 tools available (inductive, datatype, primrec, ...). This facilitates
1261 experimentation and tool development. Note that user applications
1262 (and library theories) should never refer to anything below theory
1265 * Logic image HOL-Main stops at theory Main, and thus facilitates
1266 experimentation due to shorter build times.
1268 * Logic image HOL-NSA contains theories of nonstandard analysis which
1269 were previously part of former HOL-Complex. Entry point Hyperreal
1270 remains valid, but theories formerly using Complex_Main should now use
1271 new entry point Hypercomplex.
1273 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1274 Posix processes. Avoids potentially expensive forking of the ML
1275 process. New thread-based implementation also works on non-Unix
1276 platforms (Cygwin). Provers are no longer hardwired, but defined
1277 within the theory via plain ML wrapper functions. Basic Sledgehammer
1278 commands are covered in the isar-ref manual.
1280 * Wrapper scripts for remote SystemOnTPTP service allows to use
1281 sledgehammer without local ATP installation (Vampire etc.). Other
1282 provers may be included via suitable ML wrappers, see also
1283 src/HOL/ATP_Linkup.thy.
1285 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1288 * The metis method no longer fails because the theorem is too trivial
1289 (contains the empty clause).
1291 * The metis method now fails in the usual manner, rather than raising
1292 an exception, if it determines that it cannot prove the theorem.
1294 * Method "coherent" implements a prover for coherent logic (see also
1295 src/Tools/coherent.ML).
1297 * Constants "undefined" and "default" replace "arbitrary". Usually
1298 "undefined" is the right choice to replace "arbitrary", though
1299 logically there is no difference. INCOMPATIBILITY.
1301 * Command "value" now integrates different evaluation mechanisms. The
1302 result of the first successful evaluation mechanism is printed. In
1303 square brackets a particular named evaluation mechanisms may be
1304 specified (currently, [SML], [code] or [nbe]). See further
1305 src/HOL/ex/Eval_Examples.thy.
1307 * Normalization by evaluation now allows non-leftlinear equations.
1308 Declare with attribute [code nbe].
1310 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1311 as the structured Isar versions "cases" and "induct", cf. the
1312 corresponding "cases" and "induct" attributes. Mutual induction rules
1313 are now presented as a list of individual projections
1314 (e.g. foo_bar.inducts for types foo and bar); the old format with
1315 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1316 rare situations a different rule is selected --- notably nested tuple
1317 elimination instead of former prod.exhaust: use explicit (case_tac t
1318 rule: prod.exhaust) here.
1320 * Attributes "cases", "induct", "coinduct" support "del" option.
1322 * Removed fact "case_split_thm", which duplicates "case_split".
1324 * The option datatype has been moved to a new theory Option. Renamed
1325 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1327 * New predicate "strict_mono" classifies strict functions on partial
1328 orders. With strict functions on linear orders, reasoning about
1329 (in)equalities is facilitated by theorems "strict_mono_eq",
1330 "strict_mono_less_eq" and "strict_mono_less".
1332 * Some set operations are now proper qualified constants with
1333 authentic syntax. INCOMPATIBILITY:
1344 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1347 * Auxiliary class "itself" has disappeared -- classes without any
1348 parameter are treated as expected by the 'class' command.
1350 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1352 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1353 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1355 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1356 method "approximation". It proves formulas on real values by using
1357 interval arithmetic. In the formulas are also the transcendental
1358 functions sin, cos, tan, atan, ln, exp and the constant pi are
1359 allowed. For examples see
1360 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1362 * Theory "Reflection" now resides in HOL/Library.
1364 * Entry point to Word library now simply named "Word".
1367 * Made source layout more coherent with logical distribution
1370 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1371 src/HOL/Library/Code_Message.thy ~> src/HOL/
1372 src/HOL/Library/GCD.thy ~> src/HOL/
1373 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1374 src/HOL/Library/Parity.thy ~> src/HOL/
1375 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1376 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1377 src/HOL/Real/Lubs.thy ~> src/HOL/
1378 src/HOL/Real/PReal.thy ~> src/HOL/
1379 src/HOL/Real/Rational.thy ~> src/HOL/
1380 src/HOL/Real/RComplete.thy ~> src/HOL/
1381 src/HOL/Real/RealDef.thy ~> src/HOL/
1382 src/HOL/Real/RealPow.thy ~> src/HOL/
1383 src/HOL/Real/Real.thy ~> src/HOL/
1384 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1385 src/HOL/Complex/Complex.thy ~> src/HOL/
1386 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1387 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1388 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1389 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1390 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1391 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1392 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1393 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1394 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1395 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1396 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1397 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1398 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1399 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1400 src/HOL/Real/Float ~> src/HOL/Library/
1401 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1402 src/HOL/Real/RealVector.thy ~> src/HOL/
1404 src/HOL/arith_data.ML ~> src/HOL/Tools
1405 src/HOL/hologic.ML ~> src/HOL/Tools
1406 src/HOL/simpdata.ML ~> src/HOL/Tools
1407 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1408 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1409 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1410 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1411 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1412 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1413 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1415 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1416 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1417 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1418 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1419 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1420 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1422 * If methods "eval" and "evaluation" encounter a structured proof
1423 state with !!/==>, only the conclusion is evaluated to True (if
1424 possible), avoiding strange error messages.
1426 * Method "sizechange" automates termination proofs using (a
1427 modification of) the size-change principle. Requires SAT solver. See
1428 src/HOL/ex/Termination.thy for examples.
1430 * Simplifier: simproc for let expressions now unfolds if bound
1431 variable occurs at most once in let expression body. INCOMPATIBILITY.
1433 * Method "arith": Linear arithmetic now ignores all inequalities when
1434 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1436 * New attribute "arith" for facts that should always be used
1437 automatically by arithmetic. It is intended to be used locally in
1440 assumes [arith]: "x > 0"
1442 Global usage is discouraged because of possible performance impact.
1444 * New classes "top" and "bot" with corresponding operations "top" and
1445 "bot" in theory Orderings; instantiation of class "complete_lattice"
1446 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1448 * Changed definition lemma "less_fun_def" in order to provide an
1449 instance for preorders on functions; use lemma "less_le" instead.
1452 * Theory Orderings: class "wellorder" moved here, with explicit
1453 induction rule "less_induct" as assumption. For instantiation of
1454 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1457 * Theory Orderings: added class "preorder" as superclass of "order".
1458 INCOMPATIBILITY: Instantiation proofs for order, linorder
1459 etc. slightly changed. Some theorems named order_class.* now named
1462 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1465 * Theory Finite_Set: added a new fold combinator of type
1467 ('a => 'b => 'b) => 'b => 'a set => 'b
1469 Occasionally this is more convenient than the old fold combinator
1470 which is now defined in terms of the new one and renamed to
1473 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1474 and "ring_simps" have been replaced by "algebra_simps" (which can be
1475 extended with further lemmas!). At the moment both still exist but
1476 the former will disappear at some point.
1478 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1479 class recpower. Type-specific simp rules for various recpower types
1480 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1482 rat_power_0 -> power_0
1483 rat_power_Suc -> power_Suc
1484 realpow_0 -> power_0
1485 realpow_Suc -> power_Suc
1486 complexpow_0 -> power_0
1487 complexpow_Suc -> power_Suc
1488 power_poly_0 -> power_0
1489 power_poly_Suc -> power_Suc
1491 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1492 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1493 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1494 of lemmas from Divides has been generalized from nat to class
1495 semiring_div. INCOMPATIBILITY. This involves the following theorem
1496 renames resulting from duplicate elimination:
1498 dvd_def_mod ~> dvd_eq_mod_eq_0
1499 zero_dvd_iff ~> dvd_0_left_iff
1500 dvd_0 ~> dvd_0_right
1501 DIVISION_BY_ZERO_DIV ~> div_by_0
1502 DIVISION_BY_ZERO_MOD ~> mod_by_0
1503 mult_div ~> div_mult_self2_is_id
1504 mult_mod ~> mod_mult_self2_is_0
1506 * Theory IntDiv: removed many lemmas that are instances of class-based
1507 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1508 rename old lemmas as follows:
1510 dvd_diff -> nat_dvd_diff
1511 dvd_zminus_iff -> dvd_minus_iff
1512 mod_add1_eq -> mod_add_eq
1513 mod_mult1_eq -> mod_mult_right_eq
1514 mod_mult1_eq' -> mod_mult_left_eq
1515 mod_mult_distrib_mod -> mod_mult_eq
1516 nat_mod_add_left_eq -> mod_add_left_eq
1517 nat_mod_add_right_eq -> mod_add_right_eq
1518 nat_mod_div_trivial -> mod_div_trivial
1519 nat_mod_mod_trivial -> mod_mod_trivial
1520 zdiv_zadd_self1 -> div_add_self1
1521 zdiv_zadd_self2 -> div_add_self2
1522 zdiv_zmult_self1 -> div_mult_self2_is_id
1523 zdiv_zmult_self2 -> div_mult_self1_is_id
1524 zdvd_triv_left -> dvd_triv_left
1525 zdvd_triv_right -> dvd_triv_right
1526 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1527 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1528 zmod_zadd_left_eq -> mod_add_left_eq
1529 zmod_zadd_right_eq -> mod_add_right_eq
1530 zmod_zadd_self1 -> mod_add_self1
1531 zmod_zadd_self2 -> mod_add_self2
1532 zmod_zadd1_eq -> mod_add_eq
1533 zmod_zdiff1_eq -> mod_diff_eq
1534 zmod_zdvd_zmod -> mod_mod_cancel
1535 zmod_zmod_cancel -> mod_mod_cancel
1536 zmod_zmult_self1 -> mod_mult_self2_is_0
1537 zmod_zmult_self2 -> mod_mult_self1_is_0
1540 zdvd_abs1 -> abs_dvd_iff
1541 zdvd_abs2 -> dvd_abs_iff
1542 zdvd_refl -> dvd_refl
1543 zdvd_trans -> dvd_trans
1544 zdvd_zadd -> dvd_add
1545 zdvd_zdiff -> dvd_diff
1546 zdvd_zminus_iff -> dvd_minus_iff
1547 zdvd_zminus2_iff -> minus_dvd_iff
1548 zdvd_zmultD -> dvd_mult_right
1549 zdvd_zmultD2 -> dvd_mult_left
1550 zdvd_zmult_mono -> mult_dvd_mono
1551 zdvd_0_right -> dvd_0_right
1552 zdvd_0_left -> dvd_0_left_iff
1553 zdvd_1_left -> one_dvd
1554 zminus_dvd_iff -> minus_dvd_iff
1556 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1558 * The real numbers offer decimal input syntax: 12.34 is translated
1559 into 1234/10^2. This translation is not reversed upon output.
1561 * Theory Library/Polynomial defines an abstract type 'a poly of
1562 univariate polynomials with coefficients of type 'a. In addition to
1563 the standard ring operations, it also supports div and mod. Code
1564 generation is also supported, using list-style constructors.
1566 * Theory Library/Inner_Product defines a class of real_inner for real
1567 inner product spaces, with an overloaded operation inner :: 'a => 'a
1568 => real. Class real_inner is a subclass of real_normed_vector from
1571 * Theory Library/Product_Vector provides instances for the product
1572 type 'a * 'b of several classes from RealVector and Inner_Product.
1573 Definitions of addition, subtraction, scalar multiplication, norms,
1574 and inner products are included.
1576 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1577 addition to the field operations, numerals and case syntax are also
1580 * Theory Library/Diagonalize provides constructive version of Cantor's
1581 first diagonalization argument.
1583 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1584 zlcm (for int); carried together from various gcd/lcm developements in
1585 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1586 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1587 may recover tupled syntax as follows:
1589 hide (open) const gcd
1590 abbreviation gcd where
1591 "gcd == (%(a, b). GCD.gcd a b)"
1593 GCD.gcd ("gcd '(_, _')")
1595 The same works for lcm, zgcd, zlcm.
1597 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1598 instantiations for algebraic structures. Removed some duplicate
1599 theorems. Changes in simp rules. INCOMPATIBILITY.
1601 * ML antiquotation @{code} takes a constant as argument and generates
1602 corresponding code in background and inserts name of the corresponding
1603 resulting ML value/function/datatype constructor binding in place.
1604 All occurrences of @{code} with a single ML block are generated
1605 simultaneously. Provides a generic and safe interface for
1606 instrumentalizing code generation. See
1607 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1608 In future you ought to refrain from ad-hoc compiling generated SML
1609 code on the ML toplevel. Note that (for technical reasons) @{code}
1610 cannot refer to constants for which user-defined serializations are
1611 set. Refer to the corresponding ML counterpart directly in that
1614 * Command 'rep_datatype': instead of theorem names the command now
1615 takes a list of terms denoting the constructors of the type to be
1616 represented as datatype. The characteristic theorems have to be
1617 proven. INCOMPATIBILITY. Also observe that the following theorems
1618 have disappeared in favour of existing ones:
1620 unit_induct ~> unit.induct
1621 prod_induct ~> prod.induct
1622 sum_induct ~> sum.induct
1623 Suc_Suc_eq ~> nat.inject
1624 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1629 * New locales for orders and lattices where the equivalence relation
1630 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1631 locales use a record structure with field eq for the equivalence.
1633 * New theory of factorial domains.
1635 * Units_l_inv and Units_r_inv are now simp rules by default.
1636 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1637 and/or r_inv will now also require deletion of these lemmas.
1639 * Renamed the following theorems, INCOMPATIBILITY:
1641 UpperD ~> Upper_memD
1642 LowerD ~> Lower_memD
1643 least_carrier ~> least_closed
1644 greatest_carrier ~> greatest_closed
1645 greatest_Lower_above ~> greatest_Lower_below
1646 one_zero ~> carrier_one_zero
1647 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1652 * Nominal datatypes can now contain type-variables.
1654 * Commands 'nominal_inductive' and 'equivariance' work with local
1657 * Nominal primrec can now works with local theory targets and its
1658 specification syntax now conforms to the general format as seen in
1661 * Method "perm_simp" honours the standard simplifier attributes
1662 (no_asm), (no_asm_use) etc.
1664 * The new predicate #* is defined like freshness, except that on the
1665 left hand side can be a set or list of atoms.
1667 * Experimental command 'nominal_inductive2' derives strong induction
1668 principles for inductive definitions. In contrast to
1669 'nominal_inductive', which can only deal with a fixed number of
1670 binders, it can deal with arbitrary expressions standing for sets of
1671 atoms to be avoided. The only inductive definition we have at the
1672 moment that needs this generalisation is the typing rule for Lets in
1675 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1676 -----------------------------------------------------------------
1677 Gamma |- Let x be t1 in t2 : T2
1679 In this rule one wants to avoid all the binders that are introduced by
1680 "close Gamma T1". We are looking for other examples where this
1681 feature might be useful. Please let us know.
1686 * Reimplemented the simplification procedure for proving continuity
1687 subgoals. The new simproc is extensible; users can declare additional
1688 continuity introduction rules with the attribute [cont2cont].
1690 * The continuity simproc now uses a different introduction rule for
1691 solving continuity subgoals on terms with lambda abstractions. In
1692 some rare cases the new simproc may fail to solve subgoals that the
1693 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1694 Potential INCOMPATIBILITY.
1696 * Command 'fixrec': specification syntax now conforms to the general
1697 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1698 examples. INCOMPATIBILITY.
1703 * Proof of Zorn's Lemma for partial orders.
1708 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1709 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1710 depends on multithreading, so timouts will not work before Poly/ML
1713 * High-level support for concurrent ML programming, see
1714 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1715 particularly convenient to organize independent functional
1716 computations. The concept of "synchronized variables" provides a
1717 higher-order interface for components with shared state, avoiding the
1718 delicate details of mutexes and condition variables. (Requires
1719 Poly/ML 5.2.1 or later.)
1721 * ML bindings produced via Isar commands are stored within the Isar
1722 context (theory or proof). Consequently, commands like 'use' and 'ML'
1723 become thread-safe and work with undo as expected (concerning
1724 top-level bindings, not side-effects on global references).
1725 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1726 compiler at runtime; really global bindings need to be given outside a
1727 theory. (Requires Poly/ML 5.2 or later.)
1729 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1730 context. Top-level ML bindings are stored within the proof context in
1731 a purely sequential fashion, disregarding the nested proof structure.
1732 ML bindings introduced by 'ML_prf' are discarded at the end of the
1733 proof. (Requires Poly/ML 5.2 or later.)
1735 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1736 and Method.setup, as well as Isar commands 'attribute_setup' and
1737 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1738 existing code accordingly, or use plain 'setup' together with old
1741 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1742 to 'a -> thm, while results are always tagged with an authentic oracle
1743 name. The Isar command 'oracle' is now polymorphic, no argument type
1744 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1745 accordingly. Note that extra performance may be gained by producing
1746 the cterm carefully, avoiding slow Thm.cterm_of.
1748 * Simplified interface for defining document antiquotations via
1749 ThyOutput.antiquotation, ThyOutput.output, and optionally
1750 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1751 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1754 * More systematic treatment of long names, abstract name bindings, and
1755 name space operations. Basic operations on qualified names have been
1756 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1757 Long_Name.append. Old type bstring has been mostly replaced by
1758 abstract type binding (see structure Binding), which supports precise
1759 qualification by packages and local theory targets, as well as proper
1760 tracking of source positions. INCOMPATIBILITY, need to wrap old
1761 bstring values into Binding.name, or better pass through abstract
1762 bindings everywhere. See further src/Pure/General/long_name.ML,
1763 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1765 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1766 LocalTheory.note etc.) now refer to the *full* internal name, not the
1767 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1769 * Disposed old type and term read functions (Sign.read_def_typ,
1770 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1771 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1772 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1773 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1774 resort for legacy applications.
1776 * Disposed old declarations, tactics, tactic combinators that refer to
1777 the simpset or claset of an implicit theory (such as Addsimps,
1778 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1779 embedded ML text, or local_simpset_of with a proper context passed as
1780 explicit runtime argument.
1782 * Rules and tactics that read instantiations (read_instantiate,
1783 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1784 context, which is required for parsing and type-checking. Moreover,
1785 the variables are specified as plain indexnames, not string encodings
1786 thereof. INCOMPATIBILITY.
1788 * Generic Toplevel.add_hook interface allows to analyze the result of
1789 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1790 for theorem dependency output of transactions resulting in a new
1793 * ML antiquotations: block-structured compilation context indicated by
1794 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1796 @{binding name} - basic name binding
1797 @{let ?pat = term} - term abbreviation (HO matching)
1798 @{note name = fact} - fact abbreviation
1799 @{thm fact} - singleton fact (with attributes)
1800 @{thms fact} - general fact (with attributes)
1801 @{lemma prop by method} - singleton goal
1802 @{lemma prop by meth1 meth2} - singleton goal
1803 @{lemma prop1 ... propN by method} - general goal
1804 @{lemma prop1 ... propN by meth1 meth2} - general goal
1805 @{lemma (open) ...} - open derivation
1810 * The Isabelle "emacs" tool provides a specific interface to invoke
1811 Proof General / Emacs, with more explicit failure if that is not
1812 installed (the old isabelle-interface script silently falls back on
1813 isabelle-process). The PROOFGENERAL_HOME setting determines the
1814 installation location of the Proof General distribution.
1816 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1817 the Isabelle process into a JVM/Scala application. See
1818 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1819 process wrapper has been discontinued.)
1821 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1823 * Various status messages (with exact source position information) are
1824 emitted, if proper markup print mode is enabled. This allows
1825 user-interface components to provide detailed feedback on internal
1830 New in Isabelle2008 (June 2008)
1831 -------------------------------
1835 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1836 and updated, with formally checked references as hyperlinks.
1838 * Theory loader: use_thy (and similar operations) no longer set the
1839 implicit ML context, which was occasionally hard to predict and in
1840 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1841 provides a proper context already.
1843 * Theory loader: old-style ML proof scripts being *attached* to a thy
1844 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1845 'use' within a theory file will do the job.
1847 * Name space merge now observes canonical order, i.e. the second space
1848 is inserted into the first one, while existing entries in the first
1849 space take precedence. INCOMPATIBILITY in rare situations, may try to
1850 swap theory imports.
1852 * Syntax: symbol \<chi> is now considered a letter. Potential
1853 INCOMPATIBILITY in identifier syntax etc.
1855 * Outer syntax: string tokens no longer admit escaped white space,
1856 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1857 white space without escapes.
1859 * Outer syntax: string tokens may contain arbitrary character codes
1860 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1866 * Context-dependent token translations. Default setup reverts locally
1867 fixed variables, and adds hilite markup for undeclared frees.
1869 * Unused theorems can be found using the new command 'unused_thms'.
1870 There are three ways of invoking it:
1873 Only finds unused theorems in the current theory.
1875 (2) unused_thms thy_1 ... thy_n -
1876 Finds unused theorems in the current theory and all of its ancestors,
1877 excluding the theories thy_1 ... thy_n and all of their ancestors.
1879 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1880 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1881 their ancestors, excluding the theories thy_1 ... thy_n and all of
1884 In order to increase the readability of the list produced by
1885 unused_thms, theorems that have been created by a particular instance
1886 of a theory command such as 'inductive' or 'function' are considered
1887 to belong to the same "group", meaning that if at least one theorem in
1888 this group is used, the other theorems in the same group are no longer
1889 reported as unused. Moreover, if all theorems in the group are
1890 unused, only one theorem in the group is displayed.
1892 Note that proof objects have to be switched on in order for
1893 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1894 usually the case when using Proof General with the default settings).
1896 * Authentic naming of facts disallows ad-hoc overwriting of previous
1897 theorems within the same name space. INCOMPATIBILITY, need to remove
1898 duplicate fact bindings, or even accidental fact duplications. Note
1899 that tools may maintain dynamically scoped facts systematically, using
1900 PureThy.add_thms_dynamic.
1902 * Command 'hide' now allows to hide from "fact" name space as well.
1904 * Eliminated destructive theorem database, simpset, claset, and
1905 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1906 update of theories within ML code.
1908 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1909 INCOMPATIBILITY, object-logics depending on former Pure require
1910 additional setup PureThy.old_appl_syntax_setup; object-logics
1911 depending on former CPure need to refer to Pure.
1913 * Commands 'use' and 'ML' are now purely functional, operating on
1914 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1915 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1918 * Command 'setup': discontinued implicit version with ML reference.
1920 * Instantiation target allows for simultaneous specification of class
1921 instance operations together with an instantiation proof.
1922 Type-checking phase allows to refer to class operations uniformly.
1923 See src/HOL/Complex/Complex.thy for an Isar example and
1924 src/HOL/Library/Eval.thy for an ML example.
1926 * Indexing of literal facts: be more serious about including only
1927 facts from the visible specification/proof context, but not the
1928 background context (locale etc.). Affects `prop` notation and method
1929 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1932 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1933 "(open)" option, which used to expose internal bound variables to the
1936 * Isar statements: removed obsolete case "rule_context".
1937 INCOMPATIBILITY, better use explicit fixes/assumes.
1939 * Locale proofs: default proof step now includes 'unfold_locales';
1940 hence 'proof' without argument may be used to unfold locale
1944 *** Document preparation ***
1946 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1947 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1948 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1949 spot); renamed link color from "darkblue" to "linkcolor" (default
1950 value unchanged, can be redefined via \definecolor); no longer sets
1951 "a4paper" option (unnecessary or even intrusive).
1953 * Antiquotation @{lemma A method} proves proposition A by the given
1954 method (either a method name or a method name plus (optional) method
1955 arguments in parentheses) and prints A just like @{prop A}.
1960 * New primrec package. Specification syntax conforms in style to
1961 definition/function/.... No separate induction rule is provided. The
1962 "primrec" command distinguishes old-style and new-style specifications
1963 by syntax. The former primrec package is now named OldPrimrecPackage.
1964 When adjusting theories, beware: constants stemming from new-style
1965 primrec specifications have authentic syntax.
1967 * Metis prover is now an order of magnitude faster, and also works
1968 with multithreading.
1970 * Metis: the maximum number of clauses that can be produced from a
1971 theorem is now given by the attribute max_clauses. Theorems that
1972 exceed this number are ignored, with a warning printed.
1974 * Sledgehammer no longer produces structured proofs by default. To
1975 enable, declare [[sledgehammer_full = true]]. Attributes
1976 reconstruction_modulus, reconstruction_sorts renamed
1977 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1979 * Method "induct_scheme" derives user-specified induction rules
1980 from well-founded induction and completeness of patterns. This factors
1981 out some operations that are done internally by the function package
1982 and makes them available separately. See
1983 src/HOL/ex/Induction_Scheme.thy for examples.
1985 * More flexible generation of measure functions for termination
1986 proofs: Measure functions can be declared by proving a rule of the
1987 form "is_measure f" and giving it the [measure_function] attribute.
1988 The "is_measure" predicate is logically meaningless (always true), and
1989 just guides the heuristic. To find suitable measure functions, the
1990 termination prover sets up the goal "is_measure ?f" of the appropriate
1991 type and generates all solutions by prolog-style backwards proof using
1994 This setup also deals with rules like
1996 "is_measure f ==> is_measure (list_size f)"
1998 which accommodates nested datatypes that recurse through lists.
1999 Similar rules are predeclared for products and option types.
2001 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2005 - Definitions of overloaded constants on sets have to be replaced by
2006 definitions on => and bool.
2008 - Some definitions of overloaded operators on sets can now be proved
2009 using the definitions of the operators on => and bool. Therefore,
2010 the following theorems have been renamed:
2012 subset_def -> subset_eq
2013 psubset_def -> psubset_eq
2014 set_diff_def -> set_diff_eq
2015 Compl_def -> Compl_eq
2016 Sup_set_def -> Sup_set_eq
2017 Inf_set_def -> Inf_set_eq
2018 sup_set_def -> sup_set_eq
2019 inf_set_def -> inf_set_eq
2021 - Due to the incompleteness of the HO unification algorithm, some
2022 rules such as subst may require manual instantiation, if some of
2023 the unknowns in the rule is a set.
2025 - Higher order unification and forward proofs:
2028 have "P (S::'a set)" <...>
2029 then have "EX S. P S" ..
2031 no longer works (due to the incompleteness of the HO unification
2032 algorithm) and must be replaced by the pattern
2039 - Calculational reasoning with subst (or similar rules):
2042 have "P (S::'a set)" <...>
2043 also have "S = T" <...>
2044 finally have "P T" .
2046 no longer works (for similar reasons as the previous example) and
2047 must be replaced by something like
2049 have "P (S::'a set)" <...>
2050 moreover have "S = T" <...>
2051 ultimately have "P T" by simp
2053 - Tactics or packages written in ML code:
2054 Code performing pattern matching on types via
2056 Type ("set", [T]) => ...
2058 must be rewritten. Moreover, functions like strip_type or
2059 binder_types no longer return the right value when applied to a
2062 T1 => ... => Tn => U => bool
2066 T1 => ... => Tn => U set
2068 * Merged theories Wellfounded_Recursion, Accessible_Part and
2069 Wellfounded_Relations to theory Wellfounded.
2071 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2073 * Class finite no longer treats UNIV as class parameter. Use class
2074 enum from theory Library/Enum instead to achieve a similar effect.
2077 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2078 and "Cons". INCOMPATIBILITY.
2080 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2081 Potential INCOMPATIBILITY.
2083 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2084 injective_fst_snd removed, use split_eta and prod_eqI instead.
2085 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2087 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2088 the same name in theory Orderings:
2098 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2099 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2100 and different variable names.
2102 * Library/Option_ord.thy: Canonical order on option type.
2104 * Library/RBT.thy: Red-black trees, an efficient implementation of
2107 * Library/Countable.thy: Type class for countable types.
2109 * Theory Int: The representation of numerals has changed. The infix
2110 operator BIT and the bit datatype with constructors B0 and B1 have
2111 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2112 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2113 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2116 * Theory Nat: definition of <= and < on natural numbers no longer
2117 depend on well-founded relations. INCOMPATIBILITY. Definitions
2118 le_def and less_def have disappeared. Consider lemmas not_less
2119 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2121 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2122 (whose purpose mainly is for various fold_set functionals) have been
2123 abandoned in favor of the existing algebraic classes
2124 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2125 lower_semilattice (resp. upper_semilattice) and linorder.
2128 * Theory Transitive_Closure: induct and cases rules now declare proper
2129 case_names ("base" and "step"). INCOMPATIBILITY.
2131 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2132 lattices. The form set-specific version is available as
2133 Inductive.lfp_ordinal_induct_set.
2135 * Renamed theorems "power.simps" to "power_int.simps".
2138 * Class semiring_div provides basic abstract properties of semirings
2139 with division and modulo operations. Subsumes former class dvd_mod.
2141 * Merged theories IntDef, Numeral and IntArith into unified theory
2142 Int. INCOMPATIBILITY.
2144 * Theory Library/Code_Index: type "index" now represents natural
2145 numbers rather than integers. INCOMPATIBILITY.
2147 * New class "uminus" with operation "uminus" (split of from class
2148 "minus" which now only has operation "minus", binary).
2151 * Constants "card", "internal_split", "option_map" now with authentic
2152 syntax. INCOMPATIBILITY.
2154 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2155 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2156 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2157 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2158 Sup_set_def, le_def, less_def, option_map_def now with object
2159 equality. INCOMPATIBILITY.
2161 * Records. Removed K_record, and replaced it by pure lambda term
2162 %x. c. The simplifier setup is now more robust against eta expansion.
2163 INCOMPATIBILITY: in cases explicitly referring to K_record.
2165 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2167 * Library/ListVector: new theory of arithmetic vector operations.
2169 * Library/Order_Relation: new theory of various orderings as sets of
2170 pairs. Defines preorders, partial orders, linear orders and
2171 well-orders on sets and on types.
2176 * Renamed some theories to allow to loading both ZF and HOL in the
2179 Datatype -> Datatype_ZF
2180 Inductive -> Inductive_ZF
2187 INCOMPATIBILITY: ZF theories that import individual theories below
2188 Main might need to be adapted. Regular theory Main is still
2189 available, as trivial extension of Main_ZF.
2194 * ML within Isar: antiquotation @{const name} or @{const
2195 name(typargs)} produces statically-checked Const term.
2197 * Functor NamedThmsFun: data is available to the user as dynamic fact
2198 (of the same name). Removed obsolete print command.
2200 * Removed obsolete "use_legacy_bindings" function.
2202 * The ``print mode'' is now a thread-local value derived from a global
2203 template (the former print_mode reference), thus access becomes
2204 non-critical. The global print_mode reference is for session
2205 management only; user-code should use print_mode_value,
2206 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2208 * Functions system/system_out provide a robust way to invoke external
2209 shell commands, with propagation of interrupts (requires Poly/ML
2210 5.2.1). Do not use OS.Process.system etc. from the basis library!
2215 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2216 in accordance with Proof General 3.7, which prefers GNU emacs.
2218 * isatool tty runs Isabelle process with plain tty interaction;
2219 optional line editor may be specified via ISABELLE_LINE_EDITOR
2220 setting, the default settings attempt to locate "ledit" and "rlwrap".
2222 * isatool browser now works with Cygwin as well, using general
2223 "javapath" function defined in Isabelle process environment.
2225 * YXML notation provides a simple and efficient alternative to
2226 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2227 isatool yxml as described in the Isabelle system manual.
2229 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2230 provides general wrapper for managing an Isabelle process in a robust
2231 fashion, with ``cooked'' output from stdin/stderr.
2233 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2234 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2236 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2237 way of changing the user's settings is via
2238 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2241 * Multithreading.max_threads := 0 refers to the number of actual CPU
2242 cores of the underlying machine, which is a good starting point for
2243 optimal performance tuning. The corresponding usedir option -M allows
2244 "max" as an alias for "0". WARNING: does not work on certain versions
2245 of Mac OS (with Poly/ML 5.1).
2247 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2248 adverse effect of Isabelle flooding interactive front-ends (notably
2249 ProofGeneral / XEmacs).
2253 New in Isabelle2007 (November 2007)
2254 -----------------------------------
2258 * More uniform information about legacy features, notably a
2259 warning/error of "Legacy feature: ...", depending on the state of the
2260 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2261 legacy features will disappear eventually.
2263 * Theory syntax: the header format ``theory A = B + C:'' has been
2264 discontinued in favour of ``theory A imports B C begin''. Use isatool
2265 fixheaders to convert existing theory files. INCOMPATIBILITY.
2267 * Theory syntax: the old non-Isar theory file format has been
2268 discontinued altogether. Note that ML proof scripts may still be used
2269 with Isar theories; migration is usually quite simple with the ML
2270 function use_legacy_bindings. INCOMPATIBILITY.
2272 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2273 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2276 * Theory loader: be more serious about observing the static theory
2277 header specifications (including optional directories), but not the
2278 accidental file locations of previously successful loads. The strict
2279 update policy of former update_thy is now already performed by
2280 use_thy, so the former has been removed; use_thys updates several
2281 theories simultaneously, just as 'imports' within a theory header
2282 specification, but without merging the results. Potential
2283 INCOMPATIBILITY: may need to refine theory headers and commands
2284 ROOT.ML which depend on load order.
2286 * Theory loader: optional support for content-based file
2287 identification, instead of the traditional scheme of full physical
2288 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2289 (cf. the system manual). The new scheme allows to work with
2290 non-finished theories in persistent session images, such that source
2291 files may be moved later on without requiring reloads.
2293 * Theory loader: old-style ML proof scripts being *attached* to a thy
2294 file (with the same base name as the theory) are considered a legacy
2295 feature, which will disappear eventually. Even now, the theory loader
2296 no longer maintains dependencies on such files.
2298 * Syntax: the scope for resolving ambiguities via type-inference is
2299 now limited to individual terms, instead of whole simultaneous
2300 specifications as before. This greatly reduces the complexity of the
2301 syntax module and improves flexibility by separating parsing and
2302 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2303 'fixes' etc.) are required in rare situations.
2305 * Syntax: constants introduced by new-style packages ('definition',
2306 'abbreviation' etc.) are passed through the syntax module in
2307 ``authentic mode''. This means that associated mixfix annotations
2308 really stick to such constants, independently of potential name space
2309 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2310 trees are represented slightly differently, may need to adapt syntax
2311 translations accordingly. Use CONST marker in 'translations' and
2312 @{const_syntax} antiquotation in 'parse_translation' etc.
2314 * Legacy goal package: reduced interface to the bare minimum required
2315 to keep existing proof scripts running. Most other user-level
2316 functions are now part of the OldGoals structure, which is *not* open
2317 by default (consider isatool expandshort before open OldGoals).
2318 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2319 these tend to cause confusion about the actual goal (!) context being
2320 used here, which is not necessarily the same as the_context().
2322 * Command 'find_theorems': supports "*" wild-card in "name:"
2323 criterion; "with_dups" option. Certain ProofGeneral versions might
2324 support a specific search form (see ProofGeneral/CHANGES).
2326 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2327 by default, which means that "prems" (and also "fixed variables") are
2328 suppressed from proof state output. Note that the ProofGeneral
2329 settings mechanism allows to change and save options persistently, but
2330 older versions of Isabelle will fail to start up if a negative prems
2333 * Local theory targets may be specified by non-nested blocks of
2334 ``context/locale/class ... begin'' followed by ``end''. The body may
2335 contain definitions, theorems etc., including any derived mechanism
2336 that has been implemented on top of these primitives. This concept
2337 generalizes the existing ``theorem (in ...)'' towards more versatility
2340 * Proof General interface: proper undo of final 'end' command;
2341 discontinued Isabelle/classic mode (ML proof scripts).
2344 *** Document preparation ***
2346 * Added antiquotation @{theory name} which prints the given name,
2347 after checking that it refers to a valid ancestor theory in the
2350 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2351 check the given source text as ML type/structure, printing verbatim.
2353 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2354 "c args == rhs" given in the current context. (Any number of
2355 arguments may be given on the LHS.)
2360 * The 'class' package offers a combination of axclass and locale to
2361 achieve Haskell-like type classes in Isabelle. Definitions and
2362 theorems within a class context produce both relative results (with
2363 implicit parameters according to the locale context), and polymorphic
2364 constants with qualified polymorphism (according to the class
2365 context). Within the body context of a 'class' target, a separate
2366 syntax layer ("user space type system") takes care of converting
2367 between global polymorphic consts and internal locale representation.
2368 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2369 "isatool doc classes" provides a tutorial.
2371 * Generic code generator framework allows to generate executable
2372 code for ML and Haskell (including Isabelle classes). A short usage
2375 internal compilation:
2376 export_code <list of constants (term syntax)> in SML
2377 writing SML code to a file:
2378 export_code <list of constants (term syntax)> in SML <filename>
2379 writing OCaml code to a file:
2380 export_code <list of constants (term syntax)> in OCaml <filename>
2381 writing Haskell code to a bunch of files:
2382 export_code <list of constants (term syntax)> in Haskell <filename>
2384 evaluating closed propositions to True/False using code generation:
2387 Reasonable default setup of framework in HOL.
2389 Theorem attributs for selecting and transforming function equations theorems:
2391 [code fun]: select a theorem as function equation for a specific constant
2392 [code fun del]: deselect a theorem as function equation for a specific constant
2393 [code inline]: select an equation theorem for unfolding (inlining) in place
2394 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2396 User-defined serializations (target in {SML, OCaml, Haskell}):
2398 code_const <and-list of constants (term syntax)>
2399 {(target) <and-list of const target syntax>}+
2401 code_type <and-list of type constructors>
2402 {(target) <and-list of type target syntax>}+
2404 code_instance <and-list of instances>
2406 where instance ::= <type constructor> :: <class>
2408 code_class <and_list of classes>
2409 {(target) <and-list of class target syntax>}+
2410 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2412 code_instance and code_class only are effective to target Haskell.
2414 For example usage see src/HOL/ex/Codegenerator.thy and
2415 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2416 generation from Isabelle/HOL theories is available via "isatool doc
2419 * Code generator: consts in 'consts_code' Isar commands are now
2420 referred to by usual term syntax (including optional type
2423 * Command 'no_translations' removes translation rules from theory
2426 * Overloaded definitions are now actually checked for acyclic
2427 dependencies. The overloading scheme is slightly more general than
2428 that of Haskell98, although Isabelle does not demand an exact
2429 correspondence to type class and instance declarations.
2430 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2431 exotic versions of overloading -- at the discretion of the user!
2433 Polymorphic constants are represented via type arguments, i.e. the
2434 instantiation that matches an instance against the most general
2435 declaration given in the signature. For example, with the declaration
2436 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2437 as c(nat). Overloading is essentially simultaneous structural
2438 recursion over such type arguments. Incomplete specification patterns
2439 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2440 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2441 Command 'print_theory' outputs the normalized system of recursive
2442 equations, see section "definitions".
2444 * Configuration options are maintained within the theory or proof
2445 context (with name and type bool/int/string), providing a very simple
2446 interface to a poor-man's version of general context data. Tools may
2447 declare options in ML (e.g. using Attrib.config_int) and then refer to
2448 these values using Config.get etc. Users may change options via an
2449 associated attribute of the same name. This form of context
2450 declaration works particularly well with commands 'declare' or
2451 'using', for example ``declare [[foo = 42]]''. Thus it has become
2452 very easy to avoid global references, which would not observe Isar
2453 toplevel undo/redo and fail to work with multithreading.
2455 Various global ML references of Pure and HOL have been turned into
2456 configuration options:
2458 Unify.search_bound unify_search_bound
2459 Unify.trace_bound unify_trace_bound
2460 Unify.trace_simp unify_trace_simp
2461 Unify.trace_types unify_trace_types
2462 Simplifier.simp_depth_limit simp_depth_limit
2463 Blast.depth_limit blast_depth_limit
2464 DatatypeProp.dtK datatype_distinctness_limit
2465 fast_arith_neq_limit fast_arith_neq_limit
2466 fast_arith_split_limit fast_arith_split_limit
2468 * Named collections of theorems may be easily installed as context
2469 data using the functor NamedThmsFun (see also
2470 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2471 attributes; there is also a toplevel print command. This facility is
2472 just a common case of general context data, which is the preferred way
2473 for anything more complex than just a list of facts in canonical
2476 * Isar: command 'declaration' augments a local theory by generic
2477 declaration functions written in ML. This enables arbitrary content
2478 being added to the context, depending on a morphism that tells the
2479 difference of the original declaration context wrt. the application
2480 context encountered later on.
2482 * Isar: proper interfaces for simplification procedures. Command
2483 'simproc_setup' declares named simprocs (with match patterns, and body
2484 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2485 context. ML antiquotation @{simproc name} retrieves named simprocs.
2487 * Isar: an extra pair of brackets around attribute declarations
2488 abbreviates a theorem reference involving an internal dummy fact,
2489 which will be ignored later --- only the effect of the attribute on
2490 the background context will persist. This form of in-place
2491 declarations is particularly useful with commands like 'declare' and
2492 'using', for example ``have A using [[simproc a]] by simp''.
2494 * Isar: method "assumption" (and implicit closing of subproofs) now
2495 takes simple non-atomic goal assumptions into account: after applying
2496 an assumption as a rule the resulting subgoals are solved by atomic
2497 assumption steps. This is particularly useful to finish 'obtain'
2498 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2499 without referring to the original premise "!!x. P x ==> thesis" in the
2500 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2503 * Isar: implicit use of prems from the Isar proof context is
2504 considered a legacy feature. Common applications like ``have A .''
2505 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2506 referencing facts explicitly here improves readability and
2507 maintainability of proof texts.
2509 * Isar: improper proof element 'guess' is like 'obtain', but derives
2510 the obtained context from the course of reasoning! For example:
2512 assume "EX x y. A x & B y" -- "any previous fact"
2513 then guess x and y by clarify
2515 This technique is potentially adventurous, depending on the facts and
2516 proof tools being involved here.
2518 * Isar: known facts from the proof context may be specified as literal
2519 propositions, using ASCII back-quote syntax. This works wherever
2520 named facts used to be allowed so far, in proof commands, proof
2521 methods, attributes etc. Literal facts are retrieved from the context
2522 according to unification of type and term parameters. For example,
2523 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2524 theorems in the current context, then these are valid literal facts:
2525 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2527 There is also a proof method "fact" which does the same composition
2528 for explicit goal states, e.g. the following proof texts coincide with
2529 certain special cases of literal facts:
2531 have "A" by fact == note `A`
2532 have "A ==> B" by fact == note `A ==> B`
2533 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2534 have "P a ==> Q a" by fact == note `P a ==> Q a`
2536 * Isar: ":" (colon) is no longer a symbolic identifier character in
2537 outer syntax. Thus symbolic identifiers may be used without
2538 additional white space in declarations like this: ``assume *: A''.
2540 * Isar: 'print_facts' prints all local facts of the current context,
2541 both named and unnamed ones.
2543 * Isar: 'def' now admits simultaneous definitions, e.g.:
2545 def x == "t" and y == "u"
2547 * Isar: added command 'unfolding', which is structurally similar to
2548 'using', but affects both the goal state and facts by unfolding given
2549 rewrite rules. Thus many occurrences of the 'unfold' method or
2550 'unfolded' attribute may be replaced by first-class proof text.
2552 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2553 and command 'unfolding' now all support object-level equalities
2554 (potentially conditional). The underlying notion of rewrite rule is
2555 analogous to the 'rule_format' attribute, but *not* that of the
2556 Simplifier (which is usually more generous).
2558 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2559 premises of a theorem by n. Useful in conjunction with drule.
2561 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2562 method expression within a sandbox consisting of the first N
2563 sub-goals, which need to exist. For example, ``simp_all [3]''
2564 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2565 simplifies all new goals that emerge from applying rule foo to the
2566 originally first one.
2568 * Isar: schematic goals are no longer restricted to higher-order
2569 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2572 * Isar: the conclusion of a long theorem statement is now either
2573 'shows' (a simultaneous conjunction, as before), or 'obtains'
2574 (essentially a disjunction of cases with local parameters and
2575 assumptions). The latter allows to express general elimination rules
2576 adequately; in this notation common elimination rules look like this:
2578 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2580 obtains x where "P x"
2582 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2586 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2592 The subsequent classical rules even refer to the formal "thesis"
2595 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2598 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2599 obtains "thesis ==> something"
2601 The actual proof of an 'obtains' statement is analogous to that of the
2602 Isar proof element 'obtain', only that there may be several cases.
2603 Optional case names may be specified in parentheses; these will be
2604 available both in the present proof and as annotations in the
2605 resulting rule, for later use with the 'cases' method (cf. attribute
2608 * Isar: the assumptions of a long theorem statement are available as
2609 "assms" fact in the proof context. This is more appropriate than the
2610 (historical) "prems", which refers to all assumptions of the current
2611 context, including those from the target locale, proof body etc.
2613 * Isar: 'print_statement' prints theorems from the current theory or
2614 proof context in long statement form, according to the syntax of a
2617 * Isar: 'obtain' takes an optional case name for the local context
2618 introduction rule (default "that").
2620 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2621 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2624 * Pure: syntax "CONST name" produces a fully internalized constant
2625 according to the current context. This is particularly useful for
2626 syntax translations that should refer to internal constant
2627 representations independently of name spaces.
2629 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2630 instead of "FOO ". This allows multiple binder declarations to coexist
2631 in the same context. INCOMPATIBILITY.
2633 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2634 primitive that also works in a locale context (both for constants and
2635 fixed variables). Type declaration and internal syntactic representation
2636 of given constants retrieved from the context. Likewise, the
2637 'no_notation' command allows to remove given syntax annotations from the
2640 * Isar/locales: new derived specification elements 'axiomatization',
2641 'definition', 'abbreviation', which support type-inference, admit
2642 object-level specifications (equality, equivalence). See also the
2643 isar-ref manual. Examples:
2646 eq (infix "===" 50) where
2647 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2649 definition "f x y = x + y + 1"
2650 definition g where "g x = f x x"
2653 neq (infix "=!=" 50) where
2654 "x =!= y == ~ (x === y)"
2656 These specifications may be also used in a locale context. Then the
2657 constants being introduced depend on certain fixed parameters, and the
2658 constant name is qualified by the locale base name. An internal
2659 abbreviation takes care for convenient input and output, making the
2660 parameters implicit and using the original short name. See also
2661 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2662 entities from a monomorphic theory.
2664 Presently, abbreviations are only available 'in' a target locale, but
2665 not inherited by general import expressions. Also note that
2666 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2667 'translations' in common applications. The "no_abbrevs" print mode
2668 prevents folding of abbreviations in term output.
2670 Concrete syntax is attached to specified constants in internal form,
2671 independently of name spaces. The parse tree representation is
2672 slightly different -- use 'notation' instead of raw 'syntax', and
2673 'translations' with explicit "CONST" markup to accommodate this.
2675 * Pure/Isar: unified syntax for new-style specification mechanisms
2676 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2677 full type inference and dummy patterns ("_"). For example:
2679 definition "K x _ = x"
2681 inductive conj for A B
2682 where "A ==> B ==> conj A B"
2684 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2685 the current context. Print mode "no_abbrevs" prevents inversion of
2686 abbreviations on output.
2688 * Isar/locales: improved parameter handling: use of locales "var" and
2689 "struct" no longer necessary; - parameter renamings are no longer
2690 required to be injective. For example, this allows to define
2691 endomorphisms as locale endom = homom mult mult h.
2693 * Isar/locales: changed the way locales with predicates are defined.
2694 Instead of accumulating the specification, the imported expression is
2695 now an interpretation. INCOMPATIBILITY: different normal form of
2696 locale expressions. In particular, in interpretations of locales with
2697 predicates, goals repesenting already interpreted fragments are not
2698 removed automatically. Use methods `intro_locales' and
2699 `unfold_locales'; see below.
2701 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2702 provide backward reasoning on locales predicates. The methods are
2703 aware of interpretations and discharge corresponding goals.
2704 `intro_locales' is less aggressive then `unfold_locales' and does not
2705 unfold predicates to assumptions.
2707 * Isar/locales: the order in which locale fragments are accumulated
2708 has changed. This enables to override declarations from fragments due
2709 to interpretations -- for example, unwanted simp rules.
2711 * Isar/locales: interpretation in theories and proof contexts has been
2712 extended. One may now specify (and prove) equations, which are
2713 unfolded in interpreted theorems. This is useful for replacing
2714 defined concepts (constants depending on locale parameters) by
2715 concepts already existing in the target context. Example:
2717 interpretation partial_order ["op <= :: [int, int] => bool"]
2718 where "partial_order.less (op <=) (x::int) y = (x < y)"
2720 Typically, the constant `partial_order.less' is created by a
2721 definition specification element in the context of locale
2724 * Method "induct": improved internal context management to support
2725 local fixes and defines on-the-fly. Thus explicit meta-level
2726 connectives !! and ==> are rarely required anymore in inductive goals
2727 (using object-logic connectives for this purpose has been long
2728 obsolete anyway). Common proof patterns are explained in
2729 src/HOL/Induct/Common_Patterns.thy, see also
2730 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2733 * Method "induct": improved handling of simultaneous goals. Instead of
2734 introducing object-level conjunction, the statement is now split into
2735 several conclusions, while the corresponding symbolic cases are nested
2736 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2737 see src/HOL/Induct/Common_Patterns.thy, for example.
2739 * Method "induct": mutual induction rules are now specified as a list
2740 of rule sharing the same induction cases. HOL packages usually provide
2741 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2742 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2743 mutual induction rules differently, i.e. like this:
2745 (induct rule: foo_bar.inducts)
2746 (induct set: foo bar)
2747 (induct pred: foo bar)
2748 (induct type: foo bar)
2750 The ML function ProjectRule.projections turns old-style rules into the
2753 * Method "coinduct": dual of induction, see
2754 src/HOL/Library/Coinductive_List.thy for various examples.
2756 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2757 considered a legacy feature.
2759 * Attribute "symmetric" produces result with standardized schematic
2760 variables (index 0). Potential INCOMPATIBILITY.
2762 * Simplifier: by default the simplifier trace only shows top level
2763 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2764 default. Thus there is less danger of being flooded by the trace. The
2765 trace indicates where parts have been suppressed.
2767 * Provers/classical: removed obsolete classical version of elim_format
2768 attribute; classical elim/dest rules are now treated uniformly when
2769 manipulating the claset.
2771 * Provers/classical: stricter checks to ensure that supplied intro,
2772 dest and elim rules are well-formed; dest and elim rules must have at
2775 * Provers/classical: attributes dest/elim/intro take an optional
2776 weight argument for the rule (just as the Pure versions). Weights are
2777 ignored by automated tools, but determine the search order of single
2780 * Syntax: input syntax now supports dummy variable binding "%_. b",
2781 where the body does not mention the bound variable. Note that dummy
2782 patterns implicitly depend on their context of bounds, which makes
2783 "{_. _}" match any set comprehension as expected. Potential
2784 INCOMPATIBILITY -- parse translations need to cope with syntactic
2785 constant "_idtdummy" in the binding position.
2787 * Syntax: removed obsolete syntactic constant "_K" and its associated
2788 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2789 for example "A -> B" => "Pi A (%_. B)".
2791 * Pure: 'class_deps' command visualizes the subclass relation, using
2792 the graph browser tool.
2794 * Pure: 'print_theory' now suppresses certain internal declarations by
2795 default; use '!' option for full details.
2800 * Method "metis" proves goals by applying the Metis general-purpose
2801 resolution prover (see also http://gilith.com/software/metis/).
2802 Examples are in the directory MetisExamples. WARNING: the
2803 Isabelle/HOL-Metis integration does not yet work properly with
2806 * Command 'sledgehammer' invokes external automatic theorem provers as
2807 background processes. It generates calls to the "metis" method if
2808 successful. These can be pasted into the proof. Users do not have to
2809 wait for the automatic provers to return. WARNING: does not really
2810 work with multi-threading.
2812 * New "auto_quickcheck" feature tests outermost goal statements for
2813 potential counter-examples. Controlled by ML references
2814 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2815 5000 milliseconds). Fails silently if statements is outside of
2816 executable fragment, or any other codgenerator problem occurs.
2818 * New constant "undefined" with axiom "undefined x = undefined".
2820 * Added class "HOL.eq", allowing for code generation with polymorphic
2823 * Some renaming of class constants due to canonical name prefixing in
2824 the new 'class' package:
2826 HOL.abs ~> HOL.abs_class.abs
2827 HOL.divide ~> HOL.divide_class.divide
2828 0 ~> HOL.zero_class.zero
2829 1 ~> HOL.one_class.one
2830 op + ~> HOL.plus_class.plus
2831 op - ~> HOL.minus_class.minus
2832 uminus ~> HOL.minus_class.uminus
2833 op * ~> HOL.times_class.times
2834 op < ~> HOL.ord_class.less
2835 op <= > HOL.ord_class.less_eq
2836 Nat.power ~> Power.power_class.power
2837 Nat.size ~> Nat.size_class.size
2838 Numeral.number_of ~> Numeral.number_class.number_of
2839 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2840 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2841 Orderings.min ~> Orderings.ord_class.min
2842 Orderings.max ~> Orderings.ord_class.max
2843 Divides.op div ~> Divides.div_class.div
2844 Divides.op mod ~> Divides.div_class.mod
2845 Divides.op dvd ~> Divides.div_class.dvd
2847 INCOMPATIBILITY. Adaptions may be required in the following cases:
2849 a) User-defined constants using any of the names "plus", "minus",
2850 "times", "less" or "less_eq". The standard syntax translations for
2851 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2854 b) Variables named "plus", "minus", "times", "less", "less_eq"
2855 INCOMPATIBILITY: use more specific names.
2857 c) Permutative equations (e.g. "a + b = b + a")
2858 Since the change of names also changes the order of terms, permutative
2859 rewrite rules may get applied in a different order. Experience shows
2860 that this is rarely the case (only two adaptions in the whole Isabelle
2861 distribution). INCOMPATIBILITY: rewrite proofs
2863 d) ML code directly refering to constant names
2864 This in general only affects hand-written proof tactics, simprocs and
2865 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2866 Consider using @{const_name} antiquotation.
2868 * New class "default" with associated constant "default".
2870 * Function "sgn" is now overloaded and available on int, real, complex
2871 (and other numeric types), using class "sgn". Two possible defs of
2872 sgn are given as equational assumptions in the classes sgn_if and
2873 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2876 * Locale "partial_order" now unified with class "order" (cf. theory
2877 Orderings), added parameter "less". INCOMPATIBILITY.
2879 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2880 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2881 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2883 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2884 changed order of proof goals in instance proofs.
2886 * The transitivity reasoner for partial and linear orders is set up
2887 for classes "order" and "linorder". Instances of the reasoner are available
2888 in all contexts importing or interpreting the corresponding locales.
2889 Method "order" invokes the reasoner separately; the reasoner
2890 is also integrated with the Simplifier as a solver. Diagnostic
2891 command 'print_orders' shows the available instances of the reasoner
2892 in the current context.
2894 * Localized monotonicity predicate in theory "Orderings"; integrated
2895 lemmas max_of_mono and min_of_mono with this predicate.
2898 * Formulation of theorem "dense" changed slightly due to integration
2899 with new class dense_linear_order.
2901 * Uniform lattice theory development in HOL.
2903 constants "meet" and "join" now named "inf" and "sup"
2904 constant "Meet" now named "Inf"
2906 classes "meet_semilorder" and "join_semilorder" now named
2907 "lower_semilattice" and "upper_semilattice"
2908 class "lorder" now named "lattice"
2909 class "comp_lat" now named "complete_lattice"
2911 Instantiation of lattice classes allows explicit definitions
2912 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2914 INCOMPATIBILITY. Theorem renames:
2916 meet_left_le ~> inf_le1
2917 meet_right_le ~> inf_le2
2918 join_left_le ~> sup_ge1
2919 join_right_le ~> sup_ge2
2920 meet_join_le ~> inf_sup_ord
2923 le_meet ~> le_inf_iff
2924 le_join ~> ge_sup_conv
2925 meet_idempotent ~> inf_idem
2926 join_idempotent ~> sup_idem
2927 meet_comm ~> inf_commute
2928 join_comm ~> sup_commute
2929 meet_leI1 ~> le_infI1
2930 meet_leI2 ~> le_infI2
2931 le_joinI1 ~> le_supI1
2932 le_joinI2 ~> le_supI2
2933 meet_assoc ~> inf_assoc
2934 join_assoc ~> sup_assoc
2935 meet_left_comm ~> inf_left_commute
2936 meet_left_idempotent ~> inf_left_idem
2937 join_left_comm ~> sup_left_commute
2938 join_left_idempotent ~> sup_left_idem
2941 le_def_meet ~> le_iff_inf
2942 le_def_join ~> le_iff_sup
2943 join_absorp2 ~> sup_absorb2
2944 join_absorp1 ~> sup_absorb1
2945 meet_absorp1 ~> inf_absorb1
2946 meet_absorp2 ~> inf_absorb2
2947 meet_join_absorp ~> inf_sup_absorb
2948 join_meet_absorp ~> sup_inf_absorb
2949 distrib_join_le ~> distrib_sup_le
2950 distrib_meet_le ~> distrib_inf_le
2952 add_meet_distrib_left ~> add_inf_distrib_left
2953 add_join_distrib_left ~> add_sup_distrib_left
2954 is_join_neg_meet ~> is_join_neg_inf
2955 is_meet_neg_join ~> is_meet_neg_sup
2956 add_meet_distrib_right ~> add_inf_distrib_right
2957 add_join_distrib_right ~> add_sup_distrib_right
2958 add_meet_join_distribs ~> add_sup_inf_distribs
2959 join_eq_neg_meet ~> sup_eq_neg_inf
2960 meet_eq_neg_join ~> inf_eq_neg_sup
2961 add_eq_meet_join ~> add_eq_inf_sup
2962 meet_0_imp_0 ~> inf_0_imp_0
2963 join_0_imp_0 ~> sup_0_imp_0
2964 meet_0_eq_0 ~> inf_0_eq_0
2965 join_0_eq_0 ~> sup_0_eq_0
2966 neg_meet_eq_join ~> neg_inf_eq_sup
2967 neg_join_eq_meet ~> neg_sup_eq_inf
2968 join_eq_if ~> sup_eq_if
2970 mono_meet ~> mono_inf
2971 mono_join ~> mono_sup
2972 meet_bool_eq ~> inf_bool_eq
2973 join_bool_eq ~> sup_bool_eq
2974 meet_fun_eq ~> inf_fun_eq
2975 join_fun_eq ~> sup_fun_eq
2976 meet_set_eq ~> inf_set_eq
2977 join_set_eq ~> sup_set_eq
2978 meet1_iff ~> inf1_iff
2979 meet2_iff ~> inf2_iff
2988 join1_iff ~> sup1_iff
2989 join2_iff ~> sup2_iff
2999 is_meet_Meet ~> is_meet_Inf
3000 Meet_bool_def ~> Inf_bool_def
3001 Meet_fun_def ~> Inf_fun_def
3002 Meet_greatest ~> Inf_greatest
3003 Meet_lower ~> Inf_lower
3004 Meet_set_def ~> Inf_set_def
3007 Sup_bool_eq ~> Sup_bool_def
3008 Sup_fun_eq ~> Sup_fun_def
3009 Sup_set_eq ~> Sup_set_def
3011 listsp_meetI ~> listsp_infI
3012 listsp_meet_eq ~> listsp_inf_eq
3017 * Added syntactic class "size"; overloaded constant "size" now has
3018 type "'a::size ==> bool"
3020 * Internal reorganisation of `size' of datatypes: size theorems
3021 "foo.size" are no longer subsumed by "foo.simps" (but are still
3022 simplification rules by default!); theorems "prod.size" now named
3025 * Class "div" now inherits from class "times" rather than "type".
3028 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3029 Linorder etc. have disappeared; operations defined in terms of
3030 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3032 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3034 * HOL-Word: New extensive library and type for generic, fixed size
3035 machine words, with arithemtic, bit-wise, shifting and rotating
3036 operations, reflection into int, nat, and bool lists, automation for
3037 linear arithmetic (by automatic reflection into nat or int), including
3038 lemmas on overflow and monotonicity. Instantiated to all appropriate
3039 arithmetic type classes, supporting automatic simplification of
3040 numerals on all operations.
3042 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3044 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3046 * Code generator library theories:
3047 - Code_Integer represents HOL integers by big integer literals in target
3049 - Code_Char represents HOL characters by character literals in target
3051 - Code_Char_chr like Code_Char, but also offers treatment of character
3052 codes; includes Code_Integer.
3053 - Executable_Set allows to generate code for finite sets using lists.
3054 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3056 - Executable_Real implements a subset of real numbers, namly those
3057 representable by rational numbers.
3058 - Efficient_Nat implements natural numbers by integers, which in general will
3059 result in higher efficency; pattern matching with 0/Suc is eliminated;
3060 includes Code_Integer.
3061 - Code_Index provides an additional datatype index which is mapped to
3062 target-language built-in integers.
3063 - Code_Message provides an additional datatype message_string which is isomorphic to
3064 strings; messages are mapped to target-language strings.
3066 * New package for inductive predicates
3068 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3071 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3072 for z_1 :: U_1 and ... and z_n :: U_m
3074 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3077 with full support for type-inference, rather than
3079 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3081 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3082 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3084 inductive "s z_1 ... z_m"
3086 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3089 For backward compatibility, there is a wrapper allowing inductive
3090 sets to be defined with the new package via
3093 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3094 for z_1 :: U_1 and ... and z_n :: U_m
3096 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3102 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3103 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3104 for z_1 :: U_1 and ... and z_n :: U_m
3106 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3107 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3110 if the additional syntax "p ..." is required.
3112 Numerous examples can be found in the subdirectories src/HOL/Auth,
3113 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3117 - Since declaration and definition of inductive sets or predicates
3118 is no longer separated, abbreviations involving the newly
3119 introduced sets or predicates must be specified together with the
3120 introduction rules after the 'where' keyword (see above), rather
3121 than before the actual inductive definition.
3123 - The variables in induction and elimination rules are now
3124 quantified in the order of their occurrence in the introduction
3125 rules, rather than in alphabetical order. Since this may break
3126 some proofs, these proofs either have to be repaired, e.g. by
3127 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3128 statements of the form
3130 case (rule_i a_i_1 ... a_i_{k_i})
3132 or the old order of quantification has to be restored by explicitly adding
3133 meta-level quantifiers in the introduction rules, i.e.
3135 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3137 - The format of the elimination rules is now
3139 p z_1 ... z_m x_1 ... x_n ==>
3140 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3145 (x_1, ..., x_n) : s z_1 ... z_m ==>
3146 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3149 for sets rather than
3151 x : s z_1 ... z_m ==>
3152 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3155 This may require terms in goals to be expanded to n-tuples
3156 (e.g. using case_tac or simplification with the split_paired_all
3157 rule) before the above elimination rule is applicable.
3159 - The elimination or case analysis rules for (mutually) inductive
3160 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3161 list of rules "p_1_..._p_k.elims" is no longer available.
3163 * New package "function"/"fun" for general recursive functions,
3164 supporting mutual and nested recursion, definitions in local contexts,
3165 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3166 for small examples, and the separate tutorial on the function
3167 package. The old recdef "package" is still available as before, but
3168 users are encouraged to use the new package.
3170 * Method "lexicographic_order" automatically synthesizes termination
3171 relations as lexicographic combinations of size measures.
3173 * Case-expressions allow arbitrary constructor-patterns (including
3174 "_") and take their order into account, like in functional
3175 programming. Internally, this is translated into nested
3176 case-expressions; missing cases are added and mapped to the predefined
3177 constant "undefined". In complicated cases printing may no longer show
3178 the original input but the internal form. Lambda-abstractions allow
3179 the same form of pattern matching: "% pat1 => e1 | ..." is an
3180 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3183 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3184 is an abbreviation for "of_nat :: nat => int". The simplification
3185 rules for "of_nat" have been changed to work like "int" did
3186 previously. Potential INCOMPATIBILITY:
3187 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3188 - of_nat_diff and of_nat_mult are no longer default simp rules
3190 * Method "algebra" solves polynomial equations over (semi)rings using
3191 Groebner bases. The (semi)ring structure is defined by locales and the
3192 tool setup depends on that generic context. Installing the method for
3193 a specific type involves instantiating the locale and possibly adding
3194 declarations for computation on the coefficients. The method is
3195 already instantiated for natural numbers and for the axiomatic class
3196 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3197 CALCULEMUS 2007 for the general principles underlying this
3198 architecture of context-aware proof-tools.
3200 * Method "ferrack" implements quantifier elimination over
3201 special-purpose dense linear orders using locales (analogous to
3202 "algebra"). The method is already installed for class
3203 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3206 * Former constant "List.op @" now named "List.append". Use ML
3207 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3208 circumvent possible incompatibilities when working on ML level.
3210 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3212 * New function listsum :: 'a list => 'a for arbitrary monoids.
3213 Special syntax: "SUM x <- xs. f x" (and latex variants)
3215 * New syntax for Haskell-like list comprehension (input only), eg.
3216 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3218 * The special syntax for function "filter" has changed from [x :
3219 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3220 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3222 * [a..b] is now defined for arbitrary linear orders. It used to be
3223 defined on nat only, as an abbreviation for [a..<Suc b]
3226 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3228 * New functions "sorted" and "sort" in src/HOL/List.thy.
3230 * New lemma collection field_simps (an extension of ring_simps) for
3231 manipulating (in)equations involving division. Multiplies with all
3232 denominators that can be proved to be non-zero (in equations) or
3233 positive/negative (in inequations).
3235 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3236 have been improved and renamed to ring_simps, group_simps and
3237 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3238 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3240 * Theory Library/Commutative_Ring: switched from recdef to function
3241 package; constants add, mul, pow now curried. Infix syntax for
3242 algebraic operations.
3244 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3247 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3250 * HOL/records: generalised field-update to take a function on the
3251 field rather than the new value: r(|A := x|) is translated to A_update
3252 (K x) r The K-combinator that is internally used is called K_record.
3253 INCOMPATIBILITY: Usage of the plain update functions has to be
3256 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3257 * x = 0, which are required for a semiring. Richer structures do not
3258 inherit from semiring_0 anymore, because this property is a theorem
3259 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3260 there is more to prove, but this is mostly trivial.
3262 * Class "recpower" is generalized to arbitrary monoids, not just
3263 commutative semirings. INCOMPATIBILITY: may need to incorporate
3264 commutativity or semiring properties additionally.
3266 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3267 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3268 better use 'abbreviation'.
3270 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3272 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3273 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3274 significant changes for setting up numeral syntax for types:
3275 - New constants Numeral.pred and Numeral.succ instead
3276 of former Numeral.bin_pred and Numeral.bin_succ.
3277 - Use integer operations instead of bin_add, bin_mult and so on.
3278 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3279 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3281 See src/HOL/Integ/IntArith.thy for an example setup.
3283 * Command 'normal_form' computes the normal form of a term that may
3284 contain free variables. For example ``normal_form "rev [a, b, c]"''
3285 produces ``[b, c, a]'' (without proof). This command is suitable for
3286 heavy-duty computations because the functions are compiled to ML
3287 first. Correspondingly, a method "normalization" is provided. See
3288 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3290 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3291 25 like -->); output depends on the "iff" print_mode, the default is
3292 "A = B" (with priority 50).
3294 * Relations less (<) and less_eq (<=) are also available on type bool.
3295 Modified syntax to disallow nesting without explicit parentheses,
3296 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3299 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3301 * Relation composition operator "op O" now has precedence 75 and binds
3302 stronger than union and intersection. INCOMPATIBILITY.
3304 * The old set interval syntax "{m..n(}" (and relatives) has been
3305 removed. Use "{m..<n}" (and relatives) instead.
3307 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3308 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3309 ``declare [[simproc del: neq]]''.
3311 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3314 * Theorem Cons_eq_map_conv no longer declared as "simp".
3316 * Theorem setsum_mult renamed to setsum_right_distrib.
3318 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3321 * Reimplemented methods "sat" and "satx", with several improvements:
3322 goals no longer need to be stated as "<prems> ==> False", equivalences
3323 (i.e. "=" on type bool) are handled, variable names of the form
3324 "lit_<n>" are no longer reserved, significant speedup.
3326 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3327 zChaff is still supported as well.
3329 * 'inductive' and 'datatype': provide projections of mutual rules,
3330 bundled as foo_bar.inducts;
3332 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3335 * Library: moved theory Accessible_Part to main HOL.
3337 * Library: added theory Coinductive_List of potentially infinite lists
3338 as greatest fixed-point.
3340 * Library: added theory AssocList which implements (finite) maps as
3343 * Method "evaluation" solves goals (i.e. a boolean expression)
3344 efficiently by compiling it to ML. The goal is "proved" (via an
3345 oracle) if it evaluates to True.
3347 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3348 also when invoked by the simplifier. This results in the Simplifier
3349 being more powerful on arithmetic goals. INCOMPATIBILITY.
3350 Configuration option fast_arith_split_limit=0 recovers the old
3353 * Support for hex (0x20) and binary (0b1001) numerals.
3355 * New method: reify eqs (t), where eqs are equations for an
3356 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3357 parameter, computes a term s::'b and a list xs::'a list and proves the
3358 theorem I xs s = t. This is also known as reification or quoting. The
3359 resulting theorem is applied to the subgoal to substitute t with I xs
3360 s. If t is omitted, the subgoal itself is reified.
3362 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3363 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3364 where f is supposed to be a computable function (in the sense of code
3365 generattion). The method uses reify to compute s and xs as above then
3366 applies corr_thm and uses normalization by evaluation to "prove" f s =
3367 r and finally gets the theorem t = r, which is again applied to the
3368 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3370 * Reflection: Automatic reification now handels binding, an example is
3371 available in src/HOL/ex/ReflectionEx.thy
3373 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3374 command 'statespace' that is similar to 'record', but introduces an
3375 abstract specification based on the locale infrastructure instead of
3376 HOL types. This leads to extra flexibility in composing state spaces,
3377 in particular multiple inheritance and renaming of components.
3382 * Hyperreal: Functions root and sqrt are now defined on negative real
3383 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3384 Nonnegativity side conditions have been removed from many lemmas, so
3385 that more subgoals may now be solved by simplification; potential
3388 * Real: new type classes formalize real normed vector spaces and
3389 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3390 and norm :: 'a => real.
3392 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3393 reals into other types. The overloaded constant Reals :: 'a set is now
3394 defined as range of_real; potential INCOMPATIBILITY.
3396 * Real: proper support for ML code generation, including 'quickcheck'.
3397 Reals are implemented as arbitrary precision rationals.
3399 * Real: new development using Cauchy Sequences.
3401 * Hyperreal: Several constants that previously worked only for the
3402 reals have been generalized, so they now work over arbitrary vector
3403 spaces. Type annotations may need to be added in some cases; potential
3406 Infinitesimal :: ('a::real_normed_vector) star set
3407 HFinite :: ('a::real_normed_vector) star set
3408 HInfinite :: ('a::real_normed_vector) star set
3409 approx :: ('a::real_normed_vector) star => 'a star => bool
3410 monad :: ('a::real_normed_vector) star => 'a star set
3411 galaxy :: ('a::real_normed_vector) star => 'a star set
3412 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3413 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3414 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3415 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3416 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3417 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3418 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3419 sgn :: 'a::real_normed_vector => 'a
3420 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3422 * Complex: Some complex-specific constants are now abbreviations for
3423 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3424 hnorm. Other constants have been entirely removed in favor of the
3425 polymorphic versions (INCOMPATIBILITY):
3429 HInfinite <-- CInfinite
3430 Infinitesimal <-- CInfinitesimal
3433 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3434 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3435 (ns)deriv <-- (ns)cderiv
3440 * Formalisation of ideals and the quotient construction over rings.
3442 * Order and lattice theory no longer based on records.
3445 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3446 greatest_closed. INCOMPATIBILITY.
3448 * Method algebra is now set up via an attribute. For examples see
3449 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3450 of algebraic structures.
3452 * Renamed theory CRing to Ring.
3457 * Substantial, yet incomplete support for nominal datatypes (binding
3458 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3459 src/HOL/Nominal/Examples. Prospective users should consult
3460 http://isabelle.in.tum.de/nominal/
3465 * ML basics: just one true type int, which coincides with IntInf.int
3468 * ML within Isar: antiquotations allow to embed statically-checked
3469 formal entities in the source, referring to the context available at
3470 compile-time. For example:
3472 ML {* @{sort "{zero,one}"} *}
3473 ML {* @{typ "'a => 'b"} *}
3474 ML {* @{term "%x. x"} *}
3475 ML {* @{prop "x == y"} *}
3476 ML {* @{ctyp "'a => 'b"} *}
3477 ML {* @{cterm "%x. x"} *}
3478 ML {* @{cprop "x == y"} *}
3479 ML {* @{thm asm_rl} *}
3480 ML {* @{thms asm_rl} *}
3481 ML {* @{type_name c} *}
3482 ML {* @{type_syntax c} *}
3483 ML {* @{const_name c} *}
3484 ML {* @{const_syntax c} *}
3487 ML {* @{theory Pure} *}
3488 ML {* @{theory_ref} *}
3489 ML {* @{theory_ref Pure} *}
3492 ML {* @{clasimpset} *}
3494 The same works for sources being ``used'' within an Isar context.
3496 * ML in Isar: improved error reporting; extra verbosity with
3497 ML_Context.trace enabled.
3499 * Pure/General/table.ML: the join operations now works via exceptions
3500 DUP/SAME instead of type option. This is simpler in simple cases, and
3501 admits slightly more efficient complex applications.
3503 * Pure: 'advanced' translation functions (parse_translation etc.) now
3504 use Context.generic instead of just theory.
3506 * Pure: datatype Context.generic joins theory/Proof.context and
3507 provides some facilities for code that works in either kind of
3508 context, notably GenericDataFun for uniform theory and proof data.
3510 * Pure: simplified internal attribute type, which is now always
3511 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3512 local (Proof.context) attributes have been discontinued, while
3513 minimizing code duplication. Thm.rule_attribute and
3514 Thm.declaration_attribute build canonical attributes; see also structure
3515 Context for further operations on Context.generic, notably
3516 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3517 declarations and definitions.
3519 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3520 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3521 init only required for impure data. INCOMPATIBILITY: empty really need
3522 to be empty (no dependencies on theory content!)
3524 * Pure/kernel: consts certification ignores sort constraints given in
3525 signature declarations. (This information is not relevant to the
3526 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3527 potential INCOMPATIBILITY.
3529 * Pure: axiomatic type classes are now purely definitional, with
3530 explicit proofs of class axioms and super class relations performed
3531 internally. See Pure/axclass.ML for the main internal interfaces --
3532 notably AxClass.define_class supercedes AxClass.add_axclass, and
3533 AxClass.axiomatize_class/classrel/arity supersede
3534 Sign.add_classes/classrel/arities.
3536 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3537 global/local versions on theory vs. Proof.context have been
3538 discontinued; Attrib.syntax and Method.syntax have been adapted
3539 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3540 attributes, methods, etc.
3542 * Pure: several functions of signature "... -> theory -> theory * ..."
3543 have been reoriented to "... -> theory -> ... * theory" in order to
3544 allow natural usage in combination with the ||>, ||>>, |-> and
3545 fold_map combinators.
3547 * Pure: official theorem names (closed derivations) and additional
3548 comments (tags) are now strictly separate. Name hints -- which are
3549 maintained as tags -- may be attached any time without affecting the
3552 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3553 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3554 achieve the old behaviour.
3556 * Pure: the "Goal" constant is now called "prop", supporting a
3557 slightly more general idea of ``protecting'' meta-level rule
3560 * Pure: Logic.(un)varify only works in a global context, which is now
3561 enforced instead of silently assumed. INCOMPATIBILITY, may use
3562 Logic.legacy_(un)varify as temporary workaround.
3564 * Pure: structure Name provides scalable operations for generating
3565 internal variable names, notably Name.variants etc. This replaces
3566 some popular functions from term.ML:
3568 Term.variant -> Name.variant
3569 Term.variantlist -> Name.variant_list
3570 Term.invent_names -> Name.invent_list
3572 Note that low-level renaming rarely occurs in new code -- operations
3573 from structure Variable are used instead (see below).
3575 * Pure: structure Variable provides fundamental operations for proper
3576 treatment of fixed/schematic variables in a context. For example,
3577 Variable.import introduces fixes for schematics of given facts and
3578 Variable.export reverses the effect (up to renaming) -- this replaces
3579 various freeze_thaw operations.
3581 * Pure: structure Goal provides simple interfaces for
3582 init/conclude/finish and tactical prove operations (replacing former
3583 Tactic.prove). Goal.prove is the canonical way to prove results
3584 within a given context; Goal.prove_global is a degraded version for
3585 theory level goals, including a global Drule.standard. Note that
3586 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3587 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3588 in a locale context).
3590 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3591 and type checking (Syntax.check_term etc.), with common combinations
3592 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3593 which are considered legacy and await removal.
3595 * Pure/Syntax: generic interfaces for type unchecking
3596 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3597 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3598 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3599 available for convenience, but refer to the very same operations using
3600 a mere theory instead of a full context.
3602 * Isar: simplified treatment of user-level errors, using exception
3603 ERROR of string uniformly. Function error now merely raises ERROR,
3604 without any side effect on output channels. The Isar toplevel takes
3605 care of proper display of ERROR exceptions. ML code may use plain
3606 handle/can/try; cat_error may be used to concatenate errors like this:
3608 ... handle ERROR msg => cat_error msg "..."
3610 Toplevel ML code (run directly or through the Isar toplevel) may be
3611 embedded into the Isar toplevel with exception display/debug like
3614 Isar.toplevel (fn () => ...)
3616 INCOMPATIBILITY, removed special transform_error facilities, removed
3617 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3618 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3619 -- use plain ERROR instead.
3621 * Isar: theory setup now has type (theory -> theory), instead of a
3622 list. INCOMPATIBILITY, may use #> to compose setup functions.
3624 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3625 ProofContext.debug/verbose flags.
3627 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3628 theory before entering a proof state. Transactions now always see a
3629 quasi-functional intermediate checkpoint, both in interactive and
3632 * Isar: simplified interfaces for outer syntax. Renamed
3633 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3634 OuterSyntax.add_parsers -- this functionality is now included in
3635 OuterSyntax.command etc. INCOMPATIBILITY.
3637 * Simplifier: the simpset of a running simplification process now
3638 contains a proof context (cf. Simplifier.the_context), which is the
3639 very context that the initial simpset has been retrieved from (by
3640 simpset_of/local_simpset_of). Consequently, all plug-in components
3641 (solver, looper etc.) may depend on arbitrary proof data.
3643 * Simplifier.inherit_context inherits the proof context (plus the
3644 local bounds) of the current simplification process; any simproc
3645 etc. that calls the Simplifier recursively should do this! Removed
3646 former Simplifier.inherit_bounds, which is already included here --
3647 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3648 specify an explicit context using Simplifier.context/theory_context.
3650 * Simplifier/Classical Reasoner: more abstract interfaces
3651 change_simpset/claset for modifying the simpset/claset reference of a
3652 theory; raw versions simpset/claset_ref etc. have been discontinued --
3655 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3661 * settings: the default heap location within ISABELLE_HOME_USER now
3662 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3663 Isabelle installations.
3665 * isabelle-process: option -S (secure mode) disables some critical
3666 operations, notably runtime compilation and evaluation of ML source
3669 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3671 * Support for parallel execution, using native multicore support of
3672 Poly/ML 5.1. The theory loader exploits parallelism when processing
3673 independent theories, according to the given theory header
3674 specifications. The maximum number of worker threads is specified via
3675 usedir option -M or the "max-threads" setting in Proof General. A
3676 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3677 to 6 on a 8-core machine. User-code needs to observe certain
3678 guidelines for thread-safe programming, see appendix A in the Isar
3679 Implementation manual.
3683 New in Isabelle2005 (October 2005)
3684 ----------------------------------
3688 * Theory headers: the new header syntax for Isar theories is
3691 imports <theory1> ... <theoryN>
3692 uses <file1> ... <fileM>
3695 where the 'uses' part is optional. The previous syntax
3697 theory <name> = <theory1> + ... + <theoryN>:
3699 will disappear in the next release. Use isatool fixheaders to convert
3700 existing theory files. Note that there is no change in ancient
3701 non-Isar theories now, but these will disappear soon.
3703 * Theory loader: parent theories can now also be referred to via
3704 relative and absolute paths.
3706 * Command 'find_theorems' searches for a list of criteria instead of a
3707 list of constants. Known criteria are: intro, elim, dest, name:string,
3708 simp:term, and any term. Criteria can be preceded by '-' to select
3709 theorems that do not match. Intro, elim, dest select theorems that
3710 match the current goal, name:s selects theorems whose fully qualified
3711 name contain s, and simp:term selects all simplification rules whose
3712 lhs match term. Any other term is interpreted as pattern and selects
3713 all theorems matching the pattern. Available in ProofGeneral under
3714 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3716 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3718 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3719 matching the current goal as introduction rule and not having "HOL."
3720 in their name (i.e. not being defined in theory HOL).
3722 * Command 'thms_containing' has been discontinued in favour of
3723 'find_theorems'; INCOMPATIBILITY.
3725 * Communication with Proof General is now 8bit clean, which means that
3726 Unicode text in UTF-8 encoding may be used within theory texts (both
3727 formal and informal parts). Cf. option -U of the Isabelle Proof
3728 General interface. Here are some simple examples (cf. src/HOL/ex):
3730 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3731 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3733 * Improved efficiency of the Simplifier and, to a lesser degree, the
3734 Classical Reasoner. Typical big applications run around 2 times
3738 *** Document preparation ***
3740 * Commands 'display_drafts' and 'print_drafts' perform simple output
3741 of raw sources. Only those symbols that do not require additional
3742 LaTeX packages (depending on comments in isabellesym.sty) are
3743 displayed properly, everything else is left verbatim. isatool display
3744 and isatool print are used as front ends (these are subject to the
3745 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3747 * Command tags control specific markup of certain regions of text,
3748 notably folding and hiding. Predefined tags include "theory" (for
3749 theory begin and end), "proof" for proof commands, and "ML" for
3750 commands involving ML code; the additional tags "visible" and
3751 "invisible" are unused by default. Users may give explicit tag
3752 specifications in the text, e.g. ''by %invisible (auto)''. The
3753 interpretation of tags is determined by the LaTeX job during document
3754 preparation: see option -V of isatool usedir, or options -n and -t of
3755 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3758 Several document versions may be produced at the same time via isatool
3759 usedir (the generated index.html will link all of them). Typical
3760 specifications include ''-V document=theory,proof,ML'' to present
3761 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3762 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3763 these parts without any formal replacement text. The Isabelle site
3764 default settings produce ''document'' and ''outline'' versions as
3767 * Several new antiquotations:
3769 @{term_type term} prints a term with its type annotated;
3771 @{typeof term} prints the type of a term;
3773 @{const const} is the same as @{term const}, but checks that the
3774 argument is a known logical constant;
3776 @{term_style style term} and @{thm_style style thm} print a term or
3777 theorem applying a "style" to it
3781 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3782 definitions, equations, inequations etc., 'concl' printing only the
3783 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3784 to print the specified premise. TermStyle.add_style provides an ML
3785 interface for introducing further styles. See also the "LaTeX Sugar"
3786 document practical applications. The ML antiquotation prints
3787 type-checked ML expressions verbatim.
3789 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3790 and 'text' support optional locale specification '(in loc)', which
3791 specifies the default context for interpreting antiquotations. For
3792 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3794 * Option 'locale=NAME' of antiquotations specifies an alternative
3795 context interpreting the subsequent argument. For example: @{thm
3796 [locale=lattice] inf_assoc}.
3798 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3801 * Proper output of antiquotations for theory commands involving a
3802 proof context (such as 'locale' or 'theorem (in loc) ...').
3804 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3805 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3807 * isatool usedir: new option -C (default true) controls whether option
3808 -D should include a copy of the original document directory; -C false
3809 prevents unwanted effects such as copying of administrative CVS data.
3814 * Considerably improved version of 'constdefs' command. Now performs
3815 automatic type-inference of declared constants; additional support for
3816 local structure declarations (cf. locales and HOL records), see also
3817 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3818 sequential dependencies of definitions within a single 'constdefs'
3819 section; moreover, the declared name needs to be an identifier. If
3820 all fails, consider to fall back on 'consts' and 'defs' separately.
3822 * Improved indexed syntax and implicit structures. First of all,
3823 indexed syntax provides a notational device for subscripted
3824 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3825 expressions. Secondly, in a local context with structure
3826 declarations, number indexes \<^sub>n or the empty index (default
3827 number 1) refer to a certain fixed variable implicitly; option
3828 show_structs controls printing of implicit structures. Typical
3829 applications of these concepts involve record types and locales.
3831 * New command 'no_syntax' removes grammar declarations (and
3832 translations) resulting from the given syntax specification, which is
3833 interpreted in the same manner as for the 'syntax' command.
3835 * 'Advanced' translation functions (parse_translation etc.) may depend
3836 on the signature of the theory context being presently used for
3837 parsing/printing, see also isar-ref manual.
3839 * Improved 'oracle' command provides a type-safe interface to turn an
3840 ML expression of type theory -> T -> term into a primitive rule of
3841 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3842 is already included here); see also FOL/ex/IffExample.thy;
3845 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3846 before); "cI" is no longer bound, use "c.intro" instead.
3847 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3848 axclasses vs. locales.
3850 * Improved internal renaming of symbolic identifiers -- attach primes
3851 instead of base 26 numbers.
3853 * New flag show_question_marks controls printing of leading question
3854 marks in schematic variable names.
3856 * In schematic variable names, *any* symbol following \<^isub> or
3857 \<^isup> is now treated as part of the base name. For example, the
3858 following works without printing of awkward ".0" indexes:
3860 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3863 * Inner syntax includes (*(*nested*) comments*).
3865 * Pretty printer now supports unbreakable blocks, specified in mixfix
3866 annotations as "(00...)".
3868 * Clear separation of logical types and nonterminals, where the latter
3869 may only occur in 'syntax' specifications or type abbreviations.
3870 Before that distinction was only partially implemented via type class
3871 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3872 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3873 exotic syntax specifications may require further adaption
3874 (e.g. Cube/Cube.thy).
3876 * Removed obsolete type class "logic", use the top sort {} instead.
3877 Note that non-logical types should be declared as 'nonterminals'
3878 rather than 'types'. INCOMPATIBILITY for new object-logic
3881 * Attributes 'induct' and 'cases': type or set names may now be
3882 locally fixed variables as well.
3884 * Simplifier: can now control the depth to which conditional rewriting
3885 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3888 * Simplifier: simplification procedures may now take the current
3889 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3890 interface), which is very useful for calling the Simplifier
3891 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3892 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3893 low-level mk_simproc no longer applies Logic.varify internally, to
3894 allow for use in a context of fixed variables.
3896 * thin_tac now works even if the assumption being deleted contains !!
3897 or ==>. More generally, erule now works even if the major premise of
3898 the elimination rule contains !! or ==>.
3900 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3902 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3903 from Pure, which contains all common declarations already. Both
3904 theories are defined via plain Isabelle/Isar .thy files.
3905 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3906 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3907 use isatool fixcpure to adapt your theory and ML sources.
3909 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3910 selections of theorems in named facts via index ranges.
3912 * 'print_theorems': in theory mode, really print the difference
3913 wrt. the last state (works for interactive theory development only),
3914 in proof mode print all local facts (cf. 'print_facts');
3916 * 'hide': option '(open)' hides only base names.
3918 * More efficient treatment of intermediate checkpoints in interactive
3921 * Code generator is now invoked via code_module (incremental code
3922 generation) and code_library (modular code generation, ML structures
3923 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3924 must be quoted when used as identifiers.
3926 * New 'value' command for reading, evaluating and printing terms using
3927 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3928 quoted when used as identifier.
3933 * New commands for the interpretation of locale expressions in
3934 theories (1), locales (2) and proof contexts (3). These generate
3935 proof obligations from the expression specification. After the
3936 obligations have been discharged, theorems of the expression are added
3937 to the theory, target locale or proof context. The synopsis of the
3938 commands is a follows:
3940 (1) interpretation expr inst
3941 (2) interpretation target < expr
3942 (3) interpret expr inst
3944 Interpretation in theories and proof contexts require a parameter
3945 instantiation of terms from the current context. This is applied to
3946 specifications and theorems of the interpreted expression.
3947 Interpretation in locales only permits parameter renaming through the
3948 locale expression. Interpretation is smart in that interpretations
3949 that are active already do not occur in proof obligations, neither are
3950 instantiated theorems stored in duplicate. Use 'print_interps' to
3951 inspect active interpretations of a particular locale. For details,
3952 see the Isar Reference manual. Examples can be found in
3953 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3955 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3956 'interpret' instead.
3958 * New context element 'constrains' for adding type constraints to
3961 * Context expressions: renaming of parameters with syntax
3964 * Locale declaration: 'includes' disallowed.
3966 * Proper static binding of attribute syntax -- i.e. types / terms /
3967 facts mentioned as arguments are always those of the locale definition
3968 context, independently of the context of later invocations. Moreover,
3969 locale operations (renaming and type / term instantiation) are applied
3970 to attribute arguments as expected.
3972 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3973 actual attributes; rare situations may require Attrib.attribute to
3974 embed those attributes into Attrib.src that lack concrete syntax.
3975 Attribute implementations need to cooperate properly with the static
3976 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3977 Attrib.XXX_thm etc. already do the right thing without further
3978 intervention. Only unusual applications -- such as "where" or "of"
3979 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3980 on the context and the facts involved -- may have to assign parsed
3981 values to argument tokens explicitly.
3983 * Changed parameter management in theorem generation for long goal
3984 statements with 'includes'. INCOMPATIBILITY: produces a different
3985 theorem statement in rare situations.
3987 * Locale inspection command 'print_locale' omits notes elements. Use
3988 'print_locale!' to have them included in the output.
3993 * Provers/hypsubst.ML: improved version of the subst method, for
3994 single-step rewriting: it now works in bound variable contexts. New is
3995 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3996 rewrite a different subterm than the original subst method, which is
3997 still available as 'simplesubst'.
3999 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4002 * Provers/trancl.ML: new transitivity reasoner for transitive and
4003 reflexive-transitive closure of relations.
4005 * Provers/blast.ML: new reference depth_limit to make blast's depth
4006 limit (previously hard-coded with a value of 20) user-definable.
4008 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4009 is peformed already. Object-logics merely need to finish their
4010 initial simpset configuration as before. INCOMPATIBILITY.
4015 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4018 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4020 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4021 and x-symbol; use option '-m epsilon' to get it actually printed.
4022 Moreover, the mathematically important symbolic identifier \<epsilon>
4023 becomes available as variable, constant etc. INCOMPATIBILITY,
4025 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4026 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4027 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4028 support corresponding Isar calculations.
4030 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4033 * theory SetInterval: changed the syntax for open intervals:
4042 The old syntax is still supported but will disappear in the next
4043 release. For conversion use the following Emacs search and replace
4044 patterns (these are not perfect but work quite well):
4046 {)\([^\.]*\)\.\. -> {\1<\.\.}
4047 \.\.\([^(}]*\)(} -> \.\.<\1}
4049 * Theory Commutative_Ring (in Library): method comm_ring for proving
4050 equalities in commutative rings; method 'algebra' provides a generic
4053 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4054 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4055 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4058 Some new syntax forms are available:
4060 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4061 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4062 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4063 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4065 The latter form "\<Sum>x < k. e" used to be based on a separate
4066 function "Summation", which has been discontinued.
4068 * theory Finite_Set: in structured induction proofs, the insert case
4069 is now 'case (insert x F)' instead of the old counterintuitive 'case
4072 * The 'refute' command has been extended to support a much larger
4073 fragment of HOL, including axiomatic type classes, constdefs and
4074 typedefs, inductive datatypes and recursion.
4076 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4077 Requires zChaff with proof generation to be installed. See
4078 HOL/ex/SAT_Examples.thy for examples.
4080 * Datatype induction via method 'induct' now preserves the name of the
4081 induction variable. For example, when proving P(xs::'a list) by
4082 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4083 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4084 in unstructured proof scripts.
4086 * Reworked implementation of records. Improved scalability for
4087 records with many fields, avoiding performance problems for type
4088 inference. Records are no longer composed of nested field types, but
4089 of nested extension types. Therefore the record type only grows linear
4090 in the number of extensions and not in the number of fields. The
4091 top-level (users) view on records is preserved. Potential
4092 INCOMPATIBILITY only in strange cases, where the theory depends on the
4093 old record representation. The type generated for a record is called
4094 <record_name>_ext_type.
4096 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4097 proofs triggered by a record definition or a simproc (if
4098 quick_and_dirty is enabled). Definitions of large records can take
4101 New simproc record_upd_simproc for simplification of multiple record
4102 updates enabled by default. Moreover, trivial updates are also
4103 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4104 occasionally, since simplification is more powerful by default.
4106 * typedef: proper support for polymorphic sets, which contain extra
4107 type-variables in the term.
4109 * Simplifier: automatically reasons about transitivity chains
4110 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4111 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4112 old proofs break occasionally as simplification may now solve more
4113 goals than previously.
4115 * Simplifier: converts x <= y into x = y if assumption y <= x is
4116 present. Works for all partial orders (class "order"), in particular
4117 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4120 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4121 bound variable or a constant then the let is unfolded. Otherwise
4122 first a is simplified to b, and then f b is simplified to g. If
4123 possible we abstract b from g arriving at "let x = b in h x",
4124 otherwise we unfold the let and arrive at g. The simproc can be
4125 enabled/disabled by the reference use_let_simproc. Potential
4126 INCOMPATIBILITY since simplification is more powerful by default.
4128 * Classical reasoning: the meson method now accepts theorems as arguments.
4130 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4131 jobs to provide advice on the provability of subgoals.
4133 * Theory OrderedGroup and Ring_and_Field: various additions and
4134 improvements to faciliate calculations involving equalities and
4137 The following theorems have been eliminated or modified
4140 abs_eq now named abs_of_nonneg
4141 abs_of_ge_0 now named abs_of_nonneg
4142 abs_minus_eq now named abs_of_nonpos
4143 imp_abs_id now named abs_of_nonneg
4144 imp_abs_neg_id now named abs_of_nonpos
4145 mult_pos now named mult_pos_pos
4146 mult_pos_le now named mult_nonneg_nonneg
4147 mult_pos_neg_le now named mult_nonneg_nonpos
4148 mult_pos_neg2_le now named mult_nonneg_nonpos2
4149 mult_neg now named mult_neg_neg
4150 mult_neg_le now named mult_nonpos_nonpos
4152 * The following lemmas in Ring_and_Field have been added to the simplifier:
4155 not_square_less_zero
4157 The following lemmas have been deleted from Real/RealPow:
4167 * Theory Parity: added rules for simplifying exponents.
4171 The following theorems have been eliminated or modified
4174 list_all_Nil now named list_all.simps(1)
4175 list_all_Cons now named list_all.simps(2)
4176 list_all_conv now named list_all_iff
4177 set_mem_eq now named mem_iff
4179 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4180 asymptotic "big O" calculations. See the notes in BigO.thy.
4185 * Theory RealDef: better support for embedding natural numbers and
4186 integers in the reals.
4188 The following theorems have been eliminated or modified
4191 exp_ge_add_one_self now requires no hypotheses
4192 real_of_int_add reversed direction of equality (use [symmetric])
4193 real_of_int_minus reversed direction of equality (use [symmetric])
4194 real_of_int_diff reversed direction of equality (use [symmetric])
4195 real_of_int_mult reversed direction of equality (use [symmetric])
4197 * Theory RComplete: expanded support for floor and ceiling functions.
4199 * Theory Ln is new, with properties of the natural logarithm
4201 * Hyperreal: There is a new type constructor "star" for making
4202 nonstandard types. The old type names are now type synonyms:
4206 hcomplex = complex star
4208 * Hyperreal: Many groups of similarly-defined constants have been
4209 replaced by polymorphic versions (INCOMPATIBILITY):
4211 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4213 starset <-- starsetNat, starsetC
4214 *s* <-- *sNat*, *sc*
4215 starset_n <-- starsetNat_n, starsetC_n
4216 *sn* <-- *sNatn*, *scn*
4217 InternalSets <-- InternalNatSets, InternalCSets
4219 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4220 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4221 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4222 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4223 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4225 * Hyperreal: Many type-specific theorems have been removed in favor of
4226 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4228 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4229 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4230 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4231 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4232 right_minus <-- hypreal_add_minus
4233 left_minus <-- {hypreal,hcomplex}_add_minus_left
4234 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4235 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4236 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4237 mult_1_right <-- hcomplex_mult_one_right
4238 mult_zero_left <-- hcomplex_mult_zero_left
4239 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4240 right_distrib <-- hypnat_add_mult_distrib2
4241 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4242 right_inverse <-- hypreal_mult_inverse
4243 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4244 order_refl <-- {hypreal,hypnat}_le_refl
4245 order_trans <-- {hypreal,hypnat}_le_trans
4246 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4247 order_less_le <-- {hypreal,hypnat}_less_le
4248 linorder_linear <-- {hypreal,hypnat}_le_linear
4249 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4250 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4251 add_nonneg_nonneg <-- hypreal_le_add_order
4253 * Hyperreal: Separate theorems having to do with type-specific
4254 versions of constants have been merged into theorems that apply to the
4255 new polymorphic constants (INCOMPATIBILITY):
4257 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4258 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4259 STAR_Un <-- {STAR,NatStar,STARC}_Un
4260 STAR_Int <-- {STAR,NatStar,STARC}_Int
4261 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4262 STAR_subset <-- {STAR,NatStar,STARC}_subset
4263 STAR_mem <-- {STAR,NatStar,STARC}_mem
4264 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4265 STAR_diff <-- {STAR,STARC}_diff
4266 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4267 STARC_hcomplex_of_complex}_image_subset
4268 starset_n_Un <-- starset{Nat,C}_n_Un
4269 starset_n_Int <-- starset{Nat,C}_n_Int
4270 starset_n_Compl <-- starset{Nat,C}_n_Compl
4271 starset_n_diff <-- starset{Nat,C}_n_diff
4272 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4273 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4274 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4275 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4276 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4277 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4278 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4279 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4280 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4281 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4282 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4283 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4284 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4285 starfun_diff <-- starfun{C,RC,CR}_diff
4286 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4287 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4288 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4289 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4290 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4291 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4292 starfun_Id <-- starfunC_Id
4293 starfun_approx <-- starfun{Nat,CR}_approx
4294 starfun_capprox <-- starfun{C,RC}_capprox
4295 starfun_abs <-- starfunNat_rabs
4296 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4297 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4298 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4299 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4300 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4301 starfun_add_approx <-- starfunCR_add_approx
4302 starfun_inverse_inverse <-- starfunC_inverse_inverse
4303 starfun_divide <-- starfun{C,CR,RC}_divide
4304 starfun_n <-- starfun{Nat,C}_n
4305 starfun_n_mult <-- starfun{Nat,C}_n_mult
4306 starfun_n_add <-- starfun{Nat,C}_n_add
4307 starfun_n_add_minus <-- starfunNat_n_add_minus
4308 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4309 starfun_n_minus <-- starfun{Nat,C}_n_minus
4310 starfun_n_eq <-- starfun{Nat,C}_n_eq
4312 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4313 star_n_minus <-- {hypreal,hcomplex}_minus
4314 star_n_diff <-- {hypreal,hcomplex}_diff
4315 star_n_mult <-- {hypreal,hcomplex}_mult
4316 star_n_inverse <-- {hypreal,hcomplex}_inverse
4317 star_n_le <-- {hypreal,hypnat}_le
4318 star_n_less <-- {hypreal,hypnat}_less
4319 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4320 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4321 star_n_abs <-- hypreal_hrabs
4322 star_n_divide <-- hcomplex_divide
4324 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4325 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4326 star_of_diff <-- hypreal_of_real_diff
4327 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4328 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4329 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4330 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4331 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4332 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4333 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4334 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4335 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4336 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4337 star_of_number_of <-- {hypreal,hcomplex}_number_of
4338 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4339 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4340 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4341 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4342 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4343 star_of_power <-- hypreal_of_real_power
4344 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4346 * Hyperreal: new method "transfer" that implements the transfer
4347 principle of nonstandard analysis. With a subgoal that mentions
4348 nonstandard types like "'a star", the command "apply transfer"
4349 replaces it with an equivalent one that mentions only standard types.
4350 To be successful, all free variables must have standard types; non-
4351 standard variables must have explicit universal quantifiers.
4353 * Hyperreal: A theory of Taylor series.
4358 * Discontinued special version of 'constdefs' (which used to support
4359 continuous functions) in favor of the general Pure one with full
4362 * New simplification procedure for solving continuity conditions; it
4363 is much faster on terms with many nested lambda abstractions (cubic
4364 instead of exponential time).
4366 * New syntax for domain package: selector names are now optional.
4367 Parentheses should be omitted unless argument is lazy, for example:
4369 domain 'a stream = cons "'a" (lazy "'a stream")
4371 * New command 'fixrec' for defining recursive functions with pattern
4372 matching; defining multiple functions with mutual recursion is also
4373 supported. Patterns may include the constants cpair, spair, up, sinl,
4374 sinr, or any data constructor defined by the domain package. The given
4375 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4376 syntax and examples.
4378 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4379 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4380 but the proof obligation additionally includes an admissibility
4381 requirement. The packages generate instances of class cpo or pcpo,
4382 with continuity and strictness theorems for Rep and Abs.
4384 * HOLCF: Many theorems have been renamed according to a more standard naming
4385 scheme (INCOMPATIBILITY):
4387 foo_inject: "foo$x = foo$y ==> x = y"
4388 foo_eq: "(foo$x = foo$y) = (x = y)"
4389 foo_less: "(foo$x << foo$y) = (x << y)"
4390 foo_strict: "foo$UU = UU"
4391 foo_defined: "... ==> foo$x ~= UU"
4392 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4397 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4398 including the First Isomorphism Theorem (on quotienting by the kernel
4401 * ZF/Simplifier: install second copy of type solver that actually
4402 makes use of TC rules declared to Isar proof contexts (or locales);
4403 the old version is still required for ML proof scripts.
4408 * Converted to Isar theory format; use locales instead of axiomatic
4414 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4417 * Pure/library.ML no longer defines its own option datatype, but uses
4418 that of the SML basis, which has constructors NONE and SOME instead of
4419 None and Some, as well as exception Option.Option instead of OPTION.
4420 The functions the, if_none, is_some, is_none have been adapted
4421 accordingly, while Option.map replaces apsome.
4423 * Pure/library.ML: the exception LIST has been given up in favour of
4424 the standard exceptions Empty and Subscript, as well as
4425 Library.UnequalLengths. Function like Library.hd and Library.tl are
4426 superceded by the standard hd and tl functions etc.
4428 A number of basic list functions are no longer exported to the ML
4429 toplevel, as they are variants of predefined functions. The following
4430 suggests how one can translate existing code:
4432 rev_append xs ys = List.revAppend (xs, ys)
4433 nth_elem (i, xs) = List.nth (xs, i)
4434 last_elem xs = List.last xs
4435 flat xss = List.concat xss
4436 seq fs = List.app fs
4437 partition P xs = List.partition P xs
4438 mapfilter f xs = List.mapPartial f xs
4440 * Pure/library.ML: several combinators for linear functional
4441 transformations, notably reverse application and composition:
4444 (x, y) |-> f f #-> g
4446 * Pure/library.ML: introduced/changed precedence of infix operators:
4448 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4450 infix 3 o oo ooo oooo;
4451 infix 4 ~~ upto downto;
4453 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4456 * Pure/library.ML: natural list combinators fold, fold_rev, and
4457 fold_map support linear functional transformations and nesting. For
4460 fold f [x1, ..., xN] y =
4461 y |> f x1 |> ... |> f xN
4463 (fold o fold) f [xs1, ..., xsN] y =
4464 y |> fold f xs1 |> ... |> fold f xsN
4466 fold f [x1, ..., xN] =
4469 (fold o fold) f [xs1, ..., xsN] =
4470 fold f xs1 #> ... #> fold f xsN
4472 * Pure/library.ML: the following selectors on type 'a option are
4475 the: 'a option -> 'a (*partial*)
4476 these: 'a option -> 'a where 'a = 'b list
4477 the_default: 'a -> 'a option -> 'a
4478 the_list: 'a option -> 'a list
4480 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4481 basic operations for association lists, following natural argument
4482 order; moreover the explicit equality predicate passed here avoids
4483 potentially expensive polymorphic runtime equality checks.
4484 The old functions may be expressed as follows:
4486 assoc = uncurry (AList.lookup (op =))
4487 assocs = these oo AList.lookup (op =)
4488 overwrite = uncurry (AList.update (op =)) o swap
4490 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4492 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4493 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4495 replacing make_keylist and keyfilter (occassionally used)
4498 make_keylist = AList.make
4499 keyfilter = AList.find (op =)
4501 * eq_fst and eq_snd now take explicit equality parameter, thus
4502 avoiding eqtypes. Naive rewrites:
4504 eq_fst = eq_fst (op =)
4505 eq_snd = eq_snd (op =)
4507 * Removed deprecated apl and apr (rarely used).
4510 apl (n, op) =>>= curry op n
4511 apr (op, m) =>>= fn n => op (n, m)
4513 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4514 provides a reasonably efficient light-weight implementation of sets as
4517 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4518 few new operations; existing lookup and update are now curried to
4519 follow natural argument order (for use with fold etc.);
4520 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4522 * Pure/General: output via the Isabelle channels of
4523 writeln/warning/error etc. is now passed through Output.output, with a
4524 hook for arbitrary transformations depending on the print_mode
4525 (cf. Output.add_mode -- the first active mode that provides a output
4526 function wins). Already formatted output may be embedded into further
4527 text via Output.raw; the result of Pretty.string_of/str_of and derived
4528 functions (string_of_term/cterm/thm etc.) is already marked raw to
4529 accommodate easy composition of diagnostic messages etc. Programmers
4530 rarely need to care about Output.output or Output.raw at all, with
4531 some notable exceptions: Output.output is required when bypassing the
4532 standard channels (writeln etc.), or in token translations to produce
4533 properly formatted results; Output.raw is required when capturing
4534 already output material that will eventually be presented to the user
4535 a second time. For the default print mode, both Output.output and
4536 Output.raw have no effect.
4538 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4539 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4540 cumulative results are displayed at the end of a batch session.
4542 * Pure/General: File.sysify_path and File.quote_sysify path have been
4543 replaced by File.platform_path and File.shell_path (with appropriate
4544 hooks). This provides a clean interface for unusual systems where the
4545 internal and external process view of file names are different.
4547 * Pure: more efficient orders for basic syntactic entities: added
4548 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4549 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4550 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4551 orders now -- potential INCOMPATIBILITY for code that depends on a
4552 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4553 Library.sort_strings on result).
4555 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4556 fold_types traverse types/terms from left to right, observing natural
4557 argument order. Supercedes previous foldl_XXX versions, add_frees,
4558 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4560 * Pure: name spaces have been refined, with significant changes of the
4561 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4562 to extern(_table). The plain name entry path is superceded by a
4563 general 'naming' context, which also includes the 'policy' to produce
4564 a fully qualified name and external accesses of a fully qualified
4565 name; NameSpace.extend is superceded by context dependent
4566 Sign.declare_name. Several theory and proof context operations modify
4567 the naming context. Especially note Theory.restore_naming and
4568 ProofContext.restore_naming to get back to a sane state; note that
4569 Theory.add_path is no longer sufficient to recover from
4570 Theory.absolute_path in particular.
4572 * Pure: new flags short_names (default false) and unique_names
4573 (default true) for controlling output of qualified names. If
4574 short_names is set, names are printed unqualified. If unique_names is
4575 reset, the name prefix is reduced to the minimum required to achieve
4576 the original result when interning again, even if there is an overlap
4577 with earlier declarations.
4579 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4580 now 'extend', and 'merge' gets an additional Pretty.pp argument
4581 (useful for printing error messages). INCOMPATIBILITY.
4583 * Pure: major reorganization of the theory context. Type Sign.sg and
4584 Theory.theory are now identified, referring to the universal
4585 Context.theory (see Pure/context.ML). Actual signature and theory
4586 content is managed as theory data. The old code and interfaces were
4587 spread over many files and structures; the new arrangement introduces
4588 considerable INCOMPATIBILITY to gain more clarity:
4590 Context -- theory management operations (name, identity, inclusion,
4591 parents, ancestors, merge, etc.), plus generic theory data;
4593 Sign -- logical signature and syntax operations (declaring consts,
4594 types, etc.), plus certify/read for common entities;
4596 Theory -- logical theory operations (stating axioms, definitions,
4597 oracles), plus a copy of logical signature operations (consts,
4598 types, etc.); also a few basic management operations (Theory.copy,
4601 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4602 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4603 for convenience -- they merely return the theory.
4605 * Pure: type Type.tsig is superceded by theory in most interfaces.
4607 * Pure: the Isar proof context type is already defined early in Pure
4608 as Context.proof (note that ProofContext.context and Proof.context are
4609 aliases, where the latter is the preferred name). This enables other
4610 Isabelle components to refer to that type even before Isar is present.
4612 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4613 typeK, constK, axiomK, oracleK), but provide explicit operations for
4614 any of these kinds. For example, Sign.intern typeK is now
4615 Sign.intern_type, Theory.hide_space Sign.typeK is now
4616 Theory.hide_types. Also note that former
4617 Theory.hide_classes/types/consts are now
4618 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4619 internalize their arguments! INCOMPATIBILITY.
4621 * Pure: get_thm interface (of PureThy and ProofContext) expects
4622 datatype thmref (with constructors Name and NameSelection) instead of
4623 plain string -- INCOMPATIBILITY;
4625 * Pure: cases produced by proof methods specify options, where NONE
4626 means to remove case bindings -- INCOMPATIBILITY in
4629 * Pure: the following operations retrieve axioms or theorems from a
4630 theory node or theory hierarchy, respectively:
4632 Theory.axioms_of: theory -> (string * term) list
4633 Theory.all_axioms_of: theory -> (string * term) list
4634 PureThy.thms_of: theory -> (string * thm) list
4635 PureThy.all_thms_of: theory -> (string * thm) list
4637 * Pure: print_tac now outputs the goal through the trace channel.
4639 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4640 Reference Toplevel.debug (default false) controls detailed printing
4641 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4642 controls execution profiling -- set to 1 for time and 2 for space
4643 (both increase the runtime).
4645 * Isar session: The initial use of ROOT.ML is now always timed,
4646 i.e. the log will show the actual process times, in contrast to the
4647 elapsed wall-clock time that the outer shell wrapper produces.
4649 * Simplifier: improved handling of bound variables (nameless
4650 representation, avoid allocating new strings). Simprocs that invoke
4651 the Simplifier recursively should use Simplifier.inherit_bounds to
4652 avoid local name clashes. Failure to do so produces warnings
4653 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4654 for further details.
4656 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4657 bindings for all theorems stored within a given theory; this may help
4658 in porting non-Isar theories to Isar ones, while keeping ML proof
4659 scripts for the time being.
4661 * ML operator HTML.with_charset specifies the charset begin used for
4662 generated HTML files. For example:
4664 HTML.with_charset "utf-8" use_thy "Hebrew";
4665 HTML.with_charset "utf-8" use_thy "Chinese";
4670 * Allow symlinks to all proper Isabelle executables (Isabelle,
4671 isabelle, isatool etc.).
4673 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4674 isatool doc, isatool mkdir, display_drafts etc.).
4676 * isatool usedir: option -f allows specification of the ML file to be
4677 used by Isabelle; default is ROOT.ML.
4679 * New isatool version outputs the version identifier of the Isabelle
4680 distribution being used.
4682 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4683 (containing Boolean satisfiability problems) into Isabelle/HOL
4688 New in Isabelle2004 (April 2004)
4689 --------------------------------
4693 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4694 Replaces linorder.ML.
4696 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4697 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4698 (\<a>...\<z>), are now considered normal letters, and can therefore
4699 be used anywhere where an ASCII letter (a...zA...Z) has until
4700 now. COMPATIBILITY: This obviously changes the parsing of some
4701 terms, especially where a symbol has been used as a binder, say
4702 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4703 as an identifier. Fix it by inserting a space around former
4704 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4705 existing theory and ML files.
4707 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4709 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4710 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4711 a normal (but invisible) letter. For multiple letter subscripts repeat
4712 \<^isub> like this: x\<^isub>1\<^isub>2.
4714 * Pure: There are now sub-/superscripts that can span more than one
4715 character. Text between \<^bsub> and \<^esub> is set in subscript in
4716 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4717 superscript. The new control characters are not identifier parts.
4719 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4720 content of "..." to the latex file instead of \isacntrl... . The "..."
4721 may consist of any printable characters excluding the end bracket >.
4723 * Pure: Using new Isar command "finalconsts" (or the ML functions
4724 Theory.add_finals or Theory.add_finals_i) it is now possible to
4725 declare constants "final", which prevents their being given a definition
4726 later. It is useful for constants whose behaviour is fixed axiomatically
4727 rather than definitionally, such as the meta-logic connectives.
4729 * Pure: 'instance' now handles general arities with general sorts
4730 (i.e. intersections of classes),
4732 * Presentation: generated HTML now uses a CSS style sheet to make layout
4733 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4734 It can be changed to alter the colors/layout of generated pages.
4739 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4740 cut_tac, subgoal_tac and thin_tac:
4741 - Now understand static (Isar) contexts. As a consequence, users of Isar
4742 locales are no longer forced to write Isar proof scripts.
4743 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4745 - INCOMPATIBILITY: names of variables to be instantiated may no
4746 longer be enclosed in quotes. Instead, precede variable name with `?'.
4747 This is consistent with the instantiation attribute "where".
4749 * Attributes "where" and "of":
4750 - Now take type variables of instantiated theorem into account when reading
4751 the instantiation string. This fixes a bug that caused instantiated
4752 theorems to have too special types in some circumstances.
4753 - "where" permits explicit instantiations of type variables.
4755 * Calculation commands "moreover" and "also" no longer interfere with
4756 current facts ("this"), admitting arbitrary combinations with "then"
4760 - Goal statements involving the context element "includes" no longer
4761 generate theorems with internal delta predicates (those ending on
4762 "_axioms") in the premise.
4763 Resolve particular premise with <locale>.intro to obtain old form.
4764 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4765 specification and "includes" elements in goal statement.
4766 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4767 [intro?] and [elim?] (respectively) by default.
4768 - Experimental command for instantiation of locales in proof contexts:
4769 instantiate <label>[<attrs>]: <loc>
4770 Instantiates locale <loc> and adds all its theorems to the current context
4771 taking into account their attributes. Label and attrs are optional
4772 modifiers, like in theorem declarations. If present, names of
4773 instantiated theorems are qualified with <label>, and the attributes
4774 <attrs> are applied after any attributes these theorems might have already.
4775 If the locale has assumptions, a chained fact of the form
4776 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4777 are derived. The command does not support old-style locales declared
4778 with "locale (open)".
4779 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4781 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4787 * Proof import: new image HOL4 contains the imported library from
4788 the HOL4 system with about 2500 theorems. It is imported by
4789 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4790 can be used like any other Isabelle image. See
4791 HOL/Import/HOL/README for more information.
4794 - Much improved handling of linear and partial orders.
4795 Reasoners for linear and partial orders are set up for type classes
4796 "linorder" and "order" respectively, and are added to the default simpset
4797 as solvers. This means that the simplifier can build transitivity chains
4798 to solve goals from the assumptions.
4799 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4800 of blast or auto after simplification become unnecessary because the goal
4801 is solved by simplification already.
4803 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4804 all proved in axiomatic type classes for semirings, rings and fields.
4807 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4808 now formalized using the Ring_and_Field theory mentioned above.
4809 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4810 than before, because now they are set up once in a generic manner.
4811 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4812 Look for the general versions in Ring_and_Field (and Power if they concern
4815 * Type "rat" of the rational numbers is now available in HOL-Complex.
4818 - Record types are now by default printed with their type abbreviation
4819 instead of the list of all field types. This can be configured via
4820 the reference "print_record_type_abbr".
4821 - Simproc "record_upd_simproc" for simplification of multiple updates added
4822 (not enabled by default).
4823 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4824 EX x. x = sel r to True (not enabled by default).
4825 - Tactic "record_split_simp_tac" to split and simplify records added.
4827 * 'specification' command added, allowing for definition by
4828 specification. There is also an 'ax_specification' command that
4829 introduces the new constants axiomatically.
4831 * arith(_tac) is now able to generate counterexamples for reals as well.
4833 * HOL-Algebra: new locale "ring" for non-commutative rings.
4835 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4836 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4838 * HOL-Matrix: a first theory for matrices in HOL with an application of
4839 matrix theory to linear programming.
4841 * Unions and Intersections:
4842 The latex output syntax of UN and INT has been changed
4843 from "\Union x \in A. B" to "\Union_{x \in A} B"
4844 i.e. the index formulae has become a subscript.
4845 Similarly for "\Union x. B", and for \Inter instead of \Union.
4847 * Unions and Intersections over Intervals:
4848 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4849 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4850 like in normal math, and corresponding versions for < and for intersection.
4852 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4853 lexicographic dictonary ordering has been added as "lexord".
4855 * ML: the legacy theory structures Int and List have been removed. They had
4856 conflicted with ML Basis Library structures having the same names.
4858 * 'refute' command added to search for (finite) countermodels. Only works
4859 for a fragment of HOL. The installation of an external SAT solver is
4860 highly recommended. See "HOL/Refute.thy" for details.
4862 * 'quickcheck' command: Allows to find counterexamples by evaluating
4863 formulae under an assignment of free variables to random values.
4864 In contrast to 'refute', it can deal with inductive datatypes,
4865 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4871 * Streams now come with concatenation and are part of the HOLCF image
4875 New in Isabelle2003 (May 2003)
4876 ------------------------------
4880 * Provers/simplifier:
4882 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4883 Assumptions are now subject to complete mutual simplification,
4884 not just from left to right. The simplifier now preserves
4885 the order of assumptions.
4887 Potential INCOMPATIBILITY:
4889 -- simp sometimes diverges where the old version did
4890 not, e.g. invoking simp on the goal
4892 [| P (f x); y = x; f x = f y |] ==> Q
4894 now gives rise to the infinite reduction sequence
4896 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4898 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4901 -- Tactics combining classical reasoner and simplification (such as auto)
4902 are also affected by this change, because many of them rely on
4903 simp. They may sometimes diverge as well or yield a different numbers
4904 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4905 in case of problems. Sometimes subsequent calls to the classical
4906 reasoner will fail because a preceeding call to the simplifier too
4907 eagerly simplified the goal, e.g. deleted redundant premises.
4909 - The simplifier trace now shows the names of the applied rewrite rules
4911 - You can limit the number of recursive invocations of the simplifier
4912 during conditional rewriting (where the simplifie tries to solve the
4913 conditions before applying the rewrite rule):
4914 ML "simp_depth_limit := n"
4915 where n is an integer. Thus you can force termination where previously
4916 the simplifier would diverge.
4918 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4920 - No longer aborts on failed congruence proof. Instead, the
4921 congruence is ignored.
4923 * Pure: New generic framework for extracting programs from constructive
4924 proofs. See HOL/Extraction.thy for an example instantiation, as well
4925 as HOL/Extraction for some case studies.
4927 * Pure: The main goal of the proof state is no longer shown by default, only
4928 the subgoals. This behaviour is controlled by a new flag.
4929 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4930 (ML: Proof.show_main_goal).
4932 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4933 rules whose conclusion matches subgoal 1:
4934 PG menu: Isabelle/Isar -> Show me -> matching rules
4935 The rules are ordered by how closely they match the subgoal.
4936 In particular, rules that solve a subgoal outright are displayed first
4937 (or rather last, the way they are printed).
4938 (ML: ProofGeneral.print_intros())
4940 * Pure: New flag trace_unify_fail causes unification to print
4941 diagnostic information (PG: in trace buffer) when it fails. This is
4942 useful for figuring out why single step proofs like rule, erule or
4945 * Pure: Locale specifications now produce predicate definitions
4946 according to the body of text (covering assumptions modulo local
4947 definitions); predicate "loc_axioms" covers newly introduced text,
4948 while "loc" is cumulative wrt. all included locale expressions; the
4949 latter view is presented only on export into the global theory
4950 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4951 on the old view without predicates;
4953 * Pure: predefined locales "var" and "struct" are useful for sharing
4954 parameters (as in CASL, for example); just specify something like
4955 ``var x + var y + struct M'' as import;
4957 * Pure: improved thms_containing: proper indexing of facts instead of
4958 raw theorems; check validity of results wrt. current name space;
4959 include local facts of proof configuration (also covers active
4960 locales), cover fixed variables in index; may use "_" in term
4961 specification; an optional limit for the number of printed facts may
4962 be given (the default is 40);
4964 * Pure: disallow duplicate fact bindings within new-style theory files
4967 * Provers: improved induct method: assumptions introduced by case
4968 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4969 the goal statement); "foo" still refers to all facts collectively;
4971 * Provers: the function blast.overloaded has been removed: all constants
4972 are regarded as potentially overloaded, which improves robustness in exchange
4973 for slight decrease in efficiency;
4975 * Provers/linorder: New generic prover for transitivity reasoning over
4976 linear orders. Note: this prover is not efficient!
4978 * Isar: preview of problems to finish 'show' now produce an error
4979 rather than just a warning (in interactive mode);
4986 - Produces a counter example if it cannot prove a goal.
4987 Note that the counter example may be spurious if the goal is not a formula
4988 of quantifier-free linear arithmetic.
4989 In ProofGeneral the counter example appears in the trace buffer.
4991 - Knows about div k and mod k where k is a numeral of type nat or int.
4993 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4994 linear arithmetic fails. This takes account of quantifiers and divisibility.
4995 Presburger arithmetic can also be called explicitly via presburger(_tac).
4997 * simp's arithmetic capabilities have been enhanced a bit: it now
4998 takes ~= in premises into account (by performing a case split);
5000 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5001 are distributed over a sum of terms;
5003 * New tactic "trans_tac" and method "trans" instantiate
5004 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5007 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5008 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5010 * 'typedef' command has new option "open" to suppress the set
5013 * functions Min and Max on finite sets have been introduced (theory
5016 * attribute [symmetric] now works for relations as well; it turns
5017 (x,y) : R^-1 into (y,x) : R, and vice versa;
5019 * induct over a !!-quantified statement (say !!x1..xn):
5020 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5022 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5023 %x. None. Warning: empty_def now refers to the previously hidden definition
5026 * Algebra: formalization of classical algebra. Intended as base for
5027 any algebraic development in Isabelle. Currently covers group theory
5028 (up to Sylow's theorem) and ring theory (Universal Property of
5029 Univariate Polynomials). Contributions welcome;
5031 * GroupTheory: deleted, since its material has been moved to Algebra;
5033 * Complex: new directory of the complex numbers with numeric constants,
5034 nonstandard complex numbers, and some complex analysis, standard and
5035 nonstandard (Jacques Fleuriot);
5037 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5039 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5042 * Real/HahnBanach: updated and adapted to locales;
5044 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5047 * UNITY: added the Meier-Sanders theory of progress sets;
5049 * MicroJava: bytecode verifier and lightweight bytecode verifier
5050 as abstract algorithms, instantiated to the JVM;
5052 * Bali: Java source language formalization. Type system, operational
5053 semantics, axiomatic semantics. Supported language features:
5054 classes, interfaces, objects,virtual methods, static methods,
5055 static/instance fields, arrays, access modifiers, definite
5056 assignment, exceptions.
5061 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5064 * Main ZF: virtually all theories converted to new-style format;
5069 * Pure: Tactic.prove provides sane interface for internal proofs;
5070 omits the infamous "standard" operation, so this is more appropriate
5071 than prove_goalw_cterm in many situations (e.g. in simprocs);
5073 * Pure: improved error reporting of simprocs;
5075 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5079 *** Document preparation ***
5081 * uses \par instead of \\ for line breaks in theory text. This may
5082 shift some page breaks in large documents. To get the old behaviour
5083 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5085 * minimized dependencies of isabelle.sty and isabellesym.sty on
5088 * \<euro> now needs package babel/greek instead of marvosym (which
5091 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5096 New in Isabelle2002 (March 2002)
5097 --------------------------------
5099 *** Document preparation ***
5101 * greatly simplified document preparation setup, including more
5102 graceful interpretation of isatool usedir -i/-d/-D options, and more
5103 instructive isatool mkdir; users should basically be able to get
5104 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5105 users may run a separate document processing stage manually like this:
5106 "isatool usedir -D output HOL Test && isatool document Test/output";
5108 * theory dependency graph may now be incorporated into documents;
5109 isatool usedir -g true will produce session_graph.eps/.pdf for use
5110 with \includegraphics of LaTeX;
5112 * proper spacing of consecutive markup elements, especially text
5113 blocks after section headings;
5115 * support bold style (for single symbols only), input syntax is like
5116 this: "\<^bold>\<alpha>" or "\<^bold>A";
5118 * \<bullet> is now output as bold \cdot by default, which looks much
5119 better in printed text;
5121 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5122 note that these symbols are currently unavailable in Proof General /
5123 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5125 * isatool latex no longer depends on changed TEXINPUTS, instead
5126 isatool document copies the Isabelle style files to the target
5132 * Pure/Provers: improved proof by cases and induction;
5133 - 'case' command admits impromptu naming of parameters (such as
5135 - 'induct' method divinates rule instantiation from the inductive
5136 claim; no longer requires excessive ?P bindings for proper
5137 instantiation of cases;
5138 - 'induct' method properly enumerates all possibilities of set/type
5139 rules; as a consequence facts may be also passed through *type*
5140 rules without further ado;
5141 - 'induct' method now derives symbolic cases from the *rulified*
5142 rule (before it used to rulify cases stemming from the internal
5143 atomized version); this means that the context of a non-atomic
5144 statement becomes is included in the hypothesis, avoiding the
5145 slightly cumbersome show "PROP ?case" form;
5146 - 'induct' may now use elim-style induction rules without chaining
5147 facts, using ``missing'' premises from the goal state; this allows
5148 rules stemming from inductive sets to be applied in unstructured
5149 scripts, while still benefitting from proper handling of non-atomic
5150 statements; NB: major inductive premises need to be put first, all
5151 the rest of the goal is passed through the induction;
5152 - 'induct' proper support for mutual induction involving non-atomic
5153 rule statements (uses the new concept of simultaneous goals, see
5155 - append all possible rule selections, but only use the first
5156 success (no backtracking);
5157 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5158 - undeclared rule case names default to numbers 1, 2, 3, ...;
5159 - added 'print_induct_rules' (covered by help item in recent Proof
5161 - moved induct/cases attributes to Pure, methods to Provers;
5162 - generic method setup instantiated for FOL and HOL;
5164 * Pure: support multiple simultaneous goal statements, for example
5165 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5166 meta-level mechanism, this acts as if several individual goals had
5167 been stated separately; in particular common proof methods need to be
5168 repeated in order to cover all claims; note that a single elimination
5169 step is *not* sufficient to establish the two conjunctions, so this
5172 assume "A & B" then have A and B .. (*".." fails*)
5174 better use "obtain" in situations as above; alternative refer to
5175 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5177 * Pure: proper integration with ``locales''; unlike the original
5178 version by Florian Kammller, Isar locales package high-level proof
5179 contexts rather than raw logical ones (e.g. we admit to include
5180 attributes everywhere); operations on locales include merge and
5181 rename; support for implicit arguments (``structures''); simultaneous
5182 type-inference over imports and text; see also HOL/ex/Locales.thy for
5185 * Pure: the following commands have been ``localized'', supporting a
5186 target locale specification "(in name)": 'lemma', 'theorem',
5187 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5188 stored both within the locale and at the theory level (exported and
5189 qualified by the locale name);
5191 * Pure: theory goals may now be specified in ``long'' form, with
5192 ad-hoc contexts consisting of arbitrary locale elements. for example
5193 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5194 definitions may be given, too); the result is a meta-level rule with
5195 the context elements being discharged in the obvious way;
5197 * Pure: new proof command 'using' allows to augment currently used
5198 facts after a goal statement ('using' is syntactically analogous to
5199 'apply', but acts on the goal's facts only); this allows chained facts
5200 to be separated into parts given before and after a claim, as in
5201 ``from a and b have C using d and e <proof>'';
5203 * Pure: renamed "antecedent" case to "rule_context";
5205 * Pure: new 'judgment' command records explicit information about the
5206 object-logic embedding (used by several tools internally); no longer
5207 use hard-wired "Trueprop";
5209 * Pure: added 'corollary' command;
5211 * Pure: fixed 'token_translation' command;
5213 * Pure: removed obsolete 'exported' attribute;
5215 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5216 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5217 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5219 * Pure: method 'atomize' presents local goal premises as object-level
5220 statements (atomic meta-level propositions); setup controlled via
5221 rewrite rules declarations of 'atomize' attribute; example
5222 application: 'induct' method with proper rule statements in improper
5225 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5226 now consider the syntactic context of assumptions, giving a better
5227 chance to get type-inference of the arguments right (this is
5228 especially important for locales);
5230 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5233 * Pure/obtain: the formal conclusion "thesis", being marked as
5234 ``internal'', may no longer be reference directly in the text;
5235 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5238 * Pure: generic 'sym' attribute which declares a rule both as pure
5239 'elim?' and for the 'symmetric' operation;
5241 * Pure: marginal comments ``--'' may now occur just anywhere in the
5242 text; the fixed correlation with particular command syntax has been
5245 * Pure: new method 'rules' is particularly well-suited for proof
5246 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5247 but often produces more compact proof terms with less detours;
5249 * Pure/Provers/classical: simplified integration with pure rule
5250 attributes and methods; the classical "intro?/elim?/dest?"
5251 declarations coincide with the pure ones; the "rule" method no longer
5252 includes classically swapped intros; "intro" and "elim" methods no
5253 longer pick rules from the context; also got rid of ML declarations
5254 AddXIs/AddXEs/AddXDs; all of this has some potential for
5257 * Provers/classical: attribute 'swapped' produces classical inversions
5258 of introduction rules;
5260 * Provers/simplifier: 'simplified' attribute may refer to explicit
5261 rules instead of full simplifier context; 'iff' attribute handles
5264 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5266 * HOL: 'recdef' now fails on unfinished automated proofs, use
5267 "(permissive)" option to recover old behavior;
5269 * HOL: 'inductive' no longer features separate (collective) attributes
5270 for 'intros' (was found too confusing);
5272 * HOL: properly declared induction rules less_induct and
5278 * HOL: moved over to sane numeral syntax; the new policy is as
5281 - 0 and 1 are polymorphic constants, which are defined on any
5282 numeric type (nat, int, real etc.);
5284 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5285 binary representation internally;
5287 - type nat has special constructor Suc, and generally prefers Suc 0
5288 over 1::nat and Suc (Suc 0) over 2::nat;
5290 This change may cause significant problems of INCOMPATIBILITY; here
5291 are some hints on converting existing sources:
5293 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5294 entities, so expressions involving "-" (unary or binary minus) need
5295 to be spaced properly;
5297 - existing occurrences of "1" may need to be constraint "1::nat" or
5298 even replaced by Suc 0; similar for old "2";
5300 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5302 - remove all special provisions on numerals in proofs;
5304 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5305 representation (depends on bin_arith_simps in the default context);
5307 * HOL: symbolic syntax for x^2 (numeral 2);
5309 * HOL: the class of all HOL types is now called "type" rather than
5310 "term"; INCOMPATIBILITY, need to adapt references to this type class
5311 in axclass/classes, instance/arities, and (usually rare) occurrences
5312 in typings (of consts etc.); internally the class is called
5313 "HOL.type", ML programs should refer to HOLogic.typeS;
5315 * HOL/record package improvements:
5316 - new derived operations "fields" to build a partial record section,
5317 "extend" to promote a fixed record to a record scheme, and
5318 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5319 declared as simp by default;
5320 - shared operations ("more", "fields", etc.) now need to be always
5321 qualified) --- potential INCOMPATIBILITY;
5322 - removed "make_scheme" operations (use "make" with "extend") --
5324 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5325 - provides cases/induct rules for use with corresponding Isar
5326 methods (for concrete records, record schemes, concrete more
5327 parts, and schematic more parts -- in that order);
5328 - internal definitions directly based on a light-weight abstract
5329 theory of product types over typedef rather than datatype;
5331 * HOL: generic code generator for generating executable ML code from
5332 specifications; specific support for HOL constructs such as inductive
5333 datatypes and sets, as well as recursive functions; can be invoked
5334 via 'generate_code' theory section;
5336 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5338 * HOL: consolidated and renamed several theories. In particular:
5339 Ord.thy has been absorbed into HOL.thy
5340 String.thy has been absorbed into List.thy
5342 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5343 (beware of argument permutation!);
5345 * HOL: linorder_less_split superseded by linorder_cases;
5347 * HOL/List: "nodups" renamed to "distinct";
5349 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5350 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5351 - Ex_def has changed, now need to use some_eq_ex
5353 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5354 in this (rare) case use:
5356 delSWrapper "split_all_tac"
5357 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5359 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5362 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5363 Isabelle's type classes, ^ on functions and relations has too general
5364 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5365 necessary to attach explicit type constraints;
5367 * HOL/Relation: the prefix name of the infix "O" has been changed from
5368 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5369 renamed accordingly (eg "compI" -> "rel_compI").
5371 * HOL: syntax translations now work properly with numerals and records
5374 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5375 of "lam" -- INCOMPATIBILITY;
5377 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5378 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5379 renamed "Product_Type.unit";
5381 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5383 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5384 the "cases" method);
5386 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5389 * HOL/IMP: updated and converted to new-style theory format; several
5390 parts turned into readable document, with proper Isar proof texts and
5391 some explanations (by Gerwin Klein);
5393 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5395 * HOL-Hyperreal is now a logic image;
5400 * Isar: consts/constdefs supports mixfix syntax for continuous
5403 * Isar: domain package adapted to new-style theory format, e.g. see
5406 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5407 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5408 lift.induct_tac, always use UU instead of Undef;
5410 * HOLCF/IMP: updated and converted to new-style theory;
5415 * Isar: proper integration of logic-specific tools and packages,
5416 including theory commands '(co)inductive', '(co)datatype',
5417 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5418 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5420 * theory Main no longer includes AC; for the Axiom of Choice, base
5421 your theory on Main_ZFC;
5423 * the integer library now covers quotients and remainders, with many
5424 laws relating division to addition, multiplication, etc.;
5426 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5427 typeless version of the formalism;
5429 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5432 * ZF/Induct: new directory for examples of inductive definitions,
5433 including theory Multiset for multiset orderings; converted to
5434 new-style theory format;
5436 * ZF: many new theorems about lists, ordinals, etc.;
5441 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5442 variable proof controls level of detail: 0 = no proofs (only oracle
5443 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5444 also ref manual for further ML interfaces;
5446 * Pure/axclass: removed obsolete ML interface
5447 goal_subclass/goal_arity;
5449 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5450 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5451 separate tokens, so expressions involving minus need to be spaced
5454 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5455 rather than "infixl" or "infixr";
5457 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5458 sort constraint specifications in type inference; e.g. "x::_::foo"
5459 ensures that the type of "x" is of sort "foo" (but not necessarily a
5462 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5463 control output of nested => (types); the default behavior is
5466 * Pure/syntax: builtin parse translation for "_constify" turns valued
5467 tokens into AST constants;
5469 * Pure/syntax: prefer later declarations of translations and print
5470 translation functions; potential INCOMPATIBILITY: need to reverse
5471 multiple declarations for same syntax element constant;
5473 * Pure/show_hyps reset by default (in accordance to existing Isar
5476 * Provers/classical: renamed addaltern to addafter, addSaltern to
5479 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5482 * system: tested support for MacOS X; should be able to get Isabelle +
5483 Proof General to work in a plain Terminal after installing Poly/ML
5484 (e.g. from the Isabelle distribution area) and GNU bash alone
5485 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5486 support requires further installations, e.g. from
5487 http://fink.sourceforge.net/);
5489 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5491 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5492 of 40 MB), cf. ML_OPTIONS;
5494 * system: Proof General keywords specification is now part of the
5495 Isabelle distribution (see etc/isar-keywords.el);
5497 * system: support for persistent Proof General sessions (refrain from
5498 outdating all loaded theories on startup); user may create writable
5499 logic images like this: ``isabelle -q HOL Test'';
5501 * system: smart selection of Isabelle process versus Isabelle
5502 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5503 run both "isabelle" and "Isabelle" even if file names are badly
5504 damaged (executable inspects the case of the first letter of its own
5505 name); added separate "isabelle-process" and "isabelle-interface";
5507 * system: refrain from any attempt at filtering input streams; no
5508 longer support ``8bit'' encoding of old isabelle font, instead proper
5509 iso-latin characters may now be used; the related isatools
5510 "symbolinput" and "nonascii" have disappeared as well;
5512 * system: removed old "xterm" interface (the print modes "xterm" and
5513 "xterm_color" are still available for direct use in a suitable
5518 New in Isabelle99-2 (February 2001)
5519 -----------------------------------
5521 *** Overview of INCOMPATIBILITIES ***
5523 * HOL: please note that theories in the Library and elsewhere often use the
5524 new-style (Isar) format; to refer to their theorems in an ML script you must
5525 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5527 * HOL: inductive package no longer splits induction rule aggressively,
5528 but only as far as specified by the introductions given; the old
5529 format may be recovered via ML function complete_split_rule or attribute
5530 'split_rule (complete)';
5532 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5533 gfp_Tarski to gfp_unfold;
5535 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5537 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5538 relation); infix "^^" has been renamed "``"; infix "``" has been
5539 renamed "`"; "univalent" has been renamed "single_valued";
5541 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5544 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5546 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5548 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5549 consequence, it is no longer monotonic wrt. the local goal context
5550 (which is now passed through the inductive cases);
5552 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5553 \<gg> to \<ggreater>;
5556 *** Document preparation ***
5558 * \isabellestyle{NAME} selects version of Isabelle output (currently
5559 available: are "it" for near math-mode best-style output, "sl" for
5560 slanted text style, and "tt" for plain type-writer; if no
5561 \isabellestyle command is given, output is according to slanted
5564 * support sub/super scripts (for single symbols only), input syntax is
5565 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5567 * some more standard symbols; see Appendix A of the system manual for
5568 the complete list of symbols defined in isabellesym.sty;
5570 * improved isabelle style files; more abstract symbol implementation
5571 (should now use \isamath{...} and \isatext{...} in custom symbol
5574 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5575 state; Note that presentation of goal states does not conform to
5576 actual human-readable proof documents. Please do not include goal
5577 states into document output unless you really know what you are doing!
5579 * proper indentation of antiquoted output with proportional LaTeX
5582 * no_document ML operator temporarily disables LaTeX document
5585 * isatool unsymbolize tunes sources for plain ASCII communication;
5590 * Pure: Isar now suffers initial goal statements to contain unbound
5591 schematic variables (this does not conform to actual readable proof
5592 documents, due to unpredictable outcome and non-compositional proof
5593 checking); users who know what they are doing may use schematic goals
5594 for Prolog-style synthesis of proven results;
5596 * Pure: assumption method (an implicit finishing) now handles actual
5599 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5600 initial goal, declare "that" only as Pure intro (only for single
5601 steps); the "that" rule assumption may now be involved in implicit
5602 finishing, thus ".." becomes a feasible for trivial obtains;
5604 * Pure: default proof step now includes 'intro_classes'; thus trivial
5605 instance proofs may be performed by "..";
5607 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5610 * Pure: more robust selection of calculational rules;
5612 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5613 rule (as well as the assumption rule);
5615 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5616 lemmas, using the graph browser tool;
5618 * Pure: predict failure of "show" in interactive mode;
5620 * Pure: 'thms_containing' now takes actual terms as arguments;
5622 * HOL: improved method 'induct' --- now handles non-atomic goals
5623 (potential INCOMPATIBILITY); tuned error handling;
5625 * HOL: cases and induct rules now provide explicit hints about the
5626 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5627 any remaining facts are inserted into the goal verbatim;
5629 * HOL: local contexts (aka cases) may now contain term bindings as
5630 well; the 'cases' and 'induct' methods new provide a ?case binding for
5631 the result to be shown in each case;
5633 * HOL: added 'recdef_tc' command;
5635 * isatool convert assists in eliminating legacy ML scripts;
5640 * HOL/Library: a collection of generic theories to be used together
5641 with main HOL; the theory loader path already includes this directory
5642 by default; the following existing theories have been moved here:
5643 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5644 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5646 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5647 modelling and verification task performed in Isabelle/HOL +
5648 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5650 * HOL/Algebra: special summation operator SUM no longer exists, it has
5651 been replaced by setsum; infix 'assoc' now has priority 50 (like
5652 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5653 'domain', this makes the theory consistent with mathematical
5656 * HOL basics: added overloaded operations "inverse" and "divide"
5657 (infix "/"), syntax for generic "abs" operation, generic summation
5660 * HOL/typedef: simplified package, provide more useful rules (see also
5663 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5664 now expressed as a proper nested rule (old-style tactic scripts may
5665 require atomize_strip_tac to cope with non-atomic premises);
5667 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5668 to "split_conv" (old name still available for compatibility);
5670 * HOL: improved concrete syntax for strings (e.g. allows translation
5671 rules with string literals);
5673 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5674 and Fleuriot's mechanization of analysis, including the transcendental
5675 functions for the reals;
5677 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5682 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5683 "lam" is displayed as TWO lambda-symbols
5685 * CTT: theory Main now available, containing everything (that is, Bool
5691 * Pure: the Simplifier has been implemented properly as a derived rule
5692 outside of the actual kernel (at last!); the overall performance
5693 penalty in practical applications is about 50%, while reliability of
5694 the Isabelle inference kernel has been greatly improved;
5696 * print modes "brackets" and "no_brackets" control output of nested =>
5697 (types) and ==> (props); the default behaviour is "brackets";
5699 * Provers: fast_tac (and friends) now handle actual object-logic rules
5700 as assumptions as well;
5702 * system: support Poly/ML 4.0;
5704 * system: isatool install handles KDE version 1 or 2;
5708 New in Isabelle99-1 (October 2000)
5709 ----------------------------------
5711 *** Overview of INCOMPATIBILITIES ***
5713 * HOL: simplification of natural numbers is much changed; to partly
5714 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5715 issue the following ML commands:
5717 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5718 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5720 * HOL: simplification no longer dives into case-expressions; this is
5721 controlled by "t.weak_case_cong" for each datatype t;
5723 * HOL: nat_less_induct renamed to less_induct;
5725 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5726 fixsome to patch .thy and .ML sources automatically;
5728 select_equality -> some_equality
5729 select_eq_Ex -> some_eq_ex
5730 selectI2EX -> someI2_ex
5733 select1_equality -> some1_equality
5734 Eps_sym_eq -> some_sym_eq_trivial
5735 Eps_eq -> some_eq_trivial
5737 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5739 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5742 * HOL: the recursion equations generated by 'recdef' are now called
5743 f.simps instead of f.rules;
5745 * HOL: qed_spec_mp now also handles bounded ALL as well;
5747 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5748 sometimes be needed;
5750 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5752 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5754 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5755 product is now "<*>" instead of "Times"; the lexicographic product is
5756 now "<*lex*>" instead of "**";
5758 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5759 of main HOL, but was unused); better use HOL's datatype package;
5761 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5762 the old syntax may be recovered as follows:
5765 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5766 (infixl "\\<oplus>" 100)
5768 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5770 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5771 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5774 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5775 changed from A/r to A//r;
5777 * ZF: new treatment of arithmetic (nat & int) may break some old
5780 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5781 rulify -> rule_format, elimify -> elim_format, ...);
5783 * Isar/Provers: intro/elim/dest attributes changed; renamed
5784 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5785 should have to change intro!! to intro? only); replaced "delrule" by
5788 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5790 * Provers: strengthened force_tac by using new first_best_tac;
5792 * LaTeX document preparation: several changes of isabelle.sty (see
5796 *** Document preparation ***
5798 * formal comments (text blocks etc.) in new-style theories may now
5799 contain antiquotations of thm/prop/term/typ/text to be presented
5800 according to latex print mode; concrete syntax is like this:
5801 @{term[show_types] "f(x) = a + x"};
5803 * isatool mkdir provides easy setup of Isabelle session directories,
5804 including proper document sources;
5806 * generated LaTeX sources are now deleted after successful run
5807 (isatool document -c); may retain a copy somewhere else via -D option
5810 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5811 style files, achieving self-contained LaTeX sources and simplifying
5814 * old-style theories now produce (crude) LaTeX output as well;
5816 * browser info session directories are now self-contained (may be put
5817 on WWW server seperately); improved graphs of nested sessions; removed
5818 graph for 'all sessions';
5820 * several improvements in isabelle style files; \isabellestyle{it}
5821 produces fake math mode output; \isamarkupheader is now \section by
5822 default; see lib/texinputs/isabelle.sty etc.;
5827 * Isar/Pure: local results and corresponding term bindings are now
5828 subject to Hindley-Milner polymorphism (similar to ML); this
5829 accommodates incremental type-inference very nicely;
5831 * Isar/Pure: new derived language element 'obtain' supports
5832 generalized existence reasoning;
5834 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5835 support accumulation of results, without applying any rules yet;
5836 useful to collect intermediate results without explicit name
5837 references, and for use with transitivity rules with more than 2
5840 * Isar/Pure: scalable support for case-analysis type proofs: new
5841 'case' language element refers to local contexts symbolically, as
5842 produced by certain proof methods; internally, case names are attached
5843 to theorems as "tags";
5845 * Isar/Pure: theory command 'hide' removes declarations from
5846 class/type/const name spaces;
5848 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5849 indicate potential overloading;
5851 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5853 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5854 "{a,b,c}" instead of {a,b,c};
5856 * Isar/Pure now provides its own version of intro/elim/dest
5857 attributes; useful for building new logics, but beware of confusion
5858 with the version in Provers/classical;
5860 * Isar/Pure: the local context of (non-atomic) goals is provided via
5861 case name 'antecedent';
5863 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5864 to the current context is now done automatically);
5866 * Isar/Pure: theory command 'method_setup' provides a simple interface
5867 for definining proof methods in ML;
5869 * Isar/Provers: intro/elim/dest attributes changed; renamed
5870 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5871 most cases, one should have to change intro!! to intro? only);
5872 replaced "delrule" by "rule del";
5874 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5875 'symmetric' attribute (the latter supercedes [RS sym]);
5877 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5878 method modifier); 'simp' method: 'only:' modifier removes loopers as
5879 well (including splits);
5881 * Isar/Provers: Simplifier and Classical methods now support all kind
5882 of modifiers used in the past, including 'cong', 'iff', etc.
5884 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5885 of Simplifier and Classical reasoner);
5887 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5888 now support named cases; major packages (inductive, datatype, primrec,
5889 recdef) support case names and properly name parameters;
5891 * Isar/HOL: new transitivity rules for substitution in inequalities --
5892 monotonicity conditions are extracted to be proven at end of
5895 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5898 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5899 split_if split_if_asm; datatype package provides theorems foo.splits =
5900 foo.split foo.split_asm for each datatype;
5902 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5903 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5904 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5905 use "(cases (simplified))" method in proper proof texts);
5907 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5909 * Isar: names of theorems etc. may be natural numbers as well;
5911 * Isar: 'pr' command: optional arguments for goals_limit and
5912 ProofContext.prems_limit; no longer prints theory contexts, but only
5915 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5916 additional print modes to be specified; e.g. "pr(latex)" will print
5917 proof state according to the Isabelle LaTeX style;
5919 * Isar: improved support for emulating tactic scripts, including proof
5920 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5921 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5922 (for HOL datatypes);
5924 * Isar: simplified (more robust) goal selection of proof methods: 1st
5925 goal, all goals, or explicit goal specifier (tactic emulation); thus
5926 'proof method scripts' have to be in depth-first order;
5928 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5930 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5931 should instead use individual commands for printing items
5932 (print_commands, print_methods etc.);
5934 * Isar: added 'nothing' --- the empty list of theorems;
5939 * HOL/MicroJava: formalization of a fragment of Java, together with a
5940 corresponding virtual machine and a specification of its bytecode
5941 verifier and a lightweight bytecode verifier, including proofs of
5942 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5943 Cornelia Pusch (see also the homepage of project Bali at
5944 http://isabelle.in.tum.de/Bali/);
5946 * HOL/Algebra: new theory of rings and univariate polynomials, by
5949 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5950 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5953 * HOL/Lattice: fundamental concepts of lattice theory and order
5954 structures, including duals, properties of bounds versus algebraic
5955 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5956 Theorem for complete lattices etc.; may also serve as a demonstration
5957 for abstract algebraic reasoning using axiomatic type classes, and
5958 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5960 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5963 * HOL/IMPP: extension of IMP with local variables and mutually
5964 recursive procedures, by David von Oheimb;
5966 * HOL/Lambda: converted into new-style theory and document;
5968 * HOL/ex/Multiquote: example of multiple nested quotations and
5969 anti-quotations -- basically a generalized version of de-Bruijn
5970 representation; very useful in avoiding lifting of operations;
5972 * HOL/record: added general record equality rule to simpset; fixed
5973 select-update simplification procedure to handle extended records as
5974 well; admit "r" as field name;
5976 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5977 other numeric types and also as the identity of groups, rings, etc.;
5979 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5980 Types nat and int belong to this axclass;
5982 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5983 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5984 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5985 two terms #m*u and #n*u are replaced by #(m+n)*u
5986 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5987 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5988 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5990 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5991 powerful prover for predicate logic but knows nothing of clasets; see
5992 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5994 * HOL: new version of "case_tac" subsumes both boolean case split and
5995 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5996 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5998 * HOL: simplification no longer dives into case-expressions: only the
5999 selector expression is simplified, but not the remaining arms; to
6000 enable full simplification of case-expressions for datatype t, you may
6001 remove t.weak_case_cong from the simpset, either globally (Delcongs
6002 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6004 * HOL/recdef: the recursion equations generated by 'recdef' for
6005 function 'f' are now called f.simps instead of f.rules; if all
6006 termination conditions are proved automatically, these simplification
6007 rules are added to the simpset, as in primrec; rules may be named
6008 individually as well, resulting in a separate list of theorems for
6011 * HOL/While is a new theory that provides a while-combinator. It
6012 permits the definition of tail-recursive functions without the
6013 provision of a termination measure. The latter is necessary once the
6014 invariant proof rule for while is applied.
6016 * HOL: new (overloaded) notation for the set of elements below/above
6017 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6019 * HOL: theorems impI, allI, ballI bound as "strip";
6021 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6022 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6023 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6025 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6027 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6028 main HOL, but was unused);
6030 * HOL: fewer consts declared as global (e.g. have to refer to
6031 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6033 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6034 in case of overlap with user translations (e.g. judgements over
6035 tuples); (note that the underlying logical represenation is still
6041 * ZF: simplification automatically cancels common terms in arithmetic
6042 expressions over nat and int;
6044 * ZF: new treatment of nat to minimize type-checking: all operators
6045 coerce their operands to a natural number using the function natify,
6046 making the algebraic laws unconditional;
6048 * ZF: as above, for int: operators coerce their operands to an integer
6049 using the function intify;
6051 * ZF: the integer library now contains many of the usual laws for the
6052 orderings, including $<=, and monotonicity laws for $+ and $*;
6054 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6057 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6058 to the simplifier and classical reasoner simultaneously;
6063 * Provers: blast_tac now handles actual object-logic rules as
6064 assumptions; note that auto_tac uses blast_tac internally as well;
6066 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6067 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6069 * Provers: delrules now handles destruct rules as well (no longer need
6070 explicit make_elim);
6072 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6073 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6074 use instead the strong form,
6075 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6076 in HOL, FOL and ZF the function cla_make_elim will create such rules
6077 from destruct-rules;
6079 * Provers: Simplifier.easy_setup provides a fast path to basic
6080 Simplifier setup for new object-logics;
6082 * Pure: AST translation rules no longer require constant head on LHS;
6084 * Pure: improved name spaces: ambiguous output is qualified; support
6085 for hiding of names;
6087 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6088 XSYMBOL_HOME; no longer need to do manual configuration in most
6091 * system: compression of ML heaps images may now be controlled via -c
6092 option of isabelle and isatool usedir (currently only observed by
6095 * system: isatool installfonts may handle X-Symbol fonts as well (very
6096 useful for remote X11);
6098 * system: provide TAGS file for Isabelle sources;
6100 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6103 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6104 timing flag supersedes proof_timing and Toplevel.trace;
6106 * ML: new combinators |>> and |>>> for incremental transformations
6107 with secondary results (e.g. certain theory extensions):
6109 * ML: PureThy.add_defs gets additional argument to indicate potential
6110 overloading (usually false);
6112 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6117 New in Isabelle99 (October 1999)
6118 --------------------------------
6120 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6122 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6123 are no longer simplified. (This allows the simplifier to unfold recursive
6124 functional programs.) To restore the old behaviour, declare
6126 Delcongs [if_weak_cong];
6128 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6131 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6133 * HOL/datatype: mutual_induct_tac no longer exists --
6134 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6136 * HOL/typedef: fixed type inference for representing set; type
6137 arguments now have to occur explicitly on the rhs as type constraints;
6139 * ZF: The con_defs part of an inductive definition may no longer refer
6140 to constants declared in the same theory;
6142 * HOL, ZF: the function mk_cases, generated by the inductive
6143 definition package, has lost an argument. To simplify its result, it
6144 uses the default simpset instead of a supplied list of theorems.
6146 * HOL/List: the constructors of type list are now Nil and Cons;
6148 * Simplifier: the type of the infix ML functions
6149 setSSolver addSSolver setSolver addSolver
6150 is now simpset * solver -> simpset where `solver' is a new abstract type
6151 for packaging solvers. A solver is created via
6152 mk_solver: string -> (thm list -> int -> tactic) -> solver
6153 where the string argument is only a comment.
6158 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6159 decision procedure for linear arithmetic. Currently it is used for
6160 types `nat', `int', and `real' in HOL (see below); it can, should and
6161 will be instantiated for other types and logics as well.
6163 * The simplifier now accepts rewrite rules with flexible heads, eg
6164 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6165 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6171 * New Isabelle/Isar subsystem provides an alternative to traditional
6172 tactical theorem proving; together with the ProofGeneral/isar user
6173 interface it offers an interactive environment for developing human
6174 readable proof documents (Isar == Intelligible semi-automated
6175 reasoning); for further information see isatool doc isar-ref,
6176 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6178 * improved and simplified presentation of theories: better HTML markup
6179 (including colors), graph views in several sizes; isatool usedir now
6180 provides a proper interface for user theories (via -P option); actual
6181 document preparation based on (PDF)LaTeX is available as well (for
6182 new-style theories only); see isatool doc system for more information;
6184 * native support for Proof General, both for classic Isabelle and
6187 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6188 using the graph browser tool;
6190 * Isabelle manuals now also available as PDF;
6192 * theory loader rewritten from scratch (may not be fully
6193 bug-compatible); old loadpath variable has been replaced by show_path,
6194 add_path, del_path, reset_path functions; new operations such as
6195 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6198 * improved isatool install: option -k creates KDE application icon,
6199 option -p DIR installs standalone binaries;
6201 * added ML_PLATFORM setting (useful for cross-platform installations);
6202 more robust handling of platform specific ML images for SML/NJ;
6204 * the settings environment is now statically scoped, i.e. it is never
6205 created again in sub-processes invoked from isabelle, isatool, or
6208 * path element specification '~~' refers to '$ISABELLE_HOME';
6210 * in locales, the "assumes" and "defines" parts may be omitted if
6213 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6216 * new print_mode "HTML";
6218 * new flag show_tags controls display of tags of theorems (which are
6219 basically just comments that may be attached by some tools);
6221 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6222 mode and goal output format:
6224 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6226 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6228 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6229 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6231 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6233 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6235 * function bind_thms stores lists of theorems (cf. bind_thm);
6237 * new shorthand tactics ftac, eatac, datac, fatac;
6239 * qed (and friends) now accept "" as result name; in that case the
6240 theorem is not stored, but proper checks and presentation of the
6243 * theorem database now also indexes constants "Trueprop", "all",
6244 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6249 ** HOL arithmetic **
6251 * There are now decision procedures for linear arithmetic over nat and
6254 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6255 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6256 are treated as atomic; subformulae not involving type `nat' or `int'
6257 are ignored; quantified subformulae are ignored unless they are
6258 positive universal or negative existential. The tactic has to be
6259 invoked by hand and can be a little bit slow. In particular, the
6260 running time is exponential in the number of occurrences of `min' and
6261 `max', and `-' on `nat'.
6263 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6264 (negated) (in)equalities among the premises and the conclusion into
6265 account (i.e. no compound formulae) and does not know about `min' and
6266 `max', and `-' on `nat'. It is fast and is used automatically by the
6269 NB: At the moment, these decision procedures do not cope with mixed
6270 nat/int formulae where the two parts interact, such as `m < n ==>
6273 * HOL/Numeral provides a generic theory of numerals (encoded
6274 efficiently as bit strings); setup for types nat/int/real is in place;
6275 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6276 int, existing theories and proof scripts may require a few additional
6279 * integer division and remainder can now be performed on constant
6282 * many properties of integer multiplication, division and remainder
6285 * An interface to the Stanford Validity Checker (SVC) is available through the
6286 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6287 are proved automatically. SVC must be installed separately, and its results
6288 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6289 invocation of the underlying oracle). For SVC see
6290 http://verify.stanford.edu/SVC
6292 * IsaMakefile: the HOL-Real target now builds an actual image;
6297 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6298 (in Isabelle/Isar) -- by Gertrud Bauer;
6300 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6301 analysis for assembly languages with subtypes;
6303 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6304 -- avoids syntactic ambiguities and treats state, transition, and
6305 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6306 changed syntax and (many) tactics;
6308 * HOL/inductive: Now also handles more general introduction rules such
6309 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6310 theorems are now maintained within the theory (maintained via the
6313 * HOL/datatype: Now also handles arbitrarily branching datatypes
6314 (using function types) such as
6316 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6318 * HOL/record: record_simproc (part of the default simpset) takes care
6319 of selectors applied to updated records; record_split_tac is no longer
6320 part of the default claset; update_defs may now be removed from the
6321 simpset in many cases; COMPATIBILITY: old behavior achieved by
6323 claset_ref () := claset() addSWrapper record_split_wrapper;
6324 Delsimprocs [record_simproc]
6326 * HOL/typedef: fixed type inference for representing set; type
6327 arguments now have to occur explicitly on the rhs as type constraints;
6329 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6330 names rather than an ML expression;
6332 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6333 supplied later. Program schemes can be defined, such as
6334 "While B C s = (if B s then While B C (C s) else s)"
6335 where the well-founded relation can be chosen after B and C have been given.
6337 * HOL/List: the constructors of type list are now Nil and Cons;
6338 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6339 course, ML tools referring to List.list.op # etc. have to be adapted;
6341 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6342 disabled by default; run isabelle with option -m HOL to get back to
6343 the original Gordon/HOL-style output;
6345 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6346 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6348 * HOL basic syntax simplified (more orthogonal): all variants of
6349 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6350 Eps operator is provided as well: "SOME x. P[x]";
6352 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6354 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6355 thus available for user theories;
6357 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6358 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6361 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6362 several times and then mp;
6367 * the notation <<...>> is now available as a notation for sequences of
6370 * the simplifier is now installed
6372 * the axiom system has been generalized (thanks to Soren Heilmann)
6374 * the classical reasoner now has a default rule database
6379 * new primrec section allows primitive recursive functions to be given
6380 directly (as in HOL) over datatypes and the natural numbers;
6382 * new tactics induct_tac and exhaust_tac for induction (or case
6383 analysis) over datatypes and the natural numbers;
6385 * the datatype declaration of type T now defines the recursor T_rec;
6387 * simplification automatically does freeness reasoning for datatype
6390 * automatic type-inference, with AddTCs command to insert new
6391 type-checking rules;
6393 * datatype introduction rules are now added as Safe Introduction rules
6396 * the syntax "if P then x else y" is now available in addition to
6400 *** Internal programming interfaces ***
6402 * tuned simplifier trace output; new flag debug_simp;
6404 * structures Vartab / Termtab (instances of TableFun) offer efficient
6405 tables indexed by indexname_ord / term_ord (compatible with aconv);
6407 * AxClass.axclass_tac lost the theory argument;
6409 * tuned current_goals_markers semantics: begin / end goal avoids
6410 printing empty lines;
6412 * removed prs and prs_fn hook, which was broken because it did not
6413 include \n in its semantics, forcing writeln to add one
6414 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6415 string -> unit if you really want to output text without newline;
6417 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6418 plain output, interface builders may have to enable 'isabelle_font'
6419 mode to get Isabelle font glyphs as before;
6421 * refined token_translation interface; INCOMPATIBILITY: output length
6422 now of type real instead of int;
6424 * theory loader actions may be traced via new ThyInfo.add_hook
6425 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6426 your own database of information attached to *whole* theories -- as
6427 opposed to intra-theory data slots offered via TheoryDataFun;
6429 * proper handling of dangling sort hypotheses (at last!);
6430 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6431 extra sort hypotheses that can be witnessed from the type signature;
6432 the force_strip_shyps flag is gone, any remaining shyps are simply
6433 left in the theorem (with a warning issued by strip_shyps_warning);
6437 New in Isabelle98-1 (October 1998)
6438 ----------------------------------
6440 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6442 * several changes of automated proof tools;
6444 * HOL: major changes to the inductive and datatype packages, including
6445 some minor incompatibilities of theory syntax;
6447 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6450 * HOL: removed duplicate thms in Arith:
6451 less_imp_add_less should be replaced by trans_less_add1
6452 le_imp_add_le should be replaced by trans_le_add1
6454 * HOL: unary minus is now overloaded (new type constraints may be
6457 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6458 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6459 now taken as an integer constant.
6461 * Pure: ML function 'theory_of' renamed to 'theory';
6467 1. Asm_full_simp_tac is now more aggressive.
6468 1. It will sometimes reorient premises if that increases their power to
6470 2. It does no longer proceed strictly from left to right but may also
6471 rotate premises to achieve further simplification.
6472 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6473 old Asm_full_simp_tac in that it does not rotate premises.
6474 2. The simplifier now knows a little bit about nat-arithmetic.
6476 * Classical reasoner: wrapper mechanism for the classical reasoner now
6477 allows for selected deletion of wrappers, by introduction of names for
6478 wrapper functionals. This implies that addbefore, addSbefore,
6479 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6480 and that adding two tactics with the same name overwrites the first
6481 one (emitting a warning).
6482 type wrapper = (int -> tactic) -> (int -> tactic)
6483 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6484 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6485 delWrapper, delSWrapper: claset * string -> claset
6486 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6488 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6489 semantics; addbefore now affects only the unsafe part of step_tac
6490 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6491 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6494 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6495 compWrapper; added safe wrapper (and access functions for it);
6497 * HOL/split_all_tac is now much faster and fails if there is nothing
6498 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6499 and the names of the automatically generated variables have changed.
6500 split_all_tac has moved within claset() from unsafe wrappers to safe
6501 wrappers, which means that !!-bound variables are split much more
6502 aggressively, and safe_tac and clarify_tac now split such variables.
6503 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6504 Note: the same holds for record_split_tac, which does the job of
6505 split_all_tac for record fields.
6507 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6508 permanently to the default simpset using Addsplits just like
6509 Addsimps. They can be removed via Delsplits just like
6510 Delsimps. Lower-case versions are also available.
6512 * HOL/Simplifier: The rule split_if is now part of the default
6513 simpset. This means that the simplifier will eliminate all occurrences
6514 of if-then-else in the conclusion of a goal. To prevent this, you can
6515 either remove split_if completely from the default simpset by
6516 `Delsplits [split_if]' or remove it in a specific call of the
6517 simplifier using `... delsplits [split_if]'. You can also add/delete
6518 other case splitting rules to/from the default simpset: every datatype
6519 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6520 t is the name of the datatype).
6522 * Classical reasoner / Simplifier combination: new force_tac (and
6523 derivatives Force_tac, force) combines rewriting and classical
6524 reasoning (and whatever other tools) similarly to auto_tac, but is
6525 aimed to solve the given subgoal completely.
6530 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6531 and `goalw': the theory is no longer needed as an explicit argument -
6532 the current theory context is used; assumptions are no longer returned
6533 at the ML-level unless one of them starts with ==> or !!; it is
6534 recommended to convert to these new commands using isatool fixgoal
6535 (backup your sources first!);
6537 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6538 the current theory context, and 'theory' to lookup stored theories;
6540 * new theory section 'locale' for declaring constants, assumptions and
6541 definitions that have local scope;
6543 * new theory section 'nonterminals' for purely syntactic types;
6545 * new theory section 'setup' for generic ML setup functions
6546 (e.g. package initialization);
6548 * the distribution now includes Isabelle icons: see
6549 lib/logo/isabelle-{small,tiny}.xpm;
6551 * isatool install - install binaries with absolute references to
6554 * isatool logo -- create instances of the Isabelle logo (as EPS);
6556 * print mode 'emacs' reserved for Isamode;
6558 * support multiple print (ast) translations per constant name;
6560 * theorems involving oracles are now printed with a suffixed [!];
6565 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6567 * HOL/inductive package reorganized and improved: now supports mutual
6573 oddI "n : EVEN ==> Suc n : ODD"
6574 evenI "n : ODD ==> Suc n : EVEN"
6576 new theorem list "elims" contains an elimination rule for each of the
6577 recursive sets; inductive definitions now handle disjunctive premises
6578 correctly (also ZF);
6580 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6581 "mutual_induct" no longer exists - the induction rule is always
6582 contained in "induct";
6585 * HOL/datatype package re-implemented and greatly improved: now
6586 supports mutually recursive datatypes such as
6589 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6590 | SUM ('a aexp) ('a aexp)
6591 | DIFF ('a aexp) ('a aexp)
6594 'a bexp = LESS ('a aexp) ('a aexp)
6595 | AND ('a bexp) ('a bexp)
6596 | OR ('a bexp) ('a bexp)
6598 as well as indirectly recursive datatypes such as
6601 ('a, 'b) term = Var 'a
6602 | App 'b ((('a, 'b) term) list)
6604 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6605 induction on mutually / indirectly recursive datatypes.
6607 Primrec equations are now stored in theory and can be accessed via
6608 <function_name>.simps.
6612 - Theories using datatypes must now have theory Datatype as an
6614 - The specific <typename>.induct_tac no longer exists - use the
6615 generic induct_tac instead.
6616 - natE has been renamed to nat.exhaust - use exhaust_tac
6617 instead of res_inst_tac ... natE. Note that the variable
6618 names in nat.exhaust differ from the names in natE, this
6619 may cause some "fragile" proofs to fail.
6620 - The theorems split_<typename>_case and split_<typename>_case_asm
6621 have been renamed to <typename>.split and <typename>.split_asm.
6622 - Since default sorts of type variables are now handled correctly,
6623 some datatype definitions may have to be annotated with explicit
6625 - Primrec definitions no longer require function name and type
6626 of recursive argument.
6628 Consider using isatool fixdatatype to adapt your theories and proof
6629 scripts to the new package (backup your sources first!).
6632 * HOL/record package: considerably improved implementation; now
6633 includes concrete syntax for record types, terms, updates; theorems
6634 for surjective pairing and splitting !!-bound record variables; proof
6635 support is as follows:
6637 1) standard conversions (selectors or updates applied to record
6638 constructor terms) are part of the standard simpset;
6640 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6641 made part of standard simpset and claset via addIffs;
6643 3) a tactic for record field splitting (record_split_tac) is part of
6644 the standard claset (addSWrapper);
6646 To get a better idea about these rules you may retrieve them via
6647 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6648 the name of your record type.
6650 The split tactic 3) conceptually simplifies by the following rule:
6652 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6654 Thus any record variable that is bound by meta-all will automatically
6655 blow up into some record constructor term, consequently the
6656 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6657 solve record problems automatically.
6660 * reorganized the main HOL image: HOL/Integ and String loaded by
6661 default; theory Main includes everything;
6663 * automatic simplification of integer sums and comparisons, using cancellation;
6665 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6667 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6669 * many new identities for unions, intersections, set difference, etc.;
6671 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6672 called split_if, split_split, split_sum_case and split_nat_case (to go
6673 with add/delsplits);
6675 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6676 (?x::unit) = (); this is made part of the default simpset, which COULD
6677 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6678 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6679 unit_abs_eta_conv is added in order to counter the effect of
6680 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6683 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6686 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6687 It and 'sym RS equals0D' are now in the default claset, giving automatic
6688 disjointness reasoning but breaking a few old proofs.
6690 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6691 to 'converse' from 'inverse' (for compatibility with ZF and some
6694 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6695 the well-founded relation;
6697 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6698 Compl A. The "Compl" syntax remains available as input syntax for this
6701 * HOL/Update: new theory of function updates:
6702 f(a:=b) == %x. if x=a then b else f x
6703 may also be iterated as in f(a:=b,c:=d,...);
6705 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6708 - new function list_update written xs[i:=v] that updates the i-th
6709 list position. May also be iterated as in xs[i:=a,j:=b,...].
6710 - new function `upt' written [i..j(] which generates the list
6711 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6712 bound write [i..j], which is a shorthand for [i..j+1(].
6713 - new lexicographic orderings and corresponding wellfoundedness theorems.
6716 - removed 'pred' (predecessor) function;
6717 - generalized some theorems about n-1;
6718 - many new laws about "div" and "mod";
6719 - new laws about greatest common divisors (see theory ex/Primes);
6721 * HOL/Relation: renamed the relational operator r^-1 "converse"
6722 instead of "inverse";
6724 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6725 of the multiset ordering;
6727 * directory HOL/Real: a construction of the reals using Dedekind cuts
6728 (not included by default);
6730 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6732 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6733 programs, i.e. different program variables may have different types.
6735 * calling (stac rew i) now fails if "rew" has no effect on the goal
6736 [previously, this check worked only if the rewrite rule was unconditional]
6737 Now rew can involve either definitions or equalities (either == or =).
6742 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6743 only the theorems proved on ZF.ML;
6745 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6746 It and 'sym RS equals0D' are now in the default claset, giving automatic
6747 disjointness reasoning but breaking a few old proofs.
6749 * ZF/Update: new theory of function updates
6750 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6751 may also be iterated as in f(a:=b,c:=d,...);
6753 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6755 * calling (stac rew i) now fails if "rew" has no effect on the goal
6756 [previously, this check worked only if the rewrite rule was unconditional]
6757 Now rew can involve either definitions or equalities (either == or =).
6759 * case_tac provided for compatibility with HOL
6760 (like the old excluded_middle_tac, but with subgoals swapped)
6763 *** Internal programming interfaces ***
6765 * Pure: several new basic modules made available for general use, see
6766 also src/Pure/README;
6768 * improved the theory data mechanism to support encapsulation (data
6769 kind name replaced by private Object.kind, acting as authorization
6770 key); new type-safe user interface via functor TheoryDataFun; generic
6771 print_data function becomes basically useless;
6773 * removed global_names compatibility flag -- all theory declarations
6774 are qualified by default;
6776 * module Pure/Syntax now offers quote / antiquote translation
6777 functions (useful for Hoare logic etc. with implicit dependencies);
6778 see HOL/ex/Antiquote for an example use;
6780 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6783 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6786 * Display.print_goals function moved to Locale.print_goals;
6788 * standard print function for goals supports current_goals_markers
6789 variable for marking begin of proof, end of proof, start of goal; the
6790 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6791 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6796 New in Isabelle98 (January 1998)
6797 --------------------------------
6799 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6801 * changed lexical syntax of terms / types: dots made part of long
6802 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6804 * simpset (and claset) reference variable replaced by functions
6805 simpset / simpset_ref;
6807 * no longer supports theory aliases (via merge) and non-trivial
6808 implicit merge of thms' signatures;
6810 * most internal names of constants changed due to qualified names;
6812 * changed Pure/Sequence interface (see Pure/seq.ML);
6815 *** General Changes ***
6817 * hierachically structured name spaces (for consts, types, axms, thms
6818 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6819 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6820 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6821 long_names for fully qualified output names; NOTE: ML programs
6822 (special tactics, packages etc.) referring to internal names may have
6823 to be adapted to cope with fully qualified names; in case of severe
6824 backward campatibility problems try setting 'global_names' at compile
6825 time to have enrything declared within a flat name space; one may also
6826 fine tune name declarations in theories via the 'global' and 'local'
6829 * reimplemented the implicit simpset and claset using the new anytype
6830 data filed in signatures; references simpset:simpset ref etc. are
6831 replaced by functions simpset:unit->simpset and
6832 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6833 to patch your ML files accordingly;
6835 * HTML output now includes theory graph data for display with Java
6836 applet or isatool browser; data generated automatically via isatool
6837 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6839 * defs may now be conditional; improved rewrite_goals_tac to handle
6840 conditional equations;
6842 * defs now admits additional type arguments, using TYPE('a) syntax;
6844 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6845 creates a new theory node; implicit merge of thms' signatures is
6846 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6847 transfer:theory->thm->thm in (rare) cases;
6849 * improved handling of draft signatures / theories; draft thms (and
6850 ctyps, cterms) are automatically promoted to real ones;
6852 * slightly changed interfaces for oracles: admit many per theory, named
6853 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6855 * print_goals: optional output of const types (set show_consts and
6858 * improved output of warnings (###) and errors (***);
6860 * subgoal_tac displays a warning if the new subgoal has type variables;
6862 * removed old README and Makefiles;
6864 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6866 * removed obsolete init_pps and init_database;
6868 * deleted the obsolete tactical STATE, which was declared by
6869 fun STATE tacfun st = tacfun st st;
6871 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6872 (which abbreviates $HOME);
6874 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6875 use isatool fixseq to adapt your ML programs (this works for fully
6876 qualified references to the Sequence structure only!);
6878 * use_thy no longer requires writable current directory; it always
6879 reloads .ML *and* .thy file, if either one is out of date;
6882 *** Classical Reasoner ***
6884 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6885 tactics that use classical reasoning to simplify a subgoal without
6886 splitting it into several subgoals;
6888 * Safe_tac: like safe_tac but uses the default claset;
6893 * added simplification meta rules:
6894 (asm_)(full_)simplify: simpset -> thm -> thm;
6896 * simplifier.ML no longer part of Pure -- has to be loaded by object
6899 * added prems argument to simplification procedures;
6901 * HOL, FOL, ZF: added infix function `addsplits':
6902 instead of `<simpset> setloop (split_tac <thms>)'
6903 you can simply write `<simpset> addsplits <thms>'
6908 * TYPE('a) syntax for type reflection terms;
6910 * no longer handles consts with name "" -- declare as 'syntax' instead;
6912 * pretty printer: changed order of mixfix annotation preference (again!);
6914 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6919 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6920 with `addloop' of the simplifier to faciliate case splitting in premises.
6922 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6924 * HOL/Auth: new protocol proofs including some for the Internet
6927 * HOL/Map: new theory of `maps' a la VDM;
6929 * HOL/simplifier: simplification procedures nat_cancel_sums for
6930 cancelling out common nat summands from =, <, <= (in)equalities, or
6931 differences; simplification procedures nat_cancel_factor for
6932 cancelling common factor from =, <, <= (in)equalities over natural
6933 sums; nat_cancel contains both kinds of procedures, it is installed by
6934 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6936 * HOL/simplifier: terms of the form
6937 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6939 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6940 and those of the form
6941 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6943 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6946 Each datatype `t' now comes with a theorem `split_t_case' of the form
6948 P(t_case f1 ... fn x) =
6949 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6951 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6954 and a theorem `split_t_case_asm' of the form
6956 P(t_case f1 ... fn x) =
6957 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6959 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6961 which can be added to a simpset via `addsplits'. The existing theorems
6962 expand_list_case and expand_option_case have been renamed to
6963 split_list_case and split_option_case.
6966 - `pred n' is automatically converted to `n-1'.
6967 Users are strongly encouraged not to use `pred' any longer,
6968 because it will disappear altogether at some point.
6969 - Users are strongly encouraged to write "0 < n" rather than
6970 "n ~= 0". Theorems and proof tools have been modified towards this
6974 the function "set_of_list" has been renamed "set" (and its theorems too);
6975 the function "nth" now takes its arguments in the reverse order and
6976 has acquired the infix notation "!" as in "xs!n".
6978 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6980 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6981 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6983 * HOL/record: extensible records with schematic structural subtyping
6984 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6985 still lacks various theorems and concrete record syntax;
6990 * removed "axioms" and "generated by" sections;
6992 * replaced "ops" section by extended "consts" section, which is capable of
6993 handling the continuous function space "->" directly;
6996 . proves theorems immediately and stores them in the theory,
6997 . creates hierachical name space,
6998 . now uses normal mixfix annotations (instead of cinfix...),
6999 . minor changes to some names and values (for consistency),
7000 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7001 . separator between mutual domain defs: changed "," to "and",
7002 . improved handling of sort constraints; now they have to
7003 appear on the left-hand side of the equations only;
7005 * fixed LAM <x,y,zs>.b syntax;
7007 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7008 adm (%x. P (t x)), where P is chainfinite and t continuous;
7013 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7014 with `addloop' of the simplifier to faciliate case splitting in premises.
7016 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7017 in HOL, they strip ALL and --> from proved theorems;
7021 New in Isabelle94-8 (May 1997)
7022 ------------------------------
7024 *** General Changes ***
7026 * new utilities to build / run / maintain Isabelle etc. (in parts
7027 still somewhat experimental); old Makefiles etc. still functional;
7029 * new 'Isabelle System Manual';
7031 * INSTALL text, together with ./configure and ./build scripts;
7033 * reimplemented type inference for greater efficiency, better error
7034 messages and clean internal interface;
7036 * prlim command for dealing with lots of subgoals (an easier way of
7037 setting goals_limit);
7042 * supports alternative (named) syntax tables (parser and pretty
7043 printer); internal interface is provided by add_modesyntax(_i);
7045 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7046 be used in conjunction with the Isabelle symbol font; uses the
7047 "symbols" syntax table;
7049 * added token_translation interface (may translate name tokens in
7050 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7051 the current print_mode); IMPORTANT: user print translation functions
7052 are responsible for marking newly introduced bounds
7053 (Syntax.mark_boundT);
7055 * token translations for modes "xterm" and "xterm_color" that display
7056 names in bold, underline etc. or colors (which requires a color
7059 * infixes may now be declared with names independent of their syntax;
7061 * added typed_print_translation (like print_translation, but may
7062 access type of constant);
7065 *** Classical Reasoner ***
7067 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7068 some limitations. Blast_tac...
7069 + ignores addss, addbefore, addafter; this restriction is intrinsic
7070 + ignores elimination rules that don't have the correct format
7071 (the conclusion MUST be a formula variable)
7072 + ignores types, which can make HOL proofs fail
7073 + rules must not require higher-order unification, e.g. apply_type in ZF
7074 [message "Function Var's argument not a bound variable" relates to this]
7075 + its proof strategy is more general but can actually be slower
7077 * substitution with equality assumptions no longer permutes other
7080 * minor changes in semantics of addafter (now called addaltern); renamed
7081 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7082 (and access functions for it);
7084 * improved combination of classical reasoner and simplifier:
7085 + functions for handling clasimpsets
7086 + improvement of addss: now the simplifier is called _after_ the
7088 + safe variant of addss called addSss: uses safe simplifications
7089 _during_ the safe steps. It is more complete as it allows multiple
7090 instantiations of unknowns (e.g. with slow_tac).
7094 * added interface for simplification procedures (functions that
7095 produce *proven* rewrite rules on the fly, depending on current
7098 * ordering on terms as parameter (used for ordered rewriting);
7100 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7102 * the solver is now split into a safe and an unsafe part.
7103 This should be invisible for the normal user, except that the
7104 functions setsolver and addsolver have been renamed to setSolver and
7105 addSolver; added safe_asm_full_simp_tac;
7110 * a generic induction tactic `induct_tac' which works for all datatypes and
7111 also for type `nat';
7113 * a generic case distinction tactic `exhaust_tac' which works for all
7114 datatypes and also for type `nat';
7116 * each datatype comes with a function `size';
7118 * patterns in case expressions allow tuple patterns as arguments to
7119 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7121 * primrec now also works with type nat;
7123 * recdef: a new declaration form, allows general recursive functions to be
7124 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7126 * the constant for negation has been renamed from "not" to "Not" to
7127 harmonize with FOL, ZF, LK, etc.;
7129 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7132 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7134 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7135 problems in commutative rings, using axiomatic type classes for + and *;
7137 * more examples in HOL/MiniML and HOL/Auth;
7139 * more default rewrite rules for quantifiers, union/intersection;
7141 * a new constant `arbitrary == @x.False';
7143 * HOLCF/IOA replaces old HOL/IOA;
7145 * HOLCF changes: derived all rules and arities
7146 + axiomatic type classes instead of classes
7147 + typedef instead of faking type definitions
7148 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7149 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7150 + eliminated the types void, one, tr
7151 + use unit lift and bool lift (with translations) instead of one and tr
7152 + eliminated blift from Lift3.thy (use Def instead of blift)
7153 all eliminated rules are derived as theorems --> no visible changes ;
7158 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7159 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7160 as ZF_cs addSIs [equalityI];
7164 New in Isabelle94-7 (November 96)
7165 ---------------------------------
7167 * allowing negative levels (as offsets) in prlev and choplev;
7169 * super-linear speedup for large simplifications;
7171 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7172 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7173 FAIL); can suppress it using the command Delsimps (ex_simps @
7174 all_simps); De Morgan laws are also now included, by default;
7176 * improved printing of ==> : ~:
7178 * new object-logic "Sequents" adds linear logic, while replacing LK
7179 and Modal (thanks to Sara Kalvala);
7181 * HOL/Auth: correctness proofs for authentication protocols;
7183 * HOL: new auto_tac combines rewriting and classical reasoning (many
7184 examples on HOL/Auth);
7186 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7187 the rewriter and classical reasoner simultaneously;
7189 * function uresult no longer returns theorems in "standard" format;
7190 regain previous version by: val uresult = standard o uresult;
7197 * oracles -- these establish an interface between Isabelle and trusted
7198 external reasoners, which may deliver results as theorems;
7200 * proof objects (in particular record all uses of oracles);
7202 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7204 * "constdefs" section in theory files;
7206 * "primrec" section (HOL) no longer requires names;
7208 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7215 * reduced space requirements;
7217 * automatic HTML generation from theories;
7219 * theory files no longer require "..." (quotes) around most types;
7221 * new examples, including two proofs of the Church-Rosser theorem;
7223 * non-curried (1994) version of HOL is no longer distributed;
7230 * greatly reduced space requirements;
7232 * theory files (.thy) no longer require \...\ escapes at line breaks;
7234 * searchable theorem database (see the section "Retrieving theorems" on
7235 page 8 of the Reference Manual);
7237 * new examples, including Grabczewski's monumental case study of the
7240 * The previous version of HOL renamed to Old_HOL;
7242 * The new version of HOL (previously called CHOL) uses a curried syntax
7243 for functions. Application looks like f a b instead of f(a,b);
7245 * Mutually recursive inductive definitions finally work in HOL;
7247 * In ZF, pattern-matching on tuples is now available in all abstractions and
7248 translates to the operator "split";
7255 * new infix operator, addss, allowing the classical reasoner to
7256 perform simplification at each step of its search. Example:
7257 fast_tac (cs addss ss)
7259 * a new logic, CHOL, the same as HOL, but with a curried syntax
7260 for functions. Application looks like f a b instead of f(a,b). Also pairs
7261 look like (a,b) instead of <a,b>;
7263 * PLEASE NOTE: CHOL will eventually replace HOL!
7265 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7266 It translates to the operator "split". A new theory of integers is available;
7268 * In ZF, integer numerals now denote two's-complement binary integers.
7269 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7271 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7272 of the Axiom of Choice;
7279 * Significantly faster resolution;
7281 * the different sections in a .thy file can now be mixed and repeated
7284 * Database of theorems for FOL, HOL and ZF. New
7285 commands including qed, qed_goal and bind_thm store theorems in the database.
7287 * Simple database queries: return a named theorem (get_thm) or all theorems of
7288 a given theory (thms_of), or find out what theory a theorem was proved in
7291 * Bugs fixed in the inductive definition and datatype packages;
7293 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7294 and HOL_dup_cs obsolete;
7296 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7299 * Simpler definition of function space in ZF;
7301 * new results about cardinal and ordinal arithmetic in ZF;
7303 * 'subtype' facility in HOL for introducing new types as subsets of existing
7306 :mode=text:wrap=hard:maxLineLen=72: