1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in Isabelle2009-2 (June 2010)
5 ---------------------------------
9 * Authentic syntax for *all* logical entities (type classes, type
10 constructors, term constants): provides simple and robust
11 correspondence between formal entities and concrete syntax. Within
12 the parse tree / AST representations, "constants" are decorated by
13 their category (class, type, const) and spelled out explicitly with
14 their full internal name.
16 Substantial INCOMPATIBILITY concerning low-level syntax declarations
17 and translations (translation rules and translation functions in ML).
18 Some hints on upgrading:
20 - Many existing uses of 'syntax' and 'translations' can be replaced
21 by more modern 'type_notation', 'notation' and 'abbreviation',
22 which are independent of this issue.
24 - 'translations' require markup within the AST; the term syntax
25 provides the following special forms:
27 CONST c -- produces syntax version of constant c from context
28 XCONST c -- literally c, checked as constant from context
29 c -- literally c, if declared by 'syntax'
31 Plain identifiers are treated as AST variables -- occasionally the
32 system indicates accidental variables via the error "rhs contains
35 Type classes and type constructors are marked according to their
36 concrete syntax. Some old translations rules need to be written
37 for the "type" category, using type constructor application
38 instead of pseudo-term application of the default category
41 - 'parse_translation' etc. in ML may use the following
44 @{class_syntax c} -- type class c within parse tree / AST
45 @{term_syntax c} -- type constructor c within parse tree / AST
46 @{const_syntax c} -- ML version of "CONST c" above
47 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
49 - Literal types within 'typed_print_translations', i.e. those *not*
50 represented as pseudo-terms are represented verbatim. Use @{class
51 c} or @{type_name c} here instead of the above syntax
54 Note that old non-authentic syntax was based on unqualified base
55 names, so all of the above "constant" names would coincide. Recall
56 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
57 diagnose syntax problems.
59 * Type constructors admit general mixfix syntax, not just infix.
61 * Concrete syntax may be attached to local entities without a proof
62 body, too. This works via regular mixfix annotations for 'fix',
63 'def', 'obtain' etc. or via the explicit 'write' command, which is
64 similar to the 'notation' command in theory specifications.
66 * Discontinued unnamed infix syntax (legacy feature for many years) --
67 need to specify constant name and syntax separately. Internal ML
68 datatype constructors have been renamed from InfixName to Infix etc.
69 Minor INCOMPATIBILITY.
71 * Schematic theorem statements need to be explicitly markup as such,
72 via commands 'schematic_lemma', 'schematic_theorem',
73 'schematic_corollary'. Thus the relevance of the proof is made
74 syntactically clear, which impacts performance in a parallel or
75 asynchronous interactive environment. Minor INCOMPATIBILITY.
77 * Use of cumulative prems via "!" in some proof methods has been
78 discontinued (old legacy feature).
80 * References 'trace_simp' and 'debug_simp' have been replaced by
81 configuration options stored in the context. Enabling tracing (the
82 case of debugging is similar) in proofs works via
84 using [[trace_simp = true]]
86 Tracing is then active for all invocations of the simplifier in
87 subsequent goal refinement steps. Tracing may also still be enabled or
88 disabled via the ProofGeneral settings menu.
90 * Separate commands 'hide_class', 'hide_type', 'hide_const',
91 'hide_fact' replace the former 'hide' KIND command. Minor
94 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
95 more efficient than combinations with -q1 or -q2.
100 * Proofterms record type-class reasoning explicitly, using the
101 "unconstrain" operation internally. This eliminates all sort
102 constraints from a theorem and proof, introducing explicit
103 OFCLASS-premises. On the proof term level, this operation is
104 automatically applied at theorem boundaries, such that closed proofs
105 are always free of sort constraints. INCOMPATIBILITY for tools that
108 * Local theory specifications may depend on extra type variables that
109 are not present in the result type -- arguments TYPE('a) :: 'a itself
110 are added internally. For example:
112 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
114 * Predicates of locales introduced by classes carry a mandatory
115 "class" prefix. INCOMPATIBILITY.
117 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
119 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
122 * Command 'code_reflect' allows to incorporate generated ML code into
123 runtime environment; replaces immature code_datatype antiquotation.
126 * Code generator: simple concept for abstract datatypes obeying
129 * Code generator: details of internal data cache have no impact on the
130 user space functionality any longer.
132 * Methods "unfold_locales" and "intro_locales" ignore non-locale
133 subgoals. This is more appropriate for interpretations with 'where'.
136 * Command 'example_proof' opens an empty proof body. This allows to
137 experiment with Isar, without producing any persistent result.
139 * Commands 'type_notation' and 'no_type_notation' declare type syntax
140 within a local theory context, with explicit checking of the
141 constructors involved (in contrast to the raw 'syntax' versions).
143 * Commands 'types' and 'typedecl' now work within a local theory
144 context -- without introducing dependencies on parameters or
145 assumptions, which is not possible in Isabelle/Pure.
147 * Command 'defaultsort' has been renamed to 'default_sort', it works
148 within a local theory context. Minor INCOMPATIBILITY.
153 * Command 'typedef' now works within a local theory context -- without
154 introducing dependencies on parameters or assumptions, which is not
155 possible in Isabelle/Pure/HOL. Note that the logical environment may
156 contain multiple interpretations of local typedefs (with different
157 non-emptiness proofs), even in a global theory context.
159 * New package for quotient types. Commands 'quotient_type' and
160 'quotient_definition' may be used for defining types and constants by
161 quotient constructions. An example is the type of integers created by
162 quotienting pairs of natural numbers:
165 intrel :: "(nat * nat) => (nat * nat) => bool"
167 "intrel (x, y) (u, v) = (x + v = u + y)"
169 quotient_type int = "nat × nat" / intrel
170 by (auto simp add: equivp_def expand_fun_eq)
173 "0::int" is "(0::nat, 0::nat)"
175 The method "lifting" can be used to lift of theorems from the
176 underlying "raw" type to the quotient type. The example
177 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
178 construction and provides a reasoning infrastructure for finite sets.
180 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
181 clash with new theory Quotient in Main HOL.
183 * Moved the SMT binding into the main HOL session, eliminating
184 separate HOL-SMT session.
186 * List membership infix mem operation is only an input abbreviation.
189 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
190 for future developements; former Library/Word.thy is still present in
191 the AFP entry RSAPPS.
193 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
194 longer shadowed. INCOMPATIBILITY.
196 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
199 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
202 * Dropped normalizing_semiring etc; use the facts in semiring classes
203 instead. INCOMPATIBILITY.
205 * Dropped several real-specific versions of lemmas about floor and
206 ceiling; use the generic lemmas from theory "Archimedean_Field"
207 instead. INCOMPATIBILITY.
209 floor_number_of_eq ~> floor_number_of
210 le_floor_eq_number_of ~> number_of_le_floor
211 le_floor_eq_zero ~> zero_le_floor
212 le_floor_eq_one ~> one_le_floor
213 floor_less_eq_number_of ~> floor_less_number_of
214 floor_less_eq_zero ~> floor_less_zero
215 floor_less_eq_one ~> floor_less_one
216 less_floor_eq_number_of ~> number_of_less_floor
217 less_floor_eq_zero ~> zero_less_floor
218 less_floor_eq_one ~> one_less_floor
219 floor_le_eq_number_of ~> floor_le_number_of
220 floor_le_eq_zero ~> floor_le_zero
221 floor_le_eq_one ~> floor_le_one
222 floor_subtract_number_of ~> floor_diff_number_of
223 floor_subtract_one ~> floor_diff_one
224 ceiling_number_of_eq ~> ceiling_number_of
225 ceiling_le_eq_number_of ~> ceiling_le_number_of
226 ceiling_le_zero_eq ~> ceiling_le_zero
227 ceiling_le_eq_one ~> ceiling_le_one
228 less_ceiling_eq_number_of ~> number_of_less_ceiling
229 less_ceiling_eq_zero ~> zero_less_ceiling
230 less_ceiling_eq_one ~> one_less_ceiling
231 ceiling_less_eq_number_of ~> ceiling_less_number_of
232 ceiling_less_eq_zero ~> ceiling_less_zero
233 ceiling_less_eq_one ~> ceiling_less_one
234 le_ceiling_eq_number_of ~> number_of_le_ceiling
235 le_ceiling_eq_zero ~> zero_le_ceiling
236 le_ceiling_eq_one ~> one_le_ceiling
237 ceiling_subtract_number_of ~> ceiling_diff_number_of
238 ceiling_subtract_one ~> ceiling_diff_one
240 * Theory "Finite_Set": various folding_XXX locales facilitate the
241 application of the various fold combinators on finite sets.
243 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
244 provides abstract red-black tree type which is backed by "RBT_Impl" as
245 implementation. INCOMPATIBILTY.
247 * Theory Library/Coinductive_List has been removed -- superseded by
248 AFP/thys/Coinductive.
250 * Theory PReal, including the type "preal" and related operations, has
251 been removed. INCOMPATIBILITY.
253 * Split off theory "Big_Operators" containing setsum, setprod,
254 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
256 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
257 "Int" etc. INCOMPATIBILITY.
259 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
261 * New set of rules "ac_simps" provides combined assoc / commute
262 rewrites for all interpretations of the appropriate generic locales.
264 * Renamed theory "OrderedGroup" to "Groups" and split theory
265 "Ring_and_Field" into theories "Rings" and "Fields"; for more
266 appropriate and more consistent names suitable for name prefixes
267 within the HOL theories. INCOMPATIBILITY.
269 * Some generic constants have been put to appropriate theories:
270 - less_eq, less: Orderings
271 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
272 - inverse, divide: Rings
275 * More consistent naming of type classes involving orderings (and
278 lower_semilattice ~> semilattice_inf
279 upper_semilattice ~> semilattice_sup
281 dense_linear_order ~> dense_linorder
283 pordered_ab_group_add ~> ordered_ab_group_add
284 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
285 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
286 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
287 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
288 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
289 pordered_cancel_semiring ~> ordered_cancel_semiring
290 pordered_comm_monoid_add ~> ordered_comm_monoid_add
291 pordered_comm_ring ~> ordered_comm_ring
292 pordered_comm_semiring ~> ordered_comm_semiring
293 pordered_ring ~> ordered_ring
294 pordered_ring_abs ~> ordered_ring_abs
295 pordered_semiring ~> ordered_semiring
297 ordered_ab_group_add ~> linordered_ab_group_add
298 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
299 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
300 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
301 ordered_field ~> linordered_field
302 ordered_field_no_lb ~> linordered_field_no_lb
303 ordered_field_no_ub ~> linordered_field_no_ub
304 ordered_field_dense_linear_order ~> dense_linordered_field
305 ordered_idom ~> linordered_idom
306 ordered_ring ~> linordered_ring
307 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
308 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
309 ordered_ring_strict ~> linordered_ring_strict
310 ordered_semidom ~> linordered_semidom
311 ordered_semiring ~> linordered_semiring
312 ordered_semiring_1 ~> linordered_semiring_1
313 ordered_semiring_1_strict ~> linordered_semiring_1_strict
314 ordered_semiring_strict ~> linordered_semiring_strict
316 The following slightly odd type classes have been moved to a
317 separate theory Library/Lattice_Algebras:
319 lordered_ab_group_add ~> lattice_ab_group_add
320 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
321 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
322 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
323 lordered_ring ~> lattice_ring
327 * Refined field classes:
328 - classes division_ring_inverse_zero, field_inverse_zero,
329 linordered_field_inverse_zero include rule inverse 0 = 0 --
330 subsumes former division_by_zero class;
331 - numerous lemmas have been ported from field to division_ring.
334 * Refined algebra theorem collections:
335 - dropped theorem group group_simps, use algebra_simps instead;
336 - dropped theorem group ring_simps, use field_simps instead;
337 - proper theorem collection field_simps subsumes former theorem
338 groups field_eq_simps and field_simps;
339 - dropped lemma eq_minus_self_iff which is a duplicate for
343 * Theory Finite_Set and List: some lemmas have been generalized from
346 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
347 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
348 inter_Inter_fold_inter ~> inf_Inf_fold_inf
349 union_Union_fold_union ~> sup_Sup_fold_sup
350 Inter_fold_inter ~> Inf_fold_inf
351 Union_fold_union ~> Sup_fold_sup
352 inter_INTER_fold_inter ~> inf_INFI_fold_inf
353 union_UNION_fold_union ~> sup_SUPR_fold_sup
354 INTER_fold_inter ~> INFI_fold_inf
355 UNION_fold_union ~> SUPR_fold_sup
357 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
358 replaced by the more convenient lemmas Inf_empty and Sup_empty.
359 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
360 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
361 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
362 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
364 * Reorganized theory Multiset: swapped notation of pointwise and
367 - pointwise ordering is instance of class order with standard syntax
369 - multiset ordering has syntax <=# and <#; partial order properties
370 are provided by means of interpretation with prefix
372 - less duplication, less historical organization of sections,
373 conversion from associations lists to multisets, rudimentary code
375 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
380 multiset_eq_conv_count_eq ~> multiset_ext_iff
381 multi_count_ext ~> multiset_ext
382 diff_union_inverse2 ~> diff_union_cancelR
386 * Theory Permutation: replaced local "remove" by List.remove1.
388 * Code generation: ML and OCaml code is decorated with signatures.
390 * Theory List: added transpose.
392 * Library/Nat_Bijection.thy is a collection of bijective functions
393 between nat and other types, which supersedes the older libraries
394 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
397 Nat_Int_Bij.nat2_to_nat ~> prod_encode
398 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
399 Nat_Int_Bij.int_to_nat_bij ~> int_encode
400 Nat_Int_Bij.nat_to_int_bij ~> int_decode
401 Countable.pair_encode ~> prod_encode
402 NatIso.prod2nat ~> prod_encode
403 NatIso.nat2prod ~> prod_decode
404 NatIso.sum2nat ~> sum_encode
405 NatIso.nat2sum ~> sum_decode
406 NatIso.list2nat ~> list_encode
407 NatIso.nat2list ~> list_decode
408 NatIso.set2nat ~> set_encode
409 NatIso.nat2set ~> set_decode
412 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
413 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
414 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
415 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
416 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
417 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
418 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
419 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
420 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
421 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
422 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
423 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
424 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
427 - Renamed ATP commands:
428 atp_info ~> sledgehammer running_atps
429 atp_kill ~> sledgehammer kill_atps
430 atp_messages ~> sledgehammer messages
431 atp_minimize ~> sledgehammer minimize
432 print_atps ~> sledgehammer available_atps
434 - Added user's manual ("isabelle doc sledgehammer").
435 - Added option syntax and "sledgehammer_params" to customize
436 Sledgehammer's behavior. See the manual for details.
437 - Modified the Isar proof reconstruction code so that it produces
438 direct proofs rather than proofs by contradiction. (This feature
439 is still experimental.)
440 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
442 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
445 - Added and implemented "binary_ints" and "bits" options.
446 - Added "std" option and implemented support for nonstandard models.
447 - Added and implemented "finitize" option to improve the precision
448 of infinite datatypes based on a monotonicity analysis.
449 - Added support for quotient types.
450 - Added support for "specification" and "ax_specification"
452 - Added support for local definitions (for "function" and
453 "termination" proofs).
454 - Added support for term postprocessors.
455 - Optimized "Multiset.multiset" and "FinFun.finfun".
456 - Improved efficiency of "destroy_constrs" optimization.
457 - Fixed soundness bugs related to "destroy_constrs" optimization and
459 - Fixed soundness bug related to higher-order constructors.
460 - Fixed soundness bug when "full_descrs" is enabled.
461 - Improved precision of set constructs.
462 - Added "atoms" option.
463 - Added cache to speed up repeated Kodkod invocations on the same
465 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
466 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
467 "SAT4J_Light". INCOMPATIBILITY.
468 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
469 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
470 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
472 * Method "induct" now takes instantiations of the form t, where t is not
473 a variable, as a shorthand for "x == t", where x is a fresh variable.
474 If this is not intended, t has to be enclosed in parentheses.
475 By default, the equalities generated by definitional instantiations
476 are pre-simplified, which may cause parameters of inductive cases
477 to disappear, or may even delete some of the inductive cases.
478 Use "induct (no_simp)" instead of "induct" to restore the old
479 behaviour. The (no_simp) option is also understood by the "cases"
480 and "nominal_induct" methods, which now perform pre-simplification, too.
486 * Variable names in lemmas generated by the domain package have
487 changed; the naming scheme is now consistent with the HOL datatype
488 package. Some proof scripts may be affected, INCOMPATIBILITY.
490 * The domain package no longer defines the function "foo_copy" for
491 recursive domain "foo". The reach lemma is now stated directly in
492 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
493 be reformulated in terms of "foo_take", INCOMPATIBILITY.
495 * Most definedness lemmas generated by the domain package (previously
496 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
497 like "foo$x = UU <-> x = UU", which works better as a simp rule.
498 Proofs that used definedness lemmas as intro rules may break,
499 potential INCOMPATIBILITY.
501 * Induction and casedist rules generated by the domain package now
502 declare proper case_names (one called "bottom", and one named for each
503 constructor). INCOMPATIBILITY.
505 * For mutually-recursive domains, separate "reach" and "take_lemma"
506 rules are generated for each domain, INCOMPATIBILITY.
508 foo_bar.reach ~> foo.reach bar.reach
509 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
511 * Some lemmas generated by the domain package have been renamed for
512 consistency with the datatype package, INCOMPATIBILITY.
514 foo.ind ~> foo.induct
515 foo.finite_ind ~> foo.finite_induct
516 foo.coind ~> foo.coinduct
517 foo.casedist ~> foo.exhaust
518 foo.exhaust ~> foo.nchotomy
520 * For consistency with other definition packages, the fixrec package
521 now generates qualified theorem names, INCOMPATIBILITY.
523 foo_simps ~> foo.simps
524 foo_unfold ~> foo.unfold
525 foo_induct ~> foo.induct
527 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
528 method and internal fixrec proofs now use the default simpset instead.
531 * The "contlub" predicate has been removed. Proof scripts should use
532 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
534 * The "admw" predicate has been removed, INCOMPATIBILITY.
536 * The constants cpair, cfst, and csnd have been removed in favor of
537 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
542 * Antiquotations for basic formal entities:
544 @{class NAME} -- type class
545 @{class_syntax NAME} -- syntax representation of the above
547 @{type_name NAME} -- logical type
548 @{type_abbrev NAME} -- type abbreviation
549 @{nonterminal NAME} -- type of concrete syntactic category
550 @{type_syntax NAME} -- syntax representation of any of the above
552 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
553 @{const_abbrev NAME} -- abbreviated constant
554 @{const_syntax NAME} -- syntax representation of any of the above
556 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
557 syntax constant (cf. 'syntax' command).
559 * Antiquotation @{make_string} inlines a function to print arbitrary
560 values similar to the ML toplevel. The result is compiler dependent
561 and may fall back on "?" in certain situations.
563 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
564 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
565 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
566 not work with the asynchronous Isar document model.
568 * Configuration options now admit dynamic default values, depending on
569 the context or even global references.
571 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
572 uses an efficient external library if available (for Poly/ML).
574 * Renamed some important ML structures, while keeping the old names
575 for some time as aliases within the structure Legacy:
577 OuterKeyword ~> Keyword
580 OuterSyntax ~> Outer_Syntax
581 PrintMode ~> Print_Mode
582 SpecParse ~> Parse_Spec
585 ThyOutput ~> Thy_Output
586 TypeInfer ~> Type_Infer
588 Note that "open Legacy" simplifies porting of sources, but forgetting
589 to remove it again will complicate porting again in the future.
591 * Most operations that refer to a global context are named
592 accordingly, e.g. Simplifier.global_context or
593 ProofContext.init_global. There are some situations where a global
594 context actually works, but under normal circumstances one needs to
595 pass the proper local context through the code!
597 * Discontinued old TheoryDataFun with its copy/init operation -- data
598 needs to be pure. Functor Theory_Data_PP retains the traditional
599 Pretty.pp argument to merge, which is absent in the standard
602 * Sorts.certify_sort and derived "cert" operations for types and terms
603 no longer minimize sorts. Thus certification at the boundary of the
604 inference kernel becomes invariant under addition of class relations,
605 which is an important monotonicity principle. Sorts are now minimized
606 in the syntax layer only, at the boundary between the end-user and the
607 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
608 explicitly in rare situations.
610 * Renamed old-style Drule.standard to Drule.export_without_context, to
611 emphasize that this is in no way a standard operation.
614 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
615 usual for resolution. Rare INCOMPATIBILITY.
617 * Renamed varify/unvarify operations to varify_global/unvarify_global
618 to emphasize that these only work in a global situation (which is
621 * Curried take and drop in library.ML; negative length is interpreted
622 as infinity (as in chop). Subtle INCOMPATIBILITY.
624 * Proof terms: type substitutions on proof constants now use canonical
625 order of type variables. INCOMPATIBILITY for tools working with proof
628 * Raw axioms/defs may no longer carry sort constraints, and raw defs
629 may no longer carry premises. User-level specifications are
630 transformed accordingly by Thm.add_axiom/add_def.
635 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
636 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
637 proof terms are enabled unconditionally in the new HOL-Proofs image.
639 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
640 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
643 * Old lib/scripts/polyml-platform is superseded by the
644 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
645 variant, even on a 64 bit machine. The following example setting
646 prefers 64 bit if available:
648 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
650 * The preliminary Isabelle/jEdit application demonstrates the emerging
651 Isabelle/Scala layer for advanced prover interaction and integration.
652 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
657 New in Isabelle2009-1 (December 2009)
658 -------------------------------------
662 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
663 one backslash should be used, even in ML sources.
668 * Locale interpretation propagates mixins along the locale hierarchy.
669 The currently only available mixins are the equations used to map
670 local definitions to terms of the target domain of an interpretation.
672 * Reactivated diagnostic command 'print_interps'. Use "print_interps
673 loc" to print all interpretations of locale "loc" in the theory.
674 Interpretations in proofs are not shown.
676 * Thoroughly revised locales tutorial. New section on conditional
679 * On instantiation of classes, remaining undefined class parameters
680 are formally declared. INCOMPATIBILITY.
683 *** Document preparation ***
685 * New generalized style concept for printing terms: @{foo (style) ...}
686 instead of @{foo_style style ...} (old form is still retained for
687 backward compatibility). Styles can be also applied for
688 antiquotations prop, term_type and typeof.
693 * New proof method "smt" for a combination of first-order logic with
694 equality, linear and nonlinear (natural/integer/real) arithmetic, and
695 fixed-size bitvectors; there is also basic support for higher-order
696 features (esp. lambda abstractions). It is an incomplete decision
697 procedure based on external SMT solvers using the oracle mechanism;
698 for the SMT solver Z3, this method is proof-producing. Certificates
699 are provided to avoid calling the external solvers solely for
700 re-checking proofs. Due to a remote SMT service there is no need for
701 installing SMT solvers locally. See src/HOL/SMT.
703 * New commands to load and prove verification conditions generated by
704 the Boogie program verifier or derived systems (e.g. the Verifying C
705 Compiler (VCC) or Spec#). See src/HOL/Boogie.
707 * New counterexample generator tool 'nitpick' based on the Kodkod
708 relational model finder. See src/HOL/Tools/Nitpick and
709 src/HOL/Nitpick_Examples.
711 * New commands 'code_pred' and 'values' to invoke the predicate
712 compiler and to enumerate values of inductive predicates.
714 * A tabled implementation of the reflexive transitive closure.
716 * New implementation of quickcheck uses generic code generator;
717 default generators are provided for all suitable HOL types, records
718 and datatypes. Old quickcheck can be re-activated importing theory
719 Library/SML_Quickcheck.
721 * New testing tool Mirabelle for automated proof tools. Applies
722 several tools and tactics like sledgehammer, metis, or quickcheck, to
723 every proof step in a theory. To be used in batch mode via the
726 * New proof method "sos" (sum of squares) for nonlinear real
727 arithmetic (originally due to John Harison). It requires theory
728 Library/Sum_Of_Squares. It is not a complete decision procedure but
729 works well in practice on quantifier-free real arithmetic with +, -,
730 *, ^, =, <= and <, i.e. boolean combinations of equalities and
731 inequalities between polynomials. It makes use of external
732 semidefinite programming solvers. Method "sos" generates a
733 certificate that can be pasted into the proof thus avoiding the need
734 to call an external tool every time the proof is checked. See
735 src/HOL/Library/Sum_Of_Squares.
737 * New method "linarith" invokes existing linear arithmetic decision
740 * New command 'atp_minimal' reduces result produced by Sledgehammer.
742 * New Sledgehammer option "Full Types" in Proof General settings menu.
743 Causes full type information to be output to the ATPs. This slows
744 ATPs down considerably but eliminates a source of unsound "proofs"
747 * New method "metisFT": A version of metis that uses full type
748 information in order to avoid failures of proof reconstruction.
750 * New evaluator "approximate" approximates an real valued term using
751 the same method as the approximation method.
753 * Method "approximate" now supports arithmetic expressions as
754 boundaries of intervals and implements interval splitting and Taylor
757 * ML antiquotation @{code_datatype} inserts definition of a datatype
758 generated by the code generator; e.g. see src/HOL/Predicate.thy.
760 * New theory SupInf of the supremum and infimum operators for sets of
763 * New theory Probability, which contains a development of measure
764 theory, eventually leading to Lebesgue integration and probability.
766 * Extended Multivariate Analysis to include derivation and Brouwer's
769 * Reorganization of number theory, INCOMPATIBILITY:
770 - new number theory development for nat and int, in theories Divides
771 and GCD as well as in new session Number_Theory
772 - some constants and facts now suffixed with _nat and _int
774 - former session NumberTheory now named Old_Number_Theory, including
775 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
776 - moved theory Pocklington from src/HOL/Library to
777 src/HOL/Old_Number_Theory
779 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
780 lcm of finite and infinite sets. It is shown that they form a complete
783 * Class semiring_div requires superclass no_zero_divisors and proof of
784 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
785 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
786 generalized to class semiring_div, subsuming former theorems
787 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
788 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
791 * Refinements to lattice classes and sets:
792 - less default intro/elim rules in locale variant, more default
793 intro/elim rules in class variant: more uniformity
794 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
796 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
798 - renamed ACI to inf_sup_aci
799 - new class "boolean_algebra"
800 - class "complete_lattice" moved to separate theory
801 "Complete_Lattice"; corresponding constants (and abbreviations)
802 renamed and with authentic syntax:
803 Set.Inf ~> Complete_Lattice.Inf
804 Set.Sup ~> Complete_Lattice.Sup
805 Set.INFI ~> Complete_Lattice.INFI
806 Set.SUPR ~> Complete_Lattice.SUPR
807 Set.Inter ~> Complete_Lattice.Inter
808 Set.Union ~> Complete_Lattice.Union
809 Set.INTER ~> Complete_Lattice.INTER
810 Set.UNION ~> Complete_Lattice.UNION
811 - authentic syntax for
814 - mere abbreviations:
817 Set.inter (for inf, formerly Set.Int)
818 Set.union (for sup, formerly Set.Un)
819 Complete_Lattice.Inter (for Inf)
820 Complete_Lattice.Union (for Sup)
821 Complete_Lattice.INTER (for INFI)
822 Complete_Lattice.UNION (for SUPR)
823 - object-logic definitions as far as appropriate
825 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
826 Un_subset_iff are explicitly deleted as default simp rules; then also
827 their lattice counterparts le_inf_iff and le_sup_iff have to be
828 deleted to achieve the desired effect.
830 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
831 rules by default any longer; the same applies to min_max.inf_absorb1
832 etc. INCOMPATIBILITY.
834 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
835 pred_set_conv by default. INCOMPATIBILITY.
837 * Power operations on relations and functions are now one dedicated
838 constant "compow" with infix syntax "^^". Power operation on
839 multiplicative monoids retains syntax "^" and is now defined generic
840 in class power. INCOMPATIBILITY.
842 * Relation composition "R O S" now has a more standard argument order:
843 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
844 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
845 break, since the O_assoc rule was not rewritten like this. Fix using
846 O_assoc[symmetric]. The same applies to the curried version "R OO S".
848 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
849 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
852 * Most rules produced by inductive and datatype package have mandatory
853 prefixes. INCOMPATIBILITY.
855 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
856 the attribute of the same name. Each of the theorems in the list
857 DERIV_intros assumes composition with an additional function and
858 matches a variable to the derivative, which has to be solved by the
859 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
860 of most elementary terms. Former Maclauren.DERIV_tac and
861 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
864 * Code generator attributes follow the usual underscore convention:
865 code_unfold replaces code unfold
866 code_post replaces code post
871 sizechange -> size_change
872 induct_scheme -> induction_schema
875 * Discontinued abbreviation "arbitrary" of constant "undefined".
876 INCOMPATIBILITY, use "undefined" directly.
879 Suc_eq_add_numeral_1 -> Suc_eq_plus1
880 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
881 Suc_plus1 -> Suc_eq_plus1
882 *anti_sym -> *antisym*
883 vector_less_eq_def -> vector_le_def
886 * Added theorem List.map_map as [simp]. Removed List.map_compose.
889 * Removed predicate "M hassize n" (<--> card M = n & finite M).
895 * Theory Representable defines a class "rep" of domains that are
896 representable (via an ep-pair) in the universal domain type "udom".
897 Instances are provided for all type constructors defined in HOLCF.
899 * The 'new_domain' command is a purely definitional version of the
900 domain package, for representable domains. Syntax is identical to the
901 old domain package. The 'new_domain' package also supports indirect
902 recursion using previously-defined type constructors. See
903 src/HOLCF/ex/New_Domain.thy for examples.
905 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
906 on the left-hand side of an equation, and then performs
907 simplification. Rewriting is done using rules declared with the
908 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
909 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
911 * The pattern-match compiler in 'fixrec' can now handle constructors
912 with HOL function types. Pattern-match combinators for the Pair
913 constructor are pre-configured.
915 * The 'fixrec' package now produces better fixed-point induction rules
916 for mutually-recursive definitions: Induction rules have conclusions
917 of the form "P foo bar" instead of "P <foo, bar>".
919 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
920 been renamed to "below". The name "below" now replaces "less" in many
921 theorem names. (Legacy theorem names using "less" are still supported
924 * The 'fixrec' package now supports "bottom patterns". Bottom
925 patterns can be used to generate strictness rules, or to make
926 functions more strict (much like the bang-patterns supported by the
927 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
933 * Support for Poly/ML 5.3.0, with improved reporting of compiler
934 errors and run-time exceptions, including detailed source positions.
936 * Structure Name_Space (formerly NameSpace) now manages uniquely
937 identified entries, with some additional information such as source
938 position, logical grouping etc.
940 * Theory and context data is now introduced by the simplified and
941 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
942 to be pure, but the old TheoryDataFun for mutable data (with explicit
943 copy operation) is still available for some time.
945 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
946 provides a high-level programming interface to synchronized state
947 variables with atomic update. This works via pure function
948 application within a critical section -- its runtime should be as
949 short as possible; beware of deadlocks if critical code is nested,
950 either directly or indirectly via other synchronized variables!
952 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
953 wraps raw ML references, explicitly indicating their non-thread-safe
954 behaviour. The Isar toplevel keeps this structure open, to
955 accommodate Proof General as well as quick and dirty interactive
956 experiments with references.
958 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
959 parallel tactical reasoning.
961 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
962 are similar to SUBPROOF, but are slightly more flexible: only the
963 specified parts of the subgoal are imported into the context, and the
964 body tactic may introduce new subgoals and schematic variables.
966 * Old tactical METAHYPS, which does not observe the proof context, has
967 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
968 or Subgoal.FOCUS etc.
970 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
971 functors have their own ML name space there is no point to mark them
972 separately.) Minor INCOMPATIBILITY.
974 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
976 * Renamed several structures FooBar to Foo_Bar. Occasional,
979 * Operations of structure Skip_Proof no longer require quick_and_dirty
980 mode, which avoids critical setmp.
982 * Eliminated old Attrib.add_attributes, Method.add_methods and related
983 combinators for "args". INCOMPATIBILITY, need to use simplified
984 Attrib/Method.setup introduced in Isabelle2009.
986 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
987 back on global_simpset_of, global_claset_of, global_clasimpset_of as
988 last resort. INCOMPATIBILITY.
990 * Display.pretty_thm now requires a proper context (cf. former
991 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
992 or even Display.pretty_thm_without_context as last resort.
995 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
996 Syntax.pretty_typ/term directly, preferably with proper context
997 instead of global theory.
1002 * Further fine tuning of parallel proof checking, scales up to 8 cores
1003 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1006 * Support for additional "Isabelle components" via etc/components, see
1007 also the system manual.
1009 * The isabelle makeall tool now operates on all components with
1010 IsaMakefile, not just hardwired "logics".
1012 * Removed "compress" option from isabelle-process and isabelle usedir;
1013 this is always enabled.
1015 * Discontinued support for Poly/ML 4.x versions.
1017 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1018 on a given logic image. This requires the lighttpd webserver and is
1019 currently supported on Linux only.
1023 New in Isabelle2009 (April 2009)
1024 --------------------------------
1028 * Simplified main Isabelle executables, with less surprises on
1029 case-insensitive file-systems (such as Mac OS).
1031 - The main Isabelle tool wrapper is now called "isabelle" instead of
1034 - The former "isabelle" alias for "isabelle-process" has been
1035 removed (should rarely occur to regular users).
1037 - The former "isabelle-interface" and its alias "Isabelle" have been
1038 removed (interfaces are now regular Isabelle tools).
1040 Within scripts and make files, the Isabelle environment variables
1041 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1042 respectively. (The latter are still available as legacy feature.)
1044 The old isabelle-interface wrapper could react in confusing ways if
1045 the interface was uninstalled or changed otherwise. Individual
1046 interface tool configuration is now more explicit, see also the
1047 Isabelle system manual. In particular, Proof General is now available
1048 via "isabelle emacs".
1050 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1051 purge installed copies of Isabelle executables and re-run "isabelle
1052 install -p ...", or use symlinks.
1054 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1055 old ~/isabelle, which was slightly non-standard and apt to cause
1056 surprises on case-insensitive file-systems (such as Mac OS).
1058 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1059 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1060 care is required when using older releases of Isabelle. Note that
1061 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1062 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1064 * Proofs of fully specified statements are run in parallel on
1065 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1066 a regular 4-core machine, if the initial heap space is made reasonably
1067 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1069 * The main reference manuals ("isar-ref", "implementation", and
1070 "system") have been updated and extended. Formally checked references
1071 as hyperlinks are now available uniformly.
1076 * Complete re-implementation of locales. INCOMPATIBILITY in several
1077 respects. The most important changes are listed below. See the
1078 Tutorial on Locales ("locales" manual) for details.
1080 - In locale expressions, instantiation replaces renaming. Parameters
1081 must be declared in a for clause. To aid compatibility with previous
1082 parameter inheritance, in locale declarations, parameters that are not
1083 'touched' (instantiation position "_" or omitted) are implicitly added
1084 with their syntax at the beginning of the for clause.
1086 - Syntax from abbreviations and definitions in locales is available in
1087 locale expressions and context elements. The latter is particularly
1088 useful in locale declarations.
1090 - More flexible mechanisms to qualify names generated by locale
1091 expressions. Qualifiers (prefixes) may be specified in locale
1092 expressions, and can be marked as mandatory (syntax: "name!:") or
1093 optional (syntax "name?:"). The default depends for plain "name:"
1094 depends on the situation where a locale expression is used: in
1095 commands 'locale' and 'sublocale' prefixes are optional, in
1096 'interpretation' and 'interpret' prefixes are mandatory. The old
1097 implicit qualifiers derived from the parameter names of a locale are
1098 no longer generated.
1100 - Command "sublocale l < e" replaces "interpretation l < e". The
1101 instantiation clause in "interpretation" and "interpret" (square
1102 brackets) is no longer available. Use locale expressions.
1104 - When converting proof scripts, mandatory qualifiers in
1105 'interpretation' and 'interpret' should be retained by default, even
1106 if this is an INCOMPATIBILITY compared to former behavior. In the
1107 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1108 in locale expressions range over a single locale instance only.
1110 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1111 In existing theorem specifications replace the includes element by the
1112 respective context elements of the included locale, omitting those
1113 that are already present in the theorem specification. Multiple
1114 assume elements of a locale should be replaced by a single one
1115 involving the locale predicate. In the proof body, declarations (most
1116 notably theorems) may be regained by interpreting the respective
1117 locales in the proof context as required (command "interpret").
1119 If using "includes" in replacement of a target solely because the
1120 parameter types in the theorem are not as general as in the target,
1121 consider declaring a new locale with additional type constraints on
1122 the parameters (context element "constrains").
1124 - Discontinued "locale (open)". INCOMPATIBILITY.
1126 - Locale interpretation commands no longer attempt to simplify goal.
1127 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1128 methods intro_locales and unfold_locales to clarify.
1130 - Locale interpretation commands no longer accept interpretation
1131 attributes. INCOMPATIBILITY.
1133 * Class declaration: so-called "base sort" must not be given in import
1134 list any longer, but is inferred from the specification. Particularly
1141 class foo = type + ...
1143 * Class target: global versions of theorems stemming do not carry a
1144 parameter prefix any longer. INCOMPATIBILITY.
1146 * Class 'instance' command no longer accepts attached definitions.
1147 INCOMPATIBILITY, use proper 'instantiation' target instead.
1149 * Recovered hiding of consts, which was accidentally broken in
1150 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1151 makes c inaccessible; consider using ``hide (open) const c'' instead.
1153 * Slightly more coherent Pure syntax, with updated documentation in
1154 isar-ref manual. Removed locales meta_term_syntax and
1155 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1156 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1157 directly in regular applications.
1159 * There is a new syntactic category "float_const" for signed decimal
1160 fractions (e.g. 123.45 or -123.45).
1162 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1163 interface with 'setup' command instead.
1165 * Command 'local_setup' is similar to 'setup', but operates on a local
1168 * The 'axiomatization' command now only works within a global theory
1169 context. INCOMPATIBILITY.
1171 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1172 hypotheses. Sorts required in the course of reasoning need to be
1173 covered by the constraints in the initial statement, completed by the
1174 type instance information of the background theory. Non-trivial sort
1175 hypotheses, which rarely occur in practice, may be specified via
1176 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1178 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1180 The result contains an implicit sort hypotheses as before --
1181 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1184 * Generalized Isar history, with support for linear undo, direct state
1187 * Changed defaults for unify configuration options:
1189 unify_trace_bound = 50 (formerly 25)
1190 unify_search_bound = 60 (formerly 30)
1192 * Different bookkeeping for code equations (INCOMPATIBILITY):
1194 a) On theory merge, the last set of code equations for a particular
1195 constant is taken (in accordance with the policy applied by other
1196 parts of the code generator framework).
1198 b) Code equations stemming from explicit declarations (e.g. code
1199 attribute) gain priority over default code equations stemming
1200 from definition, primrec, fun etc.
1202 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1204 * Unified theorem tables for both code generators. Thus [code
1205 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1207 * Command 'find_consts' searches for constants based on type and name
1210 find_consts "_ => bool"
1212 By default, matching is against subtypes, but it may be restricted to
1213 the whole type. Searching by name is possible. Multiple queries are
1214 conjunctive and queries may be negated by prefixing them with a
1217 find_consts strict: "_ => bool" name: "Int" -"int => int"
1219 * New 'find_theorems' criterion "solves" matches theorems that
1220 directly solve the current goal (modulo higher-order unification).
1222 * Auto solve feature for main theorem statements: whenever a new goal
1223 is stated, "find_theorems solves" is called; any theorems that could
1224 solve the lemma directly are listed as part of the goal state.
1225 Cf. associated options in Proof General Isabelle settings menu,
1226 enabled by default, with reasonable timeout for pathological cases of
1227 higher-order unification.
1230 *** Document preparation ***
1232 * Antiquotation @{lemma} now imitates a regular terminal proof,
1233 demanding keyword 'by' and supporting the full method expression
1234 syntax just like the Isar command 'by'.
1239 * Integrated main parts of former image HOL-Complex with HOL. Entry
1240 points Main and Complex_Main remain as before.
1242 * Logic image HOL-Plain provides a minimal HOL with the most important
1243 tools available (inductive, datatype, primrec, ...). This facilitates
1244 experimentation and tool development. Note that user applications
1245 (and library theories) should never refer to anything below theory
1248 * Logic image HOL-Main stops at theory Main, and thus facilitates
1249 experimentation due to shorter build times.
1251 * Logic image HOL-NSA contains theories of nonstandard analysis which
1252 were previously part of former HOL-Complex. Entry point Hyperreal
1253 remains valid, but theories formerly using Complex_Main should now use
1254 new entry point Hypercomplex.
1256 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1257 Posix processes. Avoids potentially expensive forking of the ML
1258 process. New thread-based implementation also works on non-Unix
1259 platforms (Cygwin). Provers are no longer hardwired, but defined
1260 within the theory via plain ML wrapper functions. Basic Sledgehammer
1261 commands are covered in the isar-ref manual.
1263 * Wrapper scripts for remote SystemOnTPTP service allows to use
1264 sledgehammer without local ATP installation (Vampire etc.). Other
1265 provers may be included via suitable ML wrappers, see also
1266 src/HOL/ATP_Linkup.thy.
1268 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1271 * The metis method no longer fails because the theorem is too trivial
1272 (contains the empty clause).
1274 * The metis method now fails in the usual manner, rather than raising
1275 an exception, if it determines that it cannot prove the theorem.
1277 * Method "coherent" implements a prover for coherent logic (see also
1278 src/Tools/coherent.ML).
1280 * Constants "undefined" and "default" replace "arbitrary". Usually
1281 "undefined" is the right choice to replace "arbitrary", though
1282 logically there is no difference. INCOMPATIBILITY.
1284 * Command "value" now integrates different evaluation mechanisms. The
1285 result of the first successful evaluation mechanism is printed. In
1286 square brackets a particular named evaluation mechanisms may be
1287 specified (currently, [SML], [code] or [nbe]). See further
1288 src/HOL/ex/Eval_Examples.thy.
1290 * Normalization by evaluation now allows non-leftlinear equations.
1291 Declare with attribute [code nbe].
1293 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1294 as the structured Isar versions "cases" and "induct", cf. the
1295 corresponding "cases" and "induct" attributes. Mutual induction rules
1296 are now presented as a list of individual projections
1297 (e.g. foo_bar.inducts for types foo and bar); the old format with
1298 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1299 rare situations a different rule is selected --- notably nested tuple
1300 elimination instead of former prod.exhaust: use explicit (case_tac t
1301 rule: prod.exhaust) here.
1303 * Attributes "cases", "induct", "coinduct" support "del" option.
1305 * Removed fact "case_split_thm", which duplicates "case_split".
1307 * The option datatype has been moved to a new theory Option. Renamed
1308 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1310 * New predicate "strict_mono" classifies strict functions on partial
1311 orders. With strict functions on linear orders, reasoning about
1312 (in)equalities is facilitated by theorems "strict_mono_eq",
1313 "strict_mono_less_eq" and "strict_mono_less".
1315 * Some set operations are now proper qualified constants with
1316 authentic syntax. INCOMPATIBILITY:
1327 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1330 * Auxiliary class "itself" has disappeared -- classes without any
1331 parameter are treated as expected by the 'class' command.
1333 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1335 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1336 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1338 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1339 method "approximation". It proves formulas on real values by using
1340 interval arithmetic. In the formulas are also the transcendental
1341 functions sin, cos, tan, atan, ln, exp and the constant pi are
1342 allowed. For examples see
1343 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1345 * Theory "Reflection" now resides in HOL/Library.
1347 * Entry point to Word library now simply named "Word".
1350 * Made source layout more coherent with logical distribution
1353 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1354 src/HOL/Library/Code_Message.thy ~> src/HOL/
1355 src/HOL/Library/GCD.thy ~> src/HOL/
1356 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1357 src/HOL/Library/Parity.thy ~> src/HOL/
1358 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1359 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1360 src/HOL/Real/Lubs.thy ~> src/HOL/
1361 src/HOL/Real/PReal.thy ~> src/HOL/
1362 src/HOL/Real/Rational.thy ~> src/HOL/
1363 src/HOL/Real/RComplete.thy ~> src/HOL/
1364 src/HOL/Real/RealDef.thy ~> src/HOL/
1365 src/HOL/Real/RealPow.thy ~> src/HOL/
1366 src/HOL/Real/Real.thy ~> src/HOL/
1367 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1368 src/HOL/Complex/Complex.thy ~> src/HOL/
1369 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1370 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1371 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1372 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1373 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1374 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1375 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1376 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1377 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1378 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1379 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1380 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1381 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1382 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1383 src/HOL/Real/Float ~> src/HOL/Library/
1384 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1385 src/HOL/Real/RealVector.thy ~> src/HOL/
1387 src/HOL/arith_data.ML ~> src/HOL/Tools
1388 src/HOL/hologic.ML ~> src/HOL/Tools
1389 src/HOL/simpdata.ML ~> src/HOL/Tools
1390 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1391 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1392 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1393 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1394 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1395 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1396 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1398 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1399 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1400 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1401 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1402 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1403 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1405 * If methods "eval" and "evaluation" encounter a structured proof
1406 state with !!/==>, only the conclusion is evaluated to True (if
1407 possible), avoiding strange error messages.
1409 * Method "sizechange" automates termination proofs using (a
1410 modification of) the size-change principle. Requires SAT solver. See
1411 src/HOL/ex/Termination.thy for examples.
1413 * Simplifier: simproc for let expressions now unfolds if bound
1414 variable occurs at most once in let expression body. INCOMPATIBILITY.
1416 * Method "arith": Linear arithmetic now ignores all inequalities when
1417 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1419 * New attribute "arith" for facts that should always be used
1420 automatically by arithmetic. It is intended to be used locally in
1423 assumes [arith]: "x > 0"
1425 Global usage is discouraged because of possible performance impact.
1427 * New classes "top" and "bot" with corresponding operations "top" and
1428 "bot" in theory Orderings; instantiation of class "complete_lattice"
1429 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1431 * Changed definition lemma "less_fun_def" in order to provide an
1432 instance for preorders on functions; use lemma "less_le" instead.
1435 * Theory Orderings: class "wellorder" moved here, with explicit
1436 induction rule "less_induct" as assumption. For instantiation of
1437 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1440 * Theory Orderings: added class "preorder" as superclass of "order".
1441 INCOMPATIBILITY: Instantiation proofs for order, linorder
1442 etc. slightly changed. Some theorems named order_class.* now named
1445 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1448 * Theory Finite_Set: added a new fold combinator of type
1450 ('a => 'b => 'b) => 'b => 'a set => 'b
1452 Occasionally this is more convenient than the old fold combinator
1453 which is now defined in terms of the new one and renamed to
1456 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1457 and "ring_simps" have been replaced by "algebra_simps" (which can be
1458 extended with further lemmas!). At the moment both still exist but
1459 the former will disappear at some point.
1461 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1462 class recpower. Type-specific simp rules for various recpower types
1463 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1465 rat_power_0 -> power_0
1466 rat_power_Suc -> power_Suc
1467 realpow_0 -> power_0
1468 realpow_Suc -> power_Suc
1469 complexpow_0 -> power_0
1470 complexpow_Suc -> power_Suc
1471 power_poly_0 -> power_0
1472 power_poly_Suc -> power_Suc
1474 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1475 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1476 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1477 of lemmas from Divides has been generalized from nat to class
1478 semiring_div. INCOMPATIBILITY. This involves the following theorem
1479 renames resulting from duplicate elimination:
1481 dvd_def_mod ~> dvd_eq_mod_eq_0
1482 zero_dvd_iff ~> dvd_0_left_iff
1483 dvd_0 ~> dvd_0_right
1484 DIVISION_BY_ZERO_DIV ~> div_by_0
1485 DIVISION_BY_ZERO_MOD ~> mod_by_0
1486 mult_div ~> div_mult_self2_is_id
1487 mult_mod ~> mod_mult_self2_is_0
1489 * Theory IntDiv: removed many lemmas that are instances of class-based
1490 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1491 rename old lemmas as follows:
1493 dvd_diff -> nat_dvd_diff
1494 dvd_zminus_iff -> dvd_minus_iff
1495 mod_add1_eq -> mod_add_eq
1496 mod_mult1_eq -> mod_mult_right_eq
1497 mod_mult1_eq' -> mod_mult_left_eq
1498 mod_mult_distrib_mod -> mod_mult_eq
1499 nat_mod_add_left_eq -> mod_add_left_eq
1500 nat_mod_add_right_eq -> mod_add_right_eq
1501 nat_mod_div_trivial -> mod_div_trivial
1502 nat_mod_mod_trivial -> mod_mod_trivial
1503 zdiv_zadd_self1 -> div_add_self1
1504 zdiv_zadd_self2 -> div_add_self2
1505 zdiv_zmult_self1 -> div_mult_self2_is_id
1506 zdiv_zmult_self2 -> div_mult_self1_is_id
1507 zdvd_triv_left -> dvd_triv_left
1508 zdvd_triv_right -> dvd_triv_right
1509 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1510 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1511 zmod_zadd_left_eq -> mod_add_left_eq
1512 zmod_zadd_right_eq -> mod_add_right_eq
1513 zmod_zadd_self1 -> mod_add_self1
1514 zmod_zadd_self2 -> mod_add_self2
1515 zmod_zadd1_eq -> mod_add_eq
1516 zmod_zdiff1_eq -> mod_diff_eq
1517 zmod_zdvd_zmod -> mod_mod_cancel
1518 zmod_zmod_cancel -> mod_mod_cancel
1519 zmod_zmult_self1 -> mod_mult_self2_is_0
1520 zmod_zmult_self2 -> mod_mult_self1_is_0
1523 zdvd_abs1 -> abs_dvd_iff
1524 zdvd_abs2 -> dvd_abs_iff
1525 zdvd_refl -> dvd_refl
1526 zdvd_trans -> dvd_trans
1527 zdvd_zadd -> dvd_add
1528 zdvd_zdiff -> dvd_diff
1529 zdvd_zminus_iff -> dvd_minus_iff
1530 zdvd_zminus2_iff -> minus_dvd_iff
1531 zdvd_zmultD -> dvd_mult_right
1532 zdvd_zmultD2 -> dvd_mult_left
1533 zdvd_zmult_mono -> mult_dvd_mono
1534 zdvd_0_right -> dvd_0_right
1535 zdvd_0_left -> dvd_0_left_iff
1536 zdvd_1_left -> one_dvd
1537 zminus_dvd_iff -> minus_dvd_iff
1539 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1541 * The real numbers offer decimal input syntax: 12.34 is translated
1542 into 1234/10^2. This translation is not reversed upon output.
1544 * Theory Library/Polynomial defines an abstract type 'a poly of
1545 univariate polynomials with coefficients of type 'a. In addition to
1546 the standard ring operations, it also supports div and mod. Code
1547 generation is also supported, using list-style constructors.
1549 * Theory Library/Inner_Product defines a class of real_inner for real
1550 inner product spaces, with an overloaded operation inner :: 'a => 'a
1551 => real. Class real_inner is a subclass of real_normed_vector from
1554 * Theory Library/Product_Vector provides instances for the product
1555 type 'a * 'b of several classes from RealVector and Inner_Product.
1556 Definitions of addition, subtraction, scalar multiplication, norms,
1557 and inner products are included.
1559 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1560 addition to the field operations, numerals and case syntax are also
1563 * Theory Library/Diagonalize provides constructive version of Cantor's
1564 first diagonalization argument.
1566 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1567 zlcm (for int); carried together from various gcd/lcm developements in
1568 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1569 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1570 may recover tupled syntax as follows:
1572 hide (open) const gcd
1573 abbreviation gcd where
1574 "gcd == (%(a, b). GCD.gcd a b)"
1576 GCD.gcd ("gcd '(_, _')")
1578 The same works for lcm, zgcd, zlcm.
1580 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1581 instantiations for algebraic structures. Removed some duplicate
1582 theorems. Changes in simp rules. INCOMPATIBILITY.
1584 * ML antiquotation @{code} takes a constant as argument and generates
1585 corresponding code in background and inserts name of the corresponding
1586 resulting ML value/function/datatype constructor binding in place.
1587 All occurrences of @{code} with a single ML block are generated
1588 simultaneously. Provides a generic and safe interface for
1589 instrumentalizing code generation. See
1590 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1591 In future you ought to refrain from ad-hoc compiling generated SML
1592 code on the ML toplevel. Note that (for technical reasons) @{code}
1593 cannot refer to constants for which user-defined serializations are
1594 set. Refer to the corresponding ML counterpart directly in that
1597 * Command 'rep_datatype': instead of theorem names the command now
1598 takes a list of terms denoting the constructors of the type to be
1599 represented as datatype. The characteristic theorems have to be
1600 proven. INCOMPATIBILITY. Also observe that the following theorems
1601 have disappeared in favour of existing ones:
1603 unit_induct ~> unit.induct
1604 prod_induct ~> prod.induct
1605 sum_induct ~> sum.induct
1606 Suc_Suc_eq ~> nat.inject
1607 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1612 * New locales for orders and lattices where the equivalence relation
1613 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1614 locales use a record structure with field eq for the equivalence.
1616 * New theory of factorial domains.
1618 * Units_l_inv and Units_r_inv are now simp rules by default.
1619 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1620 and/or r_inv will now also require deletion of these lemmas.
1622 * Renamed the following theorems, INCOMPATIBILITY:
1624 UpperD ~> Upper_memD
1625 LowerD ~> Lower_memD
1626 least_carrier ~> least_closed
1627 greatest_carrier ~> greatest_closed
1628 greatest_Lower_above ~> greatest_Lower_below
1629 one_zero ~> carrier_one_zero
1630 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1635 * Nominal datatypes can now contain type-variables.
1637 * Commands 'nominal_inductive' and 'equivariance' work with local
1640 * Nominal primrec can now works with local theory targets and its
1641 specification syntax now conforms to the general format as seen in
1644 * Method "perm_simp" honours the standard simplifier attributes
1645 (no_asm), (no_asm_use) etc.
1647 * The new predicate #* is defined like freshness, except that on the
1648 left hand side can be a set or list of atoms.
1650 * Experimental command 'nominal_inductive2' derives strong induction
1651 principles for inductive definitions. In contrast to
1652 'nominal_inductive', which can only deal with a fixed number of
1653 binders, it can deal with arbitrary expressions standing for sets of
1654 atoms to be avoided. The only inductive definition we have at the
1655 moment that needs this generalisation is the typing rule for Lets in
1658 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1659 -----------------------------------------------------------------
1660 Gamma |- Let x be t1 in t2 : T2
1662 In this rule one wants to avoid all the binders that are introduced by
1663 "close Gamma T1". We are looking for other examples where this
1664 feature might be useful. Please let us know.
1669 * Reimplemented the simplification procedure for proving continuity
1670 subgoals. The new simproc is extensible; users can declare additional
1671 continuity introduction rules with the attribute [cont2cont].
1673 * The continuity simproc now uses a different introduction rule for
1674 solving continuity subgoals on terms with lambda abstractions. In
1675 some rare cases the new simproc may fail to solve subgoals that the
1676 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1677 Potential INCOMPATIBILITY.
1679 * Command 'fixrec': specification syntax now conforms to the general
1680 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1681 examples. INCOMPATIBILITY.
1686 * Proof of Zorn's Lemma for partial orders.
1691 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1692 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1693 depends on multithreading, so timouts will not work before Poly/ML
1696 * High-level support for concurrent ML programming, see
1697 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1698 particularly convenient to organize independent functional
1699 computations. The concept of "synchronized variables" provides a
1700 higher-order interface for components with shared state, avoiding the
1701 delicate details of mutexes and condition variables. (Requires
1702 Poly/ML 5.2.1 or later.)
1704 * ML bindings produced via Isar commands are stored within the Isar
1705 context (theory or proof). Consequently, commands like 'use' and 'ML'
1706 become thread-safe and work with undo as expected (concerning
1707 top-level bindings, not side-effects on global references).
1708 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1709 compiler at runtime; really global bindings need to be given outside a
1710 theory. (Requires Poly/ML 5.2 or later.)
1712 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1713 context. Top-level ML bindings are stored within the proof context in
1714 a purely sequential fashion, disregarding the nested proof structure.
1715 ML bindings introduced by 'ML_prf' are discarded at the end of the
1716 proof. (Requires Poly/ML 5.2 or later.)
1718 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1719 and Method.setup, as well as Isar commands 'attribute_setup' and
1720 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1721 existing code accordingly, or use plain 'setup' together with old
1724 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1725 to 'a -> thm, while results are always tagged with an authentic oracle
1726 name. The Isar command 'oracle' is now polymorphic, no argument type
1727 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1728 accordingly. Note that extra performance may be gained by producing
1729 the cterm carefully, avoiding slow Thm.cterm_of.
1731 * Simplified interface for defining document antiquotations via
1732 ThyOutput.antiquotation, ThyOutput.output, and optionally
1733 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1734 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1737 * More systematic treatment of long names, abstract name bindings, and
1738 name space operations. Basic operations on qualified names have been
1739 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1740 Long_Name.append. Old type bstring has been mostly replaced by
1741 abstract type binding (see structure Binding), which supports precise
1742 qualification by packages and local theory targets, as well as proper
1743 tracking of source positions. INCOMPATIBILITY, need to wrap old
1744 bstring values into Binding.name, or better pass through abstract
1745 bindings everywhere. See further src/Pure/General/long_name.ML,
1746 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1748 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1749 LocalTheory.note etc.) now refer to the *full* internal name, not the
1750 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1752 * Disposed old type and term read functions (Sign.read_def_typ,
1753 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1754 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1755 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1756 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1757 resort for legacy applications.
1759 * Disposed old declarations, tactics, tactic combinators that refer to
1760 the simpset or claset of an implicit theory (such as Addsimps,
1761 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1762 embedded ML text, or local_simpset_of with a proper context passed as
1763 explicit runtime argument.
1765 * Rules and tactics that read instantiations (read_instantiate,
1766 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1767 context, which is required for parsing and type-checking. Moreover,
1768 the variables are specified as plain indexnames, not string encodings
1769 thereof. INCOMPATIBILITY.
1771 * Generic Toplevel.add_hook interface allows to analyze the result of
1772 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1773 for theorem dependency output of transactions resulting in a new
1776 * ML antiquotations: block-structured compilation context indicated by
1777 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1779 @{binding name} - basic name binding
1780 @{let ?pat = term} - term abbreviation (HO matching)
1781 @{note name = fact} - fact abbreviation
1782 @{thm fact} - singleton fact (with attributes)
1783 @{thms fact} - general fact (with attributes)
1784 @{lemma prop by method} - singleton goal
1785 @{lemma prop by meth1 meth2} - singleton goal
1786 @{lemma prop1 ... propN by method} - general goal
1787 @{lemma prop1 ... propN by meth1 meth2} - general goal
1788 @{lemma (open) ...} - open derivation
1793 * The Isabelle "emacs" tool provides a specific interface to invoke
1794 Proof General / Emacs, with more explicit failure if that is not
1795 installed (the old isabelle-interface script silently falls back on
1796 isabelle-process). The PROOFGENERAL_HOME setting determines the
1797 installation location of the Proof General distribution.
1799 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1800 the Isabelle process into a JVM/Scala application. See
1801 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1802 process wrapper has been discontinued.)
1804 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1806 * Various status messages (with exact source position information) are
1807 emitted, if proper markup print mode is enabled. This allows
1808 user-interface components to provide detailed feedback on internal
1813 New in Isabelle2008 (June 2008)
1814 -------------------------------
1818 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1819 and updated, with formally checked references as hyperlinks.
1821 * Theory loader: use_thy (and similar operations) no longer set the
1822 implicit ML context, which was occasionally hard to predict and in
1823 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1824 provides a proper context already.
1826 * Theory loader: old-style ML proof scripts being *attached* to a thy
1827 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1828 'use' within a theory file will do the job.
1830 * Name space merge now observes canonical order, i.e. the second space
1831 is inserted into the first one, while existing entries in the first
1832 space take precedence. INCOMPATIBILITY in rare situations, may try to
1833 swap theory imports.
1835 * Syntax: symbol \<chi> is now considered a letter. Potential
1836 INCOMPATIBILITY in identifier syntax etc.
1838 * Outer syntax: string tokens no longer admit escaped white space,
1839 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1840 white space without escapes.
1842 * Outer syntax: string tokens may contain arbitrary character codes
1843 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1849 * Context-dependent token translations. Default setup reverts locally
1850 fixed variables, and adds hilite markup for undeclared frees.
1852 * Unused theorems can be found using the new command 'unused_thms'.
1853 There are three ways of invoking it:
1856 Only finds unused theorems in the current theory.
1858 (2) unused_thms thy_1 ... thy_n -
1859 Finds unused theorems in the current theory and all of its ancestors,
1860 excluding the theories thy_1 ... thy_n and all of their ancestors.
1862 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1863 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1864 their ancestors, excluding the theories thy_1 ... thy_n and all of
1867 In order to increase the readability of the list produced by
1868 unused_thms, theorems that have been created by a particular instance
1869 of a theory command such as 'inductive' or 'function' are considered
1870 to belong to the same "group", meaning that if at least one theorem in
1871 this group is used, the other theorems in the same group are no longer
1872 reported as unused. Moreover, if all theorems in the group are
1873 unused, only one theorem in the group is displayed.
1875 Note that proof objects have to be switched on in order for
1876 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1877 usually the case when using Proof General with the default settings).
1879 * Authentic naming of facts disallows ad-hoc overwriting of previous
1880 theorems within the same name space. INCOMPATIBILITY, need to remove
1881 duplicate fact bindings, or even accidental fact duplications. Note
1882 that tools may maintain dynamically scoped facts systematically, using
1883 PureThy.add_thms_dynamic.
1885 * Command 'hide' now allows to hide from "fact" name space as well.
1887 * Eliminated destructive theorem database, simpset, claset, and
1888 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1889 update of theories within ML code.
1891 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1892 INCOMPATIBILITY, object-logics depending on former Pure require
1893 additional setup PureThy.old_appl_syntax_setup; object-logics
1894 depending on former CPure need to refer to Pure.
1896 * Commands 'use' and 'ML' are now purely functional, operating on
1897 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1898 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1901 * Command 'setup': discontinued implicit version with ML reference.
1903 * Instantiation target allows for simultaneous specification of class
1904 instance operations together with an instantiation proof.
1905 Type-checking phase allows to refer to class operations uniformly.
1906 See src/HOL/Complex/Complex.thy for an Isar example and
1907 src/HOL/Library/Eval.thy for an ML example.
1909 * Indexing of literal facts: be more serious about including only
1910 facts from the visible specification/proof context, but not the
1911 background context (locale etc.). Affects `prop` notation and method
1912 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1915 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1916 "(open)" option, which used to expose internal bound variables to the
1919 * Isar statements: removed obsolete case "rule_context".
1920 INCOMPATIBILITY, better use explicit fixes/assumes.
1922 * Locale proofs: default proof step now includes 'unfold_locales';
1923 hence 'proof' without argument may be used to unfold locale
1927 *** Document preparation ***
1929 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1930 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1931 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1932 spot); renamed link color from "darkblue" to "linkcolor" (default
1933 value unchanged, can be redefined via \definecolor); no longer sets
1934 "a4paper" option (unnecessary or even intrusive).
1936 * Antiquotation @{lemma A method} proves proposition A by the given
1937 method (either a method name or a method name plus (optional) method
1938 arguments in parentheses) and prints A just like @{prop A}.
1943 * New primrec package. Specification syntax conforms in style to
1944 definition/function/.... No separate induction rule is provided. The
1945 "primrec" command distinguishes old-style and new-style specifications
1946 by syntax. The former primrec package is now named OldPrimrecPackage.
1947 When adjusting theories, beware: constants stemming from new-style
1948 primrec specifications have authentic syntax.
1950 * Metis prover is now an order of magnitude faster, and also works
1951 with multithreading.
1953 * Metis: the maximum number of clauses that can be produced from a
1954 theorem is now given by the attribute max_clauses. Theorems that
1955 exceed this number are ignored, with a warning printed.
1957 * Sledgehammer no longer produces structured proofs by default. To
1958 enable, declare [[sledgehammer_full = true]]. Attributes
1959 reconstruction_modulus, reconstruction_sorts renamed
1960 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1962 * Method "induct_scheme" derives user-specified induction rules
1963 from well-founded induction and completeness of patterns. This factors
1964 out some operations that are done internally by the function package
1965 and makes them available separately. See
1966 src/HOL/ex/Induction_Scheme.thy for examples.
1968 * More flexible generation of measure functions for termination
1969 proofs: Measure functions can be declared by proving a rule of the
1970 form "is_measure f" and giving it the [measure_function] attribute.
1971 The "is_measure" predicate is logically meaningless (always true), and
1972 just guides the heuristic. To find suitable measure functions, the
1973 termination prover sets up the goal "is_measure ?f" of the appropriate
1974 type and generates all solutions by prolog-style backwards proof using
1977 This setup also deals with rules like
1979 "is_measure f ==> is_measure (list_size f)"
1981 which accommodates nested datatypes that recurse through lists.
1982 Similar rules are predeclared for products and option types.
1984 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1988 - Definitions of overloaded constants on sets have to be replaced by
1989 definitions on => and bool.
1991 - Some definitions of overloaded operators on sets can now be proved
1992 using the definitions of the operators on => and bool. Therefore,
1993 the following theorems have been renamed:
1995 subset_def -> subset_eq
1996 psubset_def -> psubset_eq
1997 set_diff_def -> set_diff_eq
1998 Compl_def -> Compl_eq
1999 Sup_set_def -> Sup_set_eq
2000 Inf_set_def -> Inf_set_eq
2001 sup_set_def -> sup_set_eq
2002 inf_set_def -> inf_set_eq
2004 - Due to the incompleteness of the HO unification algorithm, some
2005 rules such as subst may require manual instantiation, if some of
2006 the unknowns in the rule is a set.
2008 - Higher order unification and forward proofs:
2011 have "P (S::'a set)" <...>
2012 then have "EX S. P S" ..
2014 no longer works (due to the incompleteness of the HO unification
2015 algorithm) and must be replaced by the pattern
2022 - Calculational reasoning with subst (or similar rules):
2025 have "P (S::'a set)" <...>
2026 also have "S = T" <...>
2027 finally have "P T" .
2029 no longer works (for similar reasons as the previous example) and
2030 must be replaced by something like
2032 have "P (S::'a set)" <...>
2033 moreover have "S = T" <...>
2034 ultimately have "P T" by simp
2036 - Tactics or packages written in ML code:
2037 Code performing pattern matching on types via
2039 Type ("set", [T]) => ...
2041 must be rewritten. Moreover, functions like strip_type or
2042 binder_types no longer return the right value when applied to a
2045 T1 => ... => Tn => U => bool
2049 T1 => ... => Tn => U set
2051 * Merged theories Wellfounded_Recursion, Accessible_Part and
2052 Wellfounded_Relations to theory Wellfounded.
2054 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2056 * Class finite no longer treats UNIV as class parameter. Use class
2057 enum from theory Library/Enum instead to achieve a similar effect.
2060 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2061 and "Cons". INCOMPATIBILITY.
2063 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2064 Potential INCOMPATIBILITY.
2066 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2067 injective_fst_snd removed, use split_eta and prod_eqI instead.
2068 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2070 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2071 the same name in theory Orderings:
2081 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2082 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2083 and different variable names.
2085 * Library/Option_ord.thy: Canonical order on option type.
2087 * Library/RBT.thy: Red-black trees, an efficient implementation of
2090 * Library/Countable.thy: Type class for countable types.
2092 * Theory Int: The representation of numerals has changed. The infix
2093 operator BIT and the bit datatype with constructors B0 and B1 have
2094 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2095 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2096 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2099 * Theory Nat: definition of <= and < on natural numbers no longer
2100 depend on well-founded relations. INCOMPATIBILITY. Definitions
2101 le_def and less_def have disappeared. Consider lemmas not_less
2102 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2104 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2105 (whose purpose mainly is for various fold_set functionals) have been
2106 abandoned in favor of the existing algebraic classes
2107 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2108 lower_semilattice (resp. upper_semilattice) and linorder.
2111 * Theory Transitive_Closure: induct and cases rules now declare proper
2112 case_names ("base" and "step"). INCOMPATIBILITY.
2114 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2115 lattices. The form set-specific version is available as
2116 Inductive.lfp_ordinal_induct_set.
2118 * Renamed theorems "power.simps" to "power_int.simps".
2121 * Class semiring_div provides basic abstract properties of semirings
2122 with division and modulo operations. Subsumes former class dvd_mod.
2124 * Merged theories IntDef, Numeral and IntArith into unified theory
2125 Int. INCOMPATIBILITY.
2127 * Theory Library/Code_Index: type "index" now represents natural
2128 numbers rather than integers. INCOMPATIBILITY.
2130 * New class "uminus" with operation "uminus" (split of from class
2131 "minus" which now only has operation "minus", binary).
2134 * Constants "card", "internal_split", "option_map" now with authentic
2135 syntax. INCOMPATIBILITY.
2137 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2138 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2139 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2140 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2141 Sup_set_def, le_def, less_def, option_map_def now with object
2142 equality. INCOMPATIBILITY.
2144 * Records. Removed K_record, and replaced it by pure lambda term
2145 %x. c. The simplifier setup is now more robust against eta expansion.
2146 INCOMPATIBILITY: in cases explicitly referring to K_record.
2148 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2150 * Library/ListVector: new theory of arithmetic vector operations.
2152 * Library/Order_Relation: new theory of various orderings as sets of
2153 pairs. Defines preorders, partial orders, linear orders and
2154 well-orders on sets and on types.
2159 * Renamed some theories to allow to loading both ZF and HOL in the
2162 Datatype -> Datatype_ZF
2163 Inductive -> Inductive_ZF
2170 INCOMPATIBILITY: ZF theories that import individual theories below
2171 Main might need to be adapted. Regular theory Main is still
2172 available, as trivial extension of Main_ZF.
2177 * ML within Isar: antiquotation @{const name} or @{const
2178 name(typargs)} produces statically-checked Const term.
2180 * Functor NamedThmsFun: data is available to the user as dynamic fact
2181 (of the same name). Removed obsolete print command.
2183 * Removed obsolete "use_legacy_bindings" function.
2185 * The ``print mode'' is now a thread-local value derived from a global
2186 template (the former print_mode reference), thus access becomes
2187 non-critical. The global print_mode reference is for session
2188 management only; user-code should use print_mode_value,
2189 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2191 * Functions system/system_out provide a robust way to invoke external
2192 shell commands, with propagation of interrupts (requires Poly/ML
2193 5.2.1). Do not use OS.Process.system etc. from the basis library!
2198 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2199 in accordance with Proof General 3.7, which prefers GNU emacs.
2201 * isatool tty runs Isabelle process with plain tty interaction;
2202 optional line editor may be specified via ISABELLE_LINE_EDITOR
2203 setting, the default settings attempt to locate "ledit" and "rlwrap".
2205 * isatool browser now works with Cygwin as well, using general
2206 "javapath" function defined in Isabelle process environment.
2208 * YXML notation provides a simple and efficient alternative to
2209 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2210 isatool yxml as described in the Isabelle system manual.
2212 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2213 provides general wrapper for managing an Isabelle process in a robust
2214 fashion, with ``cooked'' output from stdin/stderr.
2216 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2217 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2219 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2220 way of changing the user's settings is via
2221 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2224 * Multithreading.max_threads := 0 refers to the number of actual CPU
2225 cores of the underlying machine, which is a good starting point for
2226 optimal performance tuning. The corresponding usedir option -M allows
2227 "max" as an alias for "0". WARNING: does not work on certain versions
2228 of Mac OS (with Poly/ML 5.1).
2230 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2231 adverse effect of Isabelle flooding interactive front-ends (notably
2232 ProofGeneral / XEmacs).
2236 New in Isabelle2007 (November 2007)
2237 -----------------------------------
2241 * More uniform information about legacy features, notably a
2242 warning/error of "Legacy feature: ...", depending on the state of the
2243 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2244 legacy features will disappear eventually.
2246 * Theory syntax: the header format ``theory A = B + C:'' has been
2247 discontinued in favour of ``theory A imports B C begin''. Use isatool
2248 fixheaders to convert existing theory files. INCOMPATIBILITY.
2250 * Theory syntax: the old non-Isar theory file format has been
2251 discontinued altogether. Note that ML proof scripts may still be used
2252 with Isar theories; migration is usually quite simple with the ML
2253 function use_legacy_bindings. INCOMPATIBILITY.
2255 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2256 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2259 * Theory loader: be more serious about observing the static theory
2260 header specifications (including optional directories), but not the
2261 accidental file locations of previously successful loads. The strict
2262 update policy of former update_thy is now already performed by
2263 use_thy, so the former has been removed; use_thys updates several
2264 theories simultaneously, just as 'imports' within a theory header
2265 specification, but without merging the results. Potential
2266 INCOMPATIBILITY: may need to refine theory headers and commands
2267 ROOT.ML which depend on load order.
2269 * Theory loader: optional support for content-based file
2270 identification, instead of the traditional scheme of full physical
2271 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2272 (cf. the system manual). The new scheme allows to work with
2273 non-finished theories in persistent session images, such that source
2274 files may be moved later on without requiring reloads.
2276 * Theory loader: old-style ML proof scripts being *attached* to a thy
2277 file (with the same base name as the theory) are considered a legacy
2278 feature, which will disappear eventually. Even now, the theory loader
2279 no longer maintains dependencies on such files.
2281 * Syntax: the scope for resolving ambiguities via type-inference is
2282 now limited to individual terms, instead of whole simultaneous
2283 specifications as before. This greatly reduces the complexity of the
2284 syntax module and improves flexibility by separating parsing and
2285 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2286 'fixes' etc.) are required in rare situations.
2288 * Syntax: constants introduced by new-style packages ('definition',
2289 'abbreviation' etc.) are passed through the syntax module in
2290 ``authentic mode''. This means that associated mixfix annotations
2291 really stick to such constants, independently of potential name space
2292 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2293 trees are represented slightly differently, may need to adapt syntax
2294 translations accordingly. Use CONST marker in 'translations' and
2295 @{const_syntax} antiquotation in 'parse_translation' etc.
2297 * Legacy goal package: reduced interface to the bare minimum required
2298 to keep existing proof scripts running. Most other user-level
2299 functions are now part of the OldGoals structure, which is *not* open
2300 by default (consider isatool expandshort before open OldGoals).
2301 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2302 these tend to cause confusion about the actual goal (!) context being
2303 used here, which is not necessarily the same as the_context().
2305 * Command 'find_theorems': supports "*" wild-card in "name:"
2306 criterion; "with_dups" option. Certain ProofGeneral versions might
2307 support a specific search form (see ProofGeneral/CHANGES).
2309 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2310 by default, which means that "prems" (and also "fixed variables") are
2311 suppressed from proof state output. Note that the ProofGeneral
2312 settings mechanism allows to change and save options persistently, but
2313 older versions of Isabelle will fail to start up if a negative prems
2316 * Local theory targets may be specified by non-nested blocks of
2317 ``context/locale/class ... begin'' followed by ``end''. The body may
2318 contain definitions, theorems etc., including any derived mechanism
2319 that has been implemented on top of these primitives. This concept
2320 generalizes the existing ``theorem (in ...)'' towards more versatility
2323 * Proof General interface: proper undo of final 'end' command;
2324 discontinued Isabelle/classic mode (ML proof scripts).
2327 *** Document preparation ***
2329 * Added antiquotation @{theory name} which prints the given name,
2330 after checking that it refers to a valid ancestor theory in the
2333 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2334 check the given source text as ML type/structure, printing verbatim.
2336 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2337 "c args == rhs" given in the current context. (Any number of
2338 arguments may be given on the LHS.)
2343 * The 'class' package offers a combination of axclass and locale to
2344 achieve Haskell-like type classes in Isabelle. Definitions and
2345 theorems within a class context produce both relative results (with
2346 implicit parameters according to the locale context), and polymorphic
2347 constants with qualified polymorphism (according to the class
2348 context). Within the body context of a 'class' target, a separate
2349 syntax layer ("user space type system") takes care of converting
2350 between global polymorphic consts and internal locale representation.
2351 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2352 "isatool doc classes" provides a tutorial.
2354 * Generic code generator framework allows to generate executable
2355 code for ML and Haskell (including Isabelle classes). A short usage
2358 internal compilation:
2359 export_code <list of constants (term syntax)> in SML
2360 writing SML code to a file:
2361 export_code <list of constants (term syntax)> in SML <filename>
2362 writing OCaml code to a file:
2363 export_code <list of constants (term syntax)> in OCaml <filename>
2364 writing Haskell code to a bunch of files:
2365 export_code <list of constants (term syntax)> in Haskell <filename>
2367 evaluating closed propositions to True/False using code generation:
2370 Reasonable default setup of framework in HOL.
2372 Theorem attributs for selecting and transforming function equations theorems:
2374 [code fun]: select a theorem as function equation for a specific constant
2375 [code fun del]: deselect a theorem as function equation for a specific constant
2376 [code inline]: select an equation theorem for unfolding (inlining) in place
2377 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2379 User-defined serializations (target in {SML, OCaml, Haskell}):
2381 code_const <and-list of constants (term syntax)>
2382 {(target) <and-list of const target syntax>}+
2384 code_type <and-list of type constructors>
2385 {(target) <and-list of type target syntax>}+
2387 code_instance <and-list of instances>
2389 where instance ::= <type constructor> :: <class>
2391 code_class <and_list of classes>
2392 {(target) <and-list of class target syntax>}+
2393 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2395 code_instance and code_class only are effective to target Haskell.
2397 For example usage see src/HOL/ex/Codegenerator.thy and
2398 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2399 generation from Isabelle/HOL theories is available via "isatool doc
2402 * Code generator: consts in 'consts_code' Isar commands are now
2403 referred to by usual term syntax (including optional type
2406 * Command 'no_translations' removes translation rules from theory
2409 * Overloaded definitions are now actually checked for acyclic
2410 dependencies. The overloading scheme is slightly more general than
2411 that of Haskell98, although Isabelle does not demand an exact
2412 correspondence to type class and instance declarations.
2413 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2414 exotic versions of overloading -- at the discretion of the user!
2416 Polymorphic constants are represented via type arguments, i.e. the
2417 instantiation that matches an instance against the most general
2418 declaration given in the signature. For example, with the declaration
2419 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2420 as c(nat). Overloading is essentially simultaneous structural
2421 recursion over such type arguments. Incomplete specification patterns
2422 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2423 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2424 Command 'print_theory' outputs the normalized system of recursive
2425 equations, see section "definitions".
2427 * Configuration options are maintained within the theory or proof
2428 context (with name and type bool/int/string), providing a very simple
2429 interface to a poor-man's version of general context data. Tools may
2430 declare options in ML (e.g. using Attrib.config_int) and then refer to
2431 these values using Config.get etc. Users may change options via an
2432 associated attribute of the same name. This form of context
2433 declaration works particularly well with commands 'declare' or
2434 'using', for example ``declare [[foo = 42]]''. Thus it has become
2435 very easy to avoid global references, which would not observe Isar
2436 toplevel undo/redo and fail to work with multithreading.
2438 Various global ML references of Pure and HOL have been turned into
2439 configuration options:
2441 Unify.search_bound unify_search_bound
2442 Unify.trace_bound unify_trace_bound
2443 Unify.trace_simp unify_trace_simp
2444 Unify.trace_types unify_trace_types
2445 Simplifier.simp_depth_limit simp_depth_limit
2446 Blast.depth_limit blast_depth_limit
2447 DatatypeProp.dtK datatype_distinctness_limit
2448 fast_arith_neq_limit fast_arith_neq_limit
2449 fast_arith_split_limit fast_arith_split_limit
2451 * Named collections of theorems may be easily installed as context
2452 data using the functor NamedThmsFun (see also
2453 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2454 attributes; there is also a toplevel print command. This facility is
2455 just a common case of general context data, which is the preferred way
2456 for anything more complex than just a list of facts in canonical
2459 * Isar: command 'declaration' augments a local theory by generic
2460 declaration functions written in ML. This enables arbitrary content
2461 being added to the context, depending on a morphism that tells the
2462 difference of the original declaration context wrt. the application
2463 context encountered later on.
2465 * Isar: proper interfaces for simplification procedures. Command
2466 'simproc_setup' declares named simprocs (with match patterns, and body
2467 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2468 context. ML antiquotation @{simproc name} retrieves named simprocs.
2470 * Isar: an extra pair of brackets around attribute declarations
2471 abbreviates a theorem reference involving an internal dummy fact,
2472 which will be ignored later --- only the effect of the attribute on
2473 the background context will persist. This form of in-place
2474 declarations is particularly useful with commands like 'declare' and
2475 'using', for example ``have A using [[simproc a]] by simp''.
2477 * Isar: method "assumption" (and implicit closing of subproofs) now
2478 takes simple non-atomic goal assumptions into account: after applying
2479 an assumption as a rule the resulting subgoals are solved by atomic
2480 assumption steps. This is particularly useful to finish 'obtain'
2481 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2482 without referring to the original premise "!!x. P x ==> thesis" in the
2483 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2486 * Isar: implicit use of prems from the Isar proof context is
2487 considered a legacy feature. Common applications like ``have A .''
2488 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2489 referencing facts explicitly here improves readability and
2490 maintainability of proof texts.
2492 * Isar: improper proof element 'guess' is like 'obtain', but derives
2493 the obtained context from the course of reasoning! For example:
2495 assume "EX x y. A x & B y" -- "any previous fact"
2496 then guess x and y by clarify
2498 This technique is potentially adventurous, depending on the facts and
2499 proof tools being involved here.
2501 * Isar: known facts from the proof context may be specified as literal
2502 propositions, using ASCII back-quote syntax. This works wherever
2503 named facts used to be allowed so far, in proof commands, proof
2504 methods, attributes etc. Literal facts are retrieved from the context
2505 according to unification of type and term parameters. For example,
2506 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2507 theorems in the current context, then these are valid literal facts:
2508 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2510 There is also a proof method "fact" which does the same composition
2511 for explicit goal states, e.g. the following proof texts coincide with
2512 certain special cases of literal facts:
2514 have "A" by fact == note `A`
2515 have "A ==> B" by fact == note `A ==> B`
2516 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2517 have "P a ==> Q a" by fact == note `P a ==> Q a`
2519 * Isar: ":" (colon) is no longer a symbolic identifier character in
2520 outer syntax. Thus symbolic identifiers may be used without
2521 additional white space in declarations like this: ``assume *: A''.
2523 * Isar: 'print_facts' prints all local facts of the current context,
2524 both named and unnamed ones.
2526 * Isar: 'def' now admits simultaneous definitions, e.g.:
2528 def x == "t" and y == "u"
2530 * Isar: added command 'unfolding', which is structurally similar to
2531 'using', but affects both the goal state and facts by unfolding given
2532 rewrite rules. Thus many occurrences of the 'unfold' method or
2533 'unfolded' attribute may be replaced by first-class proof text.
2535 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2536 and command 'unfolding' now all support object-level equalities
2537 (potentially conditional). The underlying notion of rewrite rule is
2538 analogous to the 'rule_format' attribute, but *not* that of the
2539 Simplifier (which is usually more generous).
2541 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2542 premises of a theorem by n. Useful in conjunction with drule.
2544 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2545 method expression within a sandbox consisting of the first N
2546 sub-goals, which need to exist. For example, ``simp_all [3]''
2547 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2548 simplifies all new goals that emerge from applying rule foo to the
2549 originally first one.
2551 * Isar: schematic goals are no longer restricted to higher-order
2552 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2555 * Isar: the conclusion of a long theorem statement is now either
2556 'shows' (a simultaneous conjunction, as before), or 'obtains'
2557 (essentially a disjunction of cases with local parameters and
2558 assumptions). The latter allows to express general elimination rules
2559 adequately; in this notation common elimination rules look like this:
2561 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2563 obtains x where "P x"
2565 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2569 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2575 The subsequent classical rules even refer to the formal "thesis"
2578 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2581 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2582 obtains "thesis ==> something"
2584 The actual proof of an 'obtains' statement is analogous to that of the
2585 Isar proof element 'obtain', only that there may be several cases.
2586 Optional case names may be specified in parentheses; these will be
2587 available both in the present proof and as annotations in the
2588 resulting rule, for later use with the 'cases' method (cf. attribute
2591 * Isar: the assumptions of a long theorem statement are available as
2592 "assms" fact in the proof context. This is more appropriate than the
2593 (historical) "prems", which refers to all assumptions of the current
2594 context, including those from the target locale, proof body etc.
2596 * Isar: 'print_statement' prints theorems from the current theory or
2597 proof context in long statement form, according to the syntax of a
2600 * Isar: 'obtain' takes an optional case name for the local context
2601 introduction rule (default "that").
2603 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2604 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2607 * Pure: syntax "CONST name" produces a fully internalized constant
2608 according to the current context. This is particularly useful for
2609 syntax translations that should refer to internal constant
2610 representations independently of name spaces.
2612 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2613 instead of "FOO ". This allows multiple binder declarations to coexist
2614 in the same context. INCOMPATIBILITY.
2616 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2617 primitive that also works in a locale context (both for constants and
2618 fixed variables). Type declaration and internal syntactic representation
2619 of given constants retrieved from the context. Likewise, the
2620 'no_notation' command allows to remove given syntax annotations from the
2623 * Isar/locales: new derived specification elements 'axiomatization',
2624 'definition', 'abbreviation', which support type-inference, admit
2625 object-level specifications (equality, equivalence). See also the
2626 isar-ref manual. Examples:
2629 eq (infix "===" 50) where
2630 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2632 definition "f x y = x + y + 1"
2633 definition g where "g x = f x x"
2636 neq (infix "=!=" 50) where
2637 "x =!= y == ~ (x === y)"
2639 These specifications may be also used in a locale context. Then the
2640 constants being introduced depend on certain fixed parameters, and the
2641 constant name is qualified by the locale base name. An internal
2642 abbreviation takes care for convenient input and output, making the
2643 parameters implicit and using the original short name. See also
2644 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2645 entities from a monomorphic theory.
2647 Presently, abbreviations are only available 'in' a target locale, but
2648 not inherited by general import expressions. Also note that
2649 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2650 'translations' in common applications. The "no_abbrevs" print mode
2651 prevents folding of abbreviations in term output.
2653 Concrete syntax is attached to specified constants in internal form,
2654 independently of name spaces. The parse tree representation is
2655 slightly different -- use 'notation' instead of raw 'syntax', and
2656 'translations' with explicit "CONST" markup to accommodate this.
2658 * Pure/Isar: unified syntax for new-style specification mechanisms
2659 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2660 full type inference and dummy patterns ("_"). For example:
2662 definition "K x _ = x"
2664 inductive conj for A B
2665 where "A ==> B ==> conj A B"
2667 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2668 the current context. Print mode "no_abbrevs" prevents inversion of
2669 abbreviations on output.
2671 * Isar/locales: improved parameter handling: use of locales "var" and
2672 "struct" no longer necessary; - parameter renamings are no longer
2673 required to be injective. For example, this allows to define
2674 endomorphisms as locale endom = homom mult mult h.
2676 * Isar/locales: changed the way locales with predicates are defined.
2677 Instead of accumulating the specification, the imported expression is
2678 now an interpretation. INCOMPATIBILITY: different normal form of
2679 locale expressions. In particular, in interpretations of locales with
2680 predicates, goals repesenting already interpreted fragments are not
2681 removed automatically. Use methods `intro_locales' and
2682 `unfold_locales'; see below.
2684 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2685 provide backward reasoning on locales predicates. The methods are
2686 aware of interpretations and discharge corresponding goals.
2687 `intro_locales' is less aggressive then `unfold_locales' and does not
2688 unfold predicates to assumptions.
2690 * Isar/locales: the order in which locale fragments are accumulated
2691 has changed. This enables to override declarations from fragments due
2692 to interpretations -- for example, unwanted simp rules.
2694 * Isar/locales: interpretation in theories and proof contexts has been
2695 extended. One may now specify (and prove) equations, which are
2696 unfolded in interpreted theorems. This is useful for replacing
2697 defined concepts (constants depending on locale parameters) by
2698 concepts already existing in the target context. Example:
2700 interpretation partial_order ["op <= :: [int, int] => bool"]
2701 where "partial_order.less (op <=) (x::int) y = (x < y)"
2703 Typically, the constant `partial_order.less' is created by a
2704 definition specification element in the context of locale
2707 * Method "induct": improved internal context management to support
2708 local fixes and defines on-the-fly. Thus explicit meta-level
2709 connectives !! and ==> are rarely required anymore in inductive goals
2710 (using object-logic connectives for this purpose has been long
2711 obsolete anyway). Common proof patterns are explained in
2712 src/HOL/Induct/Common_Patterns.thy, see also
2713 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2716 * Method "induct": improved handling of simultaneous goals. Instead of
2717 introducing object-level conjunction, the statement is now split into
2718 several conclusions, while the corresponding symbolic cases are nested
2719 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2720 see src/HOL/Induct/Common_Patterns.thy, for example.
2722 * Method "induct": mutual induction rules are now specified as a list
2723 of rule sharing the same induction cases. HOL packages usually provide
2724 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2725 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2726 mutual induction rules differently, i.e. like this:
2728 (induct rule: foo_bar.inducts)
2729 (induct set: foo bar)
2730 (induct pred: foo bar)
2731 (induct type: foo bar)
2733 The ML function ProjectRule.projections turns old-style rules into the
2736 * Method "coinduct": dual of induction, see
2737 src/HOL/Library/Coinductive_List.thy for various examples.
2739 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2740 considered a legacy feature.
2742 * Attribute "symmetric" produces result with standardized schematic
2743 variables (index 0). Potential INCOMPATIBILITY.
2745 * Simplifier: by default the simplifier trace only shows top level
2746 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2747 default. Thus there is less danger of being flooded by the trace. The
2748 trace indicates where parts have been suppressed.
2750 * Provers/classical: removed obsolete classical version of elim_format
2751 attribute; classical elim/dest rules are now treated uniformly when
2752 manipulating the claset.
2754 * Provers/classical: stricter checks to ensure that supplied intro,
2755 dest and elim rules are well-formed; dest and elim rules must have at
2758 * Provers/classical: attributes dest/elim/intro take an optional
2759 weight argument for the rule (just as the Pure versions). Weights are
2760 ignored by automated tools, but determine the search order of single
2763 * Syntax: input syntax now supports dummy variable binding "%_. b",
2764 where the body does not mention the bound variable. Note that dummy
2765 patterns implicitly depend on their context of bounds, which makes
2766 "{_. _}" match any set comprehension as expected. Potential
2767 INCOMPATIBILITY -- parse translations need to cope with syntactic
2768 constant "_idtdummy" in the binding position.
2770 * Syntax: removed obsolete syntactic constant "_K" and its associated
2771 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2772 for example "A -> B" => "Pi A (%_. B)".
2774 * Pure: 'class_deps' command visualizes the subclass relation, using
2775 the graph browser tool.
2777 * Pure: 'print_theory' now suppresses certain internal declarations by
2778 default; use '!' option for full details.
2783 * Method "metis" proves goals by applying the Metis general-purpose
2784 resolution prover (see also http://gilith.com/software/metis/).
2785 Examples are in the directory MetisExamples. WARNING: the
2786 Isabelle/HOL-Metis integration does not yet work properly with
2789 * Command 'sledgehammer' invokes external automatic theorem provers as
2790 background processes. It generates calls to the "metis" method if
2791 successful. These can be pasted into the proof. Users do not have to
2792 wait for the automatic provers to return. WARNING: does not really
2793 work with multi-threading.
2795 * New "auto_quickcheck" feature tests outermost goal statements for
2796 potential counter-examples. Controlled by ML references
2797 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2798 5000 milliseconds). Fails silently if statements is outside of
2799 executable fragment, or any other codgenerator problem occurs.
2801 * New constant "undefined" with axiom "undefined x = undefined".
2803 * Added class "HOL.eq", allowing for code generation with polymorphic
2806 * Some renaming of class constants due to canonical name prefixing in
2807 the new 'class' package:
2809 HOL.abs ~> HOL.abs_class.abs
2810 HOL.divide ~> HOL.divide_class.divide
2811 0 ~> HOL.zero_class.zero
2812 1 ~> HOL.one_class.one
2813 op + ~> HOL.plus_class.plus
2814 op - ~> HOL.minus_class.minus
2815 uminus ~> HOL.minus_class.uminus
2816 op * ~> HOL.times_class.times
2817 op < ~> HOL.ord_class.less
2818 op <= > HOL.ord_class.less_eq
2819 Nat.power ~> Power.power_class.power
2820 Nat.size ~> Nat.size_class.size
2821 Numeral.number_of ~> Numeral.number_class.number_of
2822 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2823 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2824 Orderings.min ~> Orderings.ord_class.min
2825 Orderings.max ~> Orderings.ord_class.max
2826 Divides.op div ~> Divides.div_class.div
2827 Divides.op mod ~> Divides.div_class.mod
2828 Divides.op dvd ~> Divides.div_class.dvd
2830 INCOMPATIBILITY. Adaptions may be required in the following cases:
2832 a) User-defined constants using any of the names "plus", "minus",
2833 "times", "less" or "less_eq". The standard syntax translations for
2834 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2837 b) Variables named "plus", "minus", "times", "less", "less_eq"
2838 INCOMPATIBILITY: use more specific names.
2840 c) Permutative equations (e.g. "a + b = b + a")
2841 Since the change of names also changes the order of terms, permutative
2842 rewrite rules may get applied in a different order. Experience shows
2843 that this is rarely the case (only two adaptions in the whole Isabelle
2844 distribution). INCOMPATIBILITY: rewrite proofs
2846 d) ML code directly refering to constant names
2847 This in general only affects hand-written proof tactics, simprocs and
2848 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2849 Consider using @{const_name} antiquotation.
2851 * New class "default" with associated constant "default".
2853 * Function "sgn" is now overloaded and available on int, real, complex
2854 (and other numeric types), using class "sgn". Two possible defs of
2855 sgn are given as equational assumptions in the classes sgn_if and
2856 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2859 * Locale "partial_order" now unified with class "order" (cf. theory
2860 Orderings), added parameter "less". INCOMPATIBILITY.
2862 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2863 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2864 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2866 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2867 changed order of proof goals in instance proofs.
2869 * The transitivity reasoner for partial and linear orders is set up
2870 for classes "order" and "linorder". Instances of the reasoner are available
2871 in all contexts importing or interpreting the corresponding locales.
2872 Method "order" invokes the reasoner separately; the reasoner
2873 is also integrated with the Simplifier as a solver. Diagnostic
2874 command 'print_orders' shows the available instances of the reasoner
2875 in the current context.
2877 * Localized monotonicity predicate in theory "Orderings"; integrated
2878 lemmas max_of_mono and min_of_mono with this predicate.
2881 * Formulation of theorem "dense" changed slightly due to integration
2882 with new class dense_linear_order.
2884 * Uniform lattice theory development in HOL.
2886 constants "meet" and "join" now named "inf" and "sup"
2887 constant "Meet" now named "Inf"
2889 classes "meet_semilorder" and "join_semilorder" now named
2890 "lower_semilattice" and "upper_semilattice"
2891 class "lorder" now named "lattice"
2892 class "comp_lat" now named "complete_lattice"
2894 Instantiation of lattice classes allows explicit definitions
2895 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2897 INCOMPATIBILITY. Theorem renames:
2899 meet_left_le ~> inf_le1
2900 meet_right_le ~> inf_le2
2901 join_left_le ~> sup_ge1
2902 join_right_le ~> sup_ge2
2903 meet_join_le ~> inf_sup_ord
2906 le_meet ~> le_inf_iff
2907 le_join ~> ge_sup_conv
2908 meet_idempotent ~> inf_idem
2909 join_idempotent ~> sup_idem
2910 meet_comm ~> inf_commute
2911 join_comm ~> sup_commute
2912 meet_leI1 ~> le_infI1
2913 meet_leI2 ~> le_infI2
2914 le_joinI1 ~> le_supI1
2915 le_joinI2 ~> le_supI2
2916 meet_assoc ~> inf_assoc
2917 join_assoc ~> sup_assoc
2918 meet_left_comm ~> inf_left_commute
2919 meet_left_idempotent ~> inf_left_idem
2920 join_left_comm ~> sup_left_commute
2921 join_left_idempotent ~> sup_left_idem
2924 le_def_meet ~> le_iff_inf
2925 le_def_join ~> le_iff_sup
2926 join_absorp2 ~> sup_absorb2
2927 join_absorp1 ~> sup_absorb1
2928 meet_absorp1 ~> inf_absorb1
2929 meet_absorp2 ~> inf_absorb2
2930 meet_join_absorp ~> inf_sup_absorb
2931 join_meet_absorp ~> sup_inf_absorb
2932 distrib_join_le ~> distrib_sup_le
2933 distrib_meet_le ~> distrib_inf_le
2935 add_meet_distrib_left ~> add_inf_distrib_left
2936 add_join_distrib_left ~> add_sup_distrib_left
2937 is_join_neg_meet ~> is_join_neg_inf
2938 is_meet_neg_join ~> is_meet_neg_sup
2939 add_meet_distrib_right ~> add_inf_distrib_right
2940 add_join_distrib_right ~> add_sup_distrib_right
2941 add_meet_join_distribs ~> add_sup_inf_distribs
2942 join_eq_neg_meet ~> sup_eq_neg_inf
2943 meet_eq_neg_join ~> inf_eq_neg_sup
2944 add_eq_meet_join ~> add_eq_inf_sup
2945 meet_0_imp_0 ~> inf_0_imp_0
2946 join_0_imp_0 ~> sup_0_imp_0
2947 meet_0_eq_0 ~> inf_0_eq_0
2948 join_0_eq_0 ~> sup_0_eq_0
2949 neg_meet_eq_join ~> neg_inf_eq_sup
2950 neg_join_eq_meet ~> neg_sup_eq_inf
2951 join_eq_if ~> sup_eq_if
2953 mono_meet ~> mono_inf
2954 mono_join ~> mono_sup
2955 meet_bool_eq ~> inf_bool_eq
2956 join_bool_eq ~> sup_bool_eq
2957 meet_fun_eq ~> inf_fun_eq
2958 join_fun_eq ~> sup_fun_eq
2959 meet_set_eq ~> inf_set_eq
2960 join_set_eq ~> sup_set_eq
2961 meet1_iff ~> inf1_iff
2962 meet2_iff ~> inf2_iff
2971 join1_iff ~> sup1_iff
2972 join2_iff ~> sup2_iff
2982 is_meet_Meet ~> is_meet_Inf
2983 Meet_bool_def ~> Inf_bool_def
2984 Meet_fun_def ~> Inf_fun_def
2985 Meet_greatest ~> Inf_greatest
2986 Meet_lower ~> Inf_lower
2987 Meet_set_def ~> Inf_set_def
2990 Sup_bool_eq ~> Sup_bool_def
2991 Sup_fun_eq ~> Sup_fun_def
2992 Sup_set_eq ~> Sup_set_def
2994 listsp_meetI ~> listsp_infI
2995 listsp_meet_eq ~> listsp_inf_eq
3000 * Added syntactic class "size"; overloaded constant "size" now has
3001 type "'a::size ==> bool"
3003 * Internal reorganisation of `size' of datatypes: size theorems
3004 "foo.size" are no longer subsumed by "foo.simps" (but are still
3005 simplification rules by default!); theorems "prod.size" now named
3008 * Class "div" now inherits from class "times" rather than "type".
3011 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3012 Linorder etc. have disappeared; operations defined in terms of
3013 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3015 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3017 * HOL-Word: New extensive library and type for generic, fixed size
3018 machine words, with arithemtic, bit-wise, shifting and rotating
3019 operations, reflection into int, nat, and bool lists, automation for
3020 linear arithmetic (by automatic reflection into nat or int), including
3021 lemmas on overflow and monotonicity. Instantiated to all appropriate
3022 arithmetic type classes, supporting automatic simplification of
3023 numerals on all operations.
3025 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3027 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3029 * Code generator library theories:
3030 - Code_Integer represents HOL integers by big integer literals in target
3032 - Code_Char represents HOL characters by character literals in target
3034 - Code_Char_chr like Code_Char, but also offers treatment of character
3035 codes; includes Code_Integer.
3036 - Executable_Set allows to generate code for finite sets using lists.
3037 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3039 - Executable_Real implements a subset of real numbers, namly those
3040 representable by rational numbers.
3041 - Efficient_Nat implements natural numbers by integers, which in general will
3042 result in higher efficency; pattern matching with 0/Suc is eliminated;
3043 includes Code_Integer.
3044 - Code_Index provides an additional datatype index which is mapped to
3045 target-language built-in integers.
3046 - Code_Message provides an additional datatype message_string which is isomorphic to
3047 strings; messages are mapped to target-language strings.
3049 * New package for inductive predicates
3051 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3054 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3055 for z_1 :: U_1 and ... and z_n :: U_m
3057 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3060 with full support for type-inference, rather than
3062 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3064 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3065 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3067 inductive "s z_1 ... z_m"
3069 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3072 For backward compatibility, there is a wrapper allowing inductive
3073 sets to be defined with the new package via
3076 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3077 for z_1 :: U_1 and ... and z_n :: U_m
3079 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3085 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3086 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3087 for z_1 :: U_1 and ... and z_n :: U_m
3089 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3090 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3093 if the additional syntax "p ..." is required.
3095 Numerous examples can be found in the subdirectories src/HOL/Auth,
3096 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3100 - Since declaration and definition of inductive sets or predicates
3101 is no longer separated, abbreviations involving the newly
3102 introduced sets or predicates must be specified together with the
3103 introduction rules after the 'where' keyword (see above), rather
3104 than before the actual inductive definition.
3106 - The variables in induction and elimination rules are now
3107 quantified in the order of their occurrence in the introduction
3108 rules, rather than in alphabetical order. Since this may break
3109 some proofs, these proofs either have to be repaired, e.g. by
3110 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3111 statements of the form
3113 case (rule_i a_i_1 ... a_i_{k_i})
3115 or the old order of quantification has to be restored by explicitly adding
3116 meta-level quantifiers in the introduction rules, i.e.
3118 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3120 - The format of the elimination rules is now
3122 p z_1 ... z_m x_1 ... x_n ==>
3123 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3128 (x_1, ..., x_n) : s z_1 ... z_m ==>
3129 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3132 for sets rather than
3134 x : s z_1 ... z_m ==>
3135 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3138 This may require terms in goals to be expanded to n-tuples
3139 (e.g. using case_tac or simplification with the split_paired_all
3140 rule) before the above elimination rule is applicable.
3142 - The elimination or case analysis rules for (mutually) inductive
3143 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3144 list of rules "p_1_..._p_k.elims" is no longer available.
3146 * New package "function"/"fun" for general recursive functions,
3147 supporting mutual and nested recursion, definitions in local contexts,
3148 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3149 for small examples, and the separate tutorial on the function
3150 package. The old recdef "package" is still available as before, but
3151 users are encouraged to use the new package.
3153 * Method "lexicographic_order" automatically synthesizes termination
3154 relations as lexicographic combinations of size measures.
3156 * Case-expressions allow arbitrary constructor-patterns (including
3157 "_") and take their order into account, like in functional
3158 programming. Internally, this is translated into nested
3159 case-expressions; missing cases are added and mapped to the predefined
3160 constant "undefined". In complicated cases printing may no longer show
3161 the original input but the internal form. Lambda-abstractions allow
3162 the same form of pattern matching: "% pat1 => e1 | ..." is an
3163 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3166 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3167 is an abbreviation for "of_nat :: nat => int". The simplification
3168 rules for "of_nat" have been changed to work like "int" did
3169 previously. Potential INCOMPATIBILITY:
3170 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3171 - of_nat_diff and of_nat_mult are no longer default simp rules
3173 * Method "algebra" solves polynomial equations over (semi)rings using
3174 Groebner bases. The (semi)ring structure is defined by locales and the
3175 tool setup depends on that generic context. Installing the method for
3176 a specific type involves instantiating the locale and possibly adding
3177 declarations for computation on the coefficients. The method is
3178 already instantiated for natural numbers and for the axiomatic class
3179 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3180 CALCULEMUS 2007 for the general principles underlying this
3181 architecture of context-aware proof-tools.
3183 * Method "ferrack" implements quantifier elimination over
3184 special-purpose dense linear orders using locales (analogous to
3185 "algebra"). The method is already installed for class
3186 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3189 * Former constant "List.op @" now named "List.append". Use ML
3190 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3191 circumvent possible incompatibilities when working on ML level.
3193 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3195 * New function listsum :: 'a list => 'a for arbitrary monoids.
3196 Special syntax: "SUM x <- xs. f x" (and latex variants)
3198 * New syntax for Haskell-like list comprehension (input only), eg.
3199 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3201 * The special syntax for function "filter" has changed from [x :
3202 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3203 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3205 * [a..b] is now defined for arbitrary linear orders. It used to be
3206 defined on nat only, as an abbreviation for [a..<Suc b]
3209 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3211 * New functions "sorted" and "sort" in src/HOL/List.thy.
3213 * New lemma collection field_simps (an extension of ring_simps) for
3214 manipulating (in)equations involving division. Multiplies with all
3215 denominators that can be proved to be non-zero (in equations) or
3216 positive/negative (in inequations).
3218 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3219 have been improved and renamed to ring_simps, group_simps and
3220 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3221 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3223 * Theory Library/Commutative_Ring: switched from recdef to function
3224 package; constants add, mul, pow now curried. Infix syntax for
3225 algebraic operations.
3227 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3230 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3233 * HOL/records: generalised field-update to take a function on the
3234 field rather than the new value: r(|A := x|) is translated to A_update
3235 (K x) r The K-combinator that is internally used is called K_record.
3236 INCOMPATIBILITY: Usage of the plain update functions has to be
3239 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3240 * x = 0, which are required for a semiring. Richer structures do not
3241 inherit from semiring_0 anymore, because this property is a theorem
3242 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3243 there is more to prove, but this is mostly trivial.
3245 * Class "recpower" is generalized to arbitrary monoids, not just
3246 commutative semirings. INCOMPATIBILITY: may need to incorporate
3247 commutativity or semiring properties additionally.
3249 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3250 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3251 better use 'abbreviation'.
3253 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3255 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3256 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3257 significant changes for setting up numeral syntax for types:
3258 - New constants Numeral.pred and Numeral.succ instead
3259 of former Numeral.bin_pred and Numeral.bin_succ.
3260 - Use integer operations instead of bin_add, bin_mult and so on.
3261 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3262 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3264 See src/HOL/Integ/IntArith.thy for an example setup.
3266 * Command 'normal_form' computes the normal form of a term that may
3267 contain free variables. For example ``normal_form "rev [a, b, c]"''
3268 produces ``[b, c, a]'' (without proof). This command is suitable for
3269 heavy-duty computations because the functions are compiled to ML
3270 first. Correspondingly, a method "normalization" is provided. See
3271 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3273 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3274 25 like -->); output depends on the "iff" print_mode, the default is
3275 "A = B" (with priority 50).
3277 * Relations less (<) and less_eq (<=) are also available on type bool.
3278 Modified syntax to disallow nesting without explicit parentheses,
3279 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3282 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3284 * Relation composition operator "op O" now has precedence 75 and binds
3285 stronger than union and intersection. INCOMPATIBILITY.
3287 * The old set interval syntax "{m..n(}" (and relatives) has been
3288 removed. Use "{m..<n}" (and relatives) instead.
3290 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3291 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3292 ``declare [[simproc del: neq]]''.
3294 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3297 * Theorem Cons_eq_map_conv no longer declared as "simp".
3299 * Theorem setsum_mult renamed to setsum_right_distrib.
3301 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3304 * Reimplemented methods "sat" and "satx", with several improvements:
3305 goals no longer need to be stated as "<prems> ==> False", equivalences
3306 (i.e. "=" on type bool) are handled, variable names of the form
3307 "lit_<n>" are no longer reserved, significant speedup.
3309 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3310 zChaff is still supported as well.
3312 * 'inductive' and 'datatype': provide projections of mutual rules,
3313 bundled as foo_bar.inducts;
3315 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3318 * Library: moved theory Accessible_Part to main HOL.
3320 * Library: added theory Coinductive_List of potentially infinite lists
3321 as greatest fixed-point.
3323 * Library: added theory AssocList which implements (finite) maps as
3326 * Method "evaluation" solves goals (i.e. a boolean expression)
3327 efficiently by compiling it to ML. The goal is "proved" (via an
3328 oracle) if it evaluates to True.
3330 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3331 also when invoked by the simplifier. This results in the Simplifier
3332 being more powerful on arithmetic goals. INCOMPATIBILITY.
3333 Configuration option fast_arith_split_limit=0 recovers the old
3336 * Support for hex (0x20) and binary (0b1001) numerals.
3338 * New method: reify eqs (t), where eqs are equations for an
3339 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3340 parameter, computes a term s::'b and a list xs::'a list and proves the
3341 theorem I xs s = t. This is also known as reification or quoting. The
3342 resulting theorem is applied to the subgoal to substitute t with I xs
3343 s. If t is omitted, the subgoal itself is reified.
3345 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3346 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3347 where f is supposed to be a computable function (in the sense of code
3348 generattion). The method uses reify to compute s and xs as above then
3349 applies corr_thm and uses normalization by evaluation to "prove" f s =
3350 r and finally gets the theorem t = r, which is again applied to the
3351 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3353 * Reflection: Automatic reification now handels binding, an example is
3354 available in src/HOL/ex/ReflectionEx.thy
3356 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3357 command 'statespace' that is similar to 'record', but introduces an
3358 abstract specification based on the locale infrastructure instead of
3359 HOL types. This leads to extra flexibility in composing state spaces,
3360 in particular multiple inheritance and renaming of components.
3365 * Hyperreal: Functions root and sqrt are now defined on negative real
3366 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3367 Nonnegativity side conditions have been removed from many lemmas, so
3368 that more subgoals may now be solved by simplification; potential
3371 * Real: new type classes formalize real normed vector spaces and
3372 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3373 and norm :: 'a => real.
3375 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3376 reals into other types. The overloaded constant Reals :: 'a set is now
3377 defined as range of_real; potential INCOMPATIBILITY.
3379 * Real: proper support for ML code generation, including 'quickcheck'.
3380 Reals are implemented as arbitrary precision rationals.
3382 * Real: new development using Cauchy Sequences.
3384 * Hyperreal: Several constants that previously worked only for the
3385 reals have been generalized, so they now work over arbitrary vector
3386 spaces. Type annotations may need to be added in some cases; potential
3389 Infinitesimal :: ('a::real_normed_vector) star set
3390 HFinite :: ('a::real_normed_vector) star set
3391 HInfinite :: ('a::real_normed_vector) star set
3392 approx :: ('a::real_normed_vector) star => 'a star => bool
3393 monad :: ('a::real_normed_vector) star => 'a star set
3394 galaxy :: ('a::real_normed_vector) star => 'a star set
3395 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3396 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3397 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3398 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3399 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3400 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3401 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3402 sgn :: 'a::real_normed_vector => 'a
3403 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3405 * Complex: Some complex-specific constants are now abbreviations for
3406 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3407 hnorm. Other constants have been entirely removed in favor of the
3408 polymorphic versions (INCOMPATIBILITY):
3412 HInfinite <-- CInfinite
3413 Infinitesimal <-- CInfinitesimal
3416 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3417 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3418 (ns)deriv <-- (ns)cderiv
3423 * Formalisation of ideals and the quotient construction over rings.
3425 * Order and lattice theory no longer based on records.
3428 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3429 greatest_closed. INCOMPATIBILITY.
3431 * Method algebra is now set up via an attribute. For examples see
3432 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3433 of algebraic structures.
3435 * Renamed theory CRing to Ring.
3440 * Substantial, yet incomplete support for nominal datatypes (binding
3441 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3442 src/HOL/Nominal/Examples. Prospective users should consult
3443 http://isabelle.in.tum.de/nominal/
3448 * ML basics: just one true type int, which coincides with IntInf.int
3451 * ML within Isar: antiquotations allow to embed statically-checked
3452 formal entities in the source, referring to the context available at
3453 compile-time. For example:
3455 ML {* @{sort "{zero,one}"} *}
3456 ML {* @{typ "'a => 'b"} *}
3457 ML {* @{term "%x. x"} *}
3458 ML {* @{prop "x == y"} *}
3459 ML {* @{ctyp "'a => 'b"} *}
3460 ML {* @{cterm "%x. x"} *}
3461 ML {* @{cprop "x == y"} *}
3462 ML {* @{thm asm_rl} *}
3463 ML {* @{thms asm_rl} *}
3464 ML {* @{type_name c} *}
3465 ML {* @{type_syntax c} *}
3466 ML {* @{const_name c} *}
3467 ML {* @{const_syntax c} *}
3470 ML {* @{theory Pure} *}
3471 ML {* @{theory_ref} *}
3472 ML {* @{theory_ref Pure} *}
3475 ML {* @{clasimpset} *}
3477 The same works for sources being ``used'' within an Isar context.
3479 * ML in Isar: improved error reporting; extra verbosity with
3480 ML_Context.trace enabled.
3482 * Pure/General/table.ML: the join operations now works via exceptions
3483 DUP/SAME instead of type option. This is simpler in simple cases, and
3484 admits slightly more efficient complex applications.
3486 * Pure: 'advanced' translation functions (parse_translation etc.) now
3487 use Context.generic instead of just theory.
3489 * Pure: datatype Context.generic joins theory/Proof.context and
3490 provides some facilities for code that works in either kind of
3491 context, notably GenericDataFun for uniform theory and proof data.
3493 * Pure: simplified internal attribute type, which is now always
3494 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3495 local (Proof.context) attributes have been discontinued, while
3496 minimizing code duplication. Thm.rule_attribute and
3497 Thm.declaration_attribute build canonical attributes; see also structure
3498 Context for further operations on Context.generic, notably
3499 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3500 declarations and definitions.
3502 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3503 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3504 init only required for impure data. INCOMPATIBILITY: empty really need
3505 to be empty (no dependencies on theory content!)
3507 * Pure/kernel: consts certification ignores sort constraints given in
3508 signature declarations. (This information is not relevant to the
3509 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3510 potential INCOMPATIBILITY.
3512 * Pure: axiomatic type classes are now purely definitional, with
3513 explicit proofs of class axioms and super class relations performed
3514 internally. See Pure/axclass.ML for the main internal interfaces --
3515 notably AxClass.define_class supercedes AxClass.add_axclass, and
3516 AxClass.axiomatize_class/classrel/arity supersede
3517 Sign.add_classes/classrel/arities.
3519 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3520 global/local versions on theory vs. Proof.context have been
3521 discontinued; Attrib.syntax and Method.syntax have been adapted
3522 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3523 attributes, methods, etc.
3525 * Pure: several functions of signature "... -> theory -> theory * ..."
3526 have been reoriented to "... -> theory -> ... * theory" in order to
3527 allow natural usage in combination with the ||>, ||>>, |-> and
3528 fold_map combinators.
3530 * Pure: official theorem names (closed derivations) and additional
3531 comments (tags) are now strictly separate. Name hints -- which are
3532 maintained as tags -- may be attached any time without affecting the
3535 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3536 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3537 achieve the old behaviour.
3539 * Pure: the "Goal" constant is now called "prop", supporting a
3540 slightly more general idea of ``protecting'' meta-level rule
3543 * Pure: Logic.(un)varify only works in a global context, which is now
3544 enforced instead of silently assumed. INCOMPATIBILITY, may use
3545 Logic.legacy_(un)varify as temporary workaround.
3547 * Pure: structure Name provides scalable operations for generating
3548 internal variable names, notably Name.variants etc. This replaces
3549 some popular functions from term.ML:
3551 Term.variant -> Name.variant
3552 Term.variantlist -> Name.variant_list
3553 Term.invent_names -> Name.invent_list
3555 Note that low-level renaming rarely occurs in new code -- operations
3556 from structure Variable are used instead (see below).
3558 * Pure: structure Variable provides fundamental operations for proper
3559 treatment of fixed/schematic variables in a context. For example,
3560 Variable.import introduces fixes for schematics of given facts and
3561 Variable.export reverses the effect (up to renaming) -- this replaces
3562 various freeze_thaw operations.
3564 * Pure: structure Goal provides simple interfaces for
3565 init/conclude/finish and tactical prove operations (replacing former
3566 Tactic.prove). Goal.prove is the canonical way to prove results
3567 within a given context; Goal.prove_global is a degraded version for
3568 theory level goals, including a global Drule.standard. Note that
3569 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3570 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3571 in a locale context).
3573 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3574 and type checking (Syntax.check_term etc.), with common combinations
3575 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3576 which are considered legacy and await removal.
3578 * Pure/Syntax: generic interfaces for type unchecking
3579 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3580 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3581 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3582 available for convenience, but refer to the very same operations using
3583 a mere theory instead of a full context.
3585 * Isar: simplified treatment of user-level errors, using exception
3586 ERROR of string uniformly. Function error now merely raises ERROR,
3587 without any side effect on output channels. The Isar toplevel takes
3588 care of proper display of ERROR exceptions. ML code may use plain
3589 handle/can/try; cat_error may be used to concatenate errors like this:
3591 ... handle ERROR msg => cat_error msg "..."
3593 Toplevel ML code (run directly or through the Isar toplevel) may be
3594 embedded into the Isar toplevel with exception display/debug like
3597 Isar.toplevel (fn () => ...)
3599 INCOMPATIBILITY, removed special transform_error facilities, removed
3600 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3601 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3602 -- use plain ERROR instead.
3604 * Isar: theory setup now has type (theory -> theory), instead of a
3605 list. INCOMPATIBILITY, may use #> to compose setup functions.
3607 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3608 ProofContext.debug/verbose flags.
3610 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3611 theory before entering a proof state. Transactions now always see a
3612 quasi-functional intermediate checkpoint, both in interactive and
3615 * Isar: simplified interfaces for outer syntax. Renamed
3616 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3617 OuterSyntax.add_parsers -- this functionality is now included in
3618 OuterSyntax.command etc. INCOMPATIBILITY.
3620 * Simplifier: the simpset of a running simplification process now
3621 contains a proof context (cf. Simplifier.the_context), which is the
3622 very context that the initial simpset has been retrieved from (by
3623 simpset_of/local_simpset_of). Consequently, all plug-in components
3624 (solver, looper etc.) may depend on arbitrary proof data.
3626 * Simplifier.inherit_context inherits the proof context (plus the
3627 local bounds) of the current simplification process; any simproc
3628 etc. that calls the Simplifier recursively should do this! Removed
3629 former Simplifier.inherit_bounds, which is already included here --
3630 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3631 specify an explicit context using Simplifier.context/theory_context.
3633 * Simplifier/Classical Reasoner: more abstract interfaces
3634 change_simpset/claset for modifying the simpset/claset reference of a
3635 theory; raw versions simpset/claset_ref etc. have been discontinued --
3638 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3644 * settings: the default heap location within ISABELLE_HOME_USER now
3645 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3646 Isabelle installations.
3648 * isabelle-process: option -S (secure mode) disables some critical
3649 operations, notably runtime compilation and evaluation of ML source
3652 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3654 * Support for parallel execution, using native multicore support of
3655 Poly/ML 5.1. The theory loader exploits parallelism when processing
3656 independent theories, according to the given theory header
3657 specifications. The maximum number of worker threads is specified via
3658 usedir option -M or the "max-threads" setting in Proof General. A
3659 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3660 to 6 on a 8-core machine. User-code needs to observe certain
3661 guidelines for thread-safe programming, see appendix A in the Isar
3662 Implementation manual.
3666 New in Isabelle2005 (October 2005)
3667 ----------------------------------
3671 * Theory headers: the new header syntax for Isar theories is
3674 imports <theory1> ... <theoryN>
3675 uses <file1> ... <fileM>
3678 where the 'uses' part is optional. The previous syntax
3680 theory <name> = <theory1> + ... + <theoryN>:
3682 will disappear in the next release. Use isatool fixheaders to convert
3683 existing theory files. Note that there is no change in ancient
3684 non-Isar theories now, but these will disappear soon.
3686 * Theory loader: parent theories can now also be referred to via
3687 relative and absolute paths.
3689 * Command 'find_theorems' searches for a list of criteria instead of a
3690 list of constants. Known criteria are: intro, elim, dest, name:string,
3691 simp:term, and any term. Criteria can be preceded by '-' to select
3692 theorems that do not match. Intro, elim, dest select theorems that
3693 match the current goal, name:s selects theorems whose fully qualified
3694 name contain s, and simp:term selects all simplification rules whose
3695 lhs match term. Any other term is interpreted as pattern and selects
3696 all theorems matching the pattern. Available in ProofGeneral under
3697 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3699 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3701 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3702 matching the current goal as introduction rule and not having "HOL."
3703 in their name (i.e. not being defined in theory HOL).
3705 * Command 'thms_containing' has been discontinued in favour of
3706 'find_theorems'; INCOMPATIBILITY.
3708 * Communication with Proof General is now 8bit clean, which means that
3709 Unicode text in UTF-8 encoding may be used within theory texts (both
3710 formal and informal parts). Cf. option -U of the Isabelle Proof
3711 General interface. Here are some simple examples (cf. src/HOL/ex):
3713 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3714 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3716 * Improved efficiency of the Simplifier and, to a lesser degree, the
3717 Classical Reasoner. Typical big applications run around 2 times
3721 *** Document preparation ***
3723 * Commands 'display_drafts' and 'print_drafts' perform simple output
3724 of raw sources. Only those symbols that do not require additional
3725 LaTeX packages (depending on comments in isabellesym.sty) are
3726 displayed properly, everything else is left verbatim. isatool display
3727 and isatool print are used as front ends (these are subject to the
3728 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3730 * Command tags control specific markup of certain regions of text,
3731 notably folding and hiding. Predefined tags include "theory" (for
3732 theory begin and end), "proof" for proof commands, and "ML" for
3733 commands involving ML code; the additional tags "visible" and
3734 "invisible" are unused by default. Users may give explicit tag
3735 specifications in the text, e.g. ''by %invisible (auto)''. The
3736 interpretation of tags is determined by the LaTeX job during document
3737 preparation: see option -V of isatool usedir, or options -n and -t of
3738 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3741 Several document versions may be produced at the same time via isatool
3742 usedir (the generated index.html will link all of them). Typical
3743 specifications include ''-V document=theory,proof,ML'' to present
3744 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3745 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3746 these parts without any formal replacement text. The Isabelle site
3747 default settings produce ''document'' and ''outline'' versions as
3750 * Several new antiquotations:
3752 @{term_type term} prints a term with its type annotated;
3754 @{typeof term} prints the type of a term;
3756 @{const const} is the same as @{term const}, but checks that the
3757 argument is a known logical constant;
3759 @{term_style style term} and @{thm_style style thm} print a term or
3760 theorem applying a "style" to it
3764 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3765 definitions, equations, inequations etc., 'concl' printing only the
3766 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3767 to print the specified premise. TermStyle.add_style provides an ML
3768 interface for introducing further styles. See also the "LaTeX Sugar"
3769 document practical applications. The ML antiquotation prints
3770 type-checked ML expressions verbatim.
3772 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3773 and 'text' support optional locale specification '(in loc)', which
3774 specifies the default context for interpreting antiquotations. For
3775 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3777 * Option 'locale=NAME' of antiquotations specifies an alternative
3778 context interpreting the subsequent argument. For example: @{thm
3779 [locale=lattice] inf_assoc}.
3781 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3784 * Proper output of antiquotations for theory commands involving a
3785 proof context (such as 'locale' or 'theorem (in loc) ...').
3787 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3788 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3790 * isatool usedir: new option -C (default true) controls whether option
3791 -D should include a copy of the original document directory; -C false
3792 prevents unwanted effects such as copying of administrative CVS data.
3797 * Considerably improved version of 'constdefs' command. Now performs
3798 automatic type-inference of declared constants; additional support for
3799 local structure declarations (cf. locales and HOL records), see also
3800 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3801 sequential dependencies of definitions within a single 'constdefs'
3802 section; moreover, the declared name needs to be an identifier. If
3803 all fails, consider to fall back on 'consts' and 'defs' separately.
3805 * Improved indexed syntax and implicit structures. First of all,
3806 indexed syntax provides a notational device for subscripted
3807 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3808 expressions. Secondly, in a local context with structure
3809 declarations, number indexes \<^sub>n or the empty index (default
3810 number 1) refer to a certain fixed variable implicitly; option
3811 show_structs controls printing of implicit structures. Typical
3812 applications of these concepts involve record types and locales.
3814 * New command 'no_syntax' removes grammar declarations (and
3815 translations) resulting from the given syntax specification, which is
3816 interpreted in the same manner as for the 'syntax' command.
3818 * 'Advanced' translation functions (parse_translation etc.) may depend
3819 on the signature of the theory context being presently used for
3820 parsing/printing, see also isar-ref manual.
3822 * Improved 'oracle' command provides a type-safe interface to turn an
3823 ML expression of type theory -> T -> term into a primitive rule of
3824 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3825 is already included here); see also FOL/ex/IffExample.thy;
3828 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3829 before); "cI" is no longer bound, use "c.intro" instead.
3830 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3831 axclasses vs. locales.
3833 * Improved internal renaming of symbolic identifiers -- attach primes
3834 instead of base 26 numbers.
3836 * New flag show_question_marks controls printing of leading question
3837 marks in schematic variable names.
3839 * In schematic variable names, *any* symbol following \<^isub> or
3840 \<^isup> is now treated as part of the base name. For example, the
3841 following works without printing of awkward ".0" indexes:
3843 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3846 * Inner syntax includes (*(*nested*) comments*).
3848 * Pretty printer now supports unbreakable blocks, specified in mixfix
3849 annotations as "(00...)".
3851 * Clear separation of logical types and nonterminals, where the latter
3852 may only occur in 'syntax' specifications or type abbreviations.
3853 Before that distinction was only partially implemented via type class
3854 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3855 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3856 exotic syntax specifications may require further adaption
3857 (e.g. Cube/Cube.thy).
3859 * Removed obsolete type class "logic", use the top sort {} instead.
3860 Note that non-logical types should be declared as 'nonterminals'
3861 rather than 'types'. INCOMPATIBILITY for new object-logic
3864 * Attributes 'induct' and 'cases': type or set names may now be
3865 locally fixed variables as well.
3867 * Simplifier: can now control the depth to which conditional rewriting
3868 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3871 * Simplifier: simplification procedures may now take the current
3872 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3873 interface), which is very useful for calling the Simplifier
3874 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3875 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3876 low-level mk_simproc no longer applies Logic.varify internally, to
3877 allow for use in a context of fixed variables.
3879 * thin_tac now works even if the assumption being deleted contains !!
3880 or ==>. More generally, erule now works even if the major premise of
3881 the elimination rule contains !! or ==>.
3883 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3885 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3886 from Pure, which contains all common declarations already. Both
3887 theories are defined via plain Isabelle/Isar .thy files.
3888 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3889 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3890 use isatool fixcpure to adapt your theory and ML sources.
3892 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3893 selections of theorems in named facts via index ranges.
3895 * 'print_theorems': in theory mode, really print the difference
3896 wrt. the last state (works for interactive theory development only),
3897 in proof mode print all local facts (cf. 'print_facts');
3899 * 'hide': option '(open)' hides only base names.
3901 * More efficient treatment of intermediate checkpoints in interactive
3904 * Code generator is now invoked via code_module (incremental code
3905 generation) and code_library (modular code generation, ML structures
3906 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3907 must be quoted when used as identifiers.
3909 * New 'value' command for reading, evaluating and printing terms using
3910 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3911 quoted when used as identifier.
3916 * New commands for the interpretation of locale expressions in
3917 theories (1), locales (2) and proof contexts (3). These generate
3918 proof obligations from the expression specification. After the
3919 obligations have been discharged, theorems of the expression are added
3920 to the theory, target locale or proof context. The synopsis of the
3921 commands is a follows:
3923 (1) interpretation expr inst
3924 (2) interpretation target < expr
3925 (3) interpret expr inst
3927 Interpretation in theories and proof contexts require a parameter
3928 instantiation of terms from the current context. This is applied to
3929 specifications and theorems of the interpreted expression.
3930 Interpretation in locales only permits parameter renaming through the
3931 locale expression. Interpretation is smart in that interpretations
3932 that are active already do not occur in proof obligations, neither are
3933 instantiated theorems stored in duplicate. Use 'print_interps' to
3934 inspect active interpretations of a particular locale. For details,
3935 see the Isar Reference manual. Examples can be found in
3936 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3938 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3939 'interpret' instead.
3941 * New context element 'constrains' for adding type constraints to
3944 * Context expressions: renaming of parameters with syntax
3947 * Locale declaration: 'includes' disallowed.
3949 * Proper static binding of attribute syntax -- i.e. types / terms /
3950 facts mentioned as arguments are always those of the locale definition
3951 context, independently of the context of later invocations. Moreover,
3952 locale operations (renaming and type / term instantiation) are applied
3953 to attribute arguments as expected.
3955 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3956 actual attributes; rare situations may require Attrib.attribute to
3957 embed those attributes into Attrib.src that lack concrete syntax.
3958 Attribute implementations need to cooperate properly with the static
3959 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3960 Attrib.XXX_thm etc. already do the right thing without further
3961 intervention. Only unusual applications -- such as "where" or "of"
3962 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3963 on the context and the facts involved -- may have to assign parsed
3964 values to argument tokens explicitly.
3966 * Changed parameter management in theorem generation for long goal
3967 statements with 'includes'. INCOMPATIBILITY: produces a different
3968 theorem statement in rare situations.
3970 * Locale inspection command 'print_locale' omits notes elements. Use
3971 'print_locale!' to have them included in the output.
3976 * Provers/hypsubst.ML: improved version of the subst method, for
3977 single-step rewriting: it now works in bound variable contexts. New is
3978 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3979 rewrite a different subterm than the original subst method, which is
3980 still available as 'simplesubst'.
3982 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3985 * Provers/trancl.ML: new transitivity reasoner for transitive and
3986 reflexive-transitive closure of relations.
3988 * Provers/blast.ML: new reference depth_limit to make blast's depth
3989 limit (previously hard-coded with a value of 20) user-definable.
3991 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3992 is peformed already. Object-logics merely need to finish their
3993 initial simpset configuration as before. INCOMPATIBILITY.
3998 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4001 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4003 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4004 and x-symbol; use option '-m epsilon' to get it actually printed.
4005 Moreover, the mathematically important symbolic identifier \<epsilon>
4006 becomes available as variable, constant etc. INCOMPATIBILITY,
4008 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4009 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4010 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4011 support corresponding Isar calculations.
4013 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4016 * theory SetInterval: changed the syntax for open intervals:
4025 The old syntax is still supported but will disappear in the next
4026 release. For conversion use the following Emacs search and replace
4027 patterns (these are not perfect but work quite well):
4029 {)\([^\.]*\)\.\. -> {\1<\.\.}
4030 \.\.\([^(}]*\)(} -> \.\.<\1}
4032 * Theory Commutative_Ring (in Library): method comm_ring for proving
4033 equalities in commutative rings; method 'algebra' provides a generic
4036 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4037 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4038 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4041 Some new syntax forms are available:
4043 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4044 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4045 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4046 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4048 The latter form "\<Sum>x < k. e" used to be based on a separate
4049 function "Summation", which has been discontinued.
4051 * theory Finite_Set: in structured induction proofs, the insert case
4052 is now 'case (insert x F)' instead of the old counterintuitive 'case
4055 * The 'refute' command has been extended to support a much larger
4056 fragment of HOL, including axiomatic type classes, constdefs and
4057 typedefs, inductive datatypes and recursion.
4059 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4060 Requires zChaff with proof generation to be installed. See
4061 HOL/ex/SAT_Examples.thy for examples.
4063 * Datatype induction via method 'induct' now preserves the name of the
4064 induction variable. For example, when proving P(xs::'a list) by
4065 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4066 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4067 in unstructured proof scripts.
4069 * Reworked implementation of records. Improved scalability for
4070 records with many fields, avoiding performance problems for type
4071 inference. Records are no longer composed of nested field types, but
4072 of nested extension types. Therefore the record type only grows linear
4073 in the number of extensions and not in the number of fields. The
4074 top-level (users) view on records is preserved. Potential
4075 INCOMPATIBILITY only in strange cases, where the theory depends on the
4076 old record representation. The type generated for a record is called
4077 <record_name>_ext_type.
4079 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4080 proofs triggered by a record definition or a simproc (if
4081 quick_and_dirty is enabled). Definitions of large records can take
4084 New simproc record_upd_simproc for simplification of multiple record
4085 updates enabled by default. Moreover, trivial updates are also
4086 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4087 occasionally, since simplification is more powerful by default.
4089 * typedef: proper support for polymorphic sets, which contain extra
4090 type-variables in the term.
4092 * Simplifier: automatically reasons about transitivity chains
4093 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4094 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4095 old proofs break occasionally as simplification may now solve more
4096 goals than previously.
4098 * Simplifier: converts x <= y into x = y if assumption y <= x is
4099 present. Works for all partial orders (class "order"), in particular
4100 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4103 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4104 bound variable or a constant then the let is unfolded. Otherwise
4105 first a is simplified to b, and then f b is simplified to g. If
4106 possible we abstract b from g arriving at "let x = b in h x",
4107 otherwise we unfold the let and arrive at g. The simproc can be
4108 enabled/disabled by the reference use_let_simproc. Potential
4109 INCOMPATIBILITY since simplification is more powerful by default.
4111 * Classical reasoning: the meson method now accepts theorems as arguments.
4113 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4114 jobs to provide advice on the provability of subgoals.
4116 * Theory OrderedGroup and Ring_and_Field: various additions and
4117 improvements to faciliate calculations involving equalities and
4120 The following theorems have been eliminated or modified
4123 abs_eq now named abs_of_nonneg
4124 abs_of_ge_0 now named abs_of_nonneg
4125 abs_minus_eq now named abs_of_nonpos
4126 imp_abs_id now named abs_of_nonneg
4127 imp_abs_neg_id now named abs_of_nonpos
4128 mult_pos now named mult_pos_pos
4129 mult_pos_le now named mult_nonneg_nonneg
4130 mult_pos_neg_le now named mult_nonneg_nonpos
4131 mult_pos_neg2_le now named mult_nonneg_nonpos2
4132 mult_neg now named mult_neg_neg
4133 mult_neg_le now named mult_nonpos_nonpos
4135 * The following lemmas in Ring_and_Field have been added to the simplifier:
4138 not_square_less_zero
4140 The following lemmas have been deleted from Real/RealPow:
4150 * Theory Parity: added rules for simplifying exponents.
4154 The following theorems have been eliminated or modified
4157 list_all_Nil now named list_all.simps(1)
4158 list_all_Cons now named list_all.simps(2)
4159 list_all_conv now named list_all_iff
4160 set_mem_eq now named mem_iff
4162 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4163 asymptotic "big O" calculations. See the notes in BigO.thy.
4168 * Theory RealDef: better support for embedding natural numbers and
4169 integers in the reals.
4171 The following theorems have been eliminated or modified
4174 exp_ge_add_one_self now requires no hypotheses
4175 real_of_int_add reversed direction of equality (use [symmetric])
4176 real_of_int_minus reversed direction of equality (use [symmetric])
4177 real_of_int_diff reversed direction of equality (use [symmetric])
4178 real_of_int_mult reversed direction of equality (use [symmetric])
4180 * Theory RComplete: expanded support for floor and ceiling functions.
4182 * Theory Ln is new, with properties of the natural logarithm
4184 * Hyperreal: There is a new type constructor "star" for making
4185 nonstandard types. The old type names are now type synonyms:
4189 hcomplex = complex star
4191 * Hyperreal: Many groups of similarly-defined constants have been
4192 replaced by polymorphic versions (INCOMPATIBILITY):
4194 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4196 starset <-- starsetNat, starsetC
4197 *s* <-- *sNat*, *sc*
4198 starset_n <-- starsetNat_n, starsetC_n
4199 *sn* <-- *sNatn*, *scn*
4200 InternalSets <-- InternalNatSets, InternalCSets
4202 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4203 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4204 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4205 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4206 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4208 * Hyperreal: Many type-specific theorems have been removed in favor of
4209 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4211 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4212 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4213 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4214 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4215 right_minus <-- hypreal_add_minus
4216 left_minus <-- {hypreal,hcomplex}_add_minus_left
4217 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4218 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4219 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4220 mult_1_right <-- hcomplex_mult_one_right
4221 mult_zero_left <-- hcomplex_mult_zero_left
4222 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4223 right_distrib <-- hypnat_add_mult_distrib2
4224 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4225 right_inverse <-- hypreal_mult_inverse
4226 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4227 order_refl <-- {hypreal,hypnat}_le_refl
4228 order_trans <-- {hypreal,hypnat}_le_trans
4229 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4230 order_less_le <-- {hypreal,hypnat}_less_le
4231 linorder_linear <-- {hypreal,hypnat}_le_linear
4232 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4233 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4234 add_nonneg_nonneg <-- hypreal_le_add_order
4236 * Hyperreal: Separate theorems having to do with type-specific
4237 versions of constants have been merged into theorems that apply to the
4238 new polymorphic constants (INCOMPATIBILITY):
4240 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4241 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4242 STAR_Un <-- {STAR,NatStar,STARC}_Un
4243 STAR_Int <-- {STAR,NatStar,STARC}_Int
4244 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4245 STAR_subset <-- {STAR,NatStar,STARC}_subset
4246 STAR_mem <-- {STAR,NatStar,STARC}_mem
4247 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4248 STAR_diff <-- {STAR,STARC}_diff
4249 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4250 STARC_hcomplex_of_complex}_image_subset
4251 starset_n_Un <-- starset{Nat,C}_n_Un
4252 starset_n_Int <-- starset{Nat,C}_n_Int
4253 starset_n_Compl <-- starset{Nat,C}_n_Compl
4254 starset_n_diff <-- starset{Nat,C}_n_diff
4255 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4256 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4257 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4258 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4259 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4260 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4261 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4262 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4263 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4264 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4265 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4266 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4267 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4268 starfun_diff <-- starfun{C,RC,CR}_diff
4269 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4270 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4271 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4272 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4273 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4274 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4275 starfun_Id <-- starfunC_Id
4276 starfun_approx <-- starfun{Nat,CR}_approx
4277 starfun_capprox <-- starfun{C,RC}_capprox
4278 starfun_abs <-- starfunNat_rabs
4279 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4280 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4281 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4282 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4283 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4284 starfun_add_approx <-- starfunCR_add_approx
4285 starfun_inverse_inverse <-- starfunC_inverse_inverse
4286 starfun_divide <-- starfun{C,CR,RC}_divide
4287 starfun_n <-- starfun{Nat,C}_n
4288 starfun_n_mult <-- starfun{Nat,C}_n_mult
4289 starfun_n_add <-- starfun{Nat,C}_n_add
4290 starfun_n_add_minus <-- starfunNat_n_add_minus
4291 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4292 starfun_n_minus <-- starfun{Nat,C}_n_minus
4293 starfun_n_eq <-- starfun{Nat,C}_n_eq
4295 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4296 star_n_minus <-- {hypreal,hcomplex}_minus
4297 star_n_diff <-- {hypreal,hcomplex}_diff
4298 star_n_mult <-- {hypreal,hcomplex}_mult
4299 star_n_inverse <-- {hypreal,hcomplex}_inverse
4300 star_n_le <-- {hypreal,hypnat}_le
4301 star_n_less <-- {hypreal,hypnat}_less
4302 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4303 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4304 star_n_abs <-- hypreal_hrabs
4305 star_n_divide <-- hcomplex_divide
4307 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4308 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4309 star_of_diff <-- hypreal_of_real_diff
4310 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4311 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4312 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4313 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4314 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4315 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4316 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4317 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4318 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4319 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4320 star_of_number_of <-- {hypreal,hcomplex}_number_of
4321 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4322 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4323 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4324 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4325 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4326 star_of_power <-- hypreal_of_real_power
4327 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4329 * Hyperreal: new method "transfer" that implements the transfer
4330 principle of nonstandard analysis. With a subgoal that mentions
4331 nonstandard types like "'a star", the command "apply transfer"
4332 replaces it with an equivalent one that mentions only standard types.
4333 To be successful, all free variables must have standard types; non-
4334 standard variables must have explicit universal quantifiers.
4336 * Hyperreal: A theory of Taylor series.
4341 * Discontinued special version of 'constdefs' (which used to support
4342 continuous functions) in favor of the general Pure one with full
4345 * New simplification procedure for solving continuity conditions; it
4346 is much faster on terms with many nested lambda abstractions (cubic
4347 instead of exponential time).
4349 * New syntax for domain package: selector names are now optional.
4350 Parentheses should be omitted unless argument is lazy, for example:
4352 domain 'a stream = cons "'a" (lazy "'a stream")
4354 * New command 'fixrec' for defining recursive functions with pattern
4355 matching; defining multiple functions with mutual recursion is also
4356 supported. Patterns may include the constants cpair, spair, up, sinl,
4357 sinr, or any data constructor defined by the domain package. The given
4358 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4359 syntax and examples.
4361 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4362 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4363 but the proof obligation additionally includes an admissibility
4364 requirement. The packages generate instances of class cpo or pcpo,
4365 with continuity and strictness theorems for Rep and Abs.
4367 * HOLCF: Many theorems have been renamed according to a more standard naming
4368 scheme (INCOMPATIBILITY):
4370 foo_inject: "foo$x = foo$y ==> x = y"
4371 foo_eq: "(foo$x = foo$y) = (x = y)"
4372 foo_less: "(foo$x << foo$y) = (x << y)"
4373 foo_strict: "foo$UU = UU"
4374 foo_defined: "... ==> foo$x ~= UU"
4375 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4380 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4381 including the First Isomorphism Theorem (on quotienting by the kernel
4384 * ZF/Simplifier: install second copy of type solver that actually
4385 makes use of TC rules declared to Isar proof contexts (or locales);
4386 the old version is still required for ML proof scripts.
4391 * Converted to Isar theory format; use locales instead of axiomatic
4397 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4400 * Pure/library.ML no longer defines its own option datatype, but uses
4401 that of the SML basis, which has constructors NONE and SOME instead of
4402 None and Some, as well as exception Option.Option instead of OPTION.
4403 The functions the, if_none, is_some, is_none have been adapted
4404 accordingly, while Option.map replaces apsome.
4406 * Pure/library.ML: the exception LIST has been given up in favour of
4407 the standard exceptions Empty and Subscript, as well as
4408 Library.UnequalLengths. Function like Library.hd and Library.tl are
4409 superceded by the standard hd and tl functions etc.
4411 A number of basic list functions are no longer exported to the ML
4412 toplevel, as they are variants of predefined functions. The following
4413 suggests how one can translate existing code:
4415 rev_append xs ys = List.revAppend (xs, ys)
4416 nth_elem (i, xs) = List.nth (xs, i)
4417 last_elem xs = List.last xs
4418 flat xss = List.concat xss
4419 seq fs = List.app fs
4420 partition P xs = List.partition P xs
4421 mapfilter f xs = List.mapPartial f xs
4423 * Pure/library.ML: several combinators for linear functional
4424 transformations, notably reverse application and composition:
4427 (x, y) |-> f f #-> g
4429 * Pure/library.ML: introduced/changed precedence of infix operators:
4431 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4433 infix 3 o oo ooo oooo;
4434 infix 4 ~~ upto downto;
4436 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4439 * Pure/library.ML: natural list combinators fold, fold_rev, and
4440 fold_map support linear functional transformations and nesting. For
4443 fold f [x1, ..., xN] y =
4444 y |> f x1 |> ... |> f xN
4446 (fold o fold) f [xs1, ..., xsN] y =
4447 y |> fold f xs1 |> ... |> fold f xsN
4449 fold f [x1, ..., xN] =
4452 (fold o fold) f [xs1, ..., xsN] =
4453 fold f xs1 #> ... #> fold f xsN
4455 * Pure/library.ML: the following selectors on type 'a option are
4458 the: 'a option -> 'a (*partial*)
4459 these: 'a option -> 'a where 'a = 'b list
4460 the_default: 'a -> 'a option -> 'a
4461 the_list: 'a option -> 'a list
4463 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4464 basic operations for association lists, following natural argument
4465 order; moreover the explicit equality predicate passed here avoids
4466 potentially expensive polymorphic runtime equality checks.
4467 The old functions may be expressed as follows:
4469 assoc = uncurry (AList.lookup (op =))
4470 assocs = these oo AList.lookup (op =)
4471 overwrite = uncurry (AList.update (op =)) o swap
4473 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4475 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4476 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4478 replacing make_keylist and keyfilter (occassionally used)
4481 make_keylist = AList.make
4482 keyfilter = AList.find (op =)
4484 * eq_fst and eq_snd now take explicit equality parameter, thus
4485 avoiding eqtypes. Naive rewrites:
4487 eq_fst = eq_fst (op =)
4488 eq_snd = eq_snd (op =)
4490 * Removed deprecated apl and apr (rarely used).
4493 apl (n, op) =>>= curry op n
4494 apr (op, m) =>>= fn n => op (n, m)
4496 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4497 provides a reasonably efficient light-weight implementation of sets as
4500 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4501 few new operations; existing lookup and update are now curried to
4502 follow natural argument order (for use with fold etc.);
4503 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4505 * Pure/General: output via the Isabelle channels of
4506 writeln/warning/error etc. is now passed through Output.output, with a
4507 hook for arbitrary transformations depending on the print_mode
4508 (cf. Output.add_mode -- the first active mode that provides a output
4509 function wins). Already formatted output may be embedded into further
4510 text via Output.raw; the result of Pretty.string_of/str_of and derived
4511 functions (string_of_term/cterm/thm etc.) is already marked raw to
4512 accommodate easy composition of diagnostic messages etc. Programmers
4513 rarely need to care about Output.output or Output.raw at all, with
4514 some notable exceptions: Output.output is required when bypassing the
4515 standard channels (writeln etc.), or in token translations to produce
4516 properly formatted results; Output.raw is required when capturing
4517 already output material that will eventually be presented to the user
4518 a second time. For the default print mode, both Output.output and
4519 Output.raw have no effect.
4521 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4522 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4523 cumulative results are displayed at the end of a batch session.
4525 * Pure/General: File.sysify_path and File.quote_sysify path have been
4526 replaced by File.platform_path and File.shell_path (with appropriate
4527 hooks). This provides a clean interface for unusual systems where the
4528 internal and external process view of file names are different.
4530 * Pure: more efficient orders for basic syntactic entities: added
4531 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4532 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4533 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4534 orders now -- potential INCOMPATIBILITY for code that depends on a
4535 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4536 Library.sort_strings on result).
4538 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4539 fold_types traverse types/terms from left to right, observing natural
4540 argument order. Supercedes previous foldl_XXX versions, add_frees,
4541 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4543 * Pure: name spaces have been refined, with significant changes of the
4544 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4545 to extern(_table). The plain name entry path is superceded by a
4546 general 'naming' context, which also includes the 'policy' to produce
4547 a fully qualified name and external accesses of a fully qualified
4548 name; NameSpace.extend is superceded by context dependent
4549 Sign.declare_name. Several theory and proof context operations modify
4550 the naming context. Especially note Theory.restore_naming and
4551 ProofContext.restore_naming to get back to a sane state; note that
4552 Theory.add_path is no longer sufficient to recover from
4553 Theory.absolute_path in particular.
4555 * Pure: new flags short_names (default false) and unique_names
4556 (default true) for controlling output of qualified names. If
4557 short_names is set, names are printed unqualified. If unique_names is
4558 reset, the name prefix is reduced to the minimum required to achieve
4559 the original result when interning again, even if there is an overlap
4560 with earlier declarations.
4562 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4563 now 'extend', and 'merge' gets an additional Pretty.pp argument
4564 (useful for printing error messages). INCOMPATIBILITY.
4566 * Pure: major reorganization of the theory context. Type Sign.sg and
4567 Theory.theory are now identified, referring to the universal
4568 Context.theory (see Pure/context.ML). Actual signature and theory
4569 content is managed as theory data. The old code and interfaces were
4570 spread over many files and structures; the new arrangement introduces
4571 considerable INCOMPATIBILITY to gain more clarity:
4573 Context -- theory management operations (name, identity, inclusion,
4574 parents, ancestors, merge, etc.), plus generic theory data;
4576 Sign -- logical signature and syntax operations (declaring consts,
4577 types, etc.), plus certify/read for common entities;
4579 Theory -- logical theory operations (stating axioms, definitions,
4580 oracles), plus a copy of logical signature operations (consts,
4581 types, etc.); also a few basic management operations (Theory.copy,
4584 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4585 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4586 for convenience -- they merely return the theory.
4588 * Pure: type Type.tsig is superceded by theory in most interfaces.
4590 * Pure: the Isar proof context type is already defined early in Pure
4591 as Context.proof (note that ProofContext.context and Proof.context are
4592 aliases, where the latter is the preferred name). This enables other
4593 Isabelle components to refer to that type even before Isar is present.
4595 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4596 typeK, constK, axiomK, oracleK), but provide explicit operations for
4597 any of these kinds. For example, Sign.intern typeK is now
4598 Sign.intern_type, Theory.hide_space Sign.typeK is now
4599 Theory.hide_types. Also note that former
4600 Theory.hide_classes/types/consts are now
4601 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4602 internalize their arguments! INCOMPATIBILITY.
4604 * Pure: get_thm interface (of PureThy and ProofContext) expects
4605 datatype thmref (with constructors Name and NameSelection) instead of
4606 plain string -- INCOMPATIBILITY;
4608 * Pure: cases produced by proof methods specify options, where NONE
4609 means to remove case bindings -- INCOMPATIBILITY in
4612 * Pure: the following operations retrieve axioms or theorems from a
4613 theory node or theory hierarchy, respectively:
4615 Theory.axioms_of: theory -> (string * term) list
4616 Theory.all_axioms_of: theory -> (string * term) list
4617 PureThy.thms_of: theory -> (string * thm) list
4618 PureThy.all_thms_of: theory -> (string * thm) list
4620 * Pure: print_tac now outputs the goal through the trace channel.
4622 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4623 Reference Toplevel.debug (default false) controls detailed printing
4624 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4625 controls execution profiling -- set to 1 for time and 2 for space
4626 (both increase the runtime).
4628 * Isar session: The initial use of ROOT.ML is now always timed,
4629 i.e. the log will show the actual process times, in contrast to the
4630 elapsed wall-clock time that the outer shell wrapper produces.
4632 * Simplifier: improved handling of bound variables (nameless
4633 representation, avoid allocating new strings). Simprocs that invoke
4634 the Simplifier recursively should use Simplifier.inherit_bounds to
4635 avoid local name clashes. Failure to do so produces warnings
4636 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4637 for further details.
4639 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4640 bindings for all theorems stored within a given theory; this may help
4641 in porting non-Isar theories to Isar ones, while keeping ML proof
4642 scripts for the time being.
4644 * ML operator HTML.with_charset specifies the charset begin used for
4645 generated HTML files. For example:
4647 HTML.with_charset "utf-8" use_thy "Hebrew";
4648 HTML.with_charset "utf-8" use_thy "Chinese";
4653 * Allow symlinks to all proper Isabelle executables (Isabelle,
4654 isabelle, isatool etc.).
4656 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4657 isatool doc, isatool mkdir, display_drafts etc.).
4659 * isatool usedir: option -f allows specification of the ML file to be
4660 used by Isabelle; default is ROOT.ML.
4662 * New isatool version outputs the version identifier of the Isabelle
4663 distribution being used.
4665 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4666 (containing Boolean satisfiability problems) into Isabelle/HOL
4671 New in Isabelle2004 (April 2004)
4672 --------------------------------
4676 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4677 Replaces linorder.ML.
4679 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4680 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4681 (\<a>...\<z>), are now considered normal letters, and can therefore
4682 be used anywhere where an ASCII letter (a...zA...Z) has until
4683 now. COMPATIBILITY: This obviously changes the parsing of some
4684 terms, especially where a symbol has been used as a binder, say
4685 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4686 as an identifier. Fix it by inserting a space around former
4687 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4688 existing theory and ML files.
4690 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4692 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4693 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4694 a normal (but invisible) letter. For multiple letter subscripts repeat
4695 \<^isub> like this: x\<^isub>1\<^isub>2.
4697 * Pure: There are now sub-/superscripts that can span more than one
4698 character. Text between \<^bsub> and \<^esub> is set in subscript in
4699 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4700 superscript. The new control characters are not identifier parts.
4702 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4703 content of "..." to the latex file instead of \isacntrl... . The "..."
4704 may consist of any printable characters excluding the end bracket >.
4706 * Pure: Using new Isar command "finalconsts" (or the ML functions
4707 Theory.add_finals or Theory.add_finals_i) it is now possible to
4708 declare constants "final", which prevents their being given a definition
4709 later. It is useful for constants whose behaviour is fixed axiomatically
4710 rather than definitionally, such as the meta-logic connectives.
4712 * Pure: 'instance' now handles general arities with general sorts
4713 (i.e. intersections of classes),
4715 * Presentation: generated HTML now uses a CSS style sheet to make layout
4716 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4717 It can be changed to alter the colors/layout of generated pages.
4722 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4723 cut_tac, subgoal_tac and thin_tac:
4724 - Now understand static (Isar) contexts. As a consequence, users of Isar
4725 locales are no longer forced to write Isar proof scripts.
4726 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4728 - INCOMPATIBILITY: names of variables to be instantiated may no
4729 longer be enclosed in quotes. Instead, precede variable name with `?'.
4730 This is consistent with the instantiation attribute "where".
4732 * Attributes "where" and "of":
4733 - Now take type variables of instantiated theorem into account when reading
4734 the instantiation string. This fixes a bug that caused instantiated
4735 theorems to have too special types in some circumstances.
4736 - "where" permits explicit instantiations of type variables.
4738 * Calculation commands "moreover" and "also" no longer interfere with
4739 current facts ("this"), admitting arbitrary combinations with "then"
4743 - Goal statements involving the context element "includes" no longer
4744 generate theorems with internal delta predicates (those ending on
4745 "_axioms") in the premise.
4746 Resolve particular premise with <locale>.intro to obtain old form.
4747 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4748 specification and "includes" elements in goal statement.
4749 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4750 [intro?] and [elim?] (respectively) by default.
4751 - Experimental command for instantiation of locales in proof contexts:
4752 instantiate <label>[<attrs>]: <loc>
4753 Instantiates locale <loc> and adds all its theorems to the current context
4754 taking into account their attributes. Label and attrs are optional
4755 modifiers, like in theorem declarations. If present, names of
4756 instantiated theorems are qualified with <label>, and the attributes
4757 <attrs> are applied after any attributes these theorems might have already.
4758 If the locale has assumptions, a chained fact of the form
4759 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4760 are derived. The command does not support old-style locales declared
4761 with "locale (open)".
4762 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4764 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4770 * Proof import: new image HOL4 contains the imported library from
4771 the HOL4 system with about 2500 theorems. It is imported by
4772 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4773 can be used like any other Isabelle image. See
4774 HOL/Import/HOL/README for more information.
4777 - Much improved handling of linear and partial orders.
4778 Reasoners for linear and partial orders are set up for type classes
4779 "linorder" and "order" respectively, and are added to the default simpset
4780 as solvers. This means that the simplifier can build transitivity chains
4781 to solve goals from the assumptions.
4782 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4783 of blast or auto after simplification become unnecessary because the goal
4784 is solved by simplification already.
4786 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4787 all proved in axiomatic type classes for semirings, rings and fields.
4790 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4791 now formalized using the Ring_and_Field theory mentioned above.
4792 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4793 than before, because now they are set up once in a generic manner.
4794 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4795 Look for the general versions in Ring_and_Field (and Power if they concern
4798 * Type "rat" of the rational numbers is now available in HOL-Complex.
4801 - Record types are now by default printed with their type abbreviation
4802 instead of the list of all field types. This can be configured via
4803 the reference "print_record_type_abbr".
4804 - Simproc "record_upd_simproc" for simplification of multiple updates added
4805 (not enabled by default).
4806 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4807 EX x. x = sel r to True (not enabled by default).
4808 - Tactic "record_split_simp_tac" to split and simplify records added.
4810 * 'specification' command added, allowing for definition by
4811 specification. There is also an 'ax_specification' command that
4812 introduces the new constants axiomatically.
4814 * arith(_tac) is now able to generate counterexamples for reals as well.
4816 * HOL-Algebra: new locale "ring" for non-commutative rings.
4818 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4819 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4821 * HOL-Matrix: a first theory for matrices in HOL with an application of
4822 matrix theory to linear programming.
4824 * Unions and Intersections:
4825 The latex output syntax of UN and INT has been changed
4826 from "\Union x \in A. B" to "\Union_{x \in A} B"
4827 i.e. the index formulae has become a subscript.
4828 Similarly for "\Union x. B", and for \Inter instead of \Union.
4830 * Unions and Intersections over Intervals:
4831 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4832 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4833 like in normal math, and corresponding versions for < and for intersection.
4835 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4836 lexicographic dictonary ordering has been added as "lexord".
4838 * ML: the legacy theory structures Int and List have been removed. They had
4839 conflicted with ML Basis Library structures having the same names.
4841 * 'refute' command added to search for (finite) countermodels. Only works
4842 for a fragment of HOL. The installation of an external SAT solver is
4843 highly recommended. See "HOL/Refute.thy" for details.
4845 * 'quickcheck' command: Allows to find counterexamples by evaluating
4846 formulae under an assignment of free variables to random values.
4847 In contrast to 'refute', it can deal with inductive datatypes,
4848 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4854 * Streams now come with concatenation and are part of the HOLCF image
4858 New in Isabelle2003 (May 2003)
4859 ------------------------------
4863 * Provers/simplifier:
4865 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4866 Assumptions are now subject to complete mutual simplification,
4867 not just from left to right. The simplifier now preserves
4868 the order of assumptions.
4870 Potential INCOMPATIBILITY:
4872 -- simp sometimes diverges where the old version did
4873 not, e.g. invoking simp on the goal
4875 [| P (f x); y = x; f x = f y |] ==> Q
4877 now gives rise to the infinite reduction sequence
4879 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4881 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4884 -- Tactics combining classical reasoner and simplification (such as auto)
4885 are also affected by this change, because many of them rely on
4886 simp. They may sometimes diverge as well or yield a different numbers
4887 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4888 in case of problems. Sometimes subsequent calls to the classical
4889 reasoner will fail because a preceeding call to the simplifier too
4890 eagerly simplified the goal, e.g. deleted redundant premises.
4892 - The simplifier trace now shows the names of the applied rewrite rules
4894 - You can limit the number of recursive invocations of the simplifier
4895 during conditional rewriting (where the simplifie tries to solve the
4896 conditions before applying the rewrite rule):
4897 ML "simp_depth_limit := n"
4898 where n is an integer. Thus you can force termination where previously
4899 the simplifier would diverge.
4901 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4903 - No longer aborts on failed congruence proof. Instead, the
4904 congruence is ignored.
4906 * Pure: New generic framework for extracting programs from constructive
4907 proofs. See HOL/Extraction.thy for an example instantiation, as well
4908 as HOL/Extraction for some case studies.
4910 * Pure: The main goal of the proof state is no longer shown by default, only
4911 the subgoals. This behaviour is controlled by a new flag.
4912 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4913 (ML: Proof.show_main_goal).
4915 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4916 rules whose conclusion matches subgoal 1:
4917 PG menu: Isabelle/Isar -> Show me -> matching rules
4918 The rules are ordered by how closely they match the subgoal.
4919 In particular, rules that solve a subgoal outright are displayed first
4920 (or rather last, the way they are printed).
4921 (ML: ProofGeneral.print_intros())
4923 * Pure: New flag trace_unify_fail causes unification to print
4924 diagnostic information (PG: in trace buffer) when it fails. This is
4925 useful for figuring out why single step proofs like rule, erule or
4928 * Pure: Locale specifications now produce predicate definitions
4929 according to the body of text (covering assumptions modulo local
4930 definitions); predicate "loc_axioms" covers newly introduced text,
4931 while "loc" is cumulative wrt. all included locale expressions; the
4932 latter view is presented only on export into the global theory
4933 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4934 on the old view without predicates;
4936 * Pure: predefined locales "var" and "struct" are useful for sharing
4937 parameters (as in CASL, for example); just specify something like
4938 ``var x + var y + struct M'' as import;
4940 * Pure: improved thms_containing: proper indexing of facts instead of
4941 raw theorems; check validity of results wrt. current name space;
4942 include local facts of proof configuration (also covers active
4943 locales), cover fixed variables in index; may use "_" in term
4944 specification; an optional limit for the number of printed facts may
4945 be given (the default is 40);
4947 * Pure: disallow duplicate fact bindings within new-style theory files
4950 * Provers: improved induct method: assumptions introduced by case
4951 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4952 the goal statement); "foo" still refers to all facts collectively;
4954 * Provers: the function blast.overloaded has been removed: all constants
4955 are regarded as potentially overloaded, which improves robustness in exchange
4956 for slight decrease in efficiency;
4958 * Provers/linorder: New generic prover for transitivity reasoning over
4959 linear orders. Note: this prover is not efficient!
4961 * Isar: preview of problems to finish 'show' now produce an error
4962 rather than just a warning (in interactive mode);
4969 - Produces a counter example if it cannot prove a goal.
4970 Note that the counter example may be spurious if the goal is not a formula
4971 of quantifier-free linear arithmetic.
4972 In ProofGeneral the counter example appears in the trace buffer.
4974 - Knows about div k and mod k where k is a numeral of type nat or int.
4976 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4977 linear arithmetic fails. This takes account of quantifiers and divisibility.
4978 Presburger arithmetic can also be called explicitly via presburger(_tac).
4980 * simp's arithmetic capabilities have been enhanced a bit: it now
4981 takes ~= in premises into account (by performing a case split);
4983 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4984 are distributed over a sum of terms;
4986 * New tactic "trans_tac" and method "trans" instantiate
4987 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4990 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4991 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4993 * 'typedef' command has new option "open" to suppress the set
4996 * functions Min and Max on finite sets have been introduced (theory
4999 * attribute [symmetric] now works for relations as well; it turns
5000 (x,y) : R^-1 into (y,x) : R, and vice versa;
5002 * induct over a !!-quantified statement (say !!x1..xn):
5003 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5005 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5006 %x. None. Warning: empty_def now refers to the previously hidden definition
5009 * Algebra: formalization of classical algebra. Intended as base for
5010 any algebraic development in Isabelle. Currently covers group theory
5011 (up to Sylow's theorem) and ring theory (Universal Property of
5012 Univariate Polynomials). Contributions welcome;
5014 * GroupTheory: deleted, since its material has been moved to Algebra;
5016 * Complex: new directory of the complex numbers with numeric constants,
5017 nonstandard complex numbers, and some complex analysis, standard and
5018 nonstandard (Jacques Fleuriot);
5020 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5022 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5025 * Real/HahnBanach: updated and adapted to locales;
5027 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5030 * UNITY: added the Meier-Sanders theory of progress sets;
5032 * MicroJava: bytecode verifier and lightweight bytecode verifier
5033 as abstract algorithms, instantiated to the JVM;
5035 * Bali: Java source language formalization. Type system, operational
5036 semantics, axiomatic semantics. Supported language features:
5037 classes, interfaces, objects,virtual methods, static methods,
5038 static/instance fields, arrays, access modifiers, definite
5039 assignment, exceptions.
5044 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5047 * Main ZF: virtually all theories converted to new-style format;
5052 * Pure: Tactic.prove provides sane interface for internal proofs;
5053 omits the infamous "standard" operation, so this is more appropriate
5054 than prove_goalw_cterm in many situations (e.g. in simprocs);
5056 * Pure: improved error reporting of simprocs;
5058 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5062 *** Document preparation ***
5064 * uses \par instead of \\ for line breaks in theory text. This may
5065 shift some page breaks in large documents. To get the old behaviour
5066 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5068 * minimized dependencies of isabelle.sty and isabellesym.sty on
5071 * \<euro> now needs package babel/greek instead of marvosym (which
5074 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5079 New in Isabelle2002 (March 2002)
5080 --------------------------------
5082 *** Document preparation ***
5084 * greatly simplified document preparation setup, including more
5085 graceful interpretation of isatool usedir -i/-d/-D options, and more
5086 instructive isatool mkdir; users should basically be able to get
5087 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5088 users may run a separate document processing stage manually like this:
5089 "isatool usedir -D output HOL Test && isatool document Test/output";
5091 * theory dependency graph may now be incorporated into documents;
5092 isatool usedir -g true will produce session_graph.eps/.pdf for use
5093 with \includegraphics of LaTeX;
5095 * proper spacing of consecutive markup elements, especially text
5096 blocks after section headings;
5098 * support bold style (for single symbols only), input syntax is like
5099 this: "\<^bold>\<alpha>" or "\<^bold>A";
5101 * \<bullet> is now output as bold \cdot by default, which looks much
5102 better in printed text;
5104 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5105 note that these symbols are currently unavailable in Proof General /
5106 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5108 * isatool latex no longer depends on changed TEXINPUTS, instead
5109 isatool document copies the Isabelle style files to the target
5115 * Pure/Provers: improved proof by cases and induction;
5116 - 'case' command admits impromptu naming of parameters (such as
5118 - 'induct' method divinates rule instantiation from the inductive
5119 claim; no longer requires excessive ?P bindings for proper
5120 instantiation of cases;
5121 - 'induct' method properly enumerates all possibilities of set/type
5122 rules; as a consequence facts may be also passed through *type*
5123 rules without further ado;
5124 - 'induct' method now derives symbolic cases from the *rulified*
5125 rule (before it used to rulify cases stemming from the internal
5126 atomized version); this means that the context of a non-atomic
5127 statement becomes is included in the hypothesis, avoiding the
5128 slightly cumbersome show "PROP ?case" form;
5129 - 'induct' may now use elim-style induction rules without chaining
5130 facts, using ``missing'' premises from the goal state; this allows
5131 rules stemming from inductive sets to be applied in unstructured
5132 scripts, while still benefitting from proper handling of non-atomic
5133 statements; NB: major inductive premises need to be put first, all
5134 the rest of the goal is passed through the induction;
5135 - 'induct' proper support for mutual induction involving non-atomic
5136 rule statements (uses the new concept of simultaneous goals, see
5138 - append all possible rule selections, but only use the first
5139 success (no backtracking);
5140 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5141 - undeclared rule case names default to numbers 1, 2, 3, ...;
5142 - added 'print_induct_rules' (covered by help item in recent Proof
5144 - moved induct/cases attributes to Pure, methods to Provers;
5145 - generic method setup instantiated for FOL and HOL;
5147 * Pure: support multiple simultaneous goal statements, for example
5148 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5149 meta-level mechanism, this acts as if several individual goals had
5150 been stated separately; in particular common proof methods need to be
5151 repeated in order to cover all claims; note that a single elimination
5152 step is *not* sufficient to establish the two conjunctions, so this
5155 assume "A & B" then have A and B .. (*".." fails*)
5157 better use "obtain" in situations as above; alternative refer to
5158 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5160 * Pure: proper integration with ``locales''; unlike the original
5161 version by Florian Kammller, Isar locales package high-level proof
5162 contexts rather than raw logical ones (e.g. we admit to include
5163 attributes everywhere); operations on locales include merge and
5164 rename; support for implicit arguments (``structures''); simultaneous
5165 type-inference over imports and text; see also HOL/ex/Locales.thy for
5168 * Pure: the following commands have been ``localized'', supporting a
5169 target locale specification "(in name)": 'lemma', 'theorem',
5170 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5171 stored both within the locale and at the theory level (exported and
5172 qualified by the locale name);
5174 * Pure: theory goals may now be specified in ``long'' form, with
5175 ad-hoc contexts consisting of arbitrary locale elements. for example
5176 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5177 definitions may be given, too); the result is a meta-level rule with
5178 the context elements being discharged in the obvious way;
5180 * Pure: new proof command 'using' allows to augment currently used
5181 facts after a goal statement ('using' is syntactically analogous to
5182 'apply', but acts on the goal's facts only); this allows chained facts
5183 to be separated into parts given before and after a claim, as in
5184 ``from a and b have C using d and e <proof>'';
5186 * Pure: renamed "antecedent" case to "rule_context";
5188 * Pure: new 'judgment' command records explicit information about the
5189 object-logic embedding (used by several tools internally); no longer
5190 use hard-wired "Trueprop";
5192 * Pure: added 'corollary' command;
5194 * Pure: fixed 'token_translation' command;
5196 * Pure: removed obsolete 'exported' attribute;
5198 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5199 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5200 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5202 * Pure: method 'atomize' presents local goal premises as object-level
5203 statements (atomic meta-level propositions); setup controlled via
5204 rewrite rules declarations of 'atomize' attribute; example
5205 application: 'induct' method with proper rule statements in improper
5208 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5209 now consider the syntactic context of assumptions, giving a better
5210 chance to get type-inference of the arguments right (this is
5211 especially important for locales);
5213 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5216 * Pure/obtain: the formal conclusion "thesis", being marked as
5217 ``internal'', may no longer be reference directly in the text;
5218 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5221 * Pure: generic 'sym' attribute which declares a rule both as pure
5222 'elim?' and for the 'symmetric' operation;
5224 * Pure: marginal comments ``--'' may now occur just anywhere in the
5225 text; the fixed correlation with particular command syntax has been
5228 * Pure: new method 'rules' is particularly well-suited for proof
5229 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5230 but often produces more compact proof terms with less detours;
5232 * Pure/Provers/classical: simplified integration with pure rule
5233 attributes and methods; the classical "intro?/elim?/dest?"
5234 declarations coincide with the pure ones; the "rule" method no longer
5235 includes classically swapped intros; "intro" and "elim" methods no
5236 longer pick rules from the context; also got rid of ML declarations
5237 AddXIs/AddXEs/AddXDs; all of this has some potential for
5240 * Provers/classical: attribute 'swapped' produces classical inversions
5241 of introduction rules;
5243 * Provers/simplifier: 'simplified' attribute may refer to explicit
5244 rules instead of full simplifier context; 'iff' attribute handles
5247 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5249 * HOL: 'recdef' now fails on unfinished automated proofs, use
5250 "(permissive)" option to recover old behavior;
5252 * HOL: 'inductive' no longer features separate (collective) attributes
5253 for 'intros' (was found too confusing);
5255 * HOL: properly declared induction rules less_induct and
5261 * HOL: moved over to sane numeral syntax; the new policy is as
5264 - 0 and 1 are polymorphic constants, which are defined on any
5265 numeric type (nat, int, real etc.);
5267 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5268 binary representation internally;
5270 - type nat has special constructor Suc, and generally prefers Suc 0
5271 over 1::nat and Suc (Suc 0) over 2::nat;
5273 This change may cause significant problems of INCOMPATIBILITY; here
5274 are some hints on converting existing sources:
5276 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5277 entities, so expressions involving "-" (unary or binary minus) need
5278 to be spaced properly;
5280 - existing occurrences of "1" may need to be constraint "1::nat" or
5281 even replaced by Suc 0; similar for old "2";
5283 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5285 - remove all special provisions on numerals in proofs;
5287 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5288 representation (depends on bin_arith_simps in the default context);
5290 * HOL: symbolic syntax for x^2 (numeral 2);
5292 * HOL: the class of all HOL types is now called "type" rather than
5293 "term"; INCOMPATIBILITY, need to adapt references to this type class
5294 in axclass/classes, instance/arities, and (usually rare) occurrences
5295 in typings (of consts etc.); internally the class is called
5296 "HOL.type", ML programs should refer to HOLogic.typeS;
5298 * HOL/record package improvements:
5299 - new derived operations "fields" to build a partial record section,
5300 "extend" to promote a fixed record to a record scheme, and
5301 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5302 declared as simp by default;
5303 - shared operations ("more", "fields", etc.) now need to be always
5304 qualified) --- potential INCOMPATIBILITY;
5305 - removed "make_scheme" operations (use "make" with "extend") --
5307 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5308 - provides cases/induct rules for use with corresponding Isar
5309 methods (for concrete records, record schemes, concrete more
5310 parts, and schematic more parts -- in that order);
5311 - internal definitions directly based on a light-weight abstract
5312 theory of product types over typedef rather than datatype;
5314 * HOL: generic code generator for generating executable ML code from
5315 specifications; specific support for HOL constructs such as inductive
5316 datatypes and sets, as well as recursive functions; can be invoked
5317 via 'generate_code' theory section;
5319 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5321 * HOL: consolidated and renamed several theories. In particular:
5322 Ord.thy has been absorbed into HOL.thy
5323 String.thy has been absorbed into List.thy
5325 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5326 (beware of argument permutation!);
5328 * HOL: linorder_less_split superseded by linorder_cases;
5330 * HOL/List: "nodups" renamed to "distinct";
5332 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5333 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5334 - Ex_def has changed, now need to use some_eq_ex
5336 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5337 in this (rare) case use:
5339 delSWrapper "split_all_tac"
5340 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5342 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5345 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5346 Isabelle's type classes, ^ on functions and relations has too general
5347 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5348 necessary to attach explicit type constraints;
5350 * HOL/Relation: the prefix name of the infix "O" has been changed from
5351 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5352 renamed accordingly (eg "compI" -> "rel_compI").
5354 * HOL: syntax translations now work properly with numerals and records
5357 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5358 of "lam" -- INCOMPATIBILITY;
5360 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5361 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5362 renamed "Product_Type.unit";
5364 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5366 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5367 the "cases" method);
5369 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5372 * HOL/IMP: updated and converted to new-style theory format; several
5373 parts turned into readable document, with proper Isar proof texts and
5374 some explanations (by Gerwin Klein);
5376 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5378 * HOL-Hyperreal is now a logic image;
5383 * Isar: consts/constdefs supports mixfix syntax for continuous
5386 * Isar: domain package adapted to new-style theory format, e.g. see
5389 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5390 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5391 lift.induct_tac, always use UU instead of Undef;
5393 * HOLCF/IMP: updated and converted to new-style theory;
5398 * Isar: proper integration of logic-specific tools and packages,
5399 including theory commands '(co)inductive', '(co)datatype',
5400 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5401 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5403 * theory Main no longer includes AC; for the Axiom of Choice, base
5404 your theory on Main_ZFC;
5406 * the integer library now covers quotients and remainders, with many
5407 laws relating division to addition, multiplication, etc.;
5409 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5410 typeless version of the formalism;
5412 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5415 * ZF/Induct: new directory for examples of inductive definitions,
5416 including theory Multiset for multiset orderings; converted to
5417 new-style theory format;
5419 * ZF: many new theorems about lists, ordinals, etc.;
5424 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5425 variable proof controls level of detail: 0 = no proofs (only oracle
5426 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5427 also ref manual for further ML interfaces;
5429 * Pure/axclass: removed obsolete ML interface
5430 goal_subclass/goal_arity;
5432 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5433 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5434 separate tokens, so expressions involving minus need to be spaced
5437 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5438 rather than "infixl" or "infixr";
5440 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5441 sort constraint specifications in type inference; e.g. "x::_::foo"
5442 ensures that the type of "x" is of sort "foo" (but not necessarily a
5445 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5446 control output of nested => (types); the default behavior is
5449 * Pure/syntax: builtin parse translation for "_constify" turns valued
5450 tokens into AST constants;
5452 * Pure/syntax: prefer later declarations of translations and print
5453 translation functions; potential INCOMPATIBILITY: need to reverse
5454 multiple declarations for same syntax element constant;
5456 * Pure/show_hyps reset by default (in accordance to existing Isar
5459 * Provers/classical: renamed addaltern to addafter, addSaltern to
5462 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5465 * system: tested support for MacOS X; should be able to get Isabelle +
5466 Proof General to work in a plain Terminal after installing Poly/ML
5467 (e.g. from the Isabelle distribution area) and GNU bash alone
5468 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5469 support requires further installations, e.g. from
5470 http://fink.sourceforge.net/);
5472 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5474 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5475 of 40 MB), cf. ML_OPTIONS;
5477 * system: Proof General keywords specification is now part of the
5478 Isabelle distribution (see etc/isar-keywords.el);
5480 * system: support for persistent Proof General sessions (refrain from
5481 outdating all loaded theories on startup); user may create writable
5482 logic images like this: ``isabelle -q HOL Test'';
5484 * system: smart selection of Isabelle process versus Isabelle
5485 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5486 run both "isabelle" and "Isabelle" even if file names are badly
5487 damaged (executable inspects the case of the first letter of its own
5488 name); added separate "isabelle-process" and "isabelle-interface";
5490 * system: refrain from any attempt at filtering input streams; no
5491 longer support ``8bit'' encoding of old isabelle font, instead proper
5492 iso-latin characters may now be used; the related isatools
5493 "symbolinput" and "nonascii" have disappeared as well;
5495 * system: removed old "xterm" interface (the print modes "xterm" and
5496 "xterm_color" are still available for direct use in a suitable
5501 New in Isabelle99-2 (February 2001)
5502 -----------------------------------
5504 *** Overview of INCOMPATIBILITIES ***
5506 * HOL: please note that theories in the Library and elsewhere often use the
5507 new-style (Isar) format; to refer to their theorems in an ML script you must
5508 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5510 * HOL: inductive package no longer splits induction rule aggressively,
5511 but only as far as specified by the introductions given; the old
5512 format may be recovered via ML function complete_split_rule or attribute
5513 'split_rule (complete)';
5515 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5516 gfp_Tarski to gfp_unfold;
5518 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5520 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5521 relation); infix "^^" has been renamed "``"; infix "``" has been
5522 renamed "`"; "univalent" has been renamed "single_valued";
5524 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5527 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5529 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5531 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5532 consequence, it is no longer monotonic wrt. the local goal context
5533 (which is now passed through the inductive cases);
5535 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5536 \<gg> to \<ggreater>;
5539 *** Document preparation ***
5541 * \isabellestyle{NAME} selects version of Isabelle output (currently
5542 available: are "it" for near math-mode best-style output, "sl" for
5543 slanted text style, and "tt" for plain type-writer; if no
5544 \isabellestyle command is given, output is according to slanted
5547 * support sub/super scripts (for single symbols only), input syntax is
5548 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5550 * some more standard symbols; see Appendix A of the system manual for
5551 the complete list of symbols defined in isabellesym.sty;
5553 * improved isabelle style files; more abstract symbol implementation
5554 (should now use \isamath{...} and \isatext{...} in custom symbol
5557 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5558 state; Note that presentation of goal states does not conform to
5559 actual human-readable proof documents. Please do not include goal
5560 states into document output unless you really know what you are doing!
5562 * proper indentation of antiquoted output with proportional LaTeX
5565 * no_document ML operator temporarily disables LaTeX document
5568 * isatool unsymbolize tunes sources for plain ASCII communication;
5573 * Pure: Isar now suffers initial goal statements to contain unbound
5574 schematic variables (this does not conform to actual readable proof
5575 documents, due to unpredictable outcome and non-compositional proof
5576 checking); users who know what they are doing may use schematic goals
5577 for Prolog-style synthesis of proven results;
5579 * Pure: assumption method (an implicit finishing) now handles actual
5582 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5583 initial goal, declare "that" only as Pure intro (only for single
5584 steps); the "that" rule assumption may now be involved in implicit
5585 finishing, thus ".." becomes a feasible for trivial obtains;
5587 * Pure: default proof step now includes 'intro_classes'; thus trivial
5588 instance proofs may be performed by "..";
5590 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5593 * Pure: more robust selection of calculational rules;
5595 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5596 rule (as well as the assumption rule);
5598 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5599 lemmas, using the graph browser tool;
5601 * Pure: predict failure of "show" in interactive mode;
5603 * Pure: 'thms_containing' now takes actual terms as arguments;
5605 * HOL: improved method 'induct' --- now handles non-atomic goals
5606 (potential INCOMPATIBILITY); tuned error handling;
5608 * HOL: cases and induct rules now provide explicit hints about the
5609 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5610 any remaining facts are inserted into the goal verbatim;
5612 * HOL: local contexts (aka cases) may now contain term bindings as
5613 well; the 'cases' and 'induct' methods new provide a ?case binding for
5614 the result to be shown in each case;
5616 * HOL: added 'recdef_tc' command;
5618 * isatool convert assists in eliminating legacy ML scripts;
5623 * HOL/Library: a collection of generic theories to be used together
5624 with main HOL; the theory loader path already includes this directory
5625 by default; the following existing theories have been moved here:
5626 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5627 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5629 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5630 modelling and verification task performed in Isabelle/HOL +
5631 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5633 * HOL/Algebra: special summation operator SUM no longer exists, it has
5634 been replaced by setsum; infix 'assoc' now has priority 50 (like
5635 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5636 'domain', this makes the theory consistent with mathematical
5639 * HOL basics: added overloaded operations "inverse" and "divide"
5640 (infix "/"), syntax for generic "abs" operation, generic summation
5643 * HOL/typedef: simplified package, provide more useful rules (see also
5646 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5647 now expressed as a proper nested rule (old-style tactic scripts may
5648 require atomize_strip_tac to cope with non-atomic premises);
5650 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5651 to "split_conv" (old name still available for compatibility);
5653 * HOL: improved concrete syntax for strings (e.g. allows translation
5654 rules with string literals);
5656 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5657 and Fleuriot's mechanization of analysis, including the transcendental
5658 functions for the reals;
5660 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5665 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5666 "lam" is displayed as TWO lambda-symbols
5668 * CTT: theory Main now available, containing everything (that is, Bool
5674 * Pure: the Simplifier has been implemented properly as a derived rule
5675 outside of the actual kernel (at last!); the overall performance
5676 penalty in practical applications is about 50%, while reliability of
5677 the Isabelle inference kernel has been greatly improved;
5679 * print modes "brackets" and "no_brackets" control output of nested =>
5680 (types) and ==> (props); the default behaviour is "brackets";
5682 * Provers: fast_tac (and friends) now handle actual object-logic rules
5683 as assumptions as well;
5685 * system: support Poly/ML 4.0;
5687 * system: isatool install handles KDE version 1 or 2;
5691 New in Isabelle99-1 (October 2000)
5692 ----------------------------------
5694 *** Overview of INCOMPATIBILITIES ***
5696 * HOL: simplification of natural numbers is much changed; to partly
5697 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5698 issue the following ML commands:
5700 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5701 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5703 * HOL: simplification no longer dives into case-expressions; this is
5704 controlled by "t.weak_case_cong" for each datatype t;
5706 * HOL: nat_less_induct renamed to less_induct;
5708 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5709 fixsome to patch .thy and .ML sources automatically;
5711 select_equality -> some_equality
5712 select_eq_Ex -> some_eq_ex
5713 selectI2EX -> someI2_ex
5716 select1_equality -> some1_equality
5717 Eps_sym_eq -> some_sym_eq_trivial
5718 Eps_eq -> some_eq_trivial
5720 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5722 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5725 * HOL: the recursion equations generated by 'recdef' are now called
5726 f.simps instead of f.rules;
5728 * HOL: qed_spec_mp now also handles bounded ALL as well;
5730 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5731 sometimes be needed;
5733 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5735 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5737 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5738 product is now "<*>" instead of "Times"; the lexicographic product is
5739 now "<*lex*>" instead of "**";
5741 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5742 of main HOL, but was unused); better use HOL's datatype package;
5744 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5745 the old syntax may be recovered as follows:
5748 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5749 (infixl "\\<oplus>" 100)
5751 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5753 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5754 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5757 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5758 changed from A/r to A//r;
5760 * ZF: new treatment of arithmetic (nat & int) may break some old
5763 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5764 rulify -> rule_format, elimify -> elim_format, ...);
5766 * Isar/Provers: intro/elim/dest attributes changed; renamed
5767 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5768 should have to change intro!! to intro? only); replaced "delrule" by
5771 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5773 * Provers: strengthened force_tac by using new first_best_tac;
5775 * LaTeX document preparation: several changes of isabelle.sty (see
5779 *** Document preparation ***
5781 * formal comments (text blocks etc.) in new-style theories may now
5782 contain antiquotations of thm/prop/term/typ/text to be presented
5783 according to latex print mode; concrete syntax is like this:
5784 @{term[show_types] "f(x) = a + x"};
5786 * isatool mkdir provides easy setup of Isabelle session directories,
5787 including proper document sources;
5789 * generated LaTeX sources are now deleted after successful run
5790 (isatool document -c); may retain a copy somewhere else via -D option
5793 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5794 style files, achieving self-contained LaTeX sources and simplifying
5797 * old-style theories now produce (crude) LaTeX output as well;
5799 * browser info session directories are now self-contained (may be put
5800 on WWW server seperately); improved graphs of nested sessions; removed
5801 graph for 'all sessions';
5803 * several improvements in isabelle style files; \isabellestyle{it}
5804 produces fake math mode output; \isamarkupheader is now \section by
5805 default; see lib/texinputs/isabelle.sty etc.;
5810 * Isar/Pure: local results and corresponding term bindings are now
5811 subject to Hindley-Milner polymorphism (similar to ML); this
5812 accommodates incremental type-inference very nicely;
5814 * Isar/Pure: new derived language element 'obtain' supports
5815 generalized existence reasoning;
5817 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5818 support accumulation of results, without applying any rules yet;
5819 useful to collect intermediate results without explicit name
5820 references, and for use with transitivity rules with more than 2
5823 * Isar/Pure: scalable support for case-analysis type proofs: new
5824 'case' language element refers to local contexts symbolically, as
5825 produced by certain proof methods; internally, case names are attached
5826 to theorems as "tags";
5828 * Isar/Pure: theory command 'hide' removes declarations from
5829 class/type/const name spaces;
5831 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5832 indicate potential overloading;
5834 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5836 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5837 "{a,b,c}" instead of {a,b,c};
5839 * Isar/Pure now provides its own version of intro/elim/dest
5840 attributes; useful for building new logics, but beware of confusion
5841 with the version in Provers/classical;
5843 * Isar/Pure: the local context of (non-atomic) goals is provided via
5844 case name 'antecedent';
5846 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5847 to the current context is now done automatically);
5849 * Isar/Pure: theory command 'method_setup' provides a simple interface
5850 for definining proof methods in ML;
5852 * Isar/Provers: intro/elim/dest attributes changed; renamed
5853 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5854 most cases, one should have to change intro!! to intro? only);
5855 replaced "delrule" by "rule del";
5857 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5858 'symmetric' attribute (the latter supercedes [RS sym]);
5860 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5861 method modifier); 'simp' method: 'only:' modifier removes loopers as
5862 well (including splits);
5864 * Isar/Provers: Simplifier and Classical methods now support all kind
5865 of modifiers used in the past, including 'cong', 'iff', etc.
5867 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5868 of Simplifier and Classical reasoner);
5870 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5871 now support named cases; major packages (inductive, datatype, primrec,
5872 recdef) support case names and properly name parameters;
5874 * Isar/HOL: new transitivity rules for substitution in inequalities --
5875 monotonicity conditions are extracted to be proven at end of
5878 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5881 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5882 split_if split_if_asm; datatype package provides theorems foo.splits =
5883 foo.split foo.split_asm for each datatype;
5885 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5886 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5887 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5888 use "(cases (simplified))" method in proper proof texts);
5890 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5892 * Isar: names of theorems etc. may be natural numbers as well;
5894 * Isar: 'pr' command: optional arguments for goals_limit and
5895 ProofContext.prems_limit; no longer prints theory contexts, but only
5898 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5899 additional print modes to be specified; e.g. "pr(latex)" will print
5900 proof state according to the Isabelle LaTeX style;
5902 * Isar: improved support for emulating tactic scripts, including proof
5903 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5904 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5905 (for HOL datatypes);
5907 * Isar: simplified (more robust) goal selection of proof methods: 1st
5908 goal, all goals, or explicit goal specifier (tactic emulation); thus
5909 'proof method scripts' have to be in depth-first order;
5911 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5913 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5914 should instead use individual commands for printing items
5915 (print_commands, print_methods etc.);
5917 * Isar: added 'nothing' --- the empty list of theorems;
5922 * HOL/MicroJava: formalization of a fragment of Java, together with a
5923 corresponding virtual machine and a specification of its bytecode
5924 verifier and a lightweight bytecode verifier, including proofs of
5925 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5926 Cornelia Pusch (see also the homepage of project Bali at
5927 http://isabelle.in.tum.de/Bali/);
5929 * HOL/Algebra: new theory of rings and univariate polynomials, by
5932 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5933 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5936 * HOL/Lattice: fundamental concepts of lattice theory and order
5937 structures, including duals, properties of bounds versus algebraic
5938 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5939 Theorem for complete lattices etc.; may also serve as a demonstration
5940 for abstract algebraic reasoning using axiomatic type classes, and
5941 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5943 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5946 * HOL/IMPP: extension of IMP with local variables and mutually
5947 recursive procedures, by David von Oheimb;
5949 * HOL/Lambda: converted into new-style theory and document;
5951 * HOL/ex/Multiquote: example of multiple nested quotations and
5952 anti-quotations -- basically a generalized version of de-Bruijn
5953 representation; very useful in avoiding lifting of operations;
5955 * HOL/record: added general record equality rule to simpset; fixed
5956 select-update simplification procedure to handle extended records as
5957 well; admit "r" as field name;
5959 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5960 other numeric types and also as the identity of groups, rings, etc.;
5962 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5963 Types nat and int belong to this axclass;
5965 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5966 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5967 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5968 two terms #m*u and #n*u are replaced by #(m+n)*u
5969 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5970 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5971 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5973 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5974 powerful prover for predicate logic but knows nothing of clasets; see
5975 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5977 * HOL: new version of "case_tac" subsumes both boolean case split and
5978 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5979 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5981 * HOL: simplification no longer dives into case-expressions: only the
5982 selector expression is simplified, but not the remaining arms; to
5983 enable full simplification of case-expressions for datatype t, you may
5984 remove t.weak_case_cong from the simpset, either globally (Delcongs
5985 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5987 * HOL/recdef: the recursion equations generated by 'recdef' for
5988 function 'f' are now called f.simps instead of f.rules; if all
5989 termination conditions are proved automatically, these simplification
5990 rules are added to the simpset, as in primrec; rules may be named
5991 individually as well, resulting in a separate list of theorems for
5994 * HOL/While is a new theory that provides a while-combinator. It
5995 permits the definition of tail-recursive functions without the
5996 provision of a termination measure. The latter is necessary once the
5997 invariant proof rule for while is applied.
5999 * HOL: new (overloaded) notation for the set of elements below/above
6000 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6002 * HOL: theorems impI, allI, ballI bound as "strip";
6004 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6005 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6006 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6008 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6010 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6011 main HOL, but was unused);
6013 * HOL: fewer consts declared as global (e.g. have to refer to
6014 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6016 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6017 in case of overlap with user translations (e.g. judgements over
6018 tuples); (note that the underlying logical represenation is still
6024 * ZF: simplification automatically cancels common terms in arithmetic
6025 expressions over nat and int;
6027 * ZF: new treatment of nat to minimize type-checking: all operators
6028 coerce their operands to a natural number using the function natify,
6029 making the algebraic laws unconditional;
6031 * ZF: as above, for int: operators coerce their operands to an integer
6032 using the function intify;
6034 * ZF: the integer library now contains many of the usual laws for the
6035 orderings, including $<=, and monotonicity laws for $+ and $*;
6037 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6040 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6041 to the simplifier and classical reasoner simultaneously;
6046 * Provers: blast_tac now handles actual object-logic rules as
6047 assumptions; note that auto_tac uses blast_tac internally as well;
6049 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6050 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6052 * Provers: delrules now handles destruct rules as well (no longer need
6053 explicit make_elim);
6055 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6056 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6057 use instead the strong form,
6058 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6059 in HOL, FOL and ZF the function cla_make_elim will create such rules
6060 from destruct-rules;
6062 * Provers: Simplifier.easy_setup provides a fast path to basic
6063 Simplifier setup for new object-logics;
6065 * Pure: AST translation rules no longer require constant head on LHS;
6067 * Pure: improved name spaces: ambiguous output is qualified; support
6068 for hiding of names;
6070 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6071 XSYMBOL_HOME; no longer need to do manual configuration in most
6074 * system: compression of ML heaps images may now be controlled via -c
6075 option of isabelle and isatool usedir (currently only observed by
6078 * system: isatool installfonts may handle X-Symbol fonts as well (very
6079 useful for remote X11);
6081 * system: provide TAGS file for Isabelle sources;
6083 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6086 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6087 timing flag supersedes proof_timing and Toplevel.trace;
6089 * ML: new combinators |>> and |>>> for incremental transformations
6090 with secondary results (e.g. certain theory extensions):
6092 * ML: PureThy.add_defs gets additional argument to indicate potential
6093 overloading (usually false);
6095 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6100 New in Isabelle99 (October 1999)
6101 --------------------------------
6103 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6105 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6106 are no longer simplified. (This allows the simplifier to unfold recursive
6107 functional programs.) To restore the old behaviour, declare
6109 Delcongs [if_weak_cong];
6111 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6114 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6116 * HOL/datatype: mutual_induct_tac no longer exists --
6117 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6119 * HOL/typedef: fixed type inference for representing set; type
6120 arguments now have to occur explicitly on the rhs as type constraints;
6122 * ZF: The con_defs part of an inductive definition may no longer refer
6123 to constants declared in the same theory;
6125 * HOL, ZF: the function mk_cases, generated by the inductive
6126 definition package, has lost an argument. To simplify its result, it
6127 uses the default simpset instead of a supplied list of theorems.
6129 * HOL/List: the constructors of type list are now Nil and Cons;
6131 * Simplifier: the type of the infix ML functions
6132 setSSolver addSSolver setSolver addSolver
6133 is now simpset * solver -> simpset where `solver' is a new abstract type
6134 for packaging solvers. A solver is created via
6135 mk_solver: string -> (thm list -> int -> tactic) -> solver
6136 where the string argument is only a comment.
6141 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6142 decision procedure for linear arithmetic. Currently it is used for
6143 types `nat', `int', and `real' in HOL (see below); it can, should and
6144 will be instantiated for other types and logics as well.
6146 * The simplifier now accepts rewrite rules with flexible heads, eg
6147 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6148 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6154 * New Isabelle/Isar subsystem provides an alternative to traditional
6155 tactical theorem proving; together with the ProofGeneral/isar user
6156 interface it offers an interactive environment for developing human
6157 readable proof documents (Isar == Intelligible semi-automated
6158 reasoning); for further information see isatool doc isar-ref,
6159 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6161 * improved and simplified presentation of theories: better HTML markup
6162 (including colors), graph views in several sizes; isatool usedir now
6163 provides a proper interface for user theories (via -P option); actual
6164 document preparation based on (PDF)LaTeX is available as well (for
6165 new-style theories only); see isatool doc system for more information;
6167 * native support for Proof General, both for classic Isabelle and
6170 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6171 using the graph browser tool;
6173 * Isabelle manuals now also available as PDF;
6175 * theory loader rewritten from scratch (may not be fully
6176 bug-compatible); old loadpath variable has been replaced by show_path,
6177 add_path, del_path, reset_path functions; new operations such as
6178 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6181 * improved isatool install: option -k creates KDE application icon,
6182 option -p DIR installs standalone binaries;
6184 * added ML_PLATFORM setting (useful for cross-platform installations);
6185 more robust handling of platform specific ML images for SML/NJ;
6187 * the settings environment is now statically scoped, i.e. it is never
6188 created again in sub-processes invoked from isabelle, isatool, or
6191 * path element specification '~~' refers to '$ISABELLE_HOME';
6193 * in locales, the "assumes" and "defines" parts may be omitted if
6196 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6199 * new print_mode "HTML";
6201 * new flag show_tags controls display of tags of theorems (which are
6202 basically just comments that may be attached by some tools);
6204 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6205 mode and goal output format:
6207 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6209 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6211 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6212 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6214 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6216 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6218 * function bind_thms stores lists of theorems (cf. bind_thm);
6220 * new shorthand tactics ftac, eatac, datac, fatac;
6222 * qed (and friends) now accept "" as result name; in that case the
6223 theorem is not stored, but proper checks and presentation of the
6226 * theorem database now also indexes constants "Trueprop", "all",
6227 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6232 ** HOL arithmetic **
6234 * There are now decision procedures for linear arithmetic over nat and
6237 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6238 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6239 are treated as atomic; subformulae not involving type `nat' or `int'
6240 are ignored; quantified subformulae are ignored unless they are
6241 positive universal or negative existential. The tactic has to be
6242 invoked by hand and can be a little bit slow. In particular, the
6243 running time is exponential in the number of occurrences of `min' and
6244 `max', and `-' on `nat'.
6246 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6247 (negated) (in)equalities among the premises and the conclusion into
6248 account (i.e. no compound formulae) and does not know about `min' and
6249 `max', and `-' on `nat'. It is fast and is used automatically by the
6252 NB: At the moment, these decision procedures do not cope with mixed
6253 nat/int formulae where the two parts interact, such as `m < n ==>
6256 * HOL/Numeral provides a generic theory of numerals (encoded
6257 efficiently as bit strings); setup for types nat/int/real is in place;
6258 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6259 int, existing theories and proof scripts may require a few additional
6262 * integer division and remainder can now be performed on constant
6265 * many properties of integer multiplication, division and remainder
6268 * An interface to the Stanford Validity Checker (SVC) is available through the
6269 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6270 are proved automatically. SVC must be installed separately, and its results
6271 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6272 invocation of the underlying oracle). For SVC see
6273 http://verify.stanford.edu/SVC
6275 * IsaMakefile: the HOL-Real target now builds an actual image;
6280 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6281 (in Isabelle/Isar) -- by Gertrud Bauer;
6283 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6284 analysis for assembly languages with subtypes;
6286 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6287 -- avoids syntactic ambiguities and treats state, transition, and
6288 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6289 changed syntax and (many) tactics;
6291 * HOL/inductive: Now also handles more general introduction rules such
6292 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6293 theorems are now maintained within the theory (maintained via the
6296 * HOL/datatype: Now also handles arbitrarily branching datatypes
6297 (using function types) such as
6299 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6301 * HOL/record: record_simproc (part of the default simpset) takes care
6302 of selectors applied to updated records; record_split_tac is no longer
6303 part of the default claset; update_defs may now be removed from the
6304 simpset in many cases; COMPATIBILITY: old behavior achieved by
6306 claset_ref () := claset() addSWrapper record_split_wrapper;
6307 Delsimprocs [record_simproc]
6309 * HOL/typedef: fixed type inference for representing set; type
6310 arguments now have to occur explicitly on the rhs as type constraints;
6312 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6313 names rather than an ML expression;
6315 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6316 supplied later. Program schemes can be defined, such as
6317 "While B C s = (if B s then While B C (C s) else s)"
6318 where the well-founded relation can be chosen after B and C have been given.
6320 * HOL/List: the constructors of type list are now Nil and Cons;
6321 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6322 course, ML tools referring to List.list.op # etc. have to be adapted;
6324 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6325 disabled by default; run isabelle with option -m HOL to get back to
6326 the original Gordon/HOL-style output;
6328 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6329 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6331 * HOL basic syntax simplified (more orthogonal): all variants of
6332 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6333 Eps operator is provided as well: "SOME x. P[x]";
6335 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6337 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6338 thus available for user theories;
6340 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6341 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6344 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6345 several times and then mp;
6350 * the notation <<...>> is now available as a notation for sequences of
6353 * the simplifier is now installed
6355 * the axiom system has been generalized (thanks to Soren Heilmann)
6357 * the classical reasoner now has a default rule database
6362 * new primrec section allows primitive recursive functions to be given
6363 directly (as in HOL) over datatypes and the natural numbers;
6365 * new tactics induct_tac and exhaust_tac for induction (or case
6366 analysis) over datatypes and the natural numbers;
6368 * the datatype declaration of type T now defines the recursor T_rec;
6370 * simplification automatically does freeness reasoning for datatype
6373 * automatic type-inference, with AddTCs command to insert new
6374 type-checking rules;
6376 * datatype introduction rules are now added as Safe Introduction rules
6379 * the syntax "if P then x else y" is now available in addition to
6383 *** Internal programming interfaces ***
6385 * tuned simplifier trace output; new flag debug_simp;
6387 * structures Vartab / Termtab (instances of TableFun) offer efficient
6388 tables indexed by indexname_ord / term_ord (compatible with aconv);
6390 * AxClass.axclass_tac lost the theory argument;
6392 * tuned current_goals_markers semantics: begin / end goal avoids
6393 printing empty lines;
6395 * removed prs and prs_fn hook, which was broken because it did not
6396 include \n in its semantics, forcing writeln to add one
6397 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6398 string -> unit if you really want to output text without newline;
6400 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6401 plain output, interface builders may have to enable 'isabelle_font'
6402 mode to get Isabelle font glyphs as before;
6404 * refined token_translation interface; INCOMPATIBILITY: output length
6405 now of type real instead of int;
6407 * theory loader actions may be traced via new ThyInfo.add_hook
6408 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6409 your own database of information attached to *whole* theories -- as
6410 opposed to intra-theory data slots offered via TheoryDataFun;
6412 * proper handling of dangling sort hypotheses (at last!);
6413 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6414 extra sort hypotheses that can be witnessed from the type signature;
6415 the force_strip_shyps flag is gone, any remaining shyps are simply
6416 left in the theorem (with a warning issued by strip_shyps_warning);
6420 New in Isabelle98-1 (October 1998)
6421 ----------------------------------
6423 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6425 * several changes of automated proof tools;
6427 * HOL: major changes to the inductive and datatype packages, including
6428 some minor incompatibilities of theory syntax;
6430 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6433 * HOL: removed duplicate thms in Arith:
6434 less_imp_add_less should be replaced by trans_less_add1
6435 le_imp_add_le should be replaced by trans_le_add1
6437 * HOL: unary minus is now overloaded (new type constraints may be
6440 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6441 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6442 now taken as an integer constant.
6444 * Pure: ML function 'theory_of' renamed to 'theory';
6450 1. Asm_full_simp_tac is now more aggressive.
6451 1. It will sometimes reorient premises if that increases their power to
6453 2. It does no longer proceed strictly from left to right but may also
6454 rotate premises to achieve further simplification.
6455 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6456 old Asm_full_simp_tac in that it does not rotate premises.
6457 2. The simplifier now knows a little bit about nat-arithmetic.
6459 * Classical reasoner: wrapper mechanism for the classical reasoner now
6460 allows for selected deletion of wrappers, by introduction of names for
6461 wrapper functionals. This implies that addbefore, addSbefore,
6462 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6463 and that adding two tactics with the same name overwrites the first
6464 one (emitting a warning).
6465 type wrapper = (int -> tactic) -> (int -> tactic)
6466 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6467 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6468 delWrapper, delSWrapper: claset * string -> claset
6469 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6471 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6472 semantics; addbefore now affects only the unsafe part of step_tac
6473 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6474 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6477 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6478 compWrapper; added safe wrapper (and access functions for it);
6480 * HOL/split_all_tac is now much faster and fails if there is nothing
6481 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6482 and the names of the automatically generated variables have changed.
6483 split_all_tac has moved within claset() from unsafe wrappers to safe
6484 wrappers, which means that !!-bound variables are split much more
6485 aggressively, and safe_tac and clarify_tac now split such variables.
6486 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6487 Note: the same holds for record_split_tac, which does the job of
6488 split_all_tac for record fields.
6490 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6491 permanently to the default simpset using Addsplits just like
6492 Addsimps. They can be removed via Delsplits just like
6493 Delsimps. Lower-case versions are also available.
6495 * HOL/Simplifier: The rule split_if is now part of the default
6496 simpset. This means that the simplifier will eliminate all occurrences
6497 of if-then-else in the conclusion of a goal. To prevent this, you can
6498 either remove split_if completely from the default simpset by
6499 `Delsplits [split_if]' or remove it in a specific call of the
6500 simplifier using `... delsplits [split_if]'. You can also add/delete
6501 other case splitting rules to/from the default simpset: every datatype
6502 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6503 t is the name of the datatype).
6505 * Classical reasoner / Simplifier combination: new force_tac (and
6506 derivatives Force_tac, force) combines rewriting and classical
6507 reasoning (and whatever other tools) similarly to auto_tac, but is
6508 aimed to solve the given subgoal completely.
6513 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6514 and `goalw': the theory is no longer needed as an explicit argument -
6515 the current theory context is used; assumptions are no longer returned
6516 at the ML-level unless one of them starts with ==> or !!; it is
6517 recommended to convert to these new commands using isatool fixgoal
6518 (backup your sources first!);
6520 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6521 the current theory context, and 'theory' to lookup stored theories;
6523 * new theory section 'locale' for declaring constants, assumptions and
6524 definitions that have local scope;
6526 * new theory section 'nonterminals' for purely syntactic types;
6528 * new theory section 'setup' for generic ML setup functions
6529 (e.g. package initialization);
6531 * the distribution now includes Isabelle icons: see
6532 lib/logo/isabelle-{small,tiny}.xpm;
6534 * isatool install - install binaries with absolute references to
6537 * isatool logo -- create instances of the Isabelle logo (as EPS);
6539 * print mode 'emacs' reserved for Isamode;
6541 * support multiple print (ast) translations per constant name;
6543 * theorems involving oracles are now printed with a suffixed [!];
6548 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6550 * HOL/inductive package reorganized and improved: now supports mutual
6556 oddI "n : EVEN ==> Suc n : ODD"
6557 evenI "n : ODD ==> Suc n : EVEN"
6559 new theorem list "elims" contains an elimination rule for each of the
6560 recursive sets; inductive definitions now handle disjunctive premises
6561 correctly (also ZF);
6563 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6564 "mutual_induct" no longer exists - the induction rule is always
6565 contained in "induct";
6568 * HOL/datatype package re-implemented and greatly improved: now
6569 supports mutually recursive datatypes such as
6572 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6573 | SUM ('a aexp) ('a aexp)
6574 | DIFF ('a aexp) ('a aexp)
6577 'a bexp = LESS ('a aexp) ('a aexp)
6578 | AND ('a bexp) ('a bexp)
6579 | OR ('a bexp) ('a bexp)
6581 as well as indirectly recursive datatypes such as
6584 ('a, 'b) term = Var 'a
6585 | App 'b ((('a, 'b) term) list)
6587 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6588 induction on mutually / indirectly recursive datatypes.
6590 Primrec equations are now stored in theory and can be accessed via
6591 <function_name>.simps.
6595 - Theories using datatypes must now have theory Datatype as an
6597 - The specific <typename>.induct_tac no longer exists - use the
6598 generic induct_tac instead.
6599 - natE has been renamed to nat.exhaust - use exhaust_tac
6600 instead of res_inst_tac ... natE. Note that the variable
6601 names in nat.exhaust differ from the names in natE, this
6602 may cause some "fragile" proofs to fail.
6603 - The theorems split_<typename>_case and split_<typename>_case_asm
6604 have been renamed to <typename>.split and <typename>.split_asm.
6605 - Since default sorts of type variables are now handled correctly,
6606 some datatype definitions may have to be annotated with explicit
6608 - Primrec definitions no longer require function name and type
6609 of recursive argument.
6611 Consider using isatool fixdatatype to adapt your theories and proof
6612 scripts to the new package (backup your sources first!).
6615 * HOL/record package: considerably improved implementation; now
6616 includes concrete syntax for record types, terms, updates; theorems
6617 for surjective pairing and splitting !!-bound record variables; proof
6618 support is as follows:
6620 1) standard conversions (selectors or updates applied to record
6621 constructor terms) are part of the standard simpset;
6623 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6624 made part of standard simpset and claset via addIffs;
6626 3) a tactic for record field splitting (record_split_tac) is part of
6627 the standard claset (addSWrapper);
6629 To get a better idea about these rules you may retrieve them via
6630 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6631 the name of your record type.
6633 The split tactic 3) conceptually simplifies by the following rule:
6635 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6637 Thus any record variable that is bound by meta-all will automatically
6638 blow up into some record constructor term, consequently the
6639 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6640 solve record problems automatically.
6643 * reorganized the main HOL image: HOL/Integ and String loaded by
6644 default; theory Main includes everything;
6646 * automatic simplification of integer sums and comparisons, using cancellation;
6648 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6650 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6652 * many new identities for unions, intersections, set difference, etc.;
6654 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6655 called split_if, split_split, split_sum_case and split_nat_case (to go
6656 with add/delsplits);
6658 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6659 (?x::unit) = (); this is made part of the default simpset, which COULD
6660 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6661 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6662 unit_abs_eta_conv is added in order to counter the effect of
6663 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6666 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6669 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6670 It and 'sym RS equals0D' are now in the default claset, giving automatic
6671 disjointness reasoning but breaking a few old proofs.
6673 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6674 to 'converse' from 'inverse' (for compatibility with ZF and some
6677 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6678 the well-founded relation;
6680 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6681 Compl A. The "Compl" syntax remains available as input syntax for this
6684 * HOL/Update: new theory of function updates:
6685 f(a:=b) == %x. if x=a then b else f x
6686 may also be iterated as in f(a:=b,c:=d,...);
6688 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6691 - new function list_update written xs[i:=v] that updates the i-th
6692 list position. May also be iterated as in xs[i:=a,j:=b,...].
6693 - new function `upt' written [i..j(] which generates the list
6694 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6695 bound write [i..j], which is a shorthand for [i..j+1(].
6696 - new lexicographic orderings and corresponding wellfoundedness theorems.
6699 - removed 'pred' (predecessor) function;
6700 - generalized some theorems about n-1;
6701 - many new laws about "div" and "mod";
6702 - new laws about greatest common divisors (see theory ex/Primes);
6704 * HOL/Relation: renamed the relational operator r^-1 "converse"
6705 instead of "inverse";
6707 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6708 of the multiset ordering;
6710 * directory HOL/Real: a construction of the reals using Dedekind cuts
6711 (not included by default);
6713 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6715 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6716 programs, i.e. different program variables may have different types.
6718 * calling (stac rew i) now fails if "rew" has no effect on the goal
6719 [previously, this check worked only if the rewrite rule was unconditional]
6720 Now rew can involve either definitions or equalities (either == or =).
6725 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6726 only the theorems proved on ZF.ML;
6728 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6729 It and 'sym RS equals0D' are now in the default claset, giving automatic
6730 disjointness reasoning but breaking a few old proofs.
6732 * ZF/Update: new theory of function updates
6733 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6734 may also be iterated as in f(a:=b,c:=d,...);
6736 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6738 * calling (stac rew i) now fails if "rew" has no effect on the goal
6739 [previously, this check worked only if the rewrite rule was unconditional]
6740 Now rew can involve either definitions or equalities (either == or =).
6742 * case_tac provided for compatibility with HOL
6743 (like the old excluded_middle_tac, but with subgoals swapped)
6746 *** Internal programming interfaces ***
6748 * Pure: several new basic modules made available for general use, see
6749 also src/Pure/README;
6751 * improved the theory data mechanism to support encapsulation (data
6752 kind name replaced by private Object.kind, acting as authorization
6753 key); new type-safe user interface via functor TheoryDataFun; generic
6754 print_data function becomes basically useless;
6756 * removed global_names compatibility flag -- all theory declarations
6757 are qualified by default;
6759 * module Pure/Syntax now offers quote / antiquote translation
6760 functions (useful for Hoare logic etc. with implicit dependencies);
6761 see HOL/ex/Antiquote for an example use;
6763 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6766 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6769 * Display.print_goals function moved to Locale.print_goals;
6771 * standard print function for goals supports current_goals_markers
6772 variable for marking begin of proof, end of proof, start of goal; the
6773 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6774 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6779 New in Isabelle98 (January 1998)
6780 --------------------------------
6782 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6784 * changed lexical syntax of terms / types: dots made part of long
6785 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6787 * simpset (and claset) reference variable replaced by functions
6788 simpset / simpset_ref;
6790 * no longer supports theory aliases (via merge) and non-trivial
6791 implicit merge of thms' signatures;
6793 * most internal names of constants changed due to qualified names;
6795 * changed Pure/Sequence interface (see Pure/seq.ML);
6798 *** General Changes ***
6800 * hierachically structured name spaces (for consts, types, axms, thms
6801 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6802 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6803 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6804 long_names for fully qualified output names; NOTE: ML programs
6805 (special tactics, packages etc.) referring to internal names may have
6806 to be adapted to cope with fully qualified names; in case of severe
6807 backward campatibility problems try setting 'global_names' at compile
6808 time to have enrything declared within a flat name space; one may also
6809 fine tune name declarations in theories via the 'global' and 'local'
6812 * reimplemented the implicit simpset and claset using the new anytype
6813 data filed in signatures; references simpset:simpset ref etc. are
6814 replaced by functions simpset:unit->simpset and
6815 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6816 to patch your ML files accordingly;
6818 * HTML output now includes theory graph data for display with Java
6819 applet or isatool browser; data generated automatically via isatool
6820 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6822 * defs may now be conditional; improved rewrite_goals_tac to handle
6823 conditional equations;
6825 * defs now admits additional type arguments, using TYPE('a) syntax;
6827 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6828 creates a new theory node; implicit merge of thms' signatures is
6829 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6830 transfer:theory->thm->thm in (rare) cases;
6832 * improved handling of draft signatures / theories; draft thms (and
6833 ctyps, cterms) are automatically promoted to real ones;
6835 * slightly changed interfaces for oracles: admit many per theory, named
6836 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6838 * print_goals: optional output of const types (set show_consts and
6841 * improved output of warnings (###) and errors (***);
6843 * subgoal_tac displays a warning if the new subgoal has type variables;
6845 * removed old README and Makefiles;
6847 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6849 * removed obsolete init_pps and init_database;
6851 * deleted the obsolete tactical STATE, which was declared by
6852 fun STATE tacfun st = tacfun st st;
6854 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6855 (which abbreviates $HOME);
6857 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6858 use isatool fixseq to adapt your ML programs (this works for fully
6859 qualified references to the Sequence structure only!);
6861 * use_thy no longer requires writable current directory; it always
6862 reloads .ML *and* .thy file, if either one is out of date;
6865 *** Classical Reasoner ***
6867 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6868 tactics that use classical reasoning to simplify a subgoal without
6869 splitting it into several subgoals;
6871 * Safe_tac: like safe_tac but uses the default claset;
6876 * added simplification meta rules:
6877 (asm_)(full_)simplify: simpset -> thm -> thm;
6879 * simplifier.ML no longer part of Pure -- has to be loaded by object
6882 * added prems argument to simplification procedures;
6884 * HOL, FOL, ZF: added infix function `addsplits':
6885 instead of `<simpset> setloop (split_tac <thms>)'
6886 you can simply write `<simpset> addsplits <thms>'
6891 * TYPE('a) syntax for type reflection terms;
6893 * no longer handles consts with name "" -- declare as 'syntax' instead;
6895 * pretty printer: changed order of mixfix annotation preference (again!);
6897 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6902 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6903 with `addloop' of the simplifier to faciliate case splitting in premises.
6905 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6907 * HOL/Auth: new protocol proofs including some for the Internet
6910 * HOL/Map: new theory of `maps' a la VDM;
6912 * HOL/simplifier: simplification procedures nat_cancel_sums for
6913 cancelling out common nat summands from =, <, <= (in)equalities, or
6914 differences; simplification procedures nat_cancel_factor for
6915 cancelling common factor from =, <, <= (in)equalities over natural
6916 sums; nat_cancel contains both kinds of procedures, it is installed by
6917 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6919 * HOL/simplifier: terms of the form
6920 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6922 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6923 and those of the form
6924 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6926 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6929 Each datatype `t' now comes with a theorem `split_t_case' of the form
6931 P(t_case f1 ... fn x) =
6932 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6934 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6937 and a theorem `split_t_case_asm' of the form
6939 P(t_case f1 ... fn x) =
6940 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6942 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6944 which can be added to a simpset via `addsplits'. The existing theorems
6945 expand_list_case and expand_option_case have been renamed to
6946 split_list_case and split_option_case.
6949 - `pred n' is automatically converted to `n-1'.
6950 Users are strongly encouraged not to use `pred' any longer,
6951 because it will disappear altogether at some point.
6952 - Users are strongly encouraged to write "0 < n" rather than
6953 "n ~= 0". Theorems and proof tools have been modified towards this
6957 the function "set_of_list" has been renamed "set" (and its theorems too);
6958 the function "nth" now takes its arguments in the reverse order and
6959 has acquired the infix notation "!" as in "xs!n".
6961 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6963 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6964 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6966 * HOL/record: extensible records with schematic structural subtyping
6967 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6968 still lacks various theorems and concrete record syntax;
6973 * removed "axioms" and "generated by" sections;
6975 * replaced "ops" section by extended "consts" section, which is capable of
6976 handling the continuous function space "->" directly;
6979 . proves theorems immediately and stores them in the theory,
6980 . creates hierachical name space,
6981 . now uses normal mixfix annotations (instead of cinfix...),
6982 . minor changes to some names and values (for consistency),
6983 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6984 . separator between mutual domain defs: changed "," to "and",
6985 . improved handling of sort constraints; now they have to
6986 appear on the left-hand side of the equations only;
6988 * fixed LAM <x,y,zs>.b syntax;
6990 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6991 adm (%x. P (t x)), where P is chainfinite and t continuous;
6996 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6997 with `addloop' of the simplifier to faciliate case splitting in premises.
6999 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7000 in HOL, they strip ALL and --> from proved theorems;
7004 New in Isabelle94-8 (May 1997)
7005 ------------------------------
7007 *** General Changes ***
7009 * new utilities to build / run / maintain Isabelle etc. (in parts
7010 still somewhat experimental); old Makefiles etc. still functional;
7012 * new 'Isabelle System Manual';
7014 * INSTALL text, together with ./configure and ./build scripts;
7016 * reimplemented type inference for greater efficiency, better error
7017 messages and clean internal interface;
7019 * prlim command for dealing with lots of subgoals (an easier way of
7020 setting goals_limit);
7025 * supports alternative (named) syntax tables (parser and pretty
7026 printer); internal interface is provided by add_modesyntax(_i);
7028 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7029 be used in conjunction with the Isabelle symbol font; uses the
7030 "symbols" syntax table;
7032 * added token_translation interface (may translate name tokens in
7033 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7034 the current print_mode); IMPORTANT: user print translation functions
7035 are responsible for marking newly introduced bounds
7036 (Syntax.mark_boundT);
7038 * token translations for modes "xterm" and "xterm_color" that display
7039 names in bold, underline etc. or colors (which requires a color
7042 * infixes may now be declared with names independent of their syntax;
7044 * added typed_print_translation (like print_translation, but may
7045 access type of constant);
7048 *** Classical Reasoner ***
7050 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7051 some limitations. Blast_tac...
7052 + ignores addss, addbefore, addafter; this restriction is intrinsic
7053 + ignores elimination rules that don't have the correct format
7054 (the conclusion MUST be a formula variable)
7055 + ignores types, which can make HOL proofs fail
7056 + rules must not require higher-order unification, e.g. apply_type in ZF
7057 [message "Function Var's argument not a bound variable" relates to this]
7058 + its proof strategy is more general but can actually be slower
7060 * substitution with equality assumptions no longer permutes other
7063 * minor changes in semantics of addafter (now called addaltern); renamed
7064 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7065 (and access functions for it);
7067 * improved combination of classical reasoner and simplifier:
7068 + functions for handling clasimpsets
7069 + improvement of addss: now the simplifier is called _after_ the
7071 + safe variant of addss called addSss: uses safe simplifications
7072 _during_ the safe steps. It is more complete as it allows multiple
7073 instantiations of unknowns (e.g. with slow_tac).
7077 * added interface for simplification procedures (functions that
7078 produce *proven* rewrite rules on the fly, depending on current
7081 * ordering on terms as parameter (used for ordered rewriting);
7083 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7085 * the solver is now split into a safe and an unsafe part.
7086 This should be invisible for the normal user, except that the
7087 functions setsolver and addsolver have been renamed to setSolver and
7088 addSolver; added safe_asm_full_simp_tac;
7093 * a generic induction tactic `induct_tac' which works for all datatypes and
7094 also for type `nat';
7096 * a generic case distinction tactic `exhaust_tac' which works for all
7097 datatypes and also for type `nat';
7099 * each datatype comes with a function `size';
7101 * patterns in case expressions allow tuple patterns as arguments to
7102 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7104 * primrec now also works with type nat;
7106 * recdef: a new declaration form, allows general recursive functions to be
7107 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7109 * the constant for negation has been renamed from "not" to "Not" to
7110 harmonize with FOL, ZF, LK, etc.;
7112 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7115 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7117 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7118 problems in commutative rings, using axiomatic type classes for + and *;
7120 * more examples in HOL/MiniML and HOL/Auth;
7122 * more default rewrite rules for quantifiers, union/intersection;
7124 * a new constant `arbitrary == @x.False';
7126 * HOLCF/IOA replaces old HOL/IOA;
7128 * HOLCF changes: derived all rules and arities
7129 + axiomatic type classes instead of classes
7130 + typedef instead of faking type definitions
7131 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7132 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7133 + eliminated the types void, one, tr
7134 + use unit lift and bool lift (with translations) instead of one and tr
7135 + eliminated blift from Lift3.thy (use Def instead of blift)
7136 all eliminated rules are derived as theorems --> no visible changes ;
7141 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7142 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7143 as ZF_cs addSIs [equalityI];
7147 New in Isabelle94-7 (November 96)
7148 ---------------------------------
7150 * allowing negative levels (as offsets) in prlev and choplev;
7152 * super-linear speedup for large simplifications;
7154 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7155 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7156 FAIL); can suppress it using the command Delsimps (ex_simps @
7157 all_simps); De Morgan laws are also now included, by default;
7159 * improved printing of ==> : ~:
7161 * new object-logic "Sequents" adds linear logic, while replacing LK
7162 and Modal (thanks to Sara Kalvala);
7164 * HOL/Auth: correctness proofs for authentication protocols;
7166 * HOL: new auto_tac combines rewriting and classical reasoning (many
7167 examples on HOL/Auth);
7169 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7170 the rewriter and classical reasoner simultaneously;
7172 * function uresult no longer returns theorems in "standard" format;
7173 regain previous version by: val uresult = standard o uresult;
7180 * oracles -- these establish an interface between Isabelle and trusted
7181 external reasoners, which may deliver results as theorems;
7183 * proof objects (in particular record all uses of oracles);
7185 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7187 * "constdefs" section in theory files;
7189 * "primrec" section (HOL) no longer requires names;
7191 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7198 * reduced space requirements;
7200 * automatic HTML generation from theories;
7202 * theory files no longer require "..." (quotes) around most types;
7204 * new examples, including two proofs of the Church-Rosser theorem;
7206 * non-curried (1994) version of HOL is no longer distributed;
7213 * greatly reduced space requirements;
7215 * theory files (.thy) no longer require \...\ escapes at line breaks;
7217 * searchable theorem database (see the section "Retrieving theorems" on
7218 page 8 of the Reference Manual);
7220 * new examples, including Grabczewski's monumental case study of the
7223 * The previous version of HOL renamed to Old_HOL;
7225 * The new version of HOL (previously called CHOL) uses a curried syntax
7226 for functions. Application looks like f a b instead of f(a,b);
7228 * Mutually recursive inductive definitions finally work in HOL;
7230 * In ZF, pattern-matching on tuples is now available in all abstractions and
7231 translates to the operator "split";
7238 * new infix operator, addss, allowing the classical reasoner to
7239 perform simplification at each step of its search. Example:
7240 fast_tac (cs addss ss)
7242 * a new logic, CHOL, the same as HOL, but with a curried syntax
7243 for functions. Application looks like f a b instead of f(a,b). Also pairs
7244 look like (a,b) instead of <a,b>;
7246 * PLEASE NOTE: CHOL will eventually replace HOL!
7248 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7249 It translates to the operator "split". A new theory of integers is available;
7251 * In ZF, integer numerals now denote two's-complement binary integers.
7252 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7254 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7255 of the Axiom of Choice;
7262 * Significantly faster resolution;
7264 * the different sections in a .thy file can now be mixed and repeated
7267 * Database of theorems for FOL, HOL and ZF. New
7268 commands including qed, qed_goal and bind_thm store theorems in the database.
7270 * Simple database queries: return a named theorem (get_thm) or all theorems of
7271 a given theory (thms_of), or find out what theory a theorem was proved in
7274 * Bugs fixed in the inductive definition and datatype packages;
7276 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7277 and HOL_dup_cs obsolete;
7279 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7282 * Simpler definition of function space in ZF;
7284 * new results about cardinal and ordinal arithmetic in ZF;
7286 * 'subtype' facility in HOL for introducing new types as subsets of existing
7289 :mode=text:wrap=hard:maxLineLen=72: