1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Some previously unqualified names have been qualified:
20 Pair ~> Product_Type.Pair
21 fst ~> Product_Type.fst
22 snd ~> Product_Type.snd
23 split ~> Product_Type.split
24 curry ~> Product_Type.curry
28 * Removed simplifier congruence rule of "prod_case", as has for long
29 been the case with "split".
31 * Datatype package: theorems generated for executable equality
32 (class eq) carry proper names and are treated as default code
35 * List.thy: use various operations from the Haskell prelude when
36 generating Haskell code.
38 * code_simp.ML: simplification with rules determined by
41 * code generator: do not print function definitions for case
42 combinators any longer.
46 New in Isabelle2009-2 (June 2010)
47 ---------------------------------
51 * Authentic syntax for *all* logical entities (type classes, type
52 constructors, term constants): provides simple and robust
53 correspondence between formal entities and concrete syntax. Within
54 the parse tree / AST representations, "constants" are decorated by
55 their category (class, type, const) and spelled out explicitly with
56 their full internal name.
58 Substantial INCOMPATIBILITY concerning low-level syntax declarations
59 and translations (translation rules and translation functions in ML).
60 Some hints on upgrading:
62 - Many existing uses of 'syntax' and 'translations' can be replaced
63 by more modern 'type_notation', 'notation' and 'abbreviation',
64 which are independent of this issue.
66 - 'translations' require markup within the AST; the term syntax
67 provides the following special forms:
69 CONST c -- produces syntax version of constant c from context
70 XCONST c -- literally c, checked as constant from context
71 c -- literally c, if declared by 'syntax'
73 Plain identifiers are treated as AST variables -- occasionally the
74 system indicates accidental variables via the error "rhs contains
77 Type classes and type constructors are marked according to their
78 concrete syntax. Some old translations rules need to be written
79 for the "type" category, using type constructor application
80 instead of pseudo-term application of the default category
83 - 'parse_translation' etc. in ML may use the following
86 @{class_syntax c} -- type class c within parse tree / AST
87 @{term_syntax c} -- type constructor c within parse tree / AST
88 @{const_syntax c} -- ML version of "CONST c" above
89 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
91 - Literal types within 'typed_print_translations', i.e. those *not*
92 represented as pseudo-terms are represented verbatim. Use @{class
93 c} or @{type_name c} here instead of the above syntax
96 Note that old non-authentic syntax was based on unqualified base
97 names, so all of the above "constant" names would coincide. Recall
98 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
99 diagnose syntax problems.
101 * Type constructors admit general mixfix syntax, not just infix.
103 * Concrete syntax may be attached to local entities without a proof
104 body, too. This works via regular mixfix annotations for 'fix',
105 'def', 'obtain' etc. or via the explicit 'write' command, which is
106 similar to the 'notation' command in theory specifications.
108 * Discontinued unnamed infix syntax (legacy feature for many years) --
109 need to specify constant name and syntax separately. Internal ML
110 datatype constructors have been renamed from InfixName to Infix etc.
111 Minor INCOMPATIBILITY.
113 * Schematic theorem statements need to be explicitly markup as such,
114 via commands 'schematic_lemma', 'schematic_theorem',
115 'schematic_corollary'. Thus the relevance of the proof is made
116 syntactically clear, which impacts performance in a parallel or
117 asynchronous interactive environment. Minor INCOMPATIBILITY.
119 * Use of cumulative prems via "!" in some proof methods has been
120 discontinued (old legacy feature).
122 * References 'trace_simp' and 'debug_simp' have been replaced by
123 configuration options stored in the context. Enabling tracing (the
124 case of debugging is similar) in proofs works via
126 using [[trace_simp = true]]
128 Tracing is then active for all invocations of the simplifier in
129 subsequent goal refinement steps. Tracing may also still be enabled or
130 disabled via the ProofGeneral settings menu.
132 * Separate commands 'hide_class', 'hide_type', 'hide_const',
133 'hide_fact' replace the former 'hide' KIND command. Minor
136 * Improved parallelism of proof term normalization: usedir -p2 -q0 is
137 more efficient than combinations with -q1 or -q2.
142 * Proofterms record type-class reasoning explicitly, using the
143 "unconstrain" operation internally. This eliminates all sort
144 constraints from a theorem and proof, introducing explicit
145 OFCLASS-premises. On the proof term level, this operation is
146 automatically applied at theorem boundaries, such that closed proofs
147 are always free of sort constraints. INCOMPATIBILITY for tools that
150 * Local theory specifications may depend on extra type variables that
151 are not present in the result type -- arguments TYPE('a) :: 'a itself
152 are added internally. For example:
154 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
156 * Predicates of locales introduced by classes carry a mandatory
157 "class" prefix. INCOMPATIBILITY.
159 * Vacuous class specifications observe default sort. INCOMPATIBILITY.
161 * Old 'axclass' command has been discontinued. INCOMPATIBILITY, use
164 * Command 'code_reflect' allows to incorporate generated ML code into
165 runtime environment; replaces immature code_datatype antiquotation.
168 * Code generator: simple concept for abstract datatypes obeying
171 * Code generator: details of internal data cache have no impact on the
172 user space functionality any longer.
174 * Methods "unfold_locales" and "intro_locales" ignore non-locale
175 subgoals. This is more appropriate for interpretations with 'where'.
178 * Command 'example_proof' opens an empty proof body. This allows to
179 experiment with Isar, without producing any persistent result.
181 * Commands 'type_notation' and 'no_type_notation' declare type syntax
182 within a local theory context, with explicit checking of the
183 constructors involved (in contrast to the raw 'syntax' versions).
185 * Commands 'types' and 'typedecl' now work within a local theory
186 context -- without introducing dependencies on parameters or
187 assumptions, which is not possible in Isabelle/Pure.
189 * Command 'defaultsort' has been renamed to 'default_sort', it works
190 within a local theory context. Minor INCOMPATIBILITY.
195 * Command 'typedef' now works within a local theory context -- without
196 introducing dependencies on parameters or assumptions, which is not
197 possible in Isabelle/Pure/HOL. Note that the logical environment may
198 contain multiple interpretations of local typedefs (with different
199 non-emptiness proofs), even in a global theory context.
201 * New package for quotient types. Commands 'quotient_type' and
202 'quotient_definition' may be used for defining types and constants by
203 quotient constructions. An example is the type of integers created by
204 quotienting pairs of natural numbers:
207 intrel :: "(nat * nat) => (nat * nat) => bool"
209 "intrel (x, y) (u, v) = (x + v = u + y)"
211 quotient_type int = "nat × nat" / intrel
212 by (auto simp add: equivp_def expand_fun_eq)
215 "0::int" is "(0::nat, 0::nat)"
217 The method "lifting" can be used to lift of theorems from the
218 underlying "raw" type to the quotient type. The example
219 src/HOL/Quotient_Examples/FSet.thy includes such a quotient
220 construction and provides a reasoning infrastructure for finite sets.
222 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
223 clash with new theory Quotient in Main HOL.
225 * Moved the SMT binding into the main HOL session, eliminating
226 separate HOL-SMT session.
228 * List membership infix mem operation is only an input abbreviation.
231 * Theory Library/Word.thy has been removed. Use library Word/Word.thy
232 for future developements; former Library/Word.thy is still present in
233 the AFP entry RSAPPS.
235 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
236 longer shadowed. INCOMPATIBILITY.
238 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
241 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
244 * Dropped normalizing_semiring etc; use the facts in semiring classes
245 instead. INCOMPATIBILITY.
247 * Dropped several real-specific versions of lemmas about floor and
248 ceiling; use the generic lemmas from theory "Archimedean_Field"
249 instead. INCOMPATIBILITY.
251 floor_number_of_eq ~> floor_number_of
252 le_floor_eq_number_of ~> number_of_le_floor
253 le_floor_eq_zero ~> zero_le_floor
254 le_floor_eq_one ~> one_le_floor
255 floor_less_eq_number_of ~> floor_less_number_of
256 floor_less_eq_zero ~> floor_less_zero
257 floor_less_eq_one ~> floor_less_one
258 less_floor_eq_number_of ~> number_of_less_floor
259 less_floor_eq_zero ~> zero_less_floor
260 less_floor_eq_one ~> one_less_floor
261 floor_le_eq_number_of ~> floor_le_number_of
262 floor_le_eq_zero ~> floor_le_zero
263 floor_le_eq_one ~> floor_le_one
264 floor_subtract_number_of ~> floor_diff_number_of
265 floor_subtract_one ~> floor_diff_one
266 ceiling_number_of_eq ~> ceiling_number_of
267 ceiling_le_eq_number_of ~> ceiling_le_number_of
268 ceiling_le_zero_eq ~> ceiling_le_zero
269 ceiling_le_eq_one ~> ceiling_le_one
270 less_ceiling_eq_number_of ~> number_of_less_ceiling
271 less_ceiling_eq_zero ~> zero_less_ceiling
272 less_ceiling_eq_one ~> one_less_ceiling
273 ceiling_less_eq_number_of ~> ceiling_less_number_of
274 ceiling_less_eq_zero ~> ceiling_less_zero
275 ceiling_less_eq_one ~> ceiling_less_one
276 le_ceiling_eq_number_of ~> number_of_le_ceiling
277 le_ceiling_eq_zero ~> zero_le_ceiling
278 le_ceiling_eq_one ~> one_le_ceiling
279 ceiling_subtract_number_of ~> ceiling_diff_number_of
280 ceiling_subtract_one ~> ceiling_diff_one
282 * Theory "Finite_Set": various folding_XXX locales facilitate the
283 application of the various fold combinators on finite sets.
285 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
286 provides abstract red-black tree type which is backed by "RBT_Impl" as
287 implementation. INCOMPATIBILTY.
289 * Theory Library/Coinductive_List has been removed -- superseded by
290 AFP/thys/Coinductive.
292 * Theory PReal, including the type "preal" and related operations, has
293 been removed. INCOMPATIBILITY.
295 * Split off theory "Big_Operators" containing setsum, setprod,
296 Inf_fin, Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
298 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
299 "Int" etc. INCOMPATIBILITY.
301 * Constant Rat.normalize needs to be qualified. INCOMPATIBILITY.
303 * New set of rules "ac_simps" provides combined assoc / commute
304 rewrites for all interpretations of the appropriate generic locales.
306 * Renamed theory "OrderedGroup" to "Groups" and split theory
307 "Ring_and_Field" into theories "Rings" and "Fields"; for more
308 appropriate and more consistent names suitable for name prefixes
309 within the HOL theories. INCOMPATIBILITY.
311 * Some generic constants have been put to appropriate theories:
312 - less_eq, less: Orderings
313 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
314 - inverse, divide: Rings
317 * More consistent naming of type classes involving orderings (and
320 lower_semilattice ~> semilattice_inf
321 upper_semilattice ~> semilattice_sup
323 dense_linear_order ~> dense_linorder
325 pordered_ab_group_add ~> ordered_ab_group_add
326 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
327 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
328 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
329 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
330 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
331 pordered_cancel_semiring ~> ordered_cancel_semiring
332 pordered_comm_monoid_add ~> ordered_comm_monoid_add
333 pordered_comm_ring ~> ordered_comm_ring
334 pordered_comm_semiring ~> ordered_comm_semiring
335 pordered_ring ~> ordered_ring
336 pordered_ring_abs ~> ordered_ring_abs
337 pordered_semiring ~> ordered_semiring
339 ordered_ab_group_add ~> linordered_ab_group_add
340 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
341 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
342 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
343 ordered_field ~> linordered_field
344 ordered_field_no_lb ~> linordered_field_no_lb
345 ordered_field_no_ub ~> linordered_field_no_ub
346 ordered_field_dense_linear_order ~> dense_linordered_field
347 ordered_idom ~> linordered_idom
348 ordered_ring ~> linordered_ring
349 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
350 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
351 ordered_ring_strict ~> linordered_ring_strict
352 ordered_semidom ~> linordered_semidom
353 ordered_semiring ~> linordered_semiring
354 ordered_semiring_1 ~> linordered_semiring_1
355 ordered_semiring_1_strict ~> linordered_semiring_1_strict
356 ordered_semiring_strict ~> linordered_semiring_strict
358 The following slightly odd type classes have been moved to a
359 separate theory Library/Lattice_Algebras:
361 lordered_ab_group_add ~> lattice_ab_group_add
362 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
363 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
364 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
365 lordered_ring ~> lattice_ring
369 * Refined field classes:
370 - classes division_ring_inverse_zero, field_inverse_zero,
371 linordered_field_inverse_zero include rule inverse 0 = 0 --
372 subsumes former division_by_zero class;
373 - numerous lemmas have been ported from field to division_ring.
376 * Refined algebra theorem collections:
377 - dropped theorem group group_simps, use algebra_simps instead;
378 - dropped theorem group ring_simps, use field_simps instead;
379 - proper theorem collection field_simps subsumes former theorem
380 groups field_eq_simps and field_simps;
381 - dropped lemma eq_minus_self_iff which is a duplicate for
385 * Theory Finite_Set and List: some lemmas have been generalized from
388 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
389 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
390 inter_Inter_fold_inter ~> inf_Inf_fold_inf
391 union_Union_fold_union ~> sup_Sup_fold_sup
392 Inter_fold_inter ~> Inf_fold_inf
393 Union_fold_union ~> Sup_fold_sup
394 inter_INTER_fold_inter ~> inf_INFI_fold_inf
395 union_UNION_fold_union ~> sup_SUPR_fold_sup
396 INTER_fold_inter ~> INFI_fold_inf
397 UNION_fold_union ~> SUPR_fold_sup
399 * Theory "Complete_Lattice": lemmas top_def and bot_def have been
400 replaced by the more convenient lemmas Inf_empty and Sup_empty.
401 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
402 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
403 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
404 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
406 * Reorganized theory Multiset: swapped notation of pointwise and
409 - pointwise ordering is instance of class order with standard syntax
411 - multiset ordering has syntax <=# and <#; partial order properties
412 are provided by means of interpretation with prefix
414 - less duplication, less historical organization of sections,
415 conversion from associations lists to multisets, rudimentary code
417 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
422 multiset_eq_conv_count_eq ~> multiset_ext_iff
423 multi_count_ext ~> multiset_ext
424 diff_union_inverse2 ~> diff_union_cancelR
428 * Theory Permutation: replaced local "remove" by List.remove1.
430 * Code generation: ML and OCaml code is decorated with signatures.
432 * Theory List: added transpose.
434 * Library/Nat_Bijection.thy is a collection of bijective functions
435 between nat and other types, which supersedes the older libraries
436 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
439 Nat_Int_Bij.nat2_to_nat ~> prod_encode
440 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
441 Nat_Int_Bij.int_to_nat_bij ~> int_encode
442 Nat_Int_Bij.nat_to_int_bij ~> int_decode
443 Countable.pair_encode ~> prod_encode
444 NatIso.prod2nat ~> prod_encode
445 NatIso.nat2prod ~> prod_decode
446 NatIso.sum2nat ~> sum_encode
447 NatIso.nat2sum ~> sum_decode
448 NatIso.list2nat ~> list_encode
449 NatIso.nat2list ~> list_decode
450 NatIso.set2nat ~> set_encode
451 NatIso.nat2set ~> set_decode
454 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
455 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
456 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
457 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
458 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
459 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
460 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
461 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
462 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
463 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
464 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
465 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
466 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
469 - Renamed ATP commands:
470 atp_info ~> sledgehammer running_atps
471 atp_kill ~> sledgehammer kill_atps
472 atp_messages ~> sledgehammer messages
473 atp_minimize ~> sledgehammer minimize
474 print_atps ~> sledgehammer available_atps
476 - Added user's manual ("isabelle doc sledgehammer").
477 - Added option syntax and "sledgehammer_params" to customize
478 Sledgehammer's behavior. See the manual for details.
479 - Modified the Isar proof reconstruction code so that it produces
480 direct proofs rather than proofs by contradiction. (This feature
481 is still experimental.)
482 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
484 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
487 - Added and implemented "binary_ints" and "bits" options.
488 - Added "std" option and implemented support for nonstandard models.
489 - Added and implemented "finitize" option to improve the precision
490 of infinite datatypes based on a monotonicity analysis.
491 - Added support for quotient types.
492 - Added support for "specification" and "ax_specification"
494 - Added support for local definitions (for "function" and
495 "termination" proofs).
496 - Added support for term postprocessors.
497 - Optimized "Multiset.multiset" and "FinFun.finfun".
498 - Improved efficiency of "destroy_constrs" optimization.
499 - Fixed soundness bugs related to "destroy_constrs" optimization and
501 - Fixed soundness bug related to higher-order constructors.
502 - Fixed soundness bug when "full_descrs" is enabled.
503 - Improved precision of set constructs.
504 - Added "atoms" option.
505 - Added cache to speed up repeated Kodkod invocations on the same
507 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
508 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
509 "SAT4J_Light". INCOMPATIBILITY.
510 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
511 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
512 - Removed "nitpick_intro" attribute. INCOMPATIBILITY.
517 * Variable names in lemmas generated by the domain package have
518 changed; the naming scheme is now consistent with the HOL datatype
519 package. Some proof scripts may be affected, INCOMPATIBILITY.
521 * The domain package no longer defines the function "foo_copy" for
522 recursive domain "foo". The reach lemma is now stated directly in
523 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
524 be reformulated in terms of "foo_take", INCOMPATIBILITY.
526 * Most definedness lemmas generated by the domain package (previously
527 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
528 like "foo$x = UU <-> x = UU", which works better as a simp rule.
529 Proofs that used definedness lemmas as intro rules may break,
530 potential INCOMPATIBILITY.
532 * Induction and casedist rules generated by the domain package now
533 declare proper case_names (one called "bottom", and one named for each
534 constructor). INCOMPATIBILITY.
536 * For mutually-recursive domains, separate "reach" and "take_lemma"
537 rules are generated for each domain, INCOMPATIBILITY.
539 foo_bar.reach ~> foo.reach bar.reach
540 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
542 * Some lemmas generated by the domain package have been renamed for
543 consistency with the datatype package, INCOMPATIBILITY.
545 foo.ind ~> foo.induct
546 foo.finite_ind ~> foo.finite_induct
547 foo.coind ~> foo.coinduct
548 foo.casedist ~> foo.exhaust
549 foo.exhaust ~> foo.nchotomy
551 * For consistency with other definition packages, the fixrec package
552 now generates qualified theorem names, INCOMPATIBILITY.
554 foo_simps ~> foo.simps
555 foo_unfold ~> foo.unfold
556 foo_induct ~> foo.induct
558 * The "fixrec_simp" attribute has been removed. The "fixrec_simp"
559 method and internal fixrec proofs now use the default simpset instead.
562 * The "contlub" predicate has been removed. Proof scripts should use
563 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
565 * The "admw" predicate has been removed, INCOMPATIBILITY.
567 * The constants cpair, cfst, and csnd have been removed in favor of
568 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
573 * Antiquotations for basic formal entities:
575 @{class NAME} -- type class
576 @{class_syntax NAME} -- syntax representation of the above
578 @{type_name NAME} -- logical type
579 @{type_abbrev NAME} -- type abbreviation
580 @{nonterminal NAME} -- type of concrete syntactic category
581 @{type_syntax NAME} -- syntax representation of any of the above
583 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
584 @{const_abbrev NAME} -- abbreviated constant
585 @{const_syntax NAME} -- syntax representation of any of the above
587 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
588 syntax constant (cf. 'syntax' command).
590 * Antiquotation @{make_string} inlines a function to print arbitrary
591 values similar to the ML toplevel. The result is compiler dependent
592 and may fall back on "?" in certain situations.
594 * Diagnostic commands 'ML_val' and 'ML_command' may refer to
595 antiquotations @{Isar.state} and @{Isar.goal}. This replaces impure
596 Isar.state() and Isar.goal(), which belong to the old TTY loop and do
597 not work with the asynchronous Isar document model.
599 * Configuration options now admit dynamic default values, depending on
600 the context or even global references.
602 * SHA1.digest digests strings according to SHA-1 (see RFC 3174). It
603 uses an efficient external library if available (for Poly/ML).
605 * Renamed some important ML structures, while keeping the old names
606 for some time as aliases within the structure Legacy:
608 OuterKeyword ~> Keyword
611 OuterSyntax ~> Outer_Syntax
612 PrintMode ~> Print_Mode
613 SpecParse ~> Parse_Spec
616 ThyOutput ~> Thy_Output
617 TypeInfer ~> Type_Infer
619 Note that "open Legacy" simplifies porting of sources, but forgetting
620 to remove it again will complicate porting again in the future.
622 * Most operations that refer to a global context are named
623 accordingly, e.g. Simplifier.global_context or
624 ProofContext.init_global. There are some situations where a global
625 context actually works, but under normal circumstances one needs to
626 pass the proper local context through the code!
628 * Discontinued old TheoryDataFun with its copy/init operation -- data
629 needs to be pure. Functor Theory_Data_PP retains the traditional
630 Pretty.pp argument to merge, which is absent in the standard
633 * Sorts.certify_sort and derived "cert" operations for types and terms
634 no longer minimize sorts. Thus certification at the boundary of the
635 inference kernel becomes invariant under addition of class relations,
636 which is an important monotonicity principle. Sorts are now minimized
637 in the syntax layer only, at the boundary between the end-user and the
638 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
639 explicitly in rare situations.
641 * Renamed old-style Drule.standard to Drule.export_without_context, to
642 emphasize that this is in no way a standard operation.
645 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
646 usual for resolution. Rare INCOMPATIBILITY.
648 * Renamed varify/unvarify operations to varify_global/unvarify_global
649 to emphasize that these only work in a global situation (which is
652 * Curried take and drop in library.ML; negative length is interpreted
653 as infinity (as in chop). Subtle INCOMPATIBILITY.
655 * Proof terms: type substitutions on proof constants now use canonical
656 order of type variables. INCOMPATIBILITY for tools working with proof
659 * Raw axioms/defs may no longer carry sort constraints, and raw defs
660 may no longer carry premises. User-level specifications are
661 transformed accordingly by Thm.add_axiom/add_def.
666 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
667 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
668 proof terms are enabled unconditionally in the new HOL-Proofs image.
670 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
671 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
674 * Old lib/scripts/polyml-platform is superseded by the
675 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
676 variant, even on a 64 bit machine. The following example setting
677 prefers 64 bit if available:
679 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
681 * The preliminary Isabelle/jEdit application demonstrates the emerging
682 Isabelle/Scala layer for advanced prover interaction and integration.
683 See src/Tools/jEdit or "isabelle jedit" provided by the properly built
688 New in Isabelle2009-1 (December 2009)
689 -------------------------------------
693 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
694 one backslash should be used, even in ML sources.
699 * Locale interpretation propagates mixins along the locale hierarchy.
700 The currently only available mixins are the equations used to map
701 local definitions to terms of the target domain of an interpretation.
703 * Reactivated diagnostic command 'print_interps'. Use "print_interps
704 loc" to print all interpretations of locale "loc" in the theory.
705 Interpretations in proofs are not shown.
707 * Thoroughly revised locales tutorial. New section on conditional
710 * On instantiation of classes, remaining undefined class parameters
711 are formally declared. INCOMPATIBILITY.
714 *** Document preparation ***
716 * New generalized style concept for printing terms: @{foo (style) ...}
717 instead of @{foo_style style ...} (old form is still retained for
718 backward compatibility). Styles can be also applied for
719 antiquotations prop, term_type and typeof.
724 * New proof method "smt" for a combination of first-order logic with
725 equality, linear and nonlinear (natural/integer/real) arithmetic, and
726 fixed-size bitvectors; there is also basic support for higher-order
727 features (esp. lambda abstractions). It is an incomplete decision
728 procedure based on external SMT solvers using the oracle mechanism;
729 for the SMT solver Z3, this method is proof-producing. Certificates
730 are provided to avoid calling the external solvers solely for
731 re-checking proofs. Due to a remote SMT service there is no need for
732 installing SMT solvers locally. See src/HOL/SMT.
734 * New commands to load and prove verification conditions generated by
735 the Boogie program verifier or derived systems (e.g. the Verifying C
736 Compiler (VCC) or Spec#). See src/HOL/Boogie.
738 * New counterexample generator tool 'nitpick' based on the Kodkod
739 relational model finder. See src/HOL/Tools/Nitpick and
740 src/HOL/Nitpick_Examples.
742 * New commands 'code_pred' and 'values' to invoke the predicate
743 compiler and to enumerate values of inductive predicates.
745 * A tabled implementation of the reflexive transitive closure.
747 * New implementation of quickcheck uses generic code generator;
748 default generators are provided for all suitable HOL types, records
749 and datatypes. Old quickcheck can be re-activated importing theory
750 Library/SML_Quickcheck.
752 * New testing tool Mirabelle for automated proof tools. Applies
753 several tools and tactics like sledgehammer, metis, or quickcheck, to
754 every proof step in a theory. To be used in batch mode via the
757 * New proof method "sos" (sum of squares) for nonlinear real
758 arithmetic (originally due to John Harison). It requires theory
759 Library/Sum_Of_Squares. It is not a complete decision procedure but
760 works well in practice on quantifier-free real arithmetic with +, -,
761 *, ^, =, <= and <, i.e. boolean combinations of equalities and
762 inequalities between polynomials. It makes use of external
763 semidefinite programming solvers. Method "sos" generates a
764 certificate that can be pasted into the proof thus avoiding the need
765 to call an external tool every time the proof is checked. See
766 src/HOL/Library/Sum_Of_Squares.
768 * New method "linarith" invokes existing linear arithmetic decision
771 * New command 'atp_minimal' reduces result produced by Sledgehammer.
773 * New Sledgehammer option "Full Types" in Proof General settings menu.
774 Causes full type information to be output to the ATPs. This slows
775 ATPs down considerably but eliminates a source of unsound "proofs"
778 * New method "metisFT": A version of metis that uses full type
779 information in order to avoid failures of proof reconstruction.
781 * New evaluator "approximate" approximates an real valued term using
782 the same method as the approximation method.
784 * Method "approximate" now supports arithmetic expressions as
785 boundaries of intervals and implements interval splitting and Taylor
788 * ML antiquotation @{code_datatype} inserts definition of a datatype
789 generated by the code generator; e.g. see src/HOL/Predicate.thy.
791 * New theory SupInf of the supremum and infimum operators for sets of
794 * New theory Probability, which contains a development of measure
795 theory, eventually leading to Lebesgue integration and probability.
797 * Extended Multivariate Analysis to include derivation and Brouwer's
800 * Reorganization of number theory, INCOMPATIBILITY:
801 - new number theory development for nat and int, in theories Divides
802 and GCD as well as in new session Number_Theory
803 - some constants and facts now suffixed with _nat and _int
805 - former session NumberTheory now named Old_Number_Theory, including
806 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
807 - moved theory Pocklington from src/HOL/Library to
808 src/HOL/Old_Number_Theory
810 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
811 lcm of finite and infinite sets. It is shown that they form a complete
814 * Class semiring_div requires superclass no_zero_divisors and proof of
815 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
816 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
817 generalized to class semiring_div, subsuming former theorems
818 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
819 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
822 * Refinements to lattice classes and sets:
823 - less default intro/elim rules in locale variant, more default
824 intro/elim rules in class variant: more uniformity
825 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
827 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
829 - renamed ACI to inf_sup_aci
830 - new class "boolean_algebra"
831 - class "complete_lattice" moved to separate theory
832 "Complete_Lattice"; corresponding constants (and abbreviations)
833 renamed and with authentic syntax:
834 Set.Inf ~> Complete_Lattice.Inf
835 Set.Sup ~> Complete_Lattice.Sup
836 Set.INFI ~> Complete_Lattice.INFI
837 Set.SUPR ~> Complete_Lattice.SUPR
838 Set.Inter ~> Complete_Lattice.Inter
839 Set.Union ~> Complete_Lattice.Union
840 Set.INTER ~> Complete_Lattice.INTER
841 Set.UNION ~> Complete_Lattice.UNION
842 - authentic syntax for
845 - mere abbreviations:
848 Set.inter (for inf, formerly Set.Int)
849 Set.union (for sup, formerly Set.Un)
850 Complete_Lattice.Inter (for Inf)
851 Complete_Lattice.Union (for Sup)
852 Complete_Lattice.INTER (for INFI)
853 Complete_Lattice.UNION (for SUPR)
854 - object-logic definitions as far as appropriate
856 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
857 Un_subset_iff are explicitly deleted as default simp rules; then also
858 their lattice counterparts le_inf_iff and le_sup_iff have to be
859 deleted to achieve the desired effect.
861 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
862 rules by default any longer; the same applies to min_max.inf_absorb1
863 etc. INCOMPATIBILITY.
865 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
866 pred_set_conv by default. INCOMPATIBILITY.
868 * Power operations on relations and functions are now one dedicated
869 constant "compow" with infix syntax "^^". Power operation on
870 multiplicative monoids retains syntax "^" and is now defined generic
871 in class power. INCOMPATIBILITY.
873 * Relation composition "R O S" now has a more standard argument order:
874 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
875 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
876 break, since the O_assoc rule was not rewritten like this. Fix using
877 O_assoc[symmetric]. The same applies to the curried version "R OO S".
879 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
880 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
883 * Most rules produced by inductive and datatype package have mandatory
884 prefixes. INCOMPATIBILITY.
886 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
887 the attribute of the same name. Each of the theorems in the list
888 DERIV_intros assumes composition with an additional function and
889 matches a variable to the derivative, which has to be solved by the
890 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
891 of most elementary terms. Former Maclauren.DERIV_tac and
892 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
895 * Code generator attributes follow the usual underscore convention:
896 code_unfold replaces code unfold
897 code_post replaces code post
902 sizechange -> size_change
903 induct_scheme -> induction_schema
906 * Discontinued abbreviation "arbitrary" of constant "undefined".
907 INCOMPATIBILITY, use "undefined" directly.
910 Suc_eq_add_numeral_1 -> Suc_eq_plus1
911 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
912 Suc_plus1 -> Suc_eq_plus1
913 *anti_sym -> *antisym*
914 vector_less_eq_def -> vector_le_def
917 * Added theorem List.map_map as [simp]. Removed List.map_compose.
920 * Removed predicate "M hassize n" (<--> card M = n & finite M).
926 * Theory Representable defines a class "rep" of domains that are
927 representable (via an ep-pair) in the universal domain type "udom".
928 Instances are provided for all type constructors defined in HOLCF.
930 * The 'new_domain' command is a purely definitional version of the
931 domain package, for representable domains. Syntax is identical to the
932 old domain package. The 'new_domain' package also supports indirect
933 recursion using previously-defined type constructors. See
934 src/HOLCF/ex/New_Domain.thy for examples.
936 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
937 on the left-hand side of an equation, and then performs
938 simplification. Rewriting is done using rules declared with the
939 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
940 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
942 * The pattern-match compiler in 'fixrec' can now handle constructors
943 with HOL function types. Pattern-match combinators for the Pair
944 constructor are pre-configured.
946 * The 'fixrec' package now produces better fixed-point induction rules
947 for mutually-recursive definitions: Induction rules have conclusions
948 of the form "P foo bar" instead of "P <foo, bar>".
950 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
951 been renamed to "below". The name "below" now replaces "less" in many
952 theorem names. (Legacy theorem names using "less" are still supported
955 * The 'fixrec' package now supports "bottom patterns". Bottom
956 patterns can be used to generate strictness rules, or to make
957 functions more strict (much like the bang-patterns supported by the
958 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
964 * Support for Poly/ML 5.3.0, with improved reporting of compiler
965 errors and run-time exceptions, including detailed source positions.
967 * Structure Name_Space (formerly NameSpace) now manages uniquely
968 identified entries, with some additional information such as source
969 position, logical grouping etc.
971 * Theory and context data is now introduced by the simplified and
972 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
973 to be pure, but the old TheoryDataFun for mutable data (with explicit
974 copy operation) is still available for some time.
976 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
977 provides a high-level programming interface to synchronized state
978 variables with atomic update. This works via pure function
979 application within a critical section -- its runtime should be as
980 short as possible; beware of deadlocks if critical code is nested,
981 either directly or indirectly via other synchronized variables!
983 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
984 wraps raw ML references, explicitly indicating their non-thread-safe
985 behaviour. The Isar toplevel keeps this structure open, to
986 accommodate Proof General as well as quick and dirty interactive
987 experiments with references.
989 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
990 parallel tactical reasoning.
992 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
993 are similar to SUBPROOF, but are slightly more flexible: only the
994 specified parts of the subgoal are imported into the context, and the
995 body tactic may introduce new subgoals and schematic variables.
997 * Old tactical METAHYPS, which does not observe the proof context, has
998 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
999 or Subgoal.FOCUS etc.
1001 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
1002 functors have their own ML name space there is no point to mark them
1003 separately.) Minor INCOMPATIBILITY.
1005 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
1007 * Renamed several structures FooBar to Foo_Bar. Occasional,
1010 * Operations of structure Skip_Proof no longer require quick_and_dirty
1011 mode, which avoids critical setmp.
1013 * Eliminated old Attrib.add_attributes, Method.add_methods and related
1014 combinators for "args". INCOMPATIBILITY, need to use simplified
1015 Attrib/Method.setup introduced in Isabelle2009.
1017 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
1018 back on global_simpset_of, global_claset_of, global_clasimpset_of as
1019 last resort. INCOMPATIBILITY.
1021 * Display.pretty_thm now requires a proper context (cf. former
1022 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
1023 or even Display.pretty_thm_without_context as last resort.
1026 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
1027 Syntax.pretty_typ/term directly, preferably with proper context
1028 instead of global theory.
1033 * Further fine tuning of parallel proof checking, scales up to 8 cores
1034 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
1037 * Support for additional "Isabelle components" via etc/components, see
1038 also the system manual.
1040 * The isabelle makeall tool now operates on all components with
1041 IsaMakefile, not just hardwired "logics".
1043 * Removed "compress" option from isabelle-process and isabelle usedir;
1044 this is always enabled.
1046 * Discontinued support for Poly/ML 4.x versions.
1048 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
1049 on a given logic image. This requires the lighttpd webserver and is
1050 currently supported on Linux only.
1054 New in Isabelle2009 (April 2009)
1055 --------------------------------
1059 * Simplified main Isabelle executables, with less surprises on
1060 case-insensitive file-systems (such as Mac OS).
1062 - The main Isabelle tool wrapper is now called "isabelle" instead of
1065 - The former "isabelle" alias for "isabelle-process" has been
1066 removed (should rarely occur to regular users).
1068 - The former "isabelle-interface" and its alias "Isabelle" have been
1069 removed (interfaces are now regular Isabelle tools).
1071 Within scripts and make files, the Isabelle environment variables
1072 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
1073 respectively. (The latter are still available as legacy feature.)
1075 The old isabelle-interface wrapper could react in confusing ways if
1076 the interface was uninstalled or changed otherwise. Individual
1077 interface tool configuration is now more explicit, see also the
1078 Isabelle system manual. In particular, Proof General is now available
1079 via "isabelle emacs".
1081 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
1082 purge installed copies of Isabelle executables and re-run "isabelle
1083 install -p ...", or use symlinks.
1085 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
1086 old ~/isabelle, which was slightly non-standard and apt to cause
1087 surprises on case-insensitive file-systems (such as Mac OS).
1089 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
1090 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
1091 care is required when using older releases of Isabelle. Note that
1092 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
1093 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
1095 * Proofs of fully specified statements are run in parallel on
1096 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
1097 a regular 4-core machine, if the initial heap space is made reasonably
1098 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
1100 * The main reference manuals ("isar-ref", "implementation", and
1101 "system") have been updated and extended. Formally checked references
1102 as hyperlinks are now available uniformly.
1107 * Complete re-implementation of locales. INCOMPATIBILITY in several
1108 respects. The most important changes are listed below. See the
1109 Tutorial on Locales ("locales" manual) for details.
1111 - In locale expressions, instantiation replaces renaming. Parameters
1112 must be declared in a for clause. To aid compatibility with previous
1113 parameter inheritance, in locale declarations, parameters that are not
1114 'touched' (instantiation position "_" or omitted) are implicitly added
1115 with their syntax at the beginning of the for clause.
1117 - Syntax from abbreviations and definitions in locales is available in
1118 locale expressions and context elements. The latter is particularly
1119 useful in locale declarations.
1121 - More flexible mechanisms to qualify names generated by locale
1122 expressions. Qualifiers (prefixes) may be specified in locale
1123 expressions, and can be marked as mandatory (syntax: "name!:") or
1124 optional (syntax "name?:"). The default depends for plain "name:"
1125 depends on the situation where a locale expression is used: in
1126 commands 'locale' and 'sublocale' prefixes are optional, in
1127 'interpretation' and 'interpret' prefixes are mandatory. The old
1128 implicit qualifiers derived from the parameter names of a locale are
1129 no longer generated.
1131 - Command "sublocale l < e" replaces "interpretation l < e". The
1132 instantiation clause in "interpretation" and "interpret" (square
1133 brackets) is no longer available. Use locale expressions.
1135 - When converting proof scripts, mandatory qualifiers in
1136 'interpretation' and 'interpret' should be retained by default, even
1137 if this is an INCOMPATIBILITY compared to former behavior. In the
1138 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1139 in locale expressions range over a single locale instance only.
1141 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1142 In existing theorem specifications replace the includes element by the
1143 respective context elements of the included locale, omitting those
1144 that are already present in the theorem specification. Multiple
1145 assume elements of a locale should be replaced by a single one
1146 involving the locale predicate. In the proof body, declarations (most
1147 notably theorems) may be regained by interpreting the respective
1148 locales in the proof context as required (command "interpret").
1150 If using "includes" in replacement of a target solely because the
1151 parameter types in the theorem are not as general as in the target,
1152 consider declaring a new locale with additional type constraints on
1153 the parameters (context element "constrains").
1155 - Discontinued "locale (open)". INCOMPATIBILITY.
1157 - Locale interpretation commands no longer attempt to simplify goal.
1158 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1159 methods intro_locales and unfold_locales to clarify.
1161 - Locale interpretation commands no longer accept interpretation
1162 attributes. INCOMPATIBILITY.
1164 * Class declaration: so-called "base sort" must not be given in import
1165 list any longer, but is inferred from the specification. Particularly
1172 class foo = type + ...
1174 * Class target: global versions of theorems stemming do not carry a
1175 parameter prefix any longer. INCOMPATIBILITY.
1177 * Class 'instance' command no longer accepts attached definitions.
1178 INCOMPATIBILITY, use proper 'instantiation' target instead.
1180 * Recovered hiding of consts, which was accidentally broken in
1181 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1182 makes c inaccessible; consider using ``hide (open) const c'' instead.
1184 * Slightly more coherent Pure syntax, with updated documentation in
1185 isar-ref manual. Removed locales meta_term_syntax and
1186 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1187 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1188 directly in regular applications.
1190 * There is a new syntactic category "float_const" for signed decimal
1191 fractions (e.g. 123.45 or -123.45).
1193 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1194 interface with 'setup' command instead.
1196 * Command 'local_setup' is similar to 'setup', but operates on a local
1199 * The 'axiomatization' command now only works within a global theory
1200 context. INCOMPATIBILITY.
1202 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1203 hypotheses. Sorts required in the course of reasoning need to be
1204 covered by the constraints in the initial statement, completed by the
1205 type instance information of the background theory. Non-trivial sort
1206 hypotheses, which rarely occur in practice, may be specified via
1207 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1209 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1211 The result contains an implicit sort hypotheses as before --
1212 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1215 * Generalized Isar history, with support for linear undo, direct state
1218 * Changed defaults for unify configuration options:
1220 unify_trace_bound = 50 (formerly 25)
1221 unify_search_bound = 60 (formerly 30)
1223 * Different bookkeeping for code equations (INCOMPATIBILITY):
1225 a) On theory merge, the last set of code equations for a particular
1226 constant is taken (in accordance with the policy applied by other
1227 parts of the code generator framework).
1229 b) Code equations stemming from explicit declarations (e.g. code
1230 attribute) gain priority over default code equations stemming
1231 from definition, primrec, fun etc.
1233 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1235 * Unified theorem tables for both code generators. Thus [code
1236 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1238 * Command 'find_consts' searches for constants based on type and name
1241 find_consts "_ => bool"
1243 By default, matching is against subtypes, but it may be restricted to
1244 the whole type. Searching by name is possible. Multiple queries are
1245 conjunctive and queries may be negated by prefixing them with a
1248 find_consts strict: "_ => bool" name: "Int" -"int => int"
1250 * New 'find_theorems' criterion "solves" matches theorems that
1251 directly solve the current goal (modulo higher-order unification).
1253 * Auto solve feature for main theorem statements: whenever a new goal
1254 is stated, "find_theorems solves" is called; any theorems that could
1255 solve the lemma directly are listed as part of the goal state.
1256 Cf. associated options in Proof General Isabelle settings menu,
1257 enabled by default, with reasonable timeout for pathological cases of
1258 higher-order unification.
1261 *** Document preparation ***
1263 * Antiquotation @{lemma} now imitates a regular terminal proof,
1264 demanding keyword 'by' and supporting the full method expression
1265 syntax just like the Isar command 'by'.
1270 * Integrated main parts of former image HOL-Complex with HOL. Entry
1271 points Main and Complex_Main remain as before.
1273 * Logic image HOL-Plain provides a minimal HOL with the most important
1274 tools available (inductive, datatype, primrec, ...). This facilitates
1275 experimentation and tool development. Note that user applications
1276 (and library theories) should never refer to anything below theory
1279 * Logic image HOL-Main stops at theory Main, and thus facilitates
1280 experimentation due to shorter build times.
1282 * Logic image HOL-NSA contains theories of nonstandard analysis which
1283 were previously part of former HOL-Complex. Entry point Hyperreal
1284 remains valid, but theories formerly using Complex_Main should now use
1285 new entry point Hypercomplex.
1287 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1288 Posix processes. Avoids potentially expensive forking of the ML
1289 process. New thread-based implementation also works on non-Unix
1290 platforms (Cygwin). Provers are no longer hardwired, but defined
1291 within the theory via plain ML wrapper functions. Basic Sledgehammer
1292 commands are covered in the isar-ref manual.
1294 * Wrapper scripts for remote SystemOnTPTP service allows to use
1295 sledgehammer without local ATP installation (Vampire etc.). Other
1296 provers may be included via suitable ML wrappers, see also
1297 src/HOL/ATP_Linkup.thy.
1299 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1302 * The metis method no longer fails because the theorem is too trivial
1303 (contains the empty clause).
1305 * The metis method now fails in the usual manner, rather than raising
1306 an exception, if it determines that it cannot prove the theorem.
1308 * Method "coherent" implements a prover for coherent logic (see also
1309 src/Tools/coherent.ML).
1311 * Constants "undefined" and "default" replace "arbitrary". Usually
1312 "undefined" is the right choice to replace "arbitrary", though
1313 logically there is no difference. INCOMPATIBILITY.
1315 * Command "value" now integrates different evaluation mechanisms. The
1316 result of the first successful evaluation mechanism is printed. In
1317 square brackets a particular named evaluation mechanisms may be
1318 specified (currently, [SML], [code] or [nbe]). See further
1319 src/HOL/ex/Eval_Examples.thy.
1321 * Normalization by evaluation now allows non-leftlinear equations.
1322 Declare with attribute [code nbe].
1324 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1325 as the structured Isar versions "cases" and "induct", cf. the
1326 corresponding "cases" and "induct" attributes. Mutual induction rules
1327 are now presented as a list of individual projections
1328 (e.g. foo_bar.inducts for types foo and bar); the old format with
1329 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1330 rare situations a different rule is selected --- notably nested tuple
1331 elimination instead of former prod.exhaust: use explicit (case_tac t
1332 rule: prod.exhaust) here.
1334 * Attributes "cases", "induct", "coinduct" support "del" option.
1336 * Removed fact "case_split_thm", which duplicates "case_split".
1338 * The option datatype has been moved to a new theory Option. Renamed
1339 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1341 * New predicate "strict_mono" classifies strict functions on partial
1342 orders. With strict functions on linear orders, reasoning about
1343 (in)equalities is facilitated by theorems "strict_mono_eq",
1344 "strict_mono_less_eq" and "strict_mono_less".
1346 * Some set operations are now proper qualified constants with
1347 authentic syntax. INCOMPATIBILITY:
1358 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1361 * Auxiliary class "itself" has disappeared -- classes without any
1362 parameter are treated as expected by the 'class' command.
1364 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1366 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1367 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1369 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1370 method "approximation". It proves formulas on real values by using
1371 interval arithmetic. In the formulas are also the transcendental
1372 functions sin, cos, tan, atan, ln, exp and the constant pi are
1373 allowed. For examples see
1374 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1376 * Theory "Reflection" now resides in HOL/Library.
1378 * Entry point to Word library now simply named "Word".
1381 * Made source layout more coherent with logical distribution
1384 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1385 src/HOL/Library/Code_Message.thy ~> src/HOL/
1386 src/HOL/Library/GCD.thy ~> src/HOL/
1387 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1388 src/HOL/Library/Parity.thy ~> src/HOL/
1389 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1390 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1391 src/HOL/Real/Lubs.thy ~> src/HOL/
1392 src/HOL/Real/PReal.thy ~> src/HOL/
1393 src/HOL/Real/Rational.thy ~> src/HOL/
1394 src/HOL/Real/RComplete.thy ~> src/HOL/
1395 src/HOL/Real/RealDef.thy ~> src/HOL/
1396 src/HOL/Real/RealPow.thy ~> src/HOL/
1397 src/HOL/Real/Real.thy ~> src/HOL/
1398 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1399 src/HOL/Complex/Complex.thy ~> src/HOL/
1400 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1401 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1402 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1403 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1404 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1405 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1406 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1407 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1408 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1409 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1410 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1411 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1412 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1413 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1414 src/HOL/Real/Float ~> src/HOL/Library/
1415 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1416 src/HOL/Real/RealVector.thy ~> src/HOL/
1418 src/HOL/arith_data.ML ~> src/HOL/Tools
1419 src/HOL/hologic.ML ~> src/HOL/Tools
1420 src/HOL/simpdata.ML ~> src/HOL/Tools
1421 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1422 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1423 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1424 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1425 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1426 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1427 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1429 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1430 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1431 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1432 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1433 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1434 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1436 * If methods "eval" and "evaluation" encounter a structured proof
1437 state with !!/==>, only the conclusion is evaluated to True (if
1438 possible), avoiding strange error messages.
1440 * Method "sizechange" automates termination proofs using (a
1441 modification of) the size-change principle. Requires SAT solver. See
1442 src/HOL/ex/Termination.thy for examples.
1444 * Simplifier: simproc for let expressions now unfolds if bound
1445 variable occurs at most once in let expression body. INCOMPATIBILITY.
1447 * Method "arith": Linear arithmetic now ignores all inequalities when
1448 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1450 * New attribute "arith" for facts that should always be used
1451 automatically by arithmetic. It is intended to be used locally in
1454 assumes [arith]: "x > 0"
1456 Global usage is discouraged because of possible performance impact.
1458 * New classes "top" and "bot" with corresponding operations "top" and
1459 "bot" in theory Orderings; instantiation of class "complete_lattice"
1460 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1462 * Changed definition lemma "less_fun_def" in order to provide an
1463 instance for preorders on functions; use lemma "less_le" instead.
1466 * Theory Orderings: class "wellorder" moved here, with explicit
1467 induction rule "less_induct" as assumption. For instantiation of
1468 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1471 * Theory Orderings: added class "preorder" as superclass of "order".
1472 INCOMPATIBILITY: Instantiation proofs for order, linorder
1473 etc. slightly changed. Some theorems named order_class.* now named
1476 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1479 * Theory Finite_Set: added a new fold combinator of type
1481 ('a => 'b => 'b) => 'b => 'a set => 'b
1483 Occasionally this is more convenient than the old fold combinator
1484 which is now defined in terms of the new one and renamed to
1487 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1488 and "ring_simps" have been replaced by "algebra_simps" (which can be
1489 extended with further lemmas!). At the moment both still exist but
1490 the former will disappear at some point.
1492 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1493 class recpower. Type-specific simp rules for various recpower types
1494 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1496 rat_power_0 -> power_0
1497 rat_power_Suc -> power_Suc
1498 realpow_0 -> power_0
1499 realpow_Suc -> power_Suc
1500 complexpow_0 -> power_0
1501 complexpow_Suc -> power_Suc
1502 power_poly_0 -> power_0
1503 power_poly_Suc -> power_Suc
1505 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1506 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1507 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1508 of lemmas from Divides has been generalized from nat to class
1509 semiring_div. INCOMPATIBILITY. This involves the following theorem
1510 renames resulting from duplicate elimination:
1512 dvd_def_mod ~> dvd_eq_mod_eq_0
1513 zero_dvd_iff ~> dvd_0_left_iff
1514 dvd_0 ~> dvd_0_right
1515 DIVISION_BY_ZERO_DIV ~> div_by_0
1516 DIVISION_BY_ZERO_MOD ~> mod_by_0
1517 mult_div ~> div_mult_self2_is_id
1518 mult_mod ~> mod_mult_self2_is_0
1520 * Theory IntDiv: removed many lemmas that are instances of class-based
1521 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1522 rename old lemmas as follows:
1524 dvd_diff -> nat_dvd_diff
1525 dvd_zminus_iff -> dvd_minus_iff
1526 mod_add1_eq -> mod_add_eq
1527 mod_mult1_eq -> mod_mult_right_eq
1528 mod_mult1_eq' -> mod_mult_left_eq
1529 mod_mult_distrib_mod -> mod_mult_eq
1530 nat_mod_add_left_eq -> mod_add_left_eq
1531 nat_mod_add_right_eq -> mod_add_right_eq
1532 nat_mod_div_trivial -> mod_div_trivial
1533 nat_mod_mod_trivial -> mod_mod_trivial
1534 zdiv_zadd_self1 -> div_add_self1
1535 zdiv_zadd_self2 -> div_add_self2
1536 zdiv_zmult_self1 -> div_mult_self2_is_id
1537 zdiv_zmult_self2 -> div_mult_self1_is_id
1538 zdvd_triv_left -> dvd_triv_left
1539 zdvd_triv_right -> dvd_triv_right
1540 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1541 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1542 zmod_zadd_left_eq -> mod_add_left_eq
1543 zmod_zadd_right_eq -> mod_add_right_eq
1544 zmod_zadd_self1 -> mod_add_self1
1545 zmod_zadd_self2 -> mod_add_self2
1546 zmod_zadd1_eq -> mod_add_eq
1547 zmod_zdiff1_eq -> mod_diff_eq
1548 zmod_zdvd_zmod -> mod_mod_cancel
1549 zmod_zmod_cancel -> mod_mod_cancel
1550 zmod_zmult_self1 -> mod_mult_self2_is_0
1551 zmod_zmult_self2 -> mod_mult_self1_is_0
1554 zdvd_abs1 -> abs_dvd_iff
1555 zdvd_abs2 -> dvd_abs_iff
1556 zdvd_refl -> dvd_refl
1557 zdvd_trans -> dvd_trans
1558 zdvd_zadd -> dvd_add
1559 zdvd_zdiff -> dvd_diff
1560 zdvd_zminus_iff -> dvd_minus_iff
1561 zdvd_zminus2_iff -> minus_dvd_iff
1562 zdvd_zmultD -> dvd_mult_right
1563 zdvd_zmultD2 -> dvd_mult_left
1564 zdvd_zmult_mono -> mult_dvd_mono
1565 zdvd_0_right -> dvd_0_right
1566 zdvd_0_left -> dvd_0_left_iff
1567 zdvd_1_left -> one_dvd
1568 zminus_dvd_iff -> minus_dvd_iff
1570 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1572 * The real numbers offer decimal input syntax: 12.34 is translated
1573 into 1234/10^2. This translation is not reversed upon output.
1575 * Theory Library/Polynomial defines an abstract type 'a poly of
1576 univariate polynomials with coefficients of type 'a. In addition to
1577 the standard ring operations, it also supports div and mod. Code
1578 generation is also supported, using list-style constructors.
1580 * Theory Library/Inner_Product defines a class of real_inner for real
1581 inner product spaces, with an overloaded operation inner :: 'a => 'a
1582 => real. Class real_inner is a subclass of real_normed_vector from
1585 * Theory Library/Product_Vector provides instances for the product
1586 type 'a * 'b of several classes from RealVector and Inner_Product.
1587 Definitions of addition, subtraction, scalar multiplication, norms,
1588 and inner products are included.
1590 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1591 addition to the field operations, numerals and case syntax are also
1594 * Theory Library/Diagonalize provides constructive version of Cantor's
1595 first diagonalization argument.
1597 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1598 zlcm (for int); carried together from various gcd/lcm developements in
1599 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1600 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1601 may recover tupled syntax as follows:
1603 hide (open) const gcd
1604 abbreviation gcd where
1605 "gcd == (%(a, b). GCD.gcd a b)"
1607 GCD.gcd ("gcd '(_, _')")
1609 The same works for lcm, zgcd, zlcm.
1611 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1612 instantiations for algebraic structures. Removed some duplicate
1613 theorems. Changes in simp rules. INCOMPATIBILITY.
1615 * ML antiquotation @{code} takes a constant as argument and generates
1616 corresponding code in background and inserts name of the corresponding
1617 resulting ML value/function/datatype constructor binding in place.
1618 All occurrences of @{code} with a single ML block are generated
1619 simultaneously. Provides a generic and safe interface for
1620 instrumentalizing code generation. See
1621 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1622 In future you ought to refrain from ad-hoc compiling generated SML
1623 code on the ML toplevel. Note that (for technical reasons) @{code}
1624 cannot refer to constants for which user-defined serializations are
1625 set. Refer to the corresponding ML counterpart directly in that
1628 * Command 'rep_datatype': instead of theorem names the command now
1629 takes a list of terms denoting the constructors of the type to be
1630 represented as datatype. The characteristic theorems have to be
1631 proven. INCOMPATIBILITY. Also observe that the following theorems
1632 have disappeared in favour of existing ones:
1634 unit_induct ~> unit.induct
1635 prod_induct ~> prod.induct
1636 sum_induct ~> sum.induct
1637 Suc_Suc_eq ~> nat.inject
1638 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1643 * New locales for orders and lattices where the equivalence relation
1644 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1645 locales use a record structure with field eq for the equivalence.
1647 * New theory of factorial domains.
1649 * Units_l_inv and Units_r_inv are now simp rules by default.
1650 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1651 and/or r_inv will now also require deletion of these lemmas.
1653 * Renamed the following theorems, INCOMPATIBILITY:
1655 UpperD ~> Upper_memD
1656 LowerD ~> Lower_memD
1657 least_carrier ~> least_closed
1658 greatest_carrier ~> greatest_closed
1659 greatest_Lower_above ~> greatest_Lower_below
1660 one_zero ~> carrier_one_zero
1661 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1666 * Nominal datatypes can now contain type-variables.
1668 * Commands 'nominal_inductive' and 'equivariance' work with local
1671 * Nominal primrec can now works with local theory targets and its
1672 specification syntax now conforms to the general format as seen in
1675 * Method "perm_simp" honours the standard simplifier attributes
1676 (no_asm), (no_asm_use) etc.
1678 * The new predicate #* is defined like freshness, except that on the
1679 left hand side can be a set or list of atoms.
1681 * Experimental command 'nominal_inductive2' derives strong induction
1682 principles for inductive definitions. In contrast to
1683 'nominal_inductive', which can only deal with a fixed number of
1684 binders, it can deal with arbitrary expressions standing for sets of
1685 atoms to be avoided. The only inductive definition we have at the
1686 moment that needs this generalisation is the typing rule for Lets in
1689 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1690 -----------------------------------------------------------------
1691 Gamma |- Let x be t1 in t2 : T2
1693 In this rule one wants to avoid all the binders that are introduced by
1694 "close Gamma T1". We are looking for other examples where this
1695 feature might be useful. Please let us know.
1700 * Reimplemented the simplification procedure for proving continuity
1701 subgoals. The new simproc is extensible; users can declare additional
1702 continuity introduction rules with the attribute [cont2cont].
1704 * The continuity simproc now uses a different introduction rule for
1705 solving continuity subgoals on terms with lambda abstractions. In
1706 some rare cases the new simproc may fail to solve subgoals that the
1707 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1708 Potential INCOMPATIBILITY.
1710 * Command 'fixrec': specification syntax now conforms to the general
1711 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1712 examples. INCOMPATIBILITY.
1717 * Proof of Zorn's Lemma for partial orders.
1722 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1723 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1724 depends on multithreading, so timouts will not work before Poly/ML
1727 * High-level support for concurrent ML programming, see
1728 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1729 particularly convenient to organize independent functional
1730 computations. The concept of "synchronized variables" provides a
1731 higher-order interface for components with shared state, avoiding the
1732 delicate details of mutexes and condition variables. (Requires
1733 Poly/ML 5.2.1 or later.)
1735 * ML bindings produced via Isar commands are stored within the Isar
1736 context (theory or proof). Consequently, commands like 'use' and 'ML'
1737 become thread-safe and work with undo as expected (concerning
1738 top-level bindings, not side-effects on global references).
1739 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1740 compiler at runtime; really global bindings need to be given outside a
1741 theory. (Requires Poly/ML 5.2 or later.)
1743 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1744 context. Top-level ML bindings are stored within the proof context in
1745 a purely sequential fashion, disregarding the nested proof structure.
1746 ML bindings introduced by 'ML_prf' are discarded at the end of the
1747 proof. (Requires Poly/ML 5.2 or later.)
1749 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1750 and Method.setup, as well as Isar commands 'attribute_setup' and
1751 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1752 existing code accordingly, or use plain 'setup' together with old
1755 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1756 to 'a -> thm, while results are always tagged with an authentic oracle
1757 name. The Isar command 'oracle' is now polymorphic, no argument type
1758 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1759 accordingly. Note that extra performance may be gained by producing
1760 the cterm carefully, avoiding slow Thm.cterm_of.
1762 * Simplified interface for defining document antiquotations via
1763 ThyOutput.antiquotation, ThyOutput.output, and optionally
1764 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1765 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1768 * More systematic treatment of long names, abstract name bindings, and
1769 name space operations. Basic operations on qualified names have been
1770 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1771 Long_Name.append. Old type bstring has been mostly replaced by
1772 abstract type binding (see structure Binding), which supports precise
1773 qualification by packages and local theory targets, as well as proper
1774 tracking of source positions. INCOMPATIBILITY, need to wrap old
1775 bstring values into Binding.name, or better pass through abstract
1776 bindings everywhere. See further src/Pure/General/long_name.ML,
1777 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1779 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1780 LocalTheory.note etc.) now refer to the *full* internal name, not the
1781 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1783 * Disposed old type and term read functions (Sign.read_def_typ,
1784 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1785 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1786 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1787 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1788 resort for legacy applications.
1790 * Disposed old declarations, tactics, tactic combinators that refer to
1791 the simpset or claset of an implicit theory (such as Addsimps,
1792 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1793 embedded ML text, or local_simpset_of with a proper context passed as
1794 explicit runtime argument.
1796 * Rules and tactics that read instantiations (read_instantiate,
1797 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1798 context, which is required for parsing and type-checking. Moreover,
1799 the variables are specified as plain indexnames, not string encodings
1800 thereof. INCOMPATIBILITY.
1802 * Generic Toplevel.add_hook interface allows to analyze the result of
1803 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1804 for theorem dependency output of transactions resulting in a new
1807 * ML antiquotations: block-structured compilation context indicated by
1808 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1810 @{binding name} - basic name binding
1811 @{let ?pat = term} - term abbreviation (HO matching)
1812 @{note name = fact} - fact abbreviation
1813 @{thm fact} - singleton fact (with attributes)
1814 @{thms fact} - general fact (with attributes)
1815 @{lemma prop by method} - singleton goal
1816 @{lemma prop by meth1 meth2} - singleton goal
1817 @{lemma prop1 ... propN by method} - general goal
1818 @{lemma prop1 ... propN by meth1 meth2} - general goal
1819 @{lemma (open) ...} - open derivation
1824 * The Isabelle "emacs" tool provides a specific interface to invoke
1825 Proof General / Emacs, with more explicit failure if that is not
1826 installed (the old isabelle-interface script silently falls back on
1827 isabelle-process). The PROOFGENERAL_HOME setting determines the
1828 installation location of the Proof General distribution.
1830 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1831 the Isabelle process into a JVM/Scala application. See
1832 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1833 process wrapper has been discontinued.)
1835 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1837 * Various status messages (with exact source position information) are
1838 emitted, if proper markup print mode is enabled. This allows
1839 user-interface components to provide detailed feedback on internal
1844 New in Isabelle2008 (June 2008)
1845 -------------------------------
1849 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1850 and updated, with formally checked references as hyperlinks.
1852 * Theory loader: use_thy (and similar operations) no longer set the
1853 implicit ML context, which was occasionally hard to predict and in
1854 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1855 provides a proper context already.
1857 * Theory loader: old-style ML proof scripts being *attached* to a thy
1858 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1859 'use' within a theory file will do the job.
1861 * Name space merge now observes canonical order, i.e. the second space
1862 is inserted into the first one, while existing entries in the first
1863 space take precedence. INCOMPATIBILITY in rare situations, may try to
1864 swap theory imports.
1866 * Syntax: symbol \<chi> is now considered a letter. Potential
1867 INCOMPATIBILITY in identifier syntax etc.
1869 * Outer syntax: string tokens no longer admit escaped white space,
1870 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1871 white space without escapes.
1873 * Outer syntax: string tokens may contain arbitrary character codes
1874 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1880 * Context-dependent token translations. Default setup reverts locally
1881 fixed variables, and adds hilite markup for undeclared frees.
1883 * Unused theorems can be found using the new command 'unused_thms'.
1884 There are three ways of invoking it:
1887 Only finds unused theorems in the current theory.
1889 (2) unused_thms thy_1 ... thy_n -
1890 Finds unused theorems in the current theory and all of its ancestors,
1891 excluding the theories thy_1 ... thy_n and all of their ancestors.
1893 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1894 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1895 their ancestors, excluding the theories thy_1 ... thy_n and all of
1898 In order to increase the readability of the list produced by
1899 unused_thms, theorems that have been created by a particular instance
1900 of a theory command such as 'inductive' or 'function' are considered
1901 to belong to the same "group", meaning that if at least one theorem in
1902 this group is used, the other theorems in the same group are no longer
1903 reported as unused. Moreover, if all theorems in the group are
1904 unused, only one theorem in the group is displayed.
1906 Note that proof objects have to be switched on in order for
1907 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1908 usually the case when using Proof General with the default settings).
1910 * Authentic naming of facts disallows ad-hoc overwriting of previous
1911 theorems within the same name space. INCOMPATIBILITY, need to remove
1912 duplicate fact bindings, or even accidental fact duplications. Note
1913 that tools may maintain dynamically scoped facts systematically, using
1914 PureThy.add_thms_dynamic.
1916 * Command 'hide' now allows to hide from "fact" name space as well.
1918 * Eliminated destructive theorem database, simpset, claset, and
1919 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1920 update of theories within ML code.
1922 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1923 INCOMPATIBILITY, object-logics depending on former Pure require
1924 additional setup PureThy.old_appl_syntax_setup; object-logics
1925 depending on former CPure need to refer to Pure.
1927 * Commands 'use' and 'ML' are now purely functional, operating on
1928 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1929 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1932 * Command 'setup': discontinued implicit version with ML reference.
1934 * Instantiation target allows for simultaneous specification of class
1935 instance operations together with an instantiation proof.
1936 Type-checking phase allows to refer to class operations uniformly.
1937 See src/HOL/Complex/Complex.thy for an Isar example and
1938 src/HOL/Library/Eval.thy for an ML example.
1940 * Indexing of literal facts: be more serious about including only
1941 facts from the visible specification/proof context, but not the
1942 background context (locale etc.). Affects `prop` notation and method
1943 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1946 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1947 "(open)" option, which used to expose internal bound variables to the
1950 * Isar statements: removed obsolete case "rule_context".
1951 INCOMPATIBILITY, better use explicit fixes/assumes.
1953 * Locale proofs: default proof step now includes 'unfold_locales';
1954 hence 'proof' without argument may be used to unfold locale
1958 *** Document preparation ***
1960 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1961 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1962 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1963 spot); renamed link color from "darkblue" to "linkcolor" (default
1964 value unchanged, can be redefined via \definecolor); no longer sets
1965 "a4paper" option (unnecessary or even intrusive).
1967 * Antiquotation @{lemma A method} proves proposition A by the given
1968 method (either a method name or a method name plus (optional) method
1969 arguments in parentheses) and prints A just like @{prop A}.
1974 * New primrec package. Specification syntax conforms in style to
1975 definition/function/.... No separate induction rule is provided. The
1976 "primrec" command distinguishes old-style and new-style specifications
1977 by syntax. The former primrec package is now named OldPrimrecPackage.
1978 When adjusting theories, beware: constants stemming from new-style
1979 primrec specifications have authentic syntax.
1981 * Metis prover is now an order of magnitude faster, and also works
1982 with multithreading.
1984 * Metis: the maximum number of clauses that can be produced from a
1985 theorem is now given by the attribute max_clauses. Theorems that
1986 exceed this number are ignored, with a warning printed.
1988 * Sledgehammer no longer produces structured proofs by default. To
1989 enable, declare [[sledgehammer_full = true]]. Attributes
1990 reconstruction_modulus, reconstruction_sorts renamed
1991 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1993 * Method "induct_scheme" derives user-specified induction rules
1994 from well-founded induction and completeness of patterns. This factors
1995 out some operations that are done internally by the function package
1996 and makes them available separately. See
1997 src/HOL/ex/Induction_Scheme.thy for examples.
1999 * More flexible generation of measure functions for termination
2000 proofs: Measure functions can be declared by proving a rule of the
2001 form "is_measure f" and giving it the [measure_function] attribute.
2002 The "is_measure" predicate is logically meaningless (always true), and
2003 just guides the heuristic. To find suitable measure functions, the
2004 termination prover sets up the goal "is_measure ?f" of the appropriate
2005 type and generates all solutions by prolog-style backwards proof using
2008 This setup also deals with rules like
2010 "is_measure f ==> is_measure (list_size f)"
2012 which accommodates nested datatypes that recurse through lists.
2013 Similar rules are predeclared for products and option types.
2015 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
2019 - Definitions of overloaded constants on sets have to be replaced by
2020 definitions on => and bool.
2022 - Some definitions of overloaded operators on sets can now be proved
2023 using the definitions of the operators on => and bool. Therefore,
2024 the following theorems have been renamed:
2026 subset_def -> subset_eq
2027 psubset_def -> psubset_eq
2028 set_diff_def -> set_diff_eq
2029 Compl_def -> Compl_eq
2030 Sup_set_def -> Sup_set_eq
2031 Inf_set_def -> Inf_set_eq
2032 sup_set_def -> sup_set_eq
2033 inf_set_def -> inf_set_eq
2035 - Due to the incompleteness of the HO unification algorithm, some
2036 rules such as subst may require manual instantiation, if some of
2037 the unknowns in the rule is a set.
2039 - Higher order unification and forward proofs:
2042 have "P (S::'a set)" <...>
2043 then have "EX S. P S" ..
2045 no longer works (due to the incompleteness of the HO unification
2046 algorithm) and must be replaced by the pattern
2053 - Calculational reasoning with subst (or similar rules):
2056 have "P (S::'a set)" <...>
2057 also have "S = T" <...>
2058 finally have "P T" .
2060 no longer works (for similar reasons as the previous example) and
2061 must be replaced by something like
2063 have "P (S::'a set)" <...>
2064 moreover have "S = T" <...>
2065 ultimately have "P T" by simp
2067 - Tactics or packages written in ML code:
2068 Code performing pattern matching on types via
2070 Type ("set", [T]) => ...
2072 must be rewritten. Moreover, functions like strip_type or
2073 binder_types no longer return the right value when applied to a
2076 T1 => ... => Tn => U => bool
2080 T1 => ... => Tn => U set
2082 * Merged theories Wellfounded_Recursion, Accessible_Part and
2083 Wellfounded_Relations to theory Wellfounded.
2085 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
2087 * Class finite no longer treats UNIV as class parameter. Use class
2088 enum from theory Library/Enum instead to achieve a similar effect.
2091 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
2092 and "Cons". INCOMPATIBILITY.
2094 * HOL (and FOL): renamed variables in rules imp_elim and swap.
2095 Potential INCOMPATIBILITY.
2097 * Theory Product_Type: duplicated lemmas split_Pair_apply and
2098 injective_fst_snd removed, use split_eta and prod_eqI instead.
2099 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
2101 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
2102 the same name in theory Orderings:
2112 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2113 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2114 and different variable names.
2116 * Library/Option_ord.thy: Canonical order on option type.
2118 * Library/RBT.thy: Red-black trees, an efficient implementation of
2121 * Library/Countable.thy: Type class for countable types.
2123 * Theory Int: The representation of numerals has changed. The infix
2124 operator BIT and the bit datatype with constructors B0 and B1 have
2125 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2126 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2127 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2130 * Theory Nat: definition of <= and < on natural numbers no longer
2131 depend on well-founded relations. INCOMPATIBILITY. Definitions
2132 le_def and less_def have disappeared. Consider lemmas not_less
2133 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2135 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2136 (whose purpose mainly is for various fold_set functionals) have been
2137 abandoned in favor of the existing algebraic classes
2138 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2139 lower_semilattice (resp. upper_semilattice) and linorder.
2142 * Theory Transitive_Closure: induct and cases rules now declare proper
2143 case_names ("base" and "step"). INCOMPATIBILITY.
2145 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2146 lattices. The form set-specific version is available as
2147 Inductive.lfp_ordinal_induct_set.
2149 * Renamed theorems "power.simps" to "power_int.simps".
2152 * Class semiring_div provides basic abstract properties of semirings
2153 with division and modulo operations. Subsumes former class dvd_mod.
2155 * Merged theories IntDef, Numeral and IntArith into unified theory
2156 Int. INCOMPATIBILITY.
2158 * Theory Library/Code_Index: type "index" now represents natural
2159 numbers rather than integers. INCOMPATIBILITY.
2161 * New class "uminus" with operation "uminus" (split of from class
2162 "minus" which now only has operation "minus", binary).
2165 * Constants "card", "internal_split", "option_map" now with authentic
2166 syntax. INCOMPATIBILITY.
2168 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2169 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2170 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2171 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2172 Sup_set_def, le_def, less_def, option_map_def now with object
2173 equality. INCOMPATIBILITY.
2175 * Records. Removed K_record, and replaced it by pure lambda term
2176 %x. c. The simplifier setup is now more robust against eta expansion.
2177 INCOMPATIBILITY: in cases explicitly referring to K_record.
2179 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2181 * Library/ListVector: new theory of arithmetic vector operations.
2183 * Library/Order_Relation: new theory of various orderings as sets of
2184 pairs. Defines preorders, partial orders, linear orders and
2185 well-orders on sets and on types.
2190 * Renamed some theories to allow to loading both ZF and HOL in the
2193 Datatype -> Datatype_ZF
2194 Inductive -> Inductive_ZF
2201 INCOMPATIBILITY: ZF theories that import individual theories below
2202 Main might need to be adapted. Regular theory Main is still
2203 available, as trivial extension of Main_ZF.
2208 * ML within Isar: antiquotation @{const name} or @{const
2209 name(typargs)} produces statically-checked Const term.
2211 * Functor NamedThmsFun: data is available to the user as dynamic fact
2212 (of the same name). Removed obsolete print command.
2214 * Removed obsolete "use_legacy_bindings" function.
2216 * The ``print mode'' is now a thread-local value derived from a global
2217 template (the former print_mode reference), thus access becomes
2218 non-critical. The global print_mode reference is for session
2219 management only; user-code should use print_mode_value,
2220 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2222 * Functions system/system_out provide a robust way to invoke external
2223 shell commands, with propagation of interrupts (requires Poly/ML
2224 5.2.1). Do not use OS.Process.system etc. from the basis library!
2229 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2230 in accordance with Proof General 3.7, which prefers GNU emacs.
2232 * isatool tty runs Isabelle process with plain tty interaction;
2233 optional line editor may be specified via ISABELLE_LINE_EDITOR
2234 setting, the default settings attempt to locate "ledit" and "rlwrap".
2236 * isatool browser now works with Cygwin as well, using general
2237 "javapath" function defined in Isabelle process environment.
2239 * YXML notation provides a simple and efficient alternative to
2240 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2241 isatool yxml as described in the Isabelle system manual.
2243 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2244 provides general wrapper for managing an Isabelle process in a robust
2245 fashion, with ``cooked'' output from stdin/stderr.
2247 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2248 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2250 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2251 way of changing the user's settings is via
2252 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2255 * Multithreading.max_threads := 0 refers to the number of actual CPU
2256 cores of the underlying machine, which is a good starting point for
2257 optimal performance tuning. The corresponding usedir option -M allows
2258 "max" as an alias for "0". WARNING: does not work on certain versions
2259 of Mac OS (with Poly/ML 5.1).
2261 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2262 adverse effect of Isabelle flooding interactive front-ends (notably
2263 ProofGeneral / XEmacs).
2267 New in Isabelle2007 (November 2007)
2268 -----------------------------------
2272 * More uniform information about legacy features, notably a
2273 warning/error of "Legacy feature: ...", depending on the state of the
2274 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2275 legacy features will disappear eventually.
2277 * Theory syntax: the header format ``theory A = B + C:'' has been
2278 discontinued in favour of ``theory A imports B C begin''. Use isatool
2279 fixheaders to convert existing theory files. INCOMPATIBILITY.
2281 * Theory syntax: the old non-Isar theory file format has been
2282 discontinued altogether. Note that ML proof scripts may still be used
2283 with Isar theories; migration is usually quite simple with the ML
2284 function use_legacy_bindings. INCOMPATIBILITY.
2286 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2287 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2290 * Theory loader: be more serious about observing the static theory
2291 header specifications (including optional directories), but not the
2292 accidental file locations of previously successful loads. The strict
2293 update policy of former update_thy is now already performed by
2294 use_thy, so the former has been removed; use_thys updates several
2295 theories simultaneously, just as 'imports' within a theory header
2296 specification, but without merging the results. Potential
2297 INCOMPATIBILITY: may need to refine theory headers and commands
2298 ROOT.ML which depend on load order.
2300 * Theory loader: optional support for content-based file
2301 identification, instead of the traditional scheme of full physical
2302 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2303 (cf. the system manual). The new scheme allows to work with
2304 non-finished theories in persistent session images, such that source
2305 files may be moved later on without requiring reloads.
2307 * Theory loader: old-style ML proof scripts being *attached* to a thy
2308 file (with the same base name as the theory) are considered a legacy
2309 feature, which will disappear eventually. Even now, the theory loader
2310 no longer maintains dependencies on such files.
2312 * Syntax: the scope for resolving ambiguities via type-inference is
2313 now limited to individual terms, instead of whole simultaneous
2314 specifications as before. This greatly reduces the complexity of the
2315 syntax module and improves flexibility by separating parsing and
2316 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2317 'fixes' etc.) are required in rare situations.
2319 * Syntax: constants introduced by new-style packages ('definition',
2320 'abbreviation' etc.) are passed through the syntax module in
2321 ``authentic mode''. This means that associated mixfix annotations
2322 really stick to such constants, independently of potential name space
2323 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2324 trees are represented slightly differently, may need to adapt syntax
2325 translations accordingly. Use CONST marker in 'translations' and
2326 @{const_syntax} antiquotation in 'parse_translation' etc.
2328 * Legacy goal package: reduced interface to the bare minimum required
2329 to keep existing proof scripts running. Most other user-level
2330 functions are now part of the OldGoals structure, which is *not* open
2331 by default (consider isatool expandshort before open OldGoals).
2332 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2333 these tend to cause confusion about the actual goal (!) context being
2334 used here, which is not necessarily the same as the_context().
2336 * Command 'find_theorems': supports "*" wild-card in "name:"
2337 criterion; "with_dups" option. Certain ProofGeneral versions might
2338 support a specific search form (see ProofGeneral/CHANGES).
2340 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2341 by default, which means that "prems" (and also "fixed variables") are
2342 suppressed from proof state output. Note that the ProofGeneral
2343 settings mechanism allows to change and save options persistently, but
2344 older versions of Isabelle will fail to start up if a negative prems
2347 * Local theory targets may be specified by non-nested blocks of
2348 ``context/locale/class ... begin'' followed by ``end''. The body may
2349 contain definitions, theorems etc., including any derived mechanism
2350 that has been implemented on top of these primitives. This concept
2351 generalizes the existing ``theorem (in ...)'' towards more versatility
2354 * Proof General interface: proper undo of final 'end' command;
2355 discontinued Isabelle/classic mode (ML proof scripts).
2358 *** Document preparation ***
2360 * Added antiquotation @{theory name} which prints the given name,
2361 after checking that it refers to a valid ancestor theory in the
2364 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2365 check the given source text as ML type/structure, printing verbatim.
2367 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2368 "c args == rhs" given in the current context. (Any number of
2369 arguments may be given on the LHS.)
2374 * The 'class' package offers a combination of axclass and locale to
2375 achieve Haskell-like type classes in Isabelle. Definitions and
2376 theorems within a class context produce both relative results (with
2377 implicit parameters according to the locale context), and polymorphic
2378 constants with qualified polymorphism (according to the class
2379 context). Within the body context of a 'class' target, a separate
2380 syntax layer ("user space type system") takes care of converting
2381 between global polymorphic consts and internal locale representation.
2382 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2383 "isatool doc classes" provides a tutorial.
2385 * Generic code generator framework allows to generate executable
2386 code for ML and Haskell (including Isabelle classes). A short usage
2389 internal compilation:
2390 export_code <list of constants (term syntax)> in SML
2391 writing SML code to a file:
2392 export_code <list of constants (term syntax)> in SML <filename>
2393 writing OCaml code to a file:
2394 export_code <list of constants (term syntax)> in OCaml <filename>
2395 writing Haskell code to a bunch of files:
2396 export_code <list of constants (term syntax)> in Haskell <filename>
2398 evaluating closed propositions to True/False using code generation:
2401 Reasonable default setup of framework in HOL.
2403 Theorem attributs for selecting and transforming function equations theorems:
2405 [code fun]: select a theorem as function equation for a specific constant
2406 [code fun del]: deselect a theorem as function equation for a specific constant
2407 [code inline]: select an equation theorem for unfolding (inlining) in place
2408 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2410 User-defined serializations (target in {SML, OCaml, Haskell}):
2412 code_const <and-list of constants (term syntax)>
2413 {(target) <and-list of const target syntax>}+
2415 code_type <and-list of type constructors>
2416 {(target) <and-list of type target syntax>}+
2418 code_instance <and-list of instances>
2420 where instance ::= <type constructor> :: <class>
2422 code_class <and_list of classes>
2423 {(target) <and-list of class target syntax>}+
2424 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2426 code_instance and code_class only are effective to target Haskell.
2428 For example usage see src/HOL/ex/Codegenerator.thy and
2429 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2430 generation from Isabelle/HOL theories is available via "isatool doc
2433 * Code generator: consts in 'consts_code' Isar commands are now
2434 referred to by usual term syntax (including optional type
2437 * Command 'no_translations' removes translation rules from theory
2440 * Overloaded definitions are now actually checked for acyclic
2441 dependencies. The overloading scheme is slightly more general than
2442 that of Haskell98, although Isabelle does not demand an exact
2443 correspondence to type class and instance declarations.
2444 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2445 exotic versions of overloading -- at the discretion of the user!
2447 Polymorphic constants are represented via type arguments, i.e. the
2448 instantiation that matches an instance against the most general
2449 declaration given in the signature. For example, with the declaration
2450 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2451 as c(nat). Overloading is essentially simultaneous structural
2452 recursion over such type arguments. Incomplete specification patterns
2453 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2454 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2455 Command 'print_theory' outputs the normalized system of recursive
2456 equations, see section "definitions".
2458 * Configuration options are maintained within the theory or proof
2459 context (with name and type bool/int/string), providing a very simple
2460 interface to a poor-man's version of general context data. Tools may
2461 declare options in ML (e.g. using Attrib.config_int) and then refer to
2462 these values using Config.get etc. Users may change options via an
2463 associated attribute of the same name. This form of context
2464 declaration works particularly well with commands 'declare' or
2465 'using', for example ``declare [[foo = 42]]''. Thus it has become
2466 very easy to avoid global references, which would not observe Isar
2467 toplevel undo/redo and fail to work with multithreading.
2469 Various global ML references of Pure and HOL have been turned into
2470 configuration options:
2472 Unify.search_bound unify_search_bound
2473 Unify.trace_bound unify_trace_bound
2474 Unify.trace_simp unify_trace_simp
2475 Unify.trace_types unify_trace_types
2476 Simplifier.simp_depth_limit simp_depth_limit
2477 Blast.depth_limit blast_depth_limit
2478 DatatypeProp.dtK datatype_distinctness_limit
2479 fast_arith_neq_limit fast_arith_neq_limit
2480 fast_arith_split_limit fast_arith_split_limit
2482 * Named collections of theorems may be easily installed as context
2483 data using the functor NamedThmsFun (see also
2484 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2485 attributes; there is also a toplevel print command. This facility is
2486 just a common case of general context data, which is the preferred way
2487 for anything more complex than just a list of facts in canonical
2490 * Isar: command 'declaration' augments a local theory by generic
2491 declaration functions written in ML. This enables arbitrary content
2492 being added to the context, depending on a morphism that tells the
2493 difference of the original declaration context wrt. the application
2494 context encountered later on.
2496 * Isar: proper interfaces for simplification procedures. Command
2497 'simproc_setup' declares named simprocs (with match patterns, and body
2498 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2499 context. ML antiquotation @{simproc name} retrieves named simprocs.
2501 * Isar: an extra pair of brackets around attribute declarations
2502 abbreviates a theorem reference involving an internal dummy fact,
2503 which will be ignored later --- only the effect of the attribute on
2504 the background context will persist. This form of in-place
2505 declarations is particularly useful with commands like 'declare' and
2506 'using', for example ``have A using [[simproc a]] by simp''.
2508 * Isar: method "assumption" (and implicit closing of subproofs) now
2509 takes simple non-atomic goal assumptions into account: after applying
2510 an assumption as a rule the resulting subgoals are solved by atomic
2511 assumption steps. This is particularly useful to finish 'obtain'
2512 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2513 without referring to the original premise "!!x. P x ==> thesis" in the
2514 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2517 * Isar: implicit use of prems from the Isar proof context is
2518 considered a legacy feature. Common applications like ``have A .''
2519 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2520 referencing facts explicitly here improves readability and
2521 maintainability of proof texts.
2523 * Isar: improper proof element 'guess' is like 'obtain', but derives
2524 the obtained context from the course of reasoning! For example:
2526 assume "EX x y. A x & B y" -- "any previous fact"
2527 then guess x and y by clarify
2529 This technique is potentially adventurous, depending on the facts and
2530 proof tools being involved here.
2532 * Isar: known facts from the proof context may be specified as literal
2533 propositions, using ASCII back-quote syntax. This works wherever
2534 named facts used to be allowed so far, in proof commands, proof
2535 methods, attributes etc. Literal facts are retrieved from the context
2536 according to unification of type and term parameters. For example,
2537 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2538 theorems in the current context, then these are valid literal facts:
2539 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2541 There is also a proof method "fact" which does the same composition
2542 for explicit goal states, e.g. the following proof texts coincide with
2543 certain special cases of literal facts:
2545 have "A" by fact == note `A`
2546 have "A ==> B" by fact == note `A ==> B`
2547 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2548 have "P a ==> Q a" by fact == note `P a ==> Q a`
2550 * Isar: ":" (colon) is no longer a symbolic identifier character in
2551 outer syntax. Thus symbolic identifiers may be used without
2552 additional white space in declarations like this: ``assume *: A''.
2554 * Isar: 'print_facts' prints all local facts of the current context,
2555 both named and unnamed ones.
2557 * Isar: 'def' now admits simultaneous definitions, e.g.:
2559 def x == "t" and y == "u"
2561 * Isar: added command 'unfolding', which is structurally similar to
2562 'using', but affects both the goal state and facts by unfolding given
2563 rewrite rules. Thus many occurrences of the 'unfold' method or
2564 'unfolded' attribute may be replaced by first-class proof text.
2566 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2567 and command 'unfolding' now all support object-level equalities
2568 (potentially conditional). The underlying notion of rewrite rule is
2569 analogous to the 'rule_format' attribute, but *not* that of the
2570 Simplifier (which is usually more generous).
2572 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2573 premises of a theorem by n. Useful in conjunction with drule.
2575 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2576 method expression within a sandbox consisting of the first N
2577 sub-goals, which need to exist. For example, ``simp_all [3]''
2578 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2579 simplifies all new goals that emerge from applying rule foo to the
2580 originally first one.
2582 * Isar: schematic goals are no longer restricted to higher-order
2583 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2586 * Isar: the conclusion of a long theorem statement is now either
2587 'shows' (a simultaneous conjunction, as before), or 'obtains'
2588 (essentially a disjunction of cases with local parameters and
2589 assumptions). The latter allows to express general elimination rules
2590 adequately; in this notation common elimination rules look like this:
2592 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2594 obtains x where "P x"
2596 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2600 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2606 The subsequent classical rules even refer to the formal "thesis"
2609 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2612 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2613 obtains "thesis ==> something"
2615 The actual proof of an 'obtains' statement is analogous to that of the
2616 Isar proof element 'obtain', only that there may be several cases.
2617 Optional case names may be specified in parentheses; these will be
2618 available both in the present proof and as annotations in the
2619 resulting rule, for later use with the 'cases' method (cf. attribute
2622 * Isar: the assumptions of a long theorem statement are available as
2623 "assms" fact in the proof context. This is more appropriate than the
2624 (historical) "prems", which refers to all assumptions of the current
2625 context, including those from the target locale, proof body etc.
2627 * Isar: 'print_statement' prints theorems from the current theory or
2628 proof context in long statement form, according to the syntax of a
2631 * Isar: 'obtain' takes an optional case name for the local context
2632 introduction rule (default "that").
2634 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2635 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2638 * Pure: syntax "CONST name" produces a fully internalized constant
2639 according to the current context. This is particularly useful for
2640 syntax translations that should refer to internal constant
2641 representations independently of name spaces.
2643 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2644 instead of "FOO ". This allows multiple binder declarations to coexist
2645 in the same context. INCOMPATIBILITY.
2647 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2648 primitive that also works in a locale context (both for constants and
2649 fixed variables). Type declaration and internal syntactic representation
2650 of given constants retrieved from the context. Likewise, the
2651 'no_notation' command allows to remove given syntax annotations from the
2654 * Isar/locales: new derived specification elements 'axiomatization',
2655 'definition', 'abbreviation', which support type-inference, admit
2656 object-level specifications (equality, equivalence). See also the
2657 isar-ref manual. Examples:
2660 eq (infix "===" 50) where
2661 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2663 definition "f x y = x + y + 1"
2664 definition g where "g x = f x x"
2667 neq (infix "=!=" 50) where
2668 "x =!= y == ~ (x === y)"
2670 These specifications may be also used in a locale context. Then the
2671 constants being introduced depend on certain fixed parameters, and the
2672 constant name is qualified by the locale base name. An internal
2673 abbreviation takes care for convenient input and output, making the
2674 parameters implicit and using the original short name. See also
2675 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2676 entities from a monomorphic theory.
2678 Presently, abbreviations are only available 'in' a target locale, but
2679 not inherited by general import expressions. Also note that
2680 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2681 'translations' in common applications. The "no_abbrevs" print mode
2682 prevents folding of abbreviations in term output.
2684 Concrete syntax is attached to specified constants in internal form,
2685 independently of name spaces. The parse tree representation is
2686 slightly different -- use 'notation' instead of raw 'syntax', and
2687 'translations' with explicit "CONST" markup to accommodate this.
2689 * Pure/Isar: unified syntax for new-style specification mechanisms
2690 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2691 full type inference and dummy patterns ("_"). For example:
2693 definition "K x _ = x"
2695 inductive conj for A B
2696 where "A ==> B ==> conj A B"
2698 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2699 the current context. Print mode "no_abbrevs" prevents inversion of
2700 abbreviations on output.
2702 * Isar/locales: improved parameter handling: use of locales "var" and
2703 "struct" no longer necessary; - parameter renamings are no longer
2704 required to be injective. For example, this allows to define
2705 endomorphisms as locale endom = homom mult mult h.
2707 * Isar/locales: changed the way locales with predicates are defined.
2708 Instead of accumulating the specification, the imported expression is
2709 now an interpretation. INCOMPATIBILITY: different normal form of
2710 locale expressions. In particular, in interpretations of locales with
2711 predicates, goals repesenting already interpreted fragments are not
2712 removed automatically. Use methods `intro_locales' and
2713 `unfold_locales'; see below.
2715 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2716 provide backward reasoning on locales predicates. The methods are
2717 aware of interpretations and discharge corresponding goals.
2718 `intro_locales' is less aggressive then `unfold_locales' and does not
2719 unfold predicates to assumptions.
2721 * Isar/locales: the order in which locale fragments are accumulated
2722 has changed. This enables to override declarations from fragments due
2723 to interpretations -- for example, unwanted simp rules.
2725 * Isar/locales: interpretation in theories and proof contexts has been
2726 extended. One may now specify (and prove) equations, which are
2727 unfolded in interpreted theorems. This is useful for replacing
2728 defined concepts (constants depending on locale parameters) by
2729 concepts already existing in the target context. Example:
2731 interpretation partial_order ["op <= :: [int, int] => bool"]
2732 where "partial_order.less (op <=) (x::int) y = (x < y)"
2734 Typically, the constant `partial_order.less' is created by a
2735 definition specification element in the context of locale
2738 * Method "induct": improved internal context management to support
2739 local fixes and defines on-the-fly. Thus explicit meta-level
2740 connectives !! and ==> are rarely required anymore in inductive goals
2741 (using object-logic connectives for this purpose has been long
2742 obsolete anyway). Common proof patterns are explained in
2743 src/HOL/Induct/Common_Patterns.thy, see also
2744 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2747 * Method "induct": improved handling of simultaneous goals. Instead of
2748 introducing object-level conjunction, the statement is now split into
2749 several conclusions, while the corresponding symbolic cases are nested
2750 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2751 see src/HOL/Induct/Common_Patterns.thy, for example.
2753 * Method "induct": mutual induction rules are now specified as a list
2754 of rule sharing the same induction cases. HOL packages usually provide
2755 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2756 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2757 mutual induction rules differently, i.e. like this:
2759 (induct rule: foo_bar.inducts)
2760 (induct set: foo bar)
2761 (induct pred: foo bar)
2762 (induct type: foo bar)
2764 The ML function ProjectRule.projections turns old-style rules into the
2767 * Method "coinduct": dual of induction, see
2768 src/HOL/Library/Coinductive_List.thy for various examples.
2770 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2771 considered a legacy feature.
2773 * Attribute "symmetric" produces result with standardized schematic
2774 variables (index 0). Potential INCOMPATIBILITY.
2776 * Simplifier: by default the simplifier trace only shows top level
2777 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2778 default. Thus there is less danger of being flooded by the trace. The
2779 trace indicates where parts have been suppressed.
2781 * Provers/classical: removed obsolete classical version of elim_format
2782 attribute; classical elim/dest rules are now treated uniformly when
2783 manipulating the claset.
2785 * Provers/classical: stricter checks to ensure that supplied intro,
2786 dest and elim rules are well-formed; dest and elim rules must have at
2789 * Provers/classical: attributes dest/elim/intro take an optional
2790 weight argument for the rule (just as the Pure versions). Weights are
2791 ignored by automated tools, but determine the search order of single
2794 * Syntax: input syntax now supports dummy variable binding "%_. b",
2795 where the body does not mention the bound variable. Note that dummy
2796 patterns implicitly depend on their context of bounds, which makes
2797 "{_. _}" match any set comprehension as expected. Potential
2798 INCOMPATIBILITY -- parse translations need to cope with syntactic
2799 constant "_idtdummy" in the binding position.
2801 * Syntax: removed obsolete syntactic constant "_K" and its associated
2802 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2803 for example "A -> B" => "Pi A (%_. B)".
2805 * Pure: 'class_deps' command visualizes the subclass relation, using
2806 the graph browser tool.
2808 * Pure: 'print_theory' now suppresses certain internal declarations by
2809 default; use '!' option for full details.
2814 * Method "metis" proves goals by applying the Metis general-purpose
2815 resolution prover (see also http://gilith.com/software/metis/).
2816 Examples are in the directory MetisExamples. WARNING: the
2817 Isabelle/HOL-Metis integration does not yet work properly with
2820 * Command 'sledgehammer' invokes external automatic theorem provers as
2821 background processes. It generates calls to the "metis" method if
2822 successful. These can be pasted into the proof. Users do not have to
2823 wait for the automatic provers to return. WARNING: does not really
2824 work with multi-threading.
2826 * New "auto_quickcheck" feature tests outermost goal statements for
2827 potential counter-examples. Controlled by ML references
2828 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2829 5000 milliseconds). Fails silently if statements is outside of
2830 executable fragment, or any other codgenerator problem occurs.
2832 * New constant "undefined" with axiom "undefined x = undefined".
2834 * Added class "HOL.eq", allowing for code generation with polymorphic
2837 * Some renaming of class constants due to canonical name prefixing in
2838 the new 'class' package:
2840 HOL.abs ~> HOL.abs_class.abs
2841 HOL.divide ~> HOL.divide_class.divide
2842 0 ~> HOL.zero_class.zero
2843 1 ~> HOL.one_class.one
2844 op + ~> HOL.plus_class.plus
2845 op - ~> HOL.minus_class.minus
2846 uminus ~> HOL.minus_class.uminus
2847 op * ~> HOL.times_class.times
2848 op < ~> HOL.ord_class.less
2849 op <= > HOL.ord_class.less_eq
2850 Nat.power ~> Power.power_class.power
2851 Nat.size ~> Nat.size_class.size
2852 Numeral.number_of ~> Numeral.number_class.number_of
2853 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2854 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2855 Orderings.min ~> Orderings.ord_class.min
2856 Orderings.max ~> Orderings.ord_class.max
2857 Divides.op div ~> Divides.div_class.div
2858 Divides.op mod ~> Divides.div_class.mod
2859 Divides.op dvd ~> Divides.div_class.dvd
2861 INCOMPATIBILITY. Adaptions may be required in the following cases:
2863 a) User-defined constants using any of the names "plus", "minus",
2864 "times", "less" or "less_eq". The standard syntax translations for
2865 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2868 b) Variables named "plus", "minus", "times", "less", "less_eq"
2869 INCOMPATIBILITY: use more specific names.
2871 c) Permutative equations (e.g. "a + b = b + a")
2872 Since the change of names also changes the order of terms, permutative
2873 rewrite rules may get applied in a different order. Experience shows
2874 that this is rarely the case (only two adaptions in the whole Isabelle
2875 distribution). INCOMPATIBILITY: rewrite proofs
2877 d) ML code directly refering to constant names
2878 This in general only affects hand-written proof tactics, simprocs and
2879 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2880 Consider using @{const_name} antiquotation.
2882 * New class "default" with associated constant "default".
2884 * Function "sgn" is now overloaded and available on int, real, complex
2885 (and other numeric types), using class "sgn". Two possible defs of
2886 sgn are given as equational assumptions in the classes sgn_if and
2887 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2890 * Locale "partial_order" now unified with class "order" (cf. theory
2891 Orderings), added parameter "less". INCOMPATIBILITY.
2893 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2894 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2895 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2897 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2898 changed order of proof goals in instance proofs.
2900 * The transitivity reasoner for partial and linear orders is set up
2901 for classes "order" and "linorder". Instances of the reasoner are available
2902 in all contexts importing or interpreting the corresponding locales.
2903 Method "order" invokes the reasoner separately; the reasoner
2904 is also integrated with the Simplifier as a solver. Diagnostic
2905 command 'print_orders' shows the available instances of the reasoner
2906 in the current context.
2908 * Localized monotonicity predicate in theory "Orderings"; integrated
2909 lemmas max_of_mono and min_of_mono with this predicate.
2912 * Formulation of theorem "dense" changed slightly due to integration
2913 with new class dense_linear_order.
2915 * Uniform lattice theory development in HOL.
2917 constants "meet" and "join" now named "inf" and "sup"
2918 constant "Meet" now named "Inf"
2920 classes "meet_semilorder" and "join_semilorder" now named
2921 "lower_semilattice" and "upper_semilattice"
2922 class "lorder" now named "lattice"
2923 class "comp_lat" now named "complete_lattice"
2925 Instantiation of lattice classes allows explicit definitions
2926 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2928 INCOMPATIBILITY. Theorem renames:
2930 meet_left_le ~> inf_le1
2931 meet_right_le ~> inf_le2
2932 join_left_le ~> sup_ge1
2933 join_right_le ~> sup_ge2
2934 meet_join_le ~> inf_sup_ord
2937 le_meet ~> le_inf_iff
2938 le_join ~> ge_sup_conv
2939 meet_idempotent ~> inf_idem
2940 join_idempotent ~> sup_idem
2941 meet_comm ~> inf_commute
2942 join_comm ~> sup_commute
2943 meet_leI1 ~> le_infI1
2944 meet_leI2 ~> le_infI2
2945 le_joinI1 ~> le_supI1
2946 le_joinI2 ~> le_supI2
2947 meet_assoc ~> inf_assoc
2948 join_assoc ~> sup_assoc
2949 meet_left_comm ~> inf_left_commute
2950 meet_left_idempotent ~> inf_left_idem
2951 join_left_comm ~> sup_left_commute
2952 join_left_idempotent ~> sup_left_idem
2955 le_def_meet ~> le_iff_inf
2956 le_def_join ~> le_iff_sup
2957 join_absorp2 ~> sup_absorb2
2958 join_absorp1 ~> sup_absorb1
2959 meet_absorp1 ~> inf_absorb1
2960 meet_absorp2 ~> inf_absorb2
2961 meet_join_absorp ~> inf_sup_absorb
2962 join_meet_absorp ~> sup_inf_absorb
2963 distrib_join_le ~> distrib_sup_le
2964 distrib_meet_le ~> distrib_inf_le
2966 add_meet_distrib_left ~> add_inf_distrib_left
2967 add_join_distrib_left ~> add_sup_distrib_left
2968 is_join_neg_meet ~> is_join_neg_inf
2969 is_meet_neg_join ~> is_meet_neg_sup
2970 add_meet_distrib_right ~> add_inf_distrib_right
2971 add_join_distrib_right ~> add_sup_distrib_right
2972 add_meet_join_distribs ~> add_sup_inf_distribs
2973 join_eq_neg_meet ~> sup_eq_neg_inf
2974 meet_eq_neg_join ~> inf_eq_neg_sup
2975 add_eq_meet_join ~> add_eq_inf_sup
2976 meet_0_imp_0 ~> inf_0_imp_0
2977 join_0_imp_0 ~> sup_0_imp_0
2978 meet_0_eq_0 ~> inf_0_eq_0
2979 join_0_eq_0 ~> sup_0_eq_0
2980 neg_meet_eq_join ~> neg_inf_eq_sup
2981 neg_join_eq_meet ~> neg_sup_eq_inf
2982 join_eq_if ~> sup_eq_if
2984 mono_meet ~> mono_inf
2985 mono_join ~> mono_sup
2986 meet_bool_eq ~> inf_bool_eq
2987 join_bool_eq ~> sup_bool_eq
2988 meet_fun_eq ~> inf_fun_eq
2989 join_fun_eq ~> sup_fun_eq
2990 meet_set_eq ~> inf_set_eq
2991 join_set_eq ~> sup_set_eq
2992 meet1_iff ~> inf1_iff
2993 meet2_iff ~> inf2_iff
3002 join1_iff ~> sup1_iff
3003 join2_iff ~> sup2_iff
3013 is_meet_Meet ~> is_meet_Inf
3014 Meet_bool_def ~> Inf_bool_def
3015 Meet_fun_def ~> Inf_fun_def
3016 Meet_greatest ~> Inf_greatest
3017 Meet_lower ~> Inf_lower
3018 Meet_set_def ~> Inf_set_def
3021 Sup_bool_eq ~> Sup_bool_def
3022 Sup_fun_eq ~> Sup_fun_def
3023 Sup_set_eq ~> Sup_set_def
3025 listsp_meetI ~> listsp_infI
3026 listsp_meet_eq ~> listsp_inf_eq
3031 * Added syntactic class "size"; overloaded constant "size" now has
3032 type "'a::size ==> bool"
3034 * Internal reorganisation of `size' of datatypes: size theorems
3035 "foo.size" are no longer subsumed by "foo.simps" (but are still
3036 simplification rules by default!); theorems "prod.size" now named
3039 * Class "div" now inherits from class "times" rather than "type".
3042 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
3043 Linorder etc. have disappeared; operations defined in terms of
3044 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
3046 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
3048 * HOL-Word: New extensive library and type for generic, fixed size
3049 machine words, with arithemtic, bit-wise, shifting and rotating
3050 operations, reflection into int, nat, and bool lists, automation for
3051 linear arithmetic (by automatic reflection into nat or int), including
3052 lemmas on overflow and monotonicity. Instantiated to all appropriate
3053 arithmetic type classes, supporting automatic simplification of
3054 numerals on all operations.
3056 * Library/Boolean_Algebra: locales for abstract boolean algebras.
3058 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
3060 * Code generator library theories:
3061 - Code_Integer represents HOL integers by big integer literals in target
3063 - Code_Char represents HOL characters by character literals in target
3065 - Code_Char_chr like Code_Char, but also offers treatment of character
3066 codes; includes Code_Integer.
3067 - Executable_Set allows to generate code for finite sets using lists.
3068 - Executable_Rat implements rational numbers as triples (sign, enumerator,
3070 - Executable_Real implements a subset of real numbers, namly those
3071 representable by rational numbers.
3072 - Efficient_Nat implements natural numbers by integers, which in general will
3073 result in higher efficency; pattern matching with 0/Suc is eliminated;
3074 includes Code_Integer.
3075 - Code_Index provides an additional datatype index which is mapped to
3076 target-language built-in integers.
3077 - Code_Message provides an additional datatype message_string which is isomorphic to
3078 strings; messages are mapped to target-language strings.
3080 * New package for inductive predicates
3082 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
3085 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3086 for z_1 :: U_1 and ... and z_n :: U_m
3088 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3091 with full support for type-inference, rather than
3093 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3095 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3096 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3098 inductive "s z_1 ... z_m"
3100 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3103 For backward compatibility, there is a wrapper allowing inductive
3104 sets to be defined with the new package via
3107 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3108 for z_1 :: U_1 and ... and z_n :: U_m
3110 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3116 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3117 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3118 for z_1 :: U_1 and ... and z_n :: U_m
3120 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3121 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3124 if the additional syntax "p ..." is required.
3126 Numerous examples can be found in the subdirectories src/HOL/Auth,
3127 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3131 - Since declaration and definition of inductive sets or predicates
3132 is no longer separated, abbreviations involving the newly
3133 introduced sets or predicates must be specified together with the
3134 introduction rules after the 'where' keyword (see above), rather
3135 than before the actual inductive definition.
3137 - The variables in induction and elimination rules are now
3138 quantified in the order of their occurrence in the introduction
3139 rules, rather than in alphabetical order. Since this may break
3140 some proofs, these proofs either have to be repaired, e.g. by
3141 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3142 statements of the form
3144 case (rule_i a_i_1 ... a_i_{k_i})
3146 or the old order of quantification has to be restored by explicitly adding
3147 meta-level quantifiers in the introduction rules, i.e.
3149 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3151 - The format of the elimination rules is now
3153 p z_1 ... z_m x_1 ... x_n ==>
3154 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3159 (x_1, ..., x_n) : s z_1 ... z_m ==>
3160 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3163 for sets rather than
3165 x : s z_1 ... z_m ==>
3166 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3169 This may require terms in goals to be expanded to n-tuples
3170 (e.g. using case_tac or simplification with the split_paired_all
3171 rule) before the above elimination rule is applicable.
3173 - The elimination or case analysis rules for (mutually) inductive
3174 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3175 list of rules "p_1_..._p_k.elims" is no longer available.
3177 * New package "function"/"fun" for general recursive functions,
3178 supporting mutual and nested recursion, definitions in local contexts,
3179 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3180 for small examples, and the separate tutorial on the function
3181 package. The old recdef "package" is still available as before, but
3182 users are encouraged to use the new package.
3184 * Method "lexicographic_order" automatically synthesizes termination
3185 relations as lexicographic combinations of size measures.
3187 * Case-expressions allow arbitrary constructor-patterns (including
3188 "_") and take their order into account, like in functional
3189 programming. Internally, this is translated into nested
3190 case-expressions; missing cases are added and mapped to the predefined
3191 constant "undefined". In complicated cases printing may no longer show
3192 the original input but the internal form. Lambda-abstractions allow
3193 the same form of pattern matching: "% pat1 => e1 | ..." is an
3194 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3197 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3198 is an abbreviation for "of_nat :: nat => int". The simplification
3199 rules for "of_nat" have been changed to work like "int" did
3200 previously. Potential INCOMPATIBILITY:
3201 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3202 - of_nat_diff and of_nat_mult are no longer default simp rules
3204 * Method "algebra" solves polynomial equations over (semi)rings using
3205 Groebner bases. The (semi)ring structure is defined by locales and the
3206 tool setup depends on that generic context. Installing the method for
3207 a specific type involves instantiating the locale and possibly adding
3208 declarations for computation on the coefficients. The method is
3209 already instantiated for natural numbers and for the axiomatic class
3210 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3211 CALCULEMUS 2007 for the general principles underlying this
3212 architecture of context-aware proof-tools.
3214 * Method "ferrack" implements quantifier elimination over
3215 special-purpose dense linear orders using locales (analogous to
3216 "algebra"). The method is already installed for class
3217 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3220 * Former constant "List.op @" now named "List.append". Use ML
3221 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3222 circumvent possible incompatibilities when working on ML level.
3224 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3226 * New function listsum :: 'a list => 'a for arbitrary monoids.
3227 Special syntax: "SUM x <- xs. f x" (and latex variants)
3229 * New syntax for Haskell-like list comprehension (input only), eg.
3230 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3232 * The special syntax for function "filter" has changed from [x :
3233 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3234 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3236 * [a..b] is now defined for arbitrary linear orders. It used to be
3237 defined on nat only, as an abbreviation for [a..<Suc b]
3240 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3242 * New functions "sorted" and "sort" in src/HOL/List.thy.
3244 * New lemma collection field_simps (an extension of ring_simps) for
3245 manipulating (in)equations involving division. Multiplies with all
3246 denominators that can be proved to be non-zero (in equations) or
3247 positive/negative (in inequations).
3249 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3250 have been improved and renamed to ring_simps, group_simps and
3251 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3252 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3254 * Theory Library/Commutative_Ring: switched from recdef to function
3255 package; constants add, mul, pow now curried. Infix syntax for
3256 algebraic operations.
3258 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3261 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3264 * HOL/records: generalised field-update to take a function on the
3265 field rather than the new value: r(|A := x|) is translated to A_update
3266 (K x) r The K-combinator that is internally used is called K_record.
3267 INCOMPATIBILITY: Usage of the plain update functions has to be
3270 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3271 * x = 0, which are required for a semiring. Richer structures do not
3272 inherit from semiring_0 anymore, because this property is a theorem
3273 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3274 there is more to prove, but this is mostly trivial.
3276 * Class "recpower" is generalized to arbitrary monoids, not just
3277 commutative semirings. INCOMPATIBILITY: may need to incorporate
3278 commutativity or semiring properties additionally.
3280 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3281 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3282 better use 'abbreviation'.
3284 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3286 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3287 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3288 significant changes for setting up numeral syntax for types:
3289 - New constants Numeral.pred and Numeral.succ instead
3290 of former Numeral.bin_pred and Numeral.bin_succ.
3291 - Use integer operations instead of bin_add, bin_mult and so on.
3292 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3293 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3295 See src/HOL/Integ/IntArith.thy for an example setup.
3297 * Command 'normal_form' computes the normal form of a term that may
3298 contain free variables. For example ``normal_form "rev [a, b, c]"''
3299 produces ``[b, c, a]'' (without proof). This command is suitable for
3300 heavy-duty computations because the functions are compiled to ML
3301 first. Correspondingly, a method "normalization" is provided. See
3302 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3304 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3305 25 like -->); output depends on the "iff" print_mode, the default is
3306 "A = B" (with priority 50).
3308 * Relations less (<) and less_eq (<=) are also available on type bool.
3309 Modified syntax to disallow nesting without explicit parentheses,
3310 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3313 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3315 * Relation composition operator "op O" now has precedence 75 and binds
3316 stronger than union and intersection. INCOMPATIBILITY.
3318 * The old set interval syntax "{m..n(}" (and relatives) has been
3319 removed. Use "{m..<n}" (and relatives) instead.
3321 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3322 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3323 ``declare [[simproc del: neq]]''.
3325 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3328 * Theorem Cons_eq_map_conv no longer declared as "simp".
3330 * Theorem setsum_mult renamed to setsum_right_distrib.
3332 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3335 * Reimplemented methods "sat" and "satx", with several improvements:
3336 goals no longer need to be stated as "<prems> ==> False", equivalences
3337 (i.e. "=" on type bool) are handled, variable names of the form
3338 "lit_<n>" are no longer reserved, significant speedup.
3340 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3341 zChaff is still supported as well.
3343 * 'inductive' and 'datatype': provide projections of mutual rules,
3344 bundled as foo_bar.inducts;
3346 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3349 * Library: moved theory Accessible_Part to main HOL.
3351 * Library: added theory Coinductive_List of potentially infinite lists
3352 as greatest fixed-point.
3354 * Library: added theory AssocList which implements (finite) maps as
3357 * Method "evaluation" solves goals (i.e. a boolean expression)
3358 efficiently by compiling it to ML. The goal is "proved" (via an
3359 oracle) if it evaluates to True.
3361 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3362 also when invoked by the simplifier. This results in the Simplifier
3363 being more powerful on arithmetic goals. INCOMPATIBILITY.
3364 Configuration option fast_arith_split_limit=0 recovers the old
3367 * Support for hex (0x20) and binary (0b1001) numerals.
3369 * New method: reify eqs (t), where eqs are equations for an
3370 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3371 parameter, computes a term s::'b and a list xs::'a list and proves the
3372 theorem I xs s = t. This is also known as reification or quoting. The
3373 resulting theorem is applied to the subgoal to substitute t with I xs
3374 s. If t is omitted, the subgoal itself is reified.
3376 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3377 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3378 where f is supposed to be a computable function (in the sense of code
3379 generattion). The method uses reify to compute s and xs as above then
3380 applies corr_thm and uses normalization by evaluation to "prove" f s =
3381 r and finally gets the theorem t = r, which is again applied to the
3382 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3384 * Reflection: Automatic reification now handels binding, an example is
3385 available in src/HOL/ex/ReflectionEx.thy
3387 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3388 command 'statespace' that is similar to 'record', but introduces an
3389 abstract specification based on the locale infrastructure instead of
3390 HOL types. This leads to extra flexibility in composing state spaces,
3391 in particular multiple inheritance and renaming of components.
3396 * Hyperreal: Functions root and sqrt are now defined on negative real
3397 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3398 Nonnegativity side conditions have been removed from many lemmas, so
3399 that more subgoals may now be solved by simplification; potential
3402 * Real: new type classes formalize real normed vector spaces and
3403 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3404 and norm :: 'a => real.
3406 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3407 reals into other types. The overloaded constant Reals :: 'a set is now
3408 defined as range of_real; potential INCOMPATIBILITY.
3410 * Real: proper support for ML code generation, including 'quickcheck'.
3411 Reals are implemented as arbitrary precision rationals.
3413 * Real: new development using Cauchy Sequences.
3415 * Hyperreal: Several constants that previously worked only for the
3416 reals have been generalized, so they now work over arbitrary vector
3417 spaces. Type annotations may need to be added in some cases; potential
3420 Infinitesimal :: ('a::real_normed_vector) star set
3421 HFinite :: ('a::real_normed_vector) star set
3422 HInfinite :: ('a::real_normed_vector) star set
3423 approx :: ('a::real_normed_vector) star => 'a star => bool
3424 monad :: ('a::real_normed_vector) star => 'a star set
3425 galaxy :: ('a::real_normed_vector) star => 'a star set
3426 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3427 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3428 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3429 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3430 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3431 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3432 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3433 sgn :: 'a::real_normed_vector => 'a
3434 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3436 * Complex: Some complex-specific constants are now abbreviations for
3437 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3438 hnorm. Other constants have been entirely removed in favor of the
3439 polymorphic versions (INCOMPATIBILITY):
3443 HInfinite <-- CInfinite
3444 Infinitesimal <-- CInfinitesimal
3447 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3448 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3449 (ns)deriv <-- (ns)cderiv
3454 * Formalisation of ideals and the quotient construction over rings.
3456 * Order and lattice theory no longer based on records.
3459 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3460 greatest_closed. INCOMPATIBILITY.
3462 * Method algebra is now set up via an attribute. For examples see
3463 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3464 of algebraic structures.
3466 * Renamed theory CRing to Ring.
3471 * Substantial, yet incomplete support for nominal datatypes (binding
3472 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3473 src/HOL/Nominal/Examples. Prospective users should consult
3474 http://isabelle.in.tum.de/nominal/
3479 * ML basics: just one true type int, which coincides with IntInf.int
3482 * ML within Isar: antiquotations allow to embed statically-checked
3483 formal entities in the source, referring to the context available at
3484 compile-time. For example:
3486 ML {* @{sort "{zero,one}"} *}
3487 ML {* @{typ "'a => 'b"} *}
3488 ML {* @{term "%x. x"} *}
3489 ML {* @{prop "x == y"} *}
3490 ML {* @{ctyp "'a => 'b"} *}
3491 ML {* @{cterm "%x. x"} *}
3492 ML {* @{cprop "x == y"} *}
3493 ML {* @{thm asm_rl} *}
3494 ML {* @{thms asm_rl} *}
3495 ML {* @{type_name c} *}
3496 ML {* @{type_syntax c} *}
3497 ML {* @{const_name c} *}
3498 ML {* @{const_syntax c} *}
3501 ML {* @{theory Pure} *}
3502 ML {* @{theory_ref} *}
3503 ML {* @{theory_ref Pure} *}
3506 ML {* @{clasimpset} *}
3508 The same works for sources being ``used'' within an Isar context.
3510 * ML in Isar: improved error reporting; extra verbosity with
3511 ML_Context.trace enabled.
3513 * Pure/General/table.ML: the join operations now works via exceptions
3514 DUP/SAME instead of type option. This is simpler in simple cases, and
3515 admits slightly more efficient complex applications.
3517 * Pure: 'advanced' translation functions (parse_translation etc.) now
3518 use Context.generic instead of just theory.
3520 * Pure: datatype Context.generic joins theory/Proof.context and
3521 provides some facilities for code that works in either kind of
3522 context, notably GenericDataFun for uniform theory and proof data.
3524 * Pure: simplified internal attribute type, which is now always
3525 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3526 local (Proof.context) attributes have been discontinued, while
3527 minimizing code duplication. Thm.rule_attribute and
3528 Thm.declaration_attribute build canonical attributes; see also structure
3529 Context for further operations on Context.generic, notably
3530 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3531 declarations and definitions.
3533 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3534 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3535 init only required for impure data. INCOMPATIBILITY: empty really need
3536 to be empty (no dependencies on theory content!)
3538 * Pure/kernel: consts certification ignores sort constraints given in
3539 signature declarations. (This information is not relevant to the
3540 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3541 potential INCOMPATIBILITY.
3543 * Pure: axiomatic type classes are now purely definitional, with
3544 explicit proofs of class axioms and super class relations performed
3545 internally. See Pure/axclass.ML for the main internal interfaces --
3546 notably AxClass.define_class supercedes AxClass.add_axclass, and
3547 AxClass.axiomatize_class/classrel/arity supersede
3548 Sign.add_classes/classrel/arities.
3550 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3551 global/local versions on theory vs. Proof.context have been
3552 discontinued; Attrib.syntax and Method.syntax have been adapted
3553 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3554 attributes, methods, etc.
3556 * Pure: several functions of signature "... -> theory -> theory * ..."
3557 have been reoriented to "... -> theory -> ... * theory" in order to
3558 allow natural usage in combination with the ||>, ||>>, |-> and
3559 fold_map combinators.
3561 * Pure: official theorem names (closed derivations) and additional
3562 comments (tags) are now strictly separate. Name hints -- which are
3563 maintained as tags -- may be attached any time without affecting the
3566 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3567 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3568 achieve the old behaviour.
3570 * Pure: the "Goal" constant is now called "prop", supporting a
3571 slightly more general idea of ``protecting'' meta-level rule
3574 * Pure: Logic.(un)varify only works in a global context, which is now
3575 enforced instead of silently assumed. INCOMPATIBILITY, may use
3576 Logic.legacy_(un)varify as temporary workaround.
3578 * Pure: structure Name provides scalable operations for generating
3579 internal variable names, notably Name.variants etc. This replaces
3580 some popular functions from term.ML:
3582 Term.variant -> Name.variant
3583 Term.variantlist -> Name.variant_list
3584 Term.invent_names -> Name.invent_list
3586 Note that low-level renaming rarely occurs in new code -- operations
3587 from structure Variable are used instead (see below).
3589 * Pure: structure Variable provides fundamental operations for proper
3590 treatment of fixed/schematic variables in a context. For example,
3591 Variable.import introduces fixes for schematics of given facts and
3592 Variable.export reverses the effect (up to renaming) -- this replaces
3593 various freeze_thaw operations.
3595 * Pure: structure Goal provides simple interfaces for
3596 init/conclude/finish and tactical prove operations (replacing former
3597 Tactic.prove). Goal.prove is the canonical way to prove results
3598 within a given context; Goal.prove_global is a degraded version for
3599 theory level goals, including a global Drule.standard. Note that
3600 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3601 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3602 in a locale context).
3604 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3605 and type checking (Syntax.check_term etc.), with common combinations
3606 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3607 which are considered legacy and await removal.
3609 * Pure/Syntax: generic interfaces for type unchecking
3610 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3611 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3612 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3613 available for convenience, but refer to the very same operations using
3614 a mere theory instead of a full context.
3616 * Isar: simplified treatment of user-level errors, using exception
3617 ERROR of string uniformly. Function error now merely raises ERROR,
3618 without any side effect on output channels. The Isar toplevel takes
3619 care of proper display of ERROR exceptions. ML code may use plain
3620 handle/can/try; cat_error may be used to concatenate errors like this:
3622 ... handle ERROR msg => cat_error msg "..."
3624 Toplevel ML code (run directly or through the Isar toplevel) may be
3625 embedded into the Isar toplevel with exception display/debug like
3628 Isar.toplevel (fn () => ...)
3630 INCOMPATIBILITY, removed special transform_error facilities, removed
3631 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3632 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3633 -- use plain ERROR instead.
3635 * Isar: theory setup now has type (theory -> theory), instead of a
3636 list. INCOMPATIBILITY, may use #> to compose setup functions.
3638 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3639 ProofContext.debug/verbose flags.
3641 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3642 theory before entering a proof state. Transactions now always see a
3643 quasi-functional intermediate checkpoint, both in interactive and
3646 * Isar: simplified interfaces for outer syntax. Renamed
3647 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3648 OuterSyntax.add_parsers -- this functionality is now included in
3649 OuterSyntax.command etc. INCOMPATIBILITY.
3651 * Simplifier: the simpset of a running simplification process now
3652 contains a proof context (cf. Simplifier.the_context), which is the
3653 very context that the initial simpset has been retrieved from (by
3654 simpset_of/local_simpset_of). Consequently, all plug-in components
3655 (solver, looper etc.) may depend on arbitrary proof data.
3657 * Simplifier.inherit_context inherits the proof context (plus the
3658 local bounds) of the current simplification process; any simproc
3659 etc. that calls the Simplifier recursively should do this! Removed
3660 former Simplifier.inherit_bounds, which is already included here --
3661 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3662 specify an explicit context using Simplifier.context/theory_context.
3664 * Simplifier/Classical Reasoner: more abstract interfaces
3665 change_simpset/claset for modifying the simpset/claset reference of a
3666 theory; raw versions simpset/claset_ref etc. have been discontinued --
3669 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3675 * settings: the default heap location within ISABELLE_HOME_USER now
3676 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3677 Isabelle installations.
3679 * isabelle-process: option -S (secure mode) disables some critical
3680 operations, notably runtime compilation and evaluation of ML source
3683 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3685 * Support for parallel execution, using native multicore support of
3686 Poly/ML 5.1. The theory loader exploits parallelism when processing
3687 independent theories, according to the given theory header
3688 specifications. The maximum number of worker threads is specified via
3689 usedir option -M or the "max-threads" setting in Proof General. A
3690 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3691 to 6 on a 8-core machine. User-code needs to observe certain
3692 guidelines for thread-safe programming, see appendix A in the Isar
3693 Implementation manual.
3697 New in Isabelle2005 (October 2005)
3698 ----------------------------------
3702 * Theory headers: the new header syntax for Isar theories is
3705 imports <theory1> ... <theoryN>
3706 uses <file1> ... <fileM>
3709 where the 'uses' part is optional. The previous syntax
3711 theory <name> = <theory1> + ... + <theoryN>:
3713 will disappear in the next release. Use isatool fixheaders to convert
3714 existing theory files. Note that there is no change in ancient
3715 non-Isar theories now, but these will disappear soon.
3717 * Theory loader: parent theories can now also be referred to via
3718 relative and absolute paths.
3720 * Command 'find_theorems' searches for a list of criteria instead of a
3721 list of constants. Known criteria are: intro, elim, dest, name:string,
3722 simp:term, and any term. Criteria can be preceded by '-' to select
3723 theorems that do not match. Intro, elim, dest select theorems that
3724 match the current goal, name:s selects theorems whose fully qualified
3725 name contain s, and simp:term selects all simplification rules whose
3726 lhs match term. Any other term is interpreted as pattern and selects
3727 all theorems matching the pattern. Available in ProofGeneral under
3728 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3730 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3732 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3733 matching the current goal as introduction rule and not having "HOL."
3734 in their name (i.e. not being defined in theory HOL).
3736 * Command 'thms_containing' has been discontinued in favour of
3737 'find_theorems'; INCOMPATIBILITY.
3739 * Communication with Proof General is now 8bit clean, which means that
3740 Unicode text in UTF-8 encoding may be used within theory texts (both
3741 formal and informal parts). Cf. option -U of the Isabelle Proof
3742 General interface. Here are some simple examples (cf. src/HOL/ex):
3744 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3745 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3747 * Improved efficiency of the Simplifier and, to a lesser degree, the
3748 Classical Reasoner. Typical big applications run around 2 times
3752 *** Document preparation ***
3754 * Commands 'display_drafts' and 'print_drafts' perform simple output
3755 of raw sources. Only those symbols that do not require additional
3756 LaTeX packages (depending on comments in isabellesym.sty) are
3757 displayed properly, everything else is left verbatim. isatool display
3758 and isatool print are used as front ends (these are subject to the
3759 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3761 * Command tags control specific markup of certain regions of text,
3762 notably folding and hiding. Predefined tags include "theory" (for
3763 theory begin and end), "proof" for proof commands, and "ML" for
3764 commands involving ML code; the additional tags "visible" and
3765 "invisible" are unused by default. Users may give explicit tag
3766 specifications in the text, e.g. ''by %invisible (auto)''. The
3767 interpretation of tags is determined by the LaTeX job during document
3768 preparation: see option -V of isatool usedir, or options -n and -t of
3769 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3772 Several document versions may be produced at the same time via isatool
3773 usedir (the generated index.html will link all of them). Typical
3774 specifications include ''-V document=theory,proof,ML'' to present
3775 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3776 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3777 these parts without any formal replacement text. The Isabelle site
3778 default settings produce ''document'' and ''outline'' versions as
3781 * Several new antiquotations:
3783 @{term_type term} prints a term with its type annotated;
3785 @{typeof term} prints the type of a term;
3787 @{const const} is the same as @{term const}, but checks that the
3788 argument is a known logical constant;
3790 @{term_style style term} and @{thm_style style thm} print a term or
3791 theorem applying a "style" to it
3795 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3796 definitions, equations, inequations etc., 'concl' printing only the
3797 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3798 to print the specified premise. TermStyle.add_style provides an ML
3799 interface for introducing further styles. See also the "LaTeX Sugar"
3800 document practical applications. The ML antiquotation prints
3801 type-checked ML expressions verbatim.
3803 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3804 and 'text' support optional locale specification '(in loc)', which
3805 specifies the default context for interpreting antiquotations. For
3806 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3808 * Option 'locale=NAME' of antiquotations specifies an alternative
3809 context interpreting the subsequent argument. For example: @{thm
3810 [locale=lattice] inf_assoc}.
3812 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3815 * Proper output of antiquotations for theory commands involving a
3816 proof context (such as 'locale' or 'theorem (in loc) ...').
3818 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3819 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3821 * isatool usedir: new option -C (default true) controls whether option
3822 -D should include a copy of the original document directory; -C false
3823 prevents unwanted effects such as copying of administrative CVS data.
3828 * Considerably improved version of 'constdefs' command. Now performs
3829 automatic type-inference of declared constants; additional support for
3830 local structure declarations (cf. locales and HOL records), see also
3831 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3832 sequential dependencies of definitions within a single 'constdefs'
3833 section; moreover, the declared name needs to be an identifier. If
3834 all fails, consider to fall back on 'consts' and 'defs' separately.
3836 * Improved indexed syntax and implicit structures. First of all,
3837 indexed syntax provides a notational device for subscripted
3838 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3839 expressions. Secondly, in a local context with structure
3840 declarations, number indexes \<^sub>n or the empty index (default
3841 number 1) refer to a certain fixed variable implicitly; option
3842 show_structs controls printing of implicit structures. Typical
3843 applications of these concepts involve record types and locales.
3845 * New command 'no_syntax' removes grammar declarations (and
3846 translations) resulting from the given syntax specification, which is
3847 interpreted in the same manner as for the 'syntax' command.
3849 * 'Advanced' translation functions (parse_translation etc.) may depend
3850 on the signature of the theory context being presently used for
3851 parsing/printing, see also isar-ref manual.
3853 * Improved 'oracle' command provides a type-safe interface to turn an
3854 ML expression of type theory -> T -> term into a primitive rule of
3855 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3856 is already included here); see also FOL/ex/IffExample.thy;
3859 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3860 before); "cI" is no longer bound, use "c.intro" instead.
3861 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3862 axclasses vs. locales.
3864 * Improved internal renaming of symbolic identifiers -- attach primes
3865 instead of base 26 numbers.
3867 * New flag show_question_marks controls printing of leading question
3868 marks in schematic variable names.
3870 * In schematic variable names, *any* symbol following \<^isub> or
3871 \<^isup> is now treated as part of the base name. For example, the
3872 following works without printing of awkward ".0" indexes:
3874 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3877 * Inner syntax includes (*(*nested*) comments*).
3879 * Pretty printer now supports unbreakable blocks, specified in mixfix
3880 annotations as "(00...)".
3882 * Clear separation of logical types and nonterminals, where the latter
3883 may only occur in 'syntax' specifications or type abbreviations.
3884 Before that distinction was only partially implemented via type class
3885 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3886 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3887 exotic syntax specifications may require further adaption
3888 (e.g. Cube/Cube.thy).
3890 * Removed obsolete type class "logic", use the top sort {} instead.
3891 Note that non-logical types should be declared as 'nonterminals'
3892 rather than 'types'. INCOMPATIBILITY for new object-logic
3895 * Attributes 'induct' and 'cases': type or set names may now be
3896 locally fixed variables as well.
3898 * Simplifier: can now control the depth to which conditional rewriting
3899 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3902 * Simplifier: simplification procedures may now take the current
3903 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3904 interface), which is very useful for calling the Simplifier
3905 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3906 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3907 low-level mk_simproc no longer applies Logic.varify internally, to
3908 allow for use in a context of fixed variables.
3910 * thin_tac now works even if the assumption being deleted contains !!
3911 or ==>. More generally, erule now works even if the major premise of
3912 the elimination rule contains !! or ==>.
3914 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3916 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3917 from Pure, which contains all common declarations already. Both
3918 theories are defined via plain Isabelle/Isar .thy files.
3919 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3920 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3921 use isatool fixcpure to adapt your theory and ML sources.
3923 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3924 selections of theorems in named facts via index ranges.
3926 * 'print_theorems': in theory mode, really print the difference
3927 wrt. the last state (works for interactive theory development only),
3928 in proof mode print all local facts (cf. 'print_facts');
3930 * 'hide': option '(open)' hides only base names.
3932 * More efficient treatment of intermediate checkpoints in interactive
3935 * Code generator is now invoked via code_module (incremental code
3936 generation) and code_library (modular code generation, ML structures
3937 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3938 must be quoted when used as identifiers.
3940 * New 'value' command for reading, evaluating and printing terms using
3941 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3942 quoted when used as identifier.
3947 * New commands for the interpretation of locale expressions in
3948 theories (1), locales (2) and proof contexts (3). These generate
3949 proof obligations from the expression specification. After the
3950 obligations have been discharged, theorems of the expression are added
3951 to the theory, target locale or proof context. The synopsis of the
3952 commands is a follows:
3954 (1) interpretation expr inst
3955 (2) interpretation target < expr
3956 (3) interpret expr inst
3958 Interpretation in theories and proof contexts require a parameter
3959 instantiation of terms from the current context. This is applied to
3960 specifications and theorems of the interpreted expression.
3961 Interpretation in locales only permits parameter renaming through the
3962 locale expression. Interpretation is smart in that interpretations
3963 that are active already do not occur in proof obligations, neither are
3964 instantiated theorems stored in duplicate. Use 'print_interps' to
3965 inspect active interpretations of a particular locale. For details,
3966 see the Isar Reference manual. Examples can be found in
3967 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3969 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3970 'interpret' instead.
3972 * New context element 'constrains' for adding type constraints to
3975 * Context expressions: renaming of parameters with syntax
3978 * Locale declaration: 'includes' disallowed.
3980 * Proper static binding of attribute syntax -- i.e. types / terms /
3981 facts mentioned as arguments are always those of the locale definition
3982 context, independently of the context of later invocations. Moreover,
3983 locale operations (renaming and type / term instantiation) are applied
3984 to attribute arguments as expected.
3986 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3987 actual attributes; rare situations may require Attrib.attribute to
3988 embed those attributes into Attrib.src that lack concrete syntax.
3989 Attribute implementations need to cooperate properly with the static
3990 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3991 Attrib.XXX_thm etc. already do the right thing without further
3992 intervention. Only unusual applications -- such as "where" or "of"
3993 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3994 on the context and the facts involved -- may have to assign parsed
3995 values to argument tokens explicitly.
3997 * Changed parameter management in theorem generation for long goal
3998 statements with 'includes'. INCOMPATIBILITY: produces a different
3999 theorem statement in rare situations.
4001 * Locale inspection command 'print_locale' omits notes elements. Use
4002 'print_locale!' to have them included in the output.
4007 * Provers/hypsubst.ML: improved version of the subst method, for
4008 single-step rewriting: it now works in bound variable contexts. New is
4009 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
4010 rewrite a different subterm than the original subst method, which is
4011 still available as 'simplesubst'.
4013 * Provers/quasi.ML: new transitivity reasoners for transitivity only
4016 * Provers/trancl.ML: new transitivity reasoner for transitive and
4017 reflexive-transitive closure of relations.
4019 * Provers/blast.ML: new reference depth_limit to make blast's depth
4020 limit (previously hard-coded with a value of 20) user-definable.
4022 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
4023 is peformed already. Object-logics merely need to finish their
4024 initial simpset configuration as before. INCOMPATIBILITY.
4029 * Symbolic syntax of Hilbert Choice Operator is now as follows:
4032 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
4034 The symbol \<some> is displayed as the alternative epsilon of LaTeX
4035 and x-symbol; use option '-m epsilon' to get it actually printed.
4036 Moreover, the mathematically important symbolic identifier \<epsilon>
4037 becomes available as variable, constant etc. INCOMPATIBILITY,
4039 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
4040 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
4041 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
4042 support corresponding Isar calculations.
4044 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
4047 * theory SetInterval: changed the syntax for open intervals:
4056 The old syntax is still supported but will disappear in the next
4057 release. For conversion use the following Emacs search and replace
4058 patterns (these are not perfect but work quite well):
4060 {)\([^\.]*\)\.\. -> {\1<\.\.}
4061 \.\.\([^(}]*\)(} -> \.\.<\1}
4063 * Theory Commutative_Ring (in Library): method comm_ring for proving
4064 equalities in commutative rings; method 'algebra' provides a generic
4067 * Theory Finite_Set: changed the syntax for 'setsum', summation over
4068 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
4069 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
4072 Some new syntax forms are available:
4074 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
4075 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
4076 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
4077 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
4079 The latter form "\<Sum>x < k. e" used to be based on a separate
4080 function "Summation", which has been discontinued.
4082 * theory Finite_Set: in structured induction proofs, the insert case
4083 is now 'case (insert x F)' instead of the old counterintuitive 'case
4086 * The 'refute' command has been extended to support a much larger
4087 fragment of HOL, including axiomatic type classes, constdefs and
4088 typedefs, inductive datatypes and recursion.
4090 * New tactics 'sat' and 'satx' to prove propositional tautologies.
4091 Requires zChaff with proof generation to be installed. See
4092 HOL/ex/SAT_Examples.thy for examples.
4094 * Datatype induction via method 'induct' now preserves the name of the
4095 induction variable. For example, when proving P(xs::'a list) by
4096 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
4097 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
4098 in unstructured proof scripts.
4100 * Reworked implementation of records. Improved scalability for
4101 records with many fields, avoiding performance problems for type
4102 inference. Records are no longer composed of nested field types, but
4103 of nested extension types. Therefore the record type only grows linear
4104 in the number of extensions and not in the number of fields. The
4105 top-level (users) view on records is preserved. Potential
4106 INCOMPATIBILITY only in strange cases, where the theory depends on the
4107 old record representation. The type generated for a record is called
4108 <record_name>_ext_type.
4110 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4111 proofs triggered by a record definition or a simproc (if
4112 quick_and_dirty is enabled). Definitions of large records can take
4115 New simproc record_upd_simproc for simplification of multiple record
4116 updates enabled by default. Moreover, trivial updates are also
4117 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4118 occasionally, since simplification is more powerful by default.
4120 * typedef: proper support for polymorphic sets, which contain extra
4121 type-variables in the term.
4123 * Simplifier: automatically reasons about transitivity chains
4124 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4125 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4126 old proofs break occasionally as simplification may now solve more
4127 goals than previously.
4129 * Simplifier: converts x <= y into x = y if assumption y <= x is
4130 present. Works for all partial orders (class "order"), in particular
4131 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4134 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4135 bound variable or a constant then the let is unfolded. Otherwise
4136 first a is simplified to b, and then f b is simplified to g. If
4137 possible we abstract b from g arriving at "let x = b in h x",
4138 otherwise we unfold the let and arrive at g. The simproc can be
4139 enabled/disabled by the reference use_let_simproc. Potential
4140 INCOMPATIBILITY since simplification is more powerful by default.
4142 * Classical reasoning: the meson method now accepts theorems as arguments.
4144 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4145 jobs to provide advice on the provability of subgoals.
4147 * Theory OrderedGroup and Ring_and_Field: various additions and
4148 improvements to faciliate calculations involving equalities and
4151 The following theorems have been eliminated or modified
4154 abs_eq now named abs_of_nonneg
4155 abs_of_ge_0 now named abs_of_nonneg
4156 abs_minus_eq now named abs_of_nonpos
4157 imp_abs_id now named abs_of_nonneg
4158 imp_abs_neg_id now named abs_of_nonpos
4159 mult_pos now named mult_pos_pos
4160 mult_pos_le now named mult_nonneg_nonneg
4161 mult_pos_neg_le now named mult_nonneg_nonpos
4162 mult_pos_neg2_le now named mult_nonneg_nonpos2
4163 mult_neg now named mult_neg_neg
4164 mult_neg_le now named mult_nonpos_nonpos
4166 * The following lemmas in Ring_and_Field have been added to the simplifier:
4169 not_square_less_zero
4171 The following lemmas have been deleted from Real/RealPow:
4181 * Theory Parity: added rules for simplifying exponents.
4185 The following theorems have been eliminated or modified
4188 list_all_Nil now named list_all.simps(1)
4189 list_all_Cons now named list_all.simps(2)
4190 list_all_conv now named list_all_iff
4191 set_mem_eq now named mem_iff
4193 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4194 asymptotic "big O" calculations. See the notes in BigO.thy.
4199 * Theory RealDef: better support for embedding natural numbers and
4200 integers in the reals.
4202 The following theorems have been eliminated or modified
4205 exp_ge_add_one_self now requires no hypotheses
4206 real_of_int_add reversed direction of equality (use [symmetric])
4207 real_of_int_minus reversed direction of equality (use [symmetric])
4208 real_of_int_diff reversed direction of equality (use [symmetric])
4209 real_of_int_mult reversed direction of equality (use [symmetric])
4211 * Theory RComplete: expanded support for floor and ceiling functions.
4213 * Theory Ln is new, with properties of the natural logarithm
4215 * Hyperreal: There is a new type constructor "star" for making
4216 nonstandard types. The old type names are now type synonyms:
4220 hcomplex = complex star
4222 * Hyperreal: Many groups of similarly-defined constants have been
4223 replaced by polymorphic versions (INCOMPATIBILITY):
4225 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4227 starset <-- starsetNat, starsetC
4228 *s* <-- *sNat*, *sc*
4229 starset_n <-- starsetNat_n, starsetC_n
4230 *sn* <-- *sNatn*, *scn*
4231 InternalSets <-- InternalNatSets, InternalCSets
4233 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4234 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4235 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4236 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4237 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4239 * Hyperreal: Many type-specific theorems have been removed in favor of
4240 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4242 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4243 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4244 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4245 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4246 right_minus <-- hypreal_add_minus
4247 left_minus <-- {hypreal,hcomplex}_add_minus_left
4248 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4249 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4250 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4251 mult_1_right <-- hcomplex_mult_one_right
4252 mult_zero_left <-- hcomplex_mult_zero_left
4253 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4254 right_distrib <-- hypnat_add_mult_distrib2
4255 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4256 right_inverse <-- hypreal_mult_inverse
4257 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4258 order_refl <-- {hypreal,hypnat}_le_refl
4259 order_trans <-- {hypreal,hypnat}_le_trans
4260 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4261 order_less_le <-- {hypreal,hypnat}_less_le
4262 linorder_linear <-- {hypreal,hypnat}_le_linear
4263 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4264 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4265 add_nonneg_nonneg <-- hypreal_le_add_order
4267 * Hyperreal: Separate theorems having to do with type-specific
4268 versions of constants have been merged into theorems that apply to the
4269 new polymorphic constants (INCOMPATIBILITY):
4271 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4272 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4273 STAR_Un <-- {STAR,NatStar,STARC}_Un
4274 STAR_Int <-- {STAR,NatStar,STARC}_Int
4275 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4276 STAR_subset <-- {STAR,NatStar,STARC}_subset
4277 STAR_mem <-- {STAR,NatStar,STARC}_mem
4278 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4279 STAR_diff <-- {STAR,STARC}_diff
4280 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4281 STARC_hcomplex_of_complex}_image_subset
4282 starset_n_Un <-- starset{Nat,C}_n_Un
4283 starset_n_Int <-- starset{Nat,C}_n_Int
4284 starset_n_Compl <-- starset{Nat,C}_n_Compl
4285 starset_n_diff <-- starset{Nat,C}_n_diff
4286 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4287 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4288 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4289 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4290 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4291 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4292 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4293 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4294 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4295 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4296 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4297 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4298 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4299 starfun_diff <-- starfun{C,RC,CR}_diff
4300 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4301 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4302 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4303 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4304 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4305 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4306 starfun_Id <-- starfunC_Id
4307 starfun_approx <-- starfun{Nat,CR}_approx
4308 starfun_capprox <-- starfun{C,RC}_capprox
4309 starfun_abs <-- starfunNat_rabs
4310 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4311 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4312 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4313 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4314 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4315 starfun_add_approx <-- starfunCR_add_approx
4316 starfun_inverse_inverse <-- starfunC_inverse_inverse
4317 starfun_divide <-- starfun{C,CR,RC}_divide
4318 starfun_n <-- starfun{Nat,C}_n
4319 starfun_n_mult <-- starfun{Nat,C}_n_mult
4320 starfun_n_add <-- starfun{Nat,C}_n_add
4321 starfun_n_add_minus <-- starfunNat_n_add_minus
4322 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4323 starfun_n_minus <-- starfun{Nat,C}_n_minus
4324 starfun_n_eq <-- starfun{Nat,C}_n_eq
4326 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4327 star_n_minus <-- {hypreal,hcomplex}_minus
4328 star_n_diff <-- {hypreal,hcomplex}_diff
4329 star_n_mult <-- {hypreal,hcomplex}_mult
4330 star_n_inverse <-- {hypreal,hcomplex}_inverse
4331 star_n_le <-- {hypreal,hypnat}_le
4332 star_n_less <-- {hypreal,hypnat}_less
4333 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4334 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4335 star_n_abs <-- hypreal_hrabs
4336 star_n_divide <-- hcomplex_divide
4338 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4339 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4340 star_of_diff <-- hypreal_of_real_diff
4341 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4342 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4343 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4344 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4345 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4346 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4347 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4348 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4349 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4350 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4351 star_of_number_of <-- {hypreal,hcomplex}_number_of
4352 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4353 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4354 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4355 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4356 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4357 star_of_power <-- hypreal_of_real_power
4358 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4360 * Hyperreal: new method "transfer" that implements the transfer
4361 principle of nonstandard analysis. With a subgoal that mentions
4362 nonstandard types like "'a star", the command "apply transfer"
4363 replaces it with an equivalent one that mentions only standard types.
4364 To be successful, all free variables must have standard types; non-
4365 standard variables must have explicit universal quantifiers.
4367 * Hyperreal: A theory of Taylor series.
4372 * Discontinued special version of 'constdefs' (which used to support
4373 continuous functions) in favor of the general Pure one with full
4376 * New simplification procedure for solving continuity conditions; it
4377 is much faster on terms with many nested lambda abstractions (cubic
4378 instead of exponential time).
4380 * New syntax for domain package: selector names are now optional.
4381 Parentheses should be omitted unless argument is lazy, for example:
4383 domain 'a stream = cons "'a" (lazy "'a stream")
4385 * New command 'fixrec' for defining recursive functions with pattern
4386 matching; defining multiple functions with mutual recursion is also
4387 supported. Patterns may include the constants cpair, spair, up, sinl,
4388 sinr, or any data constructor defined by the domain package. The given
4389 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4390 syntax and examples.
4392 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4393 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4394 but the proof obligation additionally includes an admissibility
4395 requirement. The packages generate instances of class cpo or pcpo,
4396 with continuity and strictness theorems for Rep and Abs.
4398 * HOLCF: Many theorems have been renamed according to a more standard naming
4399 scheme (INCOMPATIBILITY):
4401 foo_inject: "foo$x = foo$y ==> x = y"
4402 foo_eq: "(foo$x = foo$y) = (x = y)"
4403 foo_less: "(foo$x << foo$y) = (x << y)"
4404 foo_strict: "foo$UU = UU"
4405 foo_defined: "... ==> foo$x ~= UU"
4406 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4411 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4412 including the First Isomorphism Theorem (on quotienting by the kernel
4415 * ZF/Simplifier: install second copy of type solver that actually
4416 makes use of TC rules declared to Isar proof contexts (or locales);
4417 the old version is still required for ML proof scripts.
4422 * Converted to Isar theory format; use locales instead of axiomatic
4428 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4431 * Pure/library.ML no longer defines its own option datatype, but uses
4432 that of the SML basis, which has constructors NONE and SOME instead of
4433 None and Some, as well as exception Option.Option instead of OPTION.
4434 The functions the, if_none, is_some, is_none have been adapted
4435 accordingly, while Option.map replaces apsome.
4437 * Pure/library.ML: the exception LIST has been given up in favour of
4438 the standard exceptions Empty and Subscript, as well as
4439 Library.UnequalLengths. Function like Library.hd and Library.tl are
4440 superceded by the standard hd and tl functions etc.
4442 A number of basic list functions are no longer exported to the ML
4443 toplevel, as they are variants of predefined functions. The following
4444 suggests how one can translate existing code:
4446 rev_append xs ys = List.revAppend (xs, ys)
4447 nth_elem (i, xs) = List.nth (xs, i)
4448 last_elem xs = List.last xs
4449 flat xss = List.concat xss
4450 seq fs = List.app fs
4451 partition P xs = List.partition P xs
4452 mapfilter f xs = List.mapPartial f xs
4454 * Pure/library.ML: several combinators for linear functional
4455 transformations, notably reverse application and composition:
4458 (x, y) |-> f f #-> g
4460 * Pure/library.ML: introduced/changed precedence of infix operators:
4462 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4464 infix 3 o oo ooo oooo;
4465 infix 4 ~~ upto downto;
4467 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4470 * Pure/library.ML: natural list combinators fold, fold_rev, and
4471 fold_map support linear functional transformations and nesting. For
4474 fold f [x1, ..., xN] y =
4475 y |> f x1 |> ... |> f xN
4477 (fold o fold) f [xs1, ..., xsN] y =
4478 y |> fold f xs1 |> ... |> fold f xsN
4480 fold f [x1, ..., xN] =
4483 (fold o fold) f [xs1, ..., xsN] =
4484 fold f xs1 #> ... #> fold f xsN
4486 * Pure/library.ML: the following selectors on type 'a option are
4489 the: 'a option -> 'a (*partial*)
4490 these: 'a option -> 'a where 'a = 'b list
4491 the_default: 'a -> 'a option -> 'a
4492 the_list: 'a option -> 'a list
4494 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4495 basic operations for association lists, following natural argument
4496 order; moreover the explicit equality predicate passed here avoids
4497 potentially expensive polymorphic runtime equality checks.
4498 The old functions may be expressed as follows:
4500 assoc = uncurry (AList.lookup (op =))
4501 assocs = these oo AList.lookup (op =)
4502 overwrite = uncurry (AList.update (op =)) o swap
4504 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4506 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4507 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4509 replacing make_keylist and keyfilter (occassionally used)
4512 make_keylist = AList.make
4513 keyfilter = AList.find (op =)
4515 * eq_fst and eq_snd now take explicit equality parameter, thus
4516 avoiding eqtypes. Naive rewrites:
4518 eq_fst = eq_fst (op =)
4519 eq_snd = eq_snd (op =)
4521 * Removed deprecated apl and apr (rarely used).
4524 apl (n, op) =>>= curry op n
4525 apr (op, m) =>>= fn n => op (n, m)
4527 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4528 provides a reasonably efficient light-weight implementation of sets as
4531 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4532 few new operations; existing lookup and update are now curried to
4533 follow natural argument order (for use with fold etc.);
4534 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4536 * Pure/General: output via the Isabelle channels of
4537 writeln/warning/error etc. is now passed through Output.output, with a
4538 hook for arbitrary transformations depending on the print_mode
4539 (cf. Output.add_mode -- the first active mode that provides a output
4540 function wins). Already formatted output may be embedded into further
4541 text via Output.raw; the result of Pretty.string_of/str_of and derived
4542 functions (string_of_term/cterm/thm etc.) is already marked raw to
4543 accommodate easy composition of diagnostic messages etc. Programmers
4544 rarely need to care about Output.output or Output.raw at all, with
4545 some notable exceptions: Output.output is required when bypassing the
4546 standard channels (writeln etc.), or in token translations to produce
4547 properly formatted results; Output.raw is required when capturing
4548 already output material that will eventually be presented to the user
4549 a second time. For the default print mode, both Output.output and
4550 Output.raw have no effect.
4552 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4553 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4554 cumulative results are displayed at the end of a batch session.
4556 * Pure/General: File.sysify_path and File.quote_sysify path have been
4557 replaced by File.platform_path and File.shell_path (with appropriate
4558 hooks). This provides a clean interface for unusual systems where the
4559 internal and external process view of file names are different.
4561 * Pure: more efficient orders for basic syntactic entities: added
4562 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4563 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4564 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4565 orders now -- potential INCOMPATIBILITY for code that depends on a
4566 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4567 Library.sort_strings on result).
4569 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4570 fold_types traverse types/terms from left to right, observing natural
4571 argument order. Supercedes previous foldl_XXX versions, add_frees,
4572 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4574 * Pure: name spaces have been refined, with significant changes of the
4575 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4576 to extern(_table). The plain name entry path is superceded by a
4577 general 'naming' context, which also includes the 'policy' to produce
4578 a fully qualified name and external accesses of a fully qualified
4579 name; NameSpace.extend is superceded by context dependent
4580 Sign.declare_name. Several theory and proof context operations modify
4581 the naming context. Especially note Theory.restore_naming and
4582 ProofContext.restore_naming to get back to a sane state; note that
4583 Theory.add_path is no longer sufficient to recover from
4584 Theory.absolute_path in particular.
4586 * Pure: new flags short_names (default false) and unique_names
4587 (default true) for controlling output of qualified names. If
4588 short_names is set, names are printed unqualified. If unique_names is
4589 reset, the name prefix is reduced to the minimum required to achieve
4590 the original result when interning again, even if there is an overlap
4591 with earlier declarations.
4593 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4594 now 'extend', and 'merge' gets an additional Pretty.pp argument
4595 (useful for printing error messages). INCOMPATIBILITY.
4597 * Pure: major reorganization of the theory context. Type Sign.sg and
4598 Theory.theory are now identified, referring to the universal
4599 Context.theory (see Pure/context.ML). Actual signature and theory
4600 content is managed as theory data. The old code and interfaces were
4601 spread over many files and structures; the new arrangement introduces
4602 considerable INCOMPATIBILITY to gain more clarity:
4604 Context -- theory management operations (name, identity, inclusion,
4605 parents, ancestors, merge, etc.), plus generic theory data;
4607 Sign -- logical signature and syntax operations (declaring consts,
4608 types, etc.), plus certify/read for common entities;
4610 Theory -- logical theory operations (stating axioms, definitions,
4611 oracles), plus a copy of logical signature operations (consts,
4612 types, etc.); also a few basic management operations (Theory.copy,
4615 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4616 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4617 for convenience -- they merely return the theory.
4619 * Pure: type Type.tsig is superceded by theory in most interfaces.
4621 * Pure: the Isar proof context type is already defined early in Pure
4622 as Context.proof (note that ProofContext.context and Proof.context are
4623 aliases, where the latter is the preferred name). This enables other
4624 Isabelle components to refer to that type even before Isar is present.
4626 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4627 typeK, constK, axiomK, oracleK), but provide explicit operations for
4628 any of these kinds. For example, Sign.intern typeK is now
4629 Sign.intern_type, Theory.hide_space Sign.typeK is now
4630 Theory.hide_types. Also note that former
4631 Theory.hide_classes/types/consts are now
4632 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4633 internalize their arguments! INCOMPATIBILITY.
4635 * Pure: get_thm interface (of PureThy and ProofContext) expects
4636 datatype thmref (with constructors Name and NameSelection) instead of
4637 plain string -- INCOMPATIBILITY;
4639 * Pure: cases produced by proof methods specify options, where NONE
4640 means to remove case bindings -- INCOMPATIBILITY in
4643 * Pure: the following operations retrieve axioms or theorems from a
4644 theory node or theory hierarchy, respectively:
4646 Theory.axioms_of: theory -> (string * term) list
4647 Theory.all_axioms_of: theory -> (string * term) list
4648 PureThy.thms_of: theory -> (string * thm) list
4649 PureThy.all_thms_of: theory -> (string * thm) list
4651 * Pure: print_tac now outputs the goal through the trace channel.
4653 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4654 Reference Toplevel.debug (default false) controls detailed printing
4655 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4656 controls execution profiling -- set to 1 for time and 2 for space
4657 (both increase the runtime).
4659 * Isar session: The initial use of ROOT.ML is now always timed,
4660 i.e. the log will show the actual process times, in contrast to the
4661 elapsed wall-clock time that the outer shell wrapper produces.
4663 * Simplifier: improved handling of bound variables (nameless
4664 representation, avoid allocating new strings). Simprocs that invoke
4665 the Simplifier recursively should use Simplifier.inherit_bounds to
4666 avoid local name clashes. Failure to do so produces warnings
4667 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4668 for further details.
4670 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4671 bindings for all theorems stored within a given theory; this may help
4672 in porting non-Isar theories to Isar ones, while keeping ML proof
4673 scripts for the time being.
4675 * ML operator HTML.with_charset specifies the charset begin used for
4676 generated HTML files. For example:
4678 HTML.with_charset "utf-8" use_thy "Hebrew";
4679 HTML.with_charset "utf-8" use_thy "Chinese";
4684 * Allow symlinks to all proper Isabelle executables (Isabelle,
4685 isabelle, isatool etc.).
4687 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4688 isatool doc, isatool mkdir, display_drafts etc.).
4690 * isatool usedir: option -f allows specification of the ML file to be
4691 used by Isabelle; default is ROOT.ML.
4693 * New isatool version outputs the version identifier of the Isabelle
4694 distribution being used.
4696 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4697 (containing Boolean satisfiability problems) into Isabelle/HOL
4702 New in Isabelle2004 (April 2004)
4703 --------------------------------
4707 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4708 Replaces linorder.ML.
4710 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4711 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4712 (\<a>...\<z>), are now considered normal letters, and can therefore
4713 be used anywhere where an ASCII letter (a...zA...Z) has until
4714 now. COMPATIBILITY: This obviously changes the parsing of some
4715 terms, especially where a symbol has been used as a binder, say
4716 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4717 as an identifier. Fix it by inserting a space around former
4718 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4719 existing theory and ML files.
4721 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4723 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4724 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4725 a normal (but invisible) letter. For multiple letter subscripts repeat
4726 \<^isub> like this: x\<^isub>1\<^isub>2.
4728 * Pure: There are now sub-/superscripts that can span more than one
4729 character. Text between \<^bsub> and \<^esub> is set in subscript in
4730 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4731 superscript. The new control characters are not identifier parts.
4733 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4734 content of "..." to the latex file instead of \isacntrl... . The "..."
4735 may consist of any printable characters excluding the end bracket >.
4737 * Pure: Using new Isar command "finalconsts" (or the ML functions
4738 Theory.add_finals or Theory.add_finals_i) it is now possible to
4739 declare constants "final", which prevents their being given a definition
4740 later. It is useful for constants whose behaviour is fixed axiomatically
4741 rather than definitionally, such as the meta-logic connectives.
4743 * Pure: 'instance' now handles general arities with general sorts
4744 (i.e. intersections of classes),
4746 * Presentation: generated HTML now uses a CSS style sheet to make layout
4747 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4748 It can be changed to alter the colors/layout of generated pages.
4753 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4754 cut_tac, subgoal_tac and thin_tac:
4755 - Now understand static (Isar) contexts. As a consequence, users of Isar
4756 locales are no longer forced to write Isar proof scripts.
4757 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4759 - INCOMPATIBILITY: names of variables to be instantiated may no
4760 longer be enclosed in quotes. Instead, precede variable name with `?'.
4761 This is consistent with the instantiation attribute "where".
4763 * Attributes "where" and "of":
4764 - Now take type variables of instantiated theorem into account when reading
4765 the instantiation string. This fixes a bug that caused instantiated
4766 theorems to have too special types in some circumstances.
4767 - "where" permits explicit instantiations of type variables.
4769 * Calculation commands "moreover" and "also" no longer interfere with
4770 current facts ("this"), admitting arbitrary combinations with "then"
4774 - Goal statements involving the context element "includes" no longer
4775 generate theorems with internal delta predicates (those ending on
4776 "_axioms") in the premise.
4777 Resolve particular premise with <locale>.intro to obtain old form.
4778 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4779 specification and "includes" elements in goal statement.
4780 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4781 [intro?] and [elim?] (respectively) by default.
4782 - Experimental command for instantiation of locales in proof contexts:
4783 instantiate <label>[<attrs>]: <loc>
4784 Instantiates locale <loc> and adds all its theorems to the current context
4785 taking into account their attributes. Label and attrs are optional
4786 modifiers, like in theorem declarations. If present, names of
4787 instantiated theorems are qualified with <label>, and the attributes
4788 <attrs> are applied after any attributes these theorems might have already.
4789 If the locale has assumptions, a chained fact of the form
4790 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4791 are derived. The command does not support old-style locales declared
4792 with "locale (open)".
4793 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4795 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4801 * Proof import: new image HOL4 contains the imported library from
4802 the HOL4 system with about 2500 theorems. It is imported by
4803 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4804 can be used like any other Isabelle image. See
4805 HOL/Import/HOL/README for more information.
4808 - Much improved handling of linear and partial orders.
4809 Reasoners for linear and partial orders are set up for type classes
4810 "linorder" and "order" respectively, and are added to the default simpset
4811 as solvers. This means that the simplifier can build transitivity chains
4812 to solve goals from the assumptions.
4813 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4814 of blast or auto after simplification become unnecessary because the goal
4815 is solved by simplification already.
4817 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4818 all proved in axiomatic type classes for semirings, rings and fields.
4821 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4822 now formalized using the Ring_and_Field theory mentioned above.
4823 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4824 than before, because now they are set up once in a generic manner.
4825 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4826 Look for the general versions in Ring_and_Field (and Power if they concern
4829 * Type "rat" of the rational numbers is now available in HOL-Complex.
4832 - Record types are now by default printed with their type abbreviation
4833 instead of the list of all field types. This can be configured via
4834 the reference "print_record_type_abbr".
4835 - Simproc "record_upd_simproc" for simplification of multiple updates added
4836 (not enabled by default).
4837 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4838 EX x. x = sel r to True (not enabled by default).
4839 - Tactic "record_split_simp_tac" to split and simplify records added.
4841 * 'specification' command added, allowing for definition by
4842 specification. There is also an 'ax_specification' command that
4843 introduces the new constants axiomatically.
4845 * arith(_tac) is now able to generate counterexamples for reals as well.
4847 * HOL-Algebra: new locale "ring" for non-commutative rings.
4849 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4850 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4852 * HOL-Matrix: a first theory for matrices in HOL with an application of
4853 matrix theory to linear programming.
4855 * Unions and Intersections:
4856 The latex output syntax of UN and INT has been changed
4857 from "\Union x \in A. B" to "\Union_{x \in A} B"
4858 i.e. the index formulae has become a subscript.
4859 Similarly for "\Union x. B", and for \Inter instead of \Union.
4861 * Unions and Intersections over Intervals:
4862 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4863 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4864 like in normal math, and corresponding versions for < and for intersection.
4866 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4867 lexicographic dictonary ordering has been added as "lexord".
4869 * ML: the legacy theory structures Int and List have been removed. They had
4870 conflicted with ML Basis Library structures having the same names.
4872 * 'refute' command added to search for (finite) countermodels. Only works
4873 for a fragment of HOL. The installation of an external SAT solver is
4874 highly recommended. See "HOL/Refute.thy" for details.
4876 * 'quickcheck' command: Allows to find counterexamples by evaluating
4877 formulae under an assignment of free variables to random values.
4878 In contrast to 'refute', it can deal with inductive datatypes,
4879 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4885 * Streams now come with concatenation and are part of the HOLCF image
4889 New in Isabelle2003 (May 2003)
4890 ------------------------------
4894 * Provers/simplifier:
4896 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4897 Assumptions are now subject to complete mutual simplification,
4898 not just from left to right. The simplifier now preserves
4899 the order of assumptions.
4901 Potential INCOMPATIBILITY:
4903 -- simp sometimes diverges where the old version did
4904 not, e.g. invoking simp on the goal
4906 [| P (f x); y = x; f x = f y |] ==> Q
4908 now gives rise to the infinite reduction sequence
4910 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4912 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4915 -- Tactics combining classical reasoner and simplification (such as auto)
4916 are also affected by this change, because many of them rely on
4917 simp. They may sometimes diverge as well or yield a different numbers
4918 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4919 in case of problems. Sometimes subsequent calls to the classical
4920 reasoner will fail because a preceeding call to the simplifier too
4921 eagerly simplified the goal, e.g. deleted redundant premises.
4923 - The simplifier trace now shows the names of the applied rewrite rules
4925 - You can limit the number of recursive invocations of the simplifier
4926 during conditional rewriting (where the simplifie tries to solve the
4927 conditions before applying the rewrite rule):
4928 ML "simp_depth_limit := n"
4929 where n is an integer. Thus you can force termination where previously
4930 the simplifier would diverge.
4932 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4934 - No longer aborts on failed congruence proof. Instead, the
4935 congruence is ignored.
4937 * Pure: New generic framework for extracting programs from constructive
4938 proofs. See HOL/Extraction.thy for an example instantiation, as well
4939 as HOL/Extraction for some case studies.
4941 * Pure: The main goal of the proof state is no longer shown by default, only
4942 the subgoals. This behaviour is controlled by a new flag.
4943 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4944 (ML: Proof.show_main_goal).
4946 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4947 rules whose conclusion matches subgoal 1:
4948 PG menu: Isabelle/Isar -> Show me -> matching rules
4949 The rules are ordered by how closely they match the subgoal.
4950 In particular, rules that solve a subgoal outright are displayed first
4951 (or rather last, the way they are printed).
4952 (ML: ProofGeneral.print_intros())
4954 * Pure: New flag trace_unify_fail causes unification to print
4955 diagnostic information (PG: in trace buffer) when it fails. This is
4956 useful for figuring out why single step proofs like rule, erule or
4959 * Pure: Locale specifications now produce predicate definitions
4960 according to the body of text (covering assumptions modulo local
4961 definitions); predicate "loc_axioms" covers newly introduced text,
4962 while "loc" is cumulative wrt. all included locale expressions; the
4963 latter view is presented only on export into the global theory
4964 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4965 on the old view without predicates;
4967 * Pure: predefined locales "var" and "struct" are useful for sharing
4968 parameters (as in CASL, for example); just specify something like
4969 ``var x + var y + struct M'' as import;
4971 * Pure: improved thms_containing: proper indexing of facts instead of
4972 raw theorems; check validity of results wrt. current name space;
4973 include local facts of proof configuration (also covers active
4974 locales), cover fixed variables in index; may use "_" in term
4975 specification; an optional limit for the number of printed facts may
4976 be given (the default is 40);
4978 * Pure: disallow duplicate fact bindings within new-style theory files
4981 * Provers: improved induct method: assumptions introduced by case
4982 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4983 the goal statement); "foo" still refers to all facts collectively;
4985 * Provers: the function blast.overloaded has been removed: all constants
4986 are regarded as potentially overloaded, which improves robustness in exchange
4987 for slight decrease in efficiency;
4989 * Provers/linorder: New generic prover for transitivity reasoning over
4990 linear orders. Note: this prover is not efficient!
4992 * Isar: preview of problems to finish 'show' now produce an error
4993 rather than just a warning (in interactive mode);
5000 - Produces a counter example if it cannot prove a goal.
5001 Note that the counter example may be spurious if the goal is not a formula
5002 of quantifier-free linear arithmetic.
5003 In ProofGeneral the counter example appears in the trace buffer.
5005 - Knows about div k and mod k where k is a numeral of type nat or int.
5007 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
5008 linear arithmetic fails. This takes account of quantifiers and divisibility.
5009 Presburger arithmetic can also be called explicitly via presburger(_tac).
5011 * simp's arithmetic capabilities have been enhanced a bit: it now
5012 takes ~= in premises into account (by performing a case split);
5014 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
5015 are distributed over a sum of terms;
5017 * New tactic "trans_tac" and method "trans" instantiate
5018 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
5021 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
5022 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
5024 * 'typedef' command has new option "open" to suppress the set
5027 * functions Min and Max on finite sets have been introduced (theory
5030 * attribute [symmetric] now works for relations as well; it turns
5031 (x,y) : R^-1 into (y,x) : R, and vice versa;
5033 * induct over a !!-quantified statement (say !!x1..xn):
5034 each "case" automatically performs "fix x1 .. xn" with exactly those names.
5036 * Map: `empty' is no longer a constant but a syntactic abbreviation for
5037 %x. None. Warning: empty_def now refers to the previously hidden definition
5040 * Algebra: formalization of classical algebra. Intended as base for
5041 any algebraic development in Isabelle. Currently covers group theory
5042 (up to Sylow's theorem) and ring theory (Universal Property of
5043 Univariate Polynomials). Contributions welcome;
5045 * GroupTheory: deleted, since its material has been moved to Algebra;
5047 * Complex: new directory of the complex numbers with numeric constants,
5048 nonstandard complex numbers, and some complex analysis, standard and
5049 nonstandard (Jacques Fleuriot);
5051 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
5053 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
5056 * Real/HahnBanach: updated and adapted to locales;
5058 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
5061 * UNITY: added the Meier-Sanders theory of progress sets;
5063 * MicroJava: bytecode verifier and lightweight bytecode verifier
5064 as abstract algorithms, instantiated to the JVM;
5066 * Bali: Java source language formalization. Type system, operational
5067 semantics, axiomatic semantics. Supported language features:
5068 classes, interfaces, objects,virtual methods, static methods,
5069 static/instance fields, arrays, access modifiers, definite
5070 assignment, exceptions.
5075 * ZF/Constructible: consistency proof for AC (Gdel's constructible
5078 * Main ZF: virtually all theories converted to new-style format;
5083 * Pure: Tactic.prove provides sane interface for internal proofs;
5084 omits the infamous "standard" operation, so this is more appropriate
5085 than prove_goalw_cterm in many situations (e.g. in simprocs);
5087 * Pure: improved error reporting of simprocs;
5089 * Provers: Simplifier.simproc(_i) provides sane interface for setting
5093 *** Document preparation ***
5095 * uses \par instead of \\ for line breaks in theory text. This may
5096 shift some page breaks in large documents. To get the old behaviour
5097 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
5099 * minimized dependencies of isabelle.sty and isabellesym.sty on
5102 * \<euro> now needs package babel/greek instead of marvosym (which
5105 * normal size for \<zero>...\<nine> (uses \mathbf instead of
5110 New in Isabelle2002 (March 2002)
5111 --------------------------------
5113 *** Document preparation ***
5115 * greatly simplified document preparation setup, including more
5116 graceful interpretation of isatool usedir -i/-d/-D options, and more
5117 instructive isatool mkdir; users should basically be able to get
5118 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5119 users may run a separate document processing stage manually like this:
5120 "isatool usedir -D output HOL Test && isatool document Test/output";
5122 * theory dependency graph may now be incorporated into documents;
5123 isatool usedir -g true will produce session_graph.eps/.pdf for use
5124 with \includegraphics of LaTeX;
5126 * proper spacing of consecutive markup elements, especially text
5127 blocks after section headings;
5129 * support bold style (for single symbols only), input syntax is like
5130 this: "\<^bold>\<alpha>" or "\<^bold>A";
5132 * \<bullet> is now output as bold \cdot by default, which looks much
5133 better in printed text;
5135 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5136 note that these symbols are currently unavailable in Proof General /
5137 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5139 * isatool latex no longer depends on changed TEXINPUTS, instead
5140 isatool document copies the Isabelle style files to the target
5146 * Pure/Provers: improved proof by cases and induction;
5147 - 'case' command admits impromptu naming of parameters (such as
5149 - 'induct' method divinates rule instantiation from the inductive
5150 claim; no longer requires excessive ?P bindings for proper
5151 instantiation of cases;
5152 - 'induct' method properly enumerates all possibilities of set/type
5153 rules; as a consequence facts may be also passed through *type*
5154 rules without further ado;
5155 - 'induct' method now derives symbolic cases from the *rulified*
5156 rule (before it used to rulify cases stemming from the internal
5157 atomized version); this means that the context of a non-atomic
5158 statement becomes is included in the hypothesis, avoiding the
5159 slightly cumbersome show "PROP ?case" form;
5160 - 'induct' may now use elim-style induction rules without chaining
5161 facts, using ``missing'' premises from the goal state; this allows
5162 rules stemming from inductive sets to be applied in unstructured
5163 scripts, while still benefitting from proper handling of non-atomic
5164 statements; NB: major inductive premises need to be put first, all
5165 the rest of the goal is passed through the induction;
5166 - 'induct' proper support for mutual induction involving non-atomic
5167 rule statements (uses the new concept of simultaneous goals, see
5169 - append all possible rule selections, but only use the first
5170 success (no backtracking);
5171 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5172 - undeclared rule case names default to numbers 1, 2, 3, ...;
5173 - added 'print_induct_rules' (covered by help item in recent Proof
5175 - moved induct/cases attributes to Pure, methods to Provers;
5176 - generic method setup instantiated for FOL and HOL;
5178 * Pure: support multiple simultaneous goal statements, for example
5179 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5180 meta-level mechanism, this acts as if several individual goals had
5181 been stated separately; in particular common proof methods need to be
5182 repeated in order to cover all claims; note that a single elimination
5183 step is *not* sufficient to establish the two conjunctions, so this
5186 assume "A & B" then have A and B .. (*".." fails*)
5188 better use "obtain" in situations as above; alternative refer to
5189 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5191 * Pure: proper integration with ``locales''; unlike the original
5192 version by Florian Kammller, Isar locales package high-level proof
5193 contexts rather than raw logical ones (e.g. we admit to include
5194 attributes everywhere); operations on locales include merge and
5195 rename; support for implicit arguments (``structures''); simultaneous
5196 type-inference over imports and text; see also HOL/ex/Locales.thy for
5199 * Pure: the following commands have been ``localized'', supporting a
5200 target locale specification "(in name)": 'lemma', 'theorem',
5201 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5202 stored both within the locale and at the theory level (exported and
5203 qualified by the locale name);
5205 * Pure: theory goals may now be specified in ``long'' form, with
5206 ad-hoc contexts consisting of arbitrary locale elements. for example
5207 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5208 definitions may be given, too); the result is a meta-level rule with
5209 the context elements being discharged in the obvious way;
5211 * Pure: new proof command 'using' allows to augment currently used
5212 facts after a goal statement ('using' is syntactically analogous to
5213 'apply', but acts on the goal's facts only); this allows chained facts
5214 to be separated into parts given before and after a claim, as in
5215 ``from a and b have C using d and e <proof>'';
5217 * Pure: renamed "antecedent" case to "rule_context";
5219 * Pure: new 'judgment' command records explicit information about the
5220 object-logic embedding (used by several tools internally); no longer
5221 use hard-wired "Trueprop";
5223 * Pure: added 'corollary' command;
5225 * Pure: fixed 'token_translation' command;
5227 * Pure: removed obsolete 'exported' attribute;
5229 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5230 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5231 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5233 * Pure: method 'atomize' presents local goal premises as object-level
5234 statements (atomic meta-level propositions); setup controlled via
5235 rewrite rules declarations of 'atomize' attribute; example
5236 application: 'induct' method with proper rule statements in improper
5239 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5240 now consider the syntactic context of assumptions, giving a better
5241 chance to get type-inference of the arguments right (this is
5242 especially important for locales);
5244 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5247 * Pure/obtain: the formal conclusion "thesis", being marked as
5248 ``internal'', may no longer be reference directly in the text;
5249 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5252 * Pure: generic 'sym' attribute which declares a rule both as pure
5253 'elim?' and for the 'symmetric' operation;
5255 * Pure: marginal comments ``--'' may now occur just anywhere in the
5256 text; the fixed correlation with particular command syntax has been
5259 * Pure: new method 'rules' is particularly well-suited for proof
5260 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5261 but often produces more compact proof terms with less detours;
5263 * Pure/Provers/classical: simplified integration with pure rule
5264 attributes and methods; the classical "intro?/elim?/dest?"
5265 declarations coincide with the pure ones; the "rule" method no longer
5266 includes classically swapped intros; "intro" and "elim" methods no
5267 longer pick rules from the context; also got rid of ML declarations
5268 AddXIs/AddXEs/AddXDs; all of this has some potential for
5271 * Provers/classical: attribute 'swapped' produces classical inversions
5272 of introduction rules;
5274 * Provers/simplifier: 'simplified' attribute may refer to explicit
5275 rules instead of full simplifier context; 'iff' attribute handles
5278 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5280 * HOL: 'recdef' now fails on unfinished automated proofs, use
5281 "(permissive)" option to recover old behavior;
5283 * HOL: 'inductive' no longer features separate (collective) attributes
5284 for 'intros' (was found too confusing);
5286 * HOL: properly declared induction rules less_induct and
5292 * HOL: moved over to sane numeral syntax; the new policy is as
5295 - 0 and 1 are polymorphic constants, which are defined on any
5296 numeric type (nat, int, real etc.);
5298 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5299 binary representation internally;
5301 - type nat has special constructor Suc, and generally prefers Suc 0
5302 over 1::nat and Suc (Suc 0) over 2::nat;
5304 This change may cause significant problems of INCOMPATIBILITY; here
5305 are some hints on converting existing sources:
5307 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5308 entities, so expressions involving "-" (unary or binary minus) need
5309 to be spaced properly;
5311 - existing occurrences of "1" may need to be constraint "1::nat" or
5312 even replaced by Suc 0; similar for old "2";
5314 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5316 - remove all special provisions on numerals in proofs;
5318 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5319 representation (depends on bin_arith_simps in the default context);
5321 * HOL: symbolic syntax for x^2 (numeral 2);
5323 * HOL: the class of all HOL types is now called "type" rather than
5324 "term"; INCOMPATIBILITY, need to adapt references to this type class
5325 in axclass/classes, instance/arities, and (usually rare) occurrences
5326 in typings (of consts etc.); internally the class is called
5327 "HOL.type", ML programs should refer to HOLogic.typeS;
5329 * HOL/record package improvements:
5330 - new derived operations "fields" to build a partial record section,
5331 "extend" to promote a fixed record to a record scheme, and
5332 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5333 declared as simp by default;
5334 - shared operations ("more", "fields", etc.) now need to be always
5335 qualified) --- potential INCOMPATIBILITY;
5336 - removed "make_scheme" operations (use "make" with "extend") --
5338 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5339 - provides cases/induct rules for use with corresponding Isar
5340 methods (for concrete records, record schemes, concrete more
5341 parts, and schematic more parts -- in that order);
5342 - internal definitions directly based on a light-weight abstract
5343 theory of product types over typedef rather than datatype;
5345 * HOL: generic code generator for generating executable ML code from
5346 specifications; specific support for HOL constructs such as inductive
5347 datatypes and sets, as well as recursive functions; can be invoked
5348 via 'generate_code' theory section;
5350 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5352 * HOL: consolidated and renamed several theories. In particular:
5353 Ord.thy has been absorbed into HOL.thy
5354 String.thy has been absorbed into List.thy
5356 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5357 (beware of argument permutation!);
5359 * HOL: linorder_less_split superseded by linorder_cases;
5361 * HOL/List: "nodups" renamed to "distinct";
5363 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5364 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5365 - Ex_def has changed, now need to use some_eq_ex
5367 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5368 in this (rare) case use:
5370 delSWrapper "split_all_tac"
5371 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5373 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5376 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5377 Isabelle's type classes, ^ on functions and relations has too general
5378 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5379 necessary to attach explicit type constraints;
5381 * HOL/Relation: the prefix name of the infix "O" has been changed from
5382 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5383 renamed accordingly (eg "compI" -> "rel_compI").
5385 * HOL: syntax translations now work properly with numerals and records
5388 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5389 of "lam" -- INCOMPATIBILITY;
5391 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5392 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5393 renamed "Product_Type.unit";
5395 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5397 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5398 the "cases" method);
5400 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5403 * HOL/IMP: updated and converted to new-style theory format; several
5404 parts turned into readable document, with proper Isar proof texts and
5405 some explanations (by Gerwin Klein);
5407 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5409 * HOL-Hyperreal is now a logic image;
5414 * Isar: consts/constdefs supports mixfix syntax for continuous
5417 * Isar: domain package adapted to new-style theory format, e.g. see
5420 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5421 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5422 lift.induct_tac, always use UU instead of Undef;
5424 * HOLCF/IMP: updated and converted to new-style theory;
5429 * Isar: proper integration of logic-specific tools and packages,
5430 including theory commands '(co)inductive', '(co)datatype',
5431 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5432 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5434 * theory Main no longer includes AC; for the Axiom of Choice, base
5435 your theory on Main_ZFC;
5437 * the integer library now covers quotients and remainders, with many
5438 laws relating division to addition, multiplication, etc.;
5440 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5441 typeless version of the formalism;
5443 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5446 * ZF/Induct: new directory for examples of inductive definitions,
5447 including theory Multiset for multiset orderings; converted to
5448 new-style theory format;
5450 * ZF: many new theorems about lists, ordinals, etc.;
5455 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5456 variable proof controls level of detail: 0 = no proofs (only oracle
5457 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5458 also ref manual for further ML interfaces;
5460 * Pure/axclass: removed obsolete ML interface
5461 goal_subclass/goal_arity;
5463 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5464 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5465 separate tokens, so expressions involving minus need to be spaced
5468 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5469 rather than "infixl" or "infixr";
5471 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5472 sort constraint specifications in type inference; e.g. "x::_::foo"
5473 ensures that the type of "x" is of sort "foo" (but not necessarily a
5476 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5477 control output of nested => (types); the default behavior is
5480 * Pure/syntax: builtin parse translation for "_constify" turns valued
5481 tokens into AST constants;
5483 * Pure/syntax: prefer later declarations of translations and print
5484 translation functions; potential INCOMPATIBILITY: need to reverse
5485 multiple declarations for same syntax element constant;
5487 * Pure/show_hyps reset by default (in accordance to existing Isar
5490 * Provers/classical: renamed addaltern to addafter, addSaltern to
5493 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5496 * system: tested support for MacOS X; should be able to get Isabelle +
5497 Proof General to work in a plain Terminal after installing Poly/ML
5498 (e.g. from the Isabelle distribution area) and GNU bash alone
5499 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5500 support requires further installations, e.g. from
5501 http://fink.sourceforge.net/);
5503 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5505 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5506 of 40 MB), cf. ML_OPTIONS;
5508 * system: Proof General keywords specification is now part of the
5509 Isabelle distribution (see etc/isar-keywords.el);
5511 * system: support for persistent Proof General sessions (refrain from
5512 outdating all loaded theories on startup); user may create writable
5513 logic images like this: ``isabelle -q HOL Test'';
5515 * system: smart selection of Isabelle process versus Isabelle
5516 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5517 run both "isabelle" and "Isabelle" even if file names are badly
5518 damaged (executable inspects the case of the first letter of its own
5519 name); added separate "isabelle-process" and "isabelle-interface";
5521 * system: refrain from any attempt at filtering input streams; no
5522 longer support ``8bit'' encoding of old isabelle font, instead proper
5523 iso-latin characters may now be used; the related isatools
5524 "symbolinput" and "nonascii" have disappeared as well;
5526 * system: removed old "xterm" interface (the print modes "xterm" and
5527 "xterm_color" are still available for direct use in a suitable
5532 New in Isabelle99-2 (February 2001)
5533 -----------------------------------
5535 *** Overview of INCOMPATIBILITIES ***
5537 * HOL: please note that theories in the Library and elsewhere often use the
5538 new-style (Isar) format; to refer to their theorems in an ML script you must
5539 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5541 * HOL: inductive package no longer splits induction rule aggressively,
5542 but only as far as specified by the introductions given; the old
5543 format may be recovered via ML function complete_split_rule or attribute
5544 'split_rule (complete)';
5546 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5547 gfp_Tarski to gfp_unfold;
5549 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5551 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5552 relation); infix "^^" has been renamed "``"; infix "``" has been
5553 renamed "`"; "univalent" has been renamed "single_valued";
5555 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5558 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5560 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5562 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5563 consequence, it is no longer monotonic wrt. the local goal context
5564 (which is now passed through the inductive cases);
5566 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5567 \<gg> to \<ggreater>;
5570 *** Document preparation ***
5572 * \isabellestyle{NAME} selects version of Isabelle output (currently
5573 available: are "it" for near math-mode best-style output, "sl" for
5574 slanted text style, and "tt" for plain type-writer; if no
5575 \isabellestyle command is given, output is according to slanted
5578 * support sub/super scripts (for single symbols only), input syntax is
5579 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5581 * some more standard symbols; see Appendix A of the system manual for
5582 the complete list of symbols defined in isabellesym.sty;
5584 * improved isabelle style files; more abstract symbol implementation
5585 (should now use \isamath{...} and \isatext{...} in custom symbol
5588 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5589 state; Note that presentation of goal states does not conform to
5590 actual human-readable proof documents. Please do not include goal
5591 states into document output unless you really know what you are doing!
5593 * proper indentation of antiquoted output with proportional LaTeX
5596 * no_document ML operator temporarily disables LaTeX document
5599 * isatool unsymbolize tunes sources for plain ASCII communication;
5604 * Pure: Isar now suffers initial goal statements to contain unbound
5605 schematic variables (this does not conform to actual readable proof
5606 documents, due to unpredictable outcome and non-compositional proof
5607 checking); users who know what they are doing may use schematic goals
5608 for Prolog-style synthesis of proven results;
5610 * Pure: assumption method (an implicit finishing) now handles actual
5613 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5614 initial goal, declare "that" only as Pure intro (only for single
5615 steps); the "that" rule assumption may now be involved in implicit
5616 finishing, thus ".." becomes a feasible for trivial obtains;
5618 * Pure: default proof step now includes 'intro_classes'; thus trivial
5619 instance proofs may be performed by "..";
5621 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5624 * Pure: more robust selection of calculational rules;
5626 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5627 rule (as well as the assumption rule);
5629 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5630 lemmas, using the graph browser tool;
5632 * Pure: predict failure of "show" in interactive mode;
5634 * Pure: 'thms_containing' now takes actual terms as arguments;
5636 * HOL: improved method 'induct' --- now handles non-atomic goals
5637 (potential INCOMPATIBILITY); tuned error handling;
5639 * HOL: cases and induct rules now provide explicit hints about the
5640 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5641 any remaining facts are inserted into the goal verbatim;
5643 * HOL: local contexts (aka cases) may now contain term bindings as
5644 well; the 'cases' and 'induct' methods new provide a ?case binding for
5645 the result to be shown in each case;
5647 * HOL: added 'recdef_tc' command;
5649 * isatool convert assists in eliminating legacy ML scripts;
5654 * HOL/Library: a collection of generic theories to be used together
5655 with main HOL; the theory loader path already includes this directory
5656 by default; the following existing theories have been moved here:
5657 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5658 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5660 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5661 modelling and verification task performed in Isabelle/HOL +
5662 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5664 * HOL/Algebra: special summation operator SUM no longer exists, it has
5665 been replaced by setsum; infix 'assoc' now has priority 50 (like
5666 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5667 'domain', this makes the theory consistent with mathematical
5670 * HOL basics: added overloaded operations "inverse" and "divide"
5671 (infix "/"), syntax for generic "abs" operation, generic summation
5674 * HOL/typedef: simplified package, provide more useful rules (see also
5677 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5678 now expressed as a proper nested rule (old-style tactic scripts may
5679 require atomize_strip_tac to cope with non-atomic premises);
5681 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5682 to "split_conv" (old name still available for compatibility);
5684 * HOL: improved concrete syntax for strings (e.g. allows translation
5685 rules with string literals);
5687 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5688 and Fleuriot's mechanization of analysis, including the transcendental
5689 functions for the reals;
5691 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5696 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5697 "lam" is displayed as TWO lambda-symbols
5699 * CTT: theory Main now available, containing everything (that is, Bool
5705 * Pure: the Simplifier has been implemented properly as a derived rule
5706 outside of the actual kernel (at last!); the overall performance
5707 penalty in practical applications is about 50%, while reliability of
5708 the Isabelle inference kernel has been greatly improved;
5710 * print modes "brackets" and "no_brackets" control output of nested =>
5711 (types) and ==> (props); the default behaviour is "brackets";
5713 * Provers: fast_tac (and friends) now handle actual object-logic rules
5714 as assumptions as well;
5716 * system: support Poly/ML 4.0;
5718 * system: isatool install handles KDE version 1 or 2;
5722 New in Isabelle99-1 (October 2000)
5723 ----------------------------------
5725 *** Overview of INCOMPATIBILITIES ***
5727 * HOL: simplification of natural numbers is much changed; to partly
5728 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5729 issue the following ML commands:
5731 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5732 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5734 * HOL: simplification no longer dives into case-expressions; this is
5735 controlled by "t.weak_case_cong" for each datatype t;
5737 * HOL: nat_less_induct renamed to less_induct;
5739 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5740 fixsome to patch .thy and .ML sources automatically;
5742 select_equality -> some_equality
5743 select_eq_Ex -> some_eq_ex
5744 selectI2EX -> someI2_ex
5747 select1_equality -> some1_equality
5748 Eps_sym_eq -> some_sym_eq_trivial
5749 Eps_eq -> some_eq_trivial
5751 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5753 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5756 * HOL: the recursion equations generated by 'recdef' are now called
5757 f.simps instead of f.rules;
5759 * HOL: qed_spec_mp now also handles bounded ALL as well;
5761 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5762 sometimes be needed;
5764 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5766 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5768 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5769 product is now "<*>" instead of "Times"; the lexicographic product is
5770 now "<*lex*>" instead of "**";
5772 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5773 of main HOL, but was unused); better use HOL's datatype package;
5775 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5776 the old syntax may be recovered as follows:
5779 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5780 (infixl "\\<oplus>" 100)
5782 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5784 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5785 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5788 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5789 changed from A/r to A//r;
5791 * ZF: new treatment of arithmetic (nat & int) may break some old
5794 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5795 rulify -> rule_format, elimify -> elim_format, ...);
5797 * Isar/Provers: intro/elim/dest attributes changed; renamed
5798 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5799 should have to change intro!! to intro? only); replaced "delrule" by
5802 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5804 * Provers: strengthened force_tac by using new first_best_tac;
5806 * LaTeX document preparation: several changes of isabelle.sty (see
5810 *** Document preparation ***
5812 * formal comments (text blocks etc.) in new-style theories may now
5813 contain antiquotations of thm/prop/term/typ/text to be presented
5814 according to latex print mode; concrete syntax is like this:
5815 @{term[show_types] "f(x) = a + x"};
5817 * isatool mkdir provides easy setup of Isabelle session directories,
5818 including proper document sources;
5820 * generated LaTeX sources are now deleted after successful run
5821 (isatool document -c); may retain a copy somewhere else via -D option
5824 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5825 style files, achieving self-contained LaTeX sources and simplifying
5828 * old-style theories now produce (crude) LaTeX output as well;
5830 * browser info session directories are now self-contained (may be put
5831 on WWW server seperately); improved graphs of nested sessions; removed
5832 graph for 'all sessions';
5834 * several improvements in isabelle style files; \isabellestyle{it}
5835 produces fake math mode output; \isamarkupheader is now \section by
5836 default; see lib/texinputs/isabelle.sty etc.;
5841 * Isar/Pure: local results and corresponding term bindings are now
5842 subject to Hindley-Milner polymorphism (similar to ML); this
5843 accommodates incremental type-inference very nicely;
5845 * Isar/Pure: new derived language element 'obtain' supports
5846 generalized existence reasoning;
5848 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5849 support accumulation of results, without applying any rules yet;
5850 useful to collect intermediate results without explicit name
5851 references, and for use with transitivity rules with more than 2
5854 * Isar/Pure: scalable support for case-analysis type proofs: new
5855 'case' language element refers to local contexts symbolically, as
5856 produced by certain proof methods; internally, case names are attached
5857 to theorems as "tags";
5859 * Isar/Pure: theory command 'hide' removes declarations from
5860 class/type/const name spaces;
5862 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5863 indicate potential overloading;
5865 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5867 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5868 "{a,b,c}" instead of {a,b,c};
5870 * Isar/Pure now provides its own version of intro/elim/dest
5871 attributes; useful for building new logics, but beware of confusion
5872 with the version in Provers/classical;
5874 * Isar/Pure: the local context of (non-atomic) goals is provided via
5875 case name 'antecedent';
5877 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5878 to the current context is now done automatically);
5880 * Isar/Pure: theory command 'method_setup' provides a simple interface
5881 for definining proof methods in ML;
5883 * Isar/Provers: intro/elim/dest attributes changed; renamed
5884 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5885 most cases, one should have to change intro!! to intro? only);
5886 replaced "delrule" by "rule del";
5888 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5889 'symmetric' attribute (the latter supercedes [RS sym]);
5891 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5892 method modifier); 'simp' method: 'only:' modifier removes loopers as
5893 well (including splits);
5895 * Isar/Provers: Simplifier and Classical methods now support all kind
5896 of modifiers used in the past, including 'cong', 'iff', etc.
5898 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5899 of Simplifier and Classical reasoner);
5901 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5902 now support named cases; major packages (inductive, datatype, primrec,
5903 recdef) support case names and properly name parameters;
5905 * Isar/HOL: new transitivity rules for substitution in inequalities --
5906 monotonicity conditions are extracted to be proven at end of
5909 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5912 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5913 split_if split_if_asm; datatype package provides theorems foo.splits =
5914 foo.split foo.split_asm for each datatype;
5916 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5917 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5918 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5919 use "(cases (simplified))" method in proper proof texts);
5921 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5923 * Isar: names of theorems etc. may be natural numbers as well;
5925 * Isar: 'pr' command: optional arguments for goals_limit and
5926 ProofContext.prems_limit; no longer prints theory contexts, but only
5929 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5930 additional print modes to be specified; e.g. "pr(latex)" will print
5931 proof state according to the Isabelle LaTeX style;
5933 * Isar: improved support for emulating tactic scripts, including proof
5934 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5935 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5936 (for HOL datatypes);
5938 * Isar: simplified (more robust) goal selection of proof methods: 1st
5939 goal, all goals, or explicit goal specifier (tactic emulation); thus
5940 'proof method scripts' have to be in depth-first order;
5942 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5944 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5945 should instead use individual commands for printing items
5946 (print_commands, print_methods etc.);
5948 * Isar: added 'nothing' --- the empty list of theorems;
5953 * HOL/MicroJava: formalization of a fragment of Java, together with a
5954 corresponding virtual machine and a specification of its bytecode
5955 verifier and a lightweight bytecode verifier, including proofs of
5956 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5957 Cornelia Pusch (see also the homepage of project Bali at
5958 http://isabelle.in.tum.de/Bali/);
5960 * HOL/Algebra: new theory of rings and univariate polynomials, by
5963 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5964 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5967 * HOL/Lattice: fundamental concepts of lattice theory and order
5968 structures, including duals, properties of bounds versus algebraic
5969 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5970 Theorem for complete lattices etc.; may also serve as a demonstration
5971 for abstract algebraic reasoning using axiomatic type classes, and
5972 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5974 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5977 * HOL/IMPP: extension of IMP with local variables and mutually
5978 recursive procedures, by David von Oheimb;
5980 * HOL/Lambda: converted into new-style theory and document;
5982 * HOL/ex/Multiquote: example of multiple nested quotations and
5983 anti-quotations -- basically a generalized version of de-Bruijn
5984 representation; very useful in avoiding lifting of operations;
5986 * HOL/record: added general record equality rule to simpset; fixed
5987 select-update simplification procedure to handle extended records as
5988 well; admit "r" as field name;
5990 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5991 other numeric types and also as the identity of groups, rings, etc.;
5993 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5994 Types nat and int belong to this axclass;
5996 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5997 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5998 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5999 two terms #m*u and #n*u are replaced by #(m+n)*u
6000 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
6001 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
6002 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
6004 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
6005 powerful prover for predicate logic but knows nothing of clasets; see
6006 ex/mesontest.ML and ex/mesontest2.ML for example applications;
6008 * HOL: new version of "case_tac" subsumes both boolean case split and
6009 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
6010 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
6012 * HOL: simplification no longer dives into case-expressions: only the
6013 selector expression is simplified, but not the remaining arms; to
6014 enable full simplification of case-expressions for datatype t, you may
6015 remove t.weak_case_cong from the simpset, either globally (Delcongs
6016 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
6018 * HOL/recdef: the recursion equations generated by 'recdef' for
6019 function 'f' are now called f.simps instead of f.rules; if all
6020 termination conditions are proved automatically, these simplification
6021 rules are added to the simpset, as in primrec; rules may be named
6022 individually as well, resulting in a separate list of theorems for
6025 * HOL/While is a new theory that provides a while-combinator. It
6026 permits the definition of tail-recursive functions without the
6027 provision of a termination measure. The latter is necessary once the
6028 invariant proof rule for while is applied.
6030 * HOL: new (overloaded) notation for the set of elements below/above
6031 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
6033 * HOL: theorems impI, allI, ballI bound as "strip";
6035 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
6036 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
6037 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
6039 * HOL/Real: "rabs" replaced by overloaded "abs" function;
6041 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
6042 main HOL, but was unused);
6044 * HOL: fewer consts declared as global (e.g. have to refer to
6045 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
6047 * HOL: tuned AST representation of nested pairs, avoiding bogus output
6048 in case of overlap with user translations (e.g. judgements over
6049 tuples); (note that the underlying logical represenation is still
6055 * ZF: simplification automatically cancels common terms in arithmetic
6056 expressions over nat and int;
6058 * ZF: new treatment of nat to minimize type-checking: all operators
6059 coerce their operands to a natural number using the function natify,
6060 making the algebraic laws unconditional;
6062 * ZF: as above, for int: operators coerce their operands to an integer
6063 using the function intify;
6065 * ZF: the integer library now contains many of the usual laws for the
6066 orderings, including $<=, and monotonicity laws for $+ and $*;
6068 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
6071 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
6072 to the simplifier and classical reasoner simultaneously;
6077 * Provers: blast_tac now handles actual object-logic rules as
6078 assumptions; note that auto_tac uses blast_tac internally as well;
6080 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
6081 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
6083 * Provers: delrules now handles destruct rules as well (no longer need
6084 explicit make_elim);
6086 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
6087 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6088 use instead the strong form,
6089 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
6090 in HOL, FOL and ZF the function cla_make_elim will create such rules
6091 from destruct-rules;
6093 * Provers: Simplifier.easy_setup provides a fast path to basic
6094 Simplifier setup for new object-logics;
6096 * Pure: AST translation rules no longer require constant head on LHS;
6098 * Pure: improved name spaces: ambiguous output is qualified; support
6099 for hiding of names;
6101 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
6102 XSYMBOL_HOME; no longer need to do manual configuration in most
6105 * system: compression of ML heaps images may now be controlled via -c
6106 option of isabelle and isatool usedir (currently only observed by
6109 * system: isatool installfonts may handle X-Symbol fonts as well (very
6110 useful for remote X11);
6112 * system: provide TAGS file for Isabelle sources;
6114 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6117 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6118 timing flag supersedes proof_timing and Toplevel.trace;
6120 * ML: new combinators |>> and |>>> for incremental transformations
6121 with secondary results (e.g. certain theory extensions):
6123 * ML: PureThy.add_defs gets additional argument to indicate potential
6124 overloading (usually false);
6126 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6131 New in Isabelle99 (October 1999)
6132 --------------------------------
6134 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6136 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6137 are no longer simplified. (This allows the simplifier to unfold recursive
6138 functional programs.) To restore the old behaviour, declare
6140 Delcongs [if_weak_cong];
6142 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6145 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6147 * HOL/datatype: mutual_induct_tac no longer exists --
6148 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6150 * HOL/typedef: fixed type inference for representing set; type
6151 arguments now have to occur explicitly on the rhs as type constraints;
6153 * ZF: The con_defs part of an inductive definition may no longer refer
6154 to constants declared in the same theory;
6156 * HOL, ZF: the function mk_cases, generated by the inductive
6157 definition package, has lost an argument. To simplify its result, it
6158 uses the default simpset instead of a supplied list of theorems.
6160 * HOL/List: the constructors of type list are now Nil and Cons;
6162 * Simplifier: the type of the infix ML functions
6163 setSSolver addSSolver setSolver addSolver
6164 is now simpset * solver -> simpset where `solver' is a new abstract type
6165 for packaging solvers. A solver is created via
6166 mk_solver: string -> (thm list -> int -> tactic) -> solver
6167 where the string argument is only a comment.
6172 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6173 decision procedure for linear arithmetic. Currently it is used for
6174 types `nat', `int', and `real' in HOL (see below); it can, should and
6175 will be instantiated for other types and logics as well.
6177 * The simplifier now accepts rewrite rules with flexible heads, eg
6178 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6179 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6185 * New Isabelle/Isar subsystem provides an alternative to traditional
6186 tactical theorem proving; together with the ProofGeneral/isar user
6187 interface it offers an interactive environment for developing human
6188 readable proof documents (Isar == Intelligible semi-automated
6189 reasoning); for further information see isatool doc isar-ref,
6190 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6192 * improved and simplified presentation of theories: better HTML markup
6193 (including colors), graph views in several sizes; isatool usedir now
6194 provides a proper interface for user theories (via -P option); actual
6195 document preparation based on (PDF)LaTeX is available as well (for
6196 new-style theories only); see isatool doc system for more information;
6198 * native support for Proof General, both for classic Isabelle and
6201 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6202 using the graph browser tool;
6204 * Isabelle manuals now also available as PDF;
6206 * theory loader rewritten from scratch (may not be fully
6207 bug-compatible); old loadpath variable has been replaced by show_path,
6208 add_path, del_path, reset_path functions; new operations such as
6209 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6212 * improved isatool install: option -k creates KDE application icon,
6213 option -p DIR installs standalone binaries;
6215 * added ML_PLATFORM setting (useful for cross-platform installations);
6216 more robust handling of platform specific ML images for SML/NJ;
6218 * the settings environment is now statically scoped, i.e. it is never
6219 created again in sub-processes invoked from isabelle, isatool, or
6222 * path element specification '~~' refers to '$ISABELLE_HOME';
6224 * in locales, the "assumes" and "defines" parts may be omitted if
6227 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6230 * new print_mode "HTML";
6232 * new flag show_tags controls display of tags of theorems (which are
6233 basically just comments that may be attached by some tools);
6235 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6236 mode and goal output format:
6238 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6240 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6242 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6243 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6245 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6247 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6249 * function bind_thms stores lists of theorems (cf. bind_thm);
6251 * new shorthand tactics ftac, eatac, datac, fatac;
6253 * qed (and friends) now accept "" as result name; in that case the
6254 theorem is not stored, but proper checks and presentation of the
6257 * theorem database now also indexes constants "Trueprop", "all",
6258 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6263 ** HOL arithmetic **
6265 * There are now decision procedures for linear arithmetic over nat and
6268 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6269 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6270 are treated as atomic; subformulae not involving type `nat' or `int'
6271 are ignored; quantified subformulae are ignored unless they are
6272 positive universal or negative existential. The tactic has to be
6273 invoked by hand and can be a little bit slow. In particular, the
6274 running time is exponential in the number of occurrences of `min' and
6275 `max', and `-' on `nat'.
6277 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6278 (negated) (in)equalities among the premises and the conclusion into
6279 account (i.e. no compound formulae) and does not know about `min' and
6280 `max', and `-' on `nat'. It is fast and is used automatically by the
6283 NB: At the moment, these decision procedures do not cope with mixed
6284 nat/int formulae where the two parts interact, such as `m < n ==>
6287 * HOL/Numeral provides a generic theory of numerals (encoded
6288 efficiently as bit strings); setup for types nat/int/real is in place;
6289 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6290 int, existing theories and proof scripts may require a few additional
6293 * integer division and remainder can now be performed on constant
6296 * many properties of integer multiplication, division and remainder
6299 * An interface to the Stanford Validity Checker (SVC) is available through the
6300 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6301 are proved automatically. SVC must be installed separately, and its results
6302 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6303 invocation of the underlying oracle). For SVC see
6304 http://verify.stanford.edu/SVC
6306 * IsaMakefile: the HOL-Real target now builds an actual image;
6311 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6312 (in Isabelle/Isar) -- by Gertrud Bauer;
6314 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6315 analysis for assembly languages with subtypes;
6317 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6318 -- avoids syntactic ambiguities and treats state, transition, and
6319 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6320 changed syntax and (many) tactics;
6322 * HOL/inductive: Now also handles more general introduction rules such
6323 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6324 theorems are now maintained within the theory (maintained via the
6327 * HOL/datatype: Now also handles arbitrarily branching datatypes
6328 (using function types) such as
6330 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6332 * HOL/record: record_simproc (part of the default simpset) takes care
6333 of selectors applied to updated records; record_split_tac is no longer
6334 part of the default claset; update_defs may now be removed from the
6335 simpset in many cases; COMPATIBILITY: old behavior achieved by
6337 claset_ref () := claset() addSWrapper record_split_wrapper;
6338 Delsimprocs [record_simproc]
6340 * HOL/typedef: fixed type inference for representing set; type
6341 arguments now have to occur explicitly on the rhs as type constraints;
6343 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6344 names rather than an ML expression;
6346 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6347 supplied later. Program schemes can be defined, such as
6348 "While B C s = (if B s then While B C (C s) else s)"
6349 where the well-founded relation can be chosen after B and C have been given.
6351 * HOL/List: the constructors of type list are now Nil and Cons;
6352 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6353 course, ML tools referring to List.list.op # etc. have to be adapted;
6355 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6356 disabled by default; run isabelle with option -m HOL to get back to
6357 the original Gordon/HOL-style output;
6359 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6360 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6362 * HOL basic syntax simplified (more orthogonal): all variants of
6363 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6364 Eps operator is provided as well: "SOME x. P[x]";
6366 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6368 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6369 thus available for user theories;
6371 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6372 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6375 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6376 several times and then mp;
6381 * the notation <<...>> is now available as a notation for sequences of
6384 * the simplifier is now installed
6386 * the axiom system has been generalized (thanks to Soren Heilmann)
6388 * the classical reasoner now has a default rule database
6393 * new primrec section allows primitive recursive functions to be given
6394 directly (as in HOL) over datatypes and the natural numbers;
6396 * new tactics induct_tac and exhaust_tac for induction (or case
6397 analysis) over datatypes and the natural numbers;
6399 * the datatype declaration of type T now defines the recursor T_rec;
6401 * simplification automatically does freeness reasoning for datatype
6404 * automatic type-inference, with AddTCs command to insert new
6405 type-checking rules;
6407 * datatype introduction rules are now added as Safe Introduction rules
6410 * the syntax "if P then x else y" is now available in addition to
6414 *** Internal programming interfaces ***
6416 * tuned simplifier trace output; new flag debug_simp;
6418 * structures Vartab / Termtab (instances of TableFun) offer efficient
6419 tables indexed by indexname_ord / term_ord (compatible with aconv);
6421 * AxClass.axclass_tac lost the theory argument;
6423 * tuned current_goals_markers semantics: begin / end goal avoids
6424 printing empty lines;
6426 * removed prs and prs_fn hook, which was broken because it did not
6427 include \n in its semantics, forcing writeln to add one
6428 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6429 string -> unit if you really want to output text without newline;
6431 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6432 plain output, interface builders may have to enable 'isabelle_font'
6433 mode to get Isabelle font glyphs as before;
6435 * refined token_translation interface; INCOMPATIBILITY: output length
6436 now of type real instead of int;
6438 * theory loader actions may be traced via new ThyInfo.add_hook
6439 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6440 your own database of information attached to *whole* theories -- as
6441 opposed to intra-theory data slots offered via TheoryDataFun;
6443 * proper handling of dangling sort hypotheses (at last!);
6444 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6445 extra sort hypotheses that can be witnessed from the type signature;
6446 the force_strip_shyps flag is gone, any remaining shyps are simply
6447 left in the theorem (with a warning issued by strip_shyps_warning);
6451 New in Isabelle98-1 (October 1998)
6452 ----------------------------------
6454 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6456 * several changes of automated proof tools;
6458 * HOL: major changes to the inductive and datatype packages, including
6459 some minor incompatibilities of theory syntax;
6461 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6464 * HOL: removed duplicate thms in Arith:
6465 less_imp_add_less should be replaced by trans_less_add1
6466 le_imp_add_le should be replaced by trans_le_add1
6468 * HOL: unary minus is now overloaded (new type constraints may be
6471 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6472 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6473 now taken as an integer constant.
6475 * Pure: ML function 'theory_of' renamed to 'theory';
6481 1. Asm_full_simp_tac is now more aggressive.
6482 1. It will sometimes reorient premises if that increases their power to
6484 2. It does no longer proceed strictly from left to right but may also
6485 rotate premises to achieve further simplification.
6486 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6487 old Asm_full_simp_tac in that it does not rotate premises.
6488 2. The simplifier now knows a little bit about nat-arithmetic.
6490 * Classical reasoner: wrapper mechanism for the classical reasoner now
6491 allows for selected deletion of wrappers, by introduction of names for
6492 wrapper functionals. This implies that addbefore, addSbefore,
6493 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6494 and that adding two tactics with the same name overwrites the first
6495 one (emitting a warning).
6496 type wrapper = (int -> tactic) -> (int -> tactic)
6497 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6498 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6499 delWrapper, delSWrapper: claset * string -> claset
6500 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6502 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6503 semantics; addbefore now affects only the unsafe part of step_tac
6504 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6505 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6508 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6509 compWrapper; added safe wrapper (and access functions for it);
6511 * HOL/split_all_tac is now much faster and fails if there is nothing
6512 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6513 and the names of the automatically generated variables have changed.
6514 split_all_tac has moved within claset() from unsafe wrappers to safe
6515 wrappers, which means that !!-bound variables are split much more
6516 aggressively, and safe_tac and clarify_tac now split such variables.
6517 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6518 Note: the same holds for record_split_tac, which does the job of
6519 split_all_tac for record fields.
6521 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6522 permanently to the default simpset using Addsplits just like
6523 Addsimps. They can be removed via Delsplits just like
6524 Delsimps. Lower-case versions are also available.
6526 * HOL/Simplifier: The rule split_if is now part of the default
6527 simpset. This means that the simplifier will eliminate all occurrences
6528 of if-then-else in the conclusion of a goal. To prevent this, you can
6529 either remove split_if completely from the default simpset by
6530 `Delsplits [split_if]' or remove it in a specific call of the
6531 simplifier using `... delsplits [split_if]'. You can also add/delete
6532 other case splitting rules to/from the default simpset: every datatype
6533 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6534 t is the name of the datatype).
6536 * Classical reasoner / Simplifier combination: new force_tac (and
6537 derivatives Force_tac, force) combines rewriting and classical
6538 reasoning (and whatever other tools) similarly to auto_tac, but is
6539 aimed to solve the given subgoal completely.
6544 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6545 and `goalw': the theory is no longer needed as an explicit argument -
6546 the current theory context is used; assumptions are no longer returned
6547 at the ML-level unless one of them starts with ==> or !!; it is
6548 recommended to convert to these new commands using isatool fixgoal
6549 (backup your sources first!);
6551 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6552 the current theory context, and 'theory' to lookup stored theories;
6554 * new theory section 'locale' for declaring constants, assumptions and
6555 definitions that have local scope;
6557 * new theory section 'nonterminals' for purely syntactic types;
6559 * new theory section 'setup' for generic ML setup functions
6560 (e.g. package initialization);
6562 * the distribution now includes Isabelle icons: see
6563 lib/logo/isabelle-{small,tiny}.xpm;
6565 * isatool install - install binaries with absolute references to
6568 * isatool logo -- create instances of the Isabelle logo (as EPS);
6570 * print mode 'emacs' reserved for Isamode;
6572 * support multiple print (ast) translations per constant name;
6574 * theorems involving oracles are now printed with a suffixed [!];
6579 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6581 * HOL/inductive package reorganized and improved: now supports mutual
6587 oddI "n : EVEN ==> Suc n : ODD"
6588 evenI "n : ODD ==> Suc n : EVEN"
6590 new theorem list "elims" contains an elimination rule for each of the
6591 recursive sets; inductive definitions now handle disjunctive premises
6592 correctly (also ZF);
6594 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6595 "mutual_induct" no longer exists - the induction rule is always
6596 contained in "induct";
6599 * HOL/datatype package re-implemented and greatly improved: now
6600 supports mutually recursive datatypes such as
6603 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6604 | SUM ('a aexp) ('a aexp)
6605 | DIFF ('a aexp) ('a aexp)
6608 'a bexp = LESS ('a aexp) ('a aexp)
6609 | AND ('a bexp) ('a bexp)
6610 | OR ('a bexp) ('a bexp)
6612 as well as indirectly recursive datatypes such as
6615 ('a, 'b) term = Var 'a
6616 | App 'b ((('a, 'b) term) list)
6618 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6619 induction on mutually / indirectly recursive datatypes.
6621 Primrec equations are now stored in theory and can be accessed via
6622 <function_name>.simps.
6626 - Theories using datatypes must now have theory Datatype as an
6628 - The specific <typename>.induct_tac no longer exists - use the
6629 generic induct_tac instead.
6630 - natE has been renamed to nat.exhaust - use exhaust_tac
6631 instead of res_inst_tac ... natE. Note that the variable
6632 names in nat.exhaust differ from the names in natE, this
6633 may cause some "fragile" proofs to fail.
6634 - The theorems split_<typename>_case and split_<typename>_case_asm
6635 have been renamed to <typename>.split and <typename>.split_asm.
6636 - Since default sorts of type variables are now handled correctly,
6637 some datatype definitions may have to be annotated with explicit
6639 - Primrec definitions no longer require function name and type
6640 of recursive argument.
6642 Consider using isatool fixdatatype to adapt your theories and proof
6643 scripts to the new package (backup your sources first!).
6646 * HOL/record package: considerably improved implementation; now
6647 includes concrete syntax for record types, terms, updates; theorems
6648 for surjective pairing and splitting !!-bound record variables; proof
6649 support is as follows:
6651 1) standard conversions (selectors or updates applied to record
6652 constructor terms) are part of the standard simpset;
6654 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6655 made part of standard simpset and claset via addIffs;
6657 3) a tactic for record field splitting (record_split_tac) is part of
6658 the standard claset (addSWrapper);
6660 To get a better idea about these rules you may retrieve them via
6661 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6662 the name of your record type.
6664 The split tactic 3) conceptually simplifies by the following rule:
6666 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6668 Thus any record variable that is bound by meta-all will automatically
6669 blow up into some record constructor term, consequently the
6670 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6671 solve record problems automatically.
6674 * reorganized the main HOL image: HOL/Integ and String loaded by
6675 default; theory Main includes everything;
6677 * automatic simplification of integer sums and comparisons, using cancellation;
6679 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6681 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6683 * many new identities for unions, intersections, set difference, etc.;
6685 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6686 called split_if, split_split, split_sum_case and split_nat_case (to go
6687 with add/delsplits);
6689 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6690 (?x::unit) = (); this is made part of the default simpset, which COULD
6691 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6692 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6693 unit_abs_eta_conv is added in order to counter the effect of
6694 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6697 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6700 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6701 It and 'sym RS equals0D' are now in the default claset, giving automatic
6702 disjointness reasoning but breaking a few old proofs.
6704 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6705 to 'converse' from 'inverse' (for compatibility with ZF and some
6708 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6709 the well-founded relation;
6711 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6712 Compl A. The "Compl" syntax remains available as input syntax for this
6715 * HOL/Update: new theory of function updates:
6716 f(a:=b) == %x. if x=a then b else f x
6717 may also be iterated as in f(a:=b,c:=d,...);
6719 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6722 - new function list_update written xs[i:=v] that updates the i-th
6723 list position. May also be iterated as in xs[i:=a,j:=b,...].
6724 - new function `upt' written [i..j(] which generates the list
6725 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6726 bound write [i..j], which is a shorthand for [i..j+1(].
6727 - new lexicographic orderings and corresponding wellfoundedness theorems.
6730 - removed 'pred' (predecessor) function;
6731 - generalized some theorems about n-1;
6732 - many new laws about "div" and "mod";
6733 - new laws about greatest common divisors (see theory ex/Primes);
6735 * HOL/Relation: renamed the relational operator r^-1 "converse"
6736 instead of "inverse";
6738 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6739 of the multiset ordering;
6741 * directory HOL/Real: a construction of the reals using Dedekind cuts
6742 (not included by default);
6744 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6746 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6747 programs, i.e. different program variables may have different types.
6749 * calling (stac rew i) now fails if "rew" has no effect on the goal
6750 [previously, this check worked only if the rewrite rule was unconditional]
6751 Now rew can involve either definitions or equalities (either == or =).
6756 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6757 only the theorems proved on ZF.ML;
6759 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6760 It and 'sym RS equals0D' are now in the default claset, giving automatic
6761 disjointness reasoning but breaking a few old proofs.
6763 * ZF/Update: new theory of function updates
6764 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6765 may also be iterated as in f(a:=b,c:=d,...);
6767 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6769 * calling (stac rew i) now fails if "rew" has no effect on the goal
6770 [previously, this check worked only if the rewrite rule was unconditional]
6771 Now rew can involve either definitions or equalities (either == or =).
6773 * case_tac provided for compatibility with HOL
6774 (like the old excluded_middle_tac, but with subgoals swapped)
6777 *** Internal programming interfaces ***
6779 * Pure: several new basic modules made available for general use, see
6780 also src/Pure/README;
6782 * improved the theory data mechanism to support encapsulation (data
6783 kind name replaced by private Object.kind, acting as authorization
6784 key); new type-safe user interface via functor TheoryDataFun; generic
6785 print_data function becomes basically useless;
6787 * removed global_names compatibility flag -- all theory declarations
6788 are qualified by default;
6790 * module Pure/Syntax now offers quote / antiquote translation
6791 functions (useful for Hoare logic etc. with implicit dependencies);
6792 see HOL/ex/Antiquote for an example use;
6794 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6797 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6800 * Display.print_goals function moved to Locale.print_goals;
6802 * standard print function for goals supports current_goals_markers
6803 variable for marking begin of proof, end of proof, start of goal; the
6804 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6805 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6810 New in Isabelle98 (January 1998)
6811 --------------------------------
6813 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6815 * changed lexical syntax of terms / types: dots made part of long
6816 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6818 * simpset (and claset) reference variable replaced by functions
6819 simpset / simpset_ref;
6821 * no longer supports theory aliases (via merge) and non-trivial
6822 implicit merge of thms' signatures;
6824 * most internal names of constants changed due to qualified names;
6826 * changed Pure/Sequence interface (see Pure/seq.ML);
6829 *** General Changes ***
6831 * hierachically structured name spaces (for consts, types, axms, thms
6832 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6833 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6834 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6835 long_names for fully qualified output names; NOTE: ML programs
6836 (special tactics, packages etc.) referring to internal names may have
6837 to be adapted to cope with fully qualified names; in case of severe
6838 backward campatibility problems try setting 'global_names' at compile
6839 time to have enrything declared within a flat name space; one may also
6840 fine tune name declarations in theories via the 'global' and 'local'
6843 * reimplemented the implicit simpset and claset using the new anytype
6844 data filed in signatures; references simpset:simpset ref etc. are
6845 replaced by functions simpset:unit->simpset and
6846 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6847 to patch your ML files accordingly;
6849 * HTML output now includes theory graph data for display with Java
6850 applet or isatool browser; data generated automatically via isatool
6851 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6853 * defs may now be conditional; improved rewrite_goals_tac to handle
6854 conditional equations;
6856 * defs now admits additional type arguments, using TYPE('a) syntax;
6858 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6859 creates a new theory node; implicit merge of thms' signatures is
6860 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6861 transfer:theory->thm->thm in (rare) cases;
6863 * improved handling of draft signatures / theories; draft thms (and
6864 ctyps, cterms) are automatically promoted to real ones;
6866 * slightly changed interfaces for oracles: admit many per theory, named
6867 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6869 * print_goals: optional output of const types (set show_consts and
6872 * improved output of warnings (###) and errors (***);
6874 * subgoal_tac displays a warning if the new subgoal has type variables;
6876 * removed old README and Makefiles;
6878 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6880 * removed obsolete init_pps and init_database;
6882 * deleted the obsolete tactical STATE, which was declared by
6883 fun STATE tacfun st = tacfun st st;
6885 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6886 (which abbreviates $HOME);
6888 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6889 use isatool fixseq to adapt your ML programs (this works for fully
6890 qualified references to the Sequence structure only!);
6892 * use_thy no longer requires writable current directory; it always
6893 reloads .ML *and* .thy file, if either one is out of date;
6896 *** Classical Reasoner ***
6898 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6899 tactics that use classical reasoning to simplify a subgoal without
6900 splitting it into several subgoals;
6902 * Safe_tac: like safe_tac but uses the default claset;
6907 * added simplification meta rules:
6908 (asm_)(full_)simplify: simpset -> thm -> thm;
6910 * simplifier.ML no longer part of Pure -- has to be loaded by object
6913 * added prems argument to simplification procedures;
6915 * HOL, FOL, ZF: added infix function `addsplits':
6916 instead of `<simpset> setloop (split_tac <thms>)'
6917 you can simply write `<simpset> addsplits <thms>'
6922 * TYPE('a) syntax for type reflection terms;
6924 * no longer handles consts with name "" -- declare as 'syntax' instead;
6926 * pretty printer: changed order of mixfix annotation preference (again!);
6928 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6933 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6934 with `addloop' of the simplifier to faciliate case splitting in premises.
6936 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6938 * HOL/Auth: new protocol proofs including some for the Internet
6941 * HOL/Map: new theory of `maps' a la VDM;
6943 * HOL/simplifier: simplification procedures nat_cancel_sums for
6944 cancelling out common nat summands from =, <, <= (in)equalities, or
6945 differences; simplification procedures nat_cancel_factor for
6946 cancelling common factor from =, <, <= (in)equalities over natural
6947 sums; nat_cancel contains both kinds of procedures, it is installed by
6948 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6950 * HOL/simplifier: terms of the form
6951 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6953 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6954 and those of the form
6955 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6957 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6960 Each datatype `t' now comes with a theorem `split_t_case' of the form
6962 P(t_case f1 ... fn x) =
6963 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6965 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6968 and a theorem `split_t_case_asm' of the form
6970 P(t_case f1 ... fn x) =
6971 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6973 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6975 which can be added to a simpset via `addsplits'. The existing theorems
6976 expand_list_case and expand_option_case have been renamed to
6977 split_list_case and split_option_case.
6980 - `pred n' is automatically converted to `n-1'.
6981 Users are strongly encouraged not to use `pred' any longer,
6982 because it will disappear altogether at some point.
6983 - Users are strongly encouraged to write "0 < n" rather than
6984 "n ~= 0". Theorems and proof tools have been modified towards this
6988 the function "set_of_list" has been renamed "set" (and its theorems too);
6989 the function "nth" now takes its arguments in the reverse order and
6990 has acquired the infix notation "!" as in "xs!n".
6992 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6994 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6995 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6997 * HOL/record: extensible records with schematic structural subtyping
6998 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6999 still lacks various theorems and concrete record syntax;
7004 * removed "axioms" and "generated by" sections;
7006 * replaced "ops" section by extended "consts" section, which is capable of
7007 handling the continuous function space "->" directly;
7010 . proves theorems immediately and stores them in the theory,
7011 . creates hierachical name space,
7012 . now uses normal mixfix annotations (instead of cinfix...),
7013 . minor changes to some names and values (for consistency),
7014 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
7015 . separator between mutual domain defs: changed "," to "and",
7016 . improved handling of sort constraints; now they have to
7017 appear on the left-hand side of the equations only;
7019 * fixed LAM <x,y,zs>.b syntax;
7021 * added extended adm_tac to simplifier in HOLCF -- can now discharge
7022 adm (%x. P (t x)), where P is chainfinite and t continuous;
7027 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
7028 with `addloop' of the simplifier to faciliate case splitting in premises.
7030 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
7031 in HOL, they strip ALL and --> from proved theorems;
7035 New in Isabelle94-8 (May 1997)
7036 ------------------------------
7038 *** General Changes ***
7040 * new utilities to build / run / maintain Isabelle etc. (in parts
7041 still somewhat experimental); old Makefiles etc. still functional;
7043 * new 'Isabelle System Manual';
7045 * INSTALL text, together with ./configure and ./build scripts;
7047 * reimplemented type inference for greater efficiency, better error
7048 messages and clean internal interface;
7050 * prlim command for dealing with lots of subgoals (an easier way of
7051 setting goals_limit);
7056 * supports alternative (named) syntax tables (parser and pretty
7057 printer); internal interface is provided by add_modesyntax(_i);
7059 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
7060 be used in conjunction with the Isabelle symbol font; uses the
7061 "symbols" syntax table;
7063 * added token_translation interface (may translate name tokens in
7064 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
7065 the current print_mode); IMPORTANT: user print translation functions
7066 are responsible for marking newly introduced bounds
7067 (Syntax.mark_boundT);
7069 * token translations for modes "xterm" and "xterm_color" that display
7070 names in bold, underline etc. or colors (which requires a color
7073 * infixes may now be declared with names independent of their syntax;
7075 * added typed_print_translation (like print_translation, but may
7076 access type of constant);
7079 *** Classical Reasoner ***
7081 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
7082 some limitations. Blast_tac...
7083 + ignores addss, addbefore, addafter; this restriction is intrinsic
7084 + ignores elimination rules that don't have the correct format
7085 (the conclusion MUST be a formula variable)
7086 + ignores types, which can make HOL proofs fail
7087 + rules must not require higher-order unification, e.g. apply_type in ZF
7088 [message "Function Var's argument not a bound variable" relates to this]
7089 + its proof strategy is more general but can actually be slower
7091 * substitution with equality assumptions no longer permutes other
7094 * minor changes in semantics of addafter (now called addaltern); renamed
7095 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
7096 (and access functions for it);
7098 * improved combination of classical reasoner and simplifier:
7099 + functions for handling clasimpsets
7100 + improvement of addss: now the simplifier is called _after_ the
7102 + safe variant of addss called addSss: uses safe simplifications
7103 _during_ the safe steps. It is more complete as it allows multiple
7104 instantiations of unknowns (e.g. with slow_tac).
7108 * added interface for simplification procedures (functions that
7109 produce *proven* rewrite rules on the fly, depending on current
7112 * ordering on terms as parameter (used for ordered rewriting);
7114 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7116 * the solver is now split into a safe and an unsafe part.
7117 This should be invisible for the normal user, except that the
7118 functions setsolver and addsolver have been renamed to setSolver and
7119 addSolver; added safe_asm_full_simp_tac;
7124 * a generic induction tactic `induct_tac' which works for all datatypes and
7125 also for type `nat';
7127 * a generic case distinction tactic `exhaust_tac' which works for all
7128 datatypes and also for type `nat';
7130 * each datatype comes with a function `size';
7132 * patterns in case expressions allow tuple patterns as arguments to
7133 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7135 * primrec now also works with type nat;
7137 * recdef: a new declaration form, allows general recursive functions to be
7138 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7140 * the constant for negation has been renamed from "not" to "Not" to
7141 harmonize with FOL, ZF, LK, etc.;
7143 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7146 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7148 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7149 problems in commutative rings, using axiomatic type classes for + and *;
7151 * more examples in HOL/MiniML and HOL/Auth;
7153 * more default rewrite rules for quantifiers, union/intersection;
7155 * a new constant `arbitrary == @x.False';
7157 * HOLCF/IOA replaces old HOL/IOA;
7159 * HOLCF changes: derived all rules and arities
7160 + axiomatic type classes instead of classes
7161 + typedef instead of faking type definitions
7162 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7163 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7164 + eliminated the types void, one, tr
7165 + use unit lift and bool lift (with translations) instead of one and tr
7166 + eliminated blift from Lift3.thy (use Def instead of blift)
7167 all eliminated rules are derived as theorems --> no visible changes ;
7172 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7173 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7174 as ZF_cs addSIs [equalityI];
7178 New in Isabelle94-7 (November 96)
7179 ---------------------------------
7181 * allowing negative levels (as offsets) in prlev and choplev;
7183 * super-linear speedup for large simplifications;
7185 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7186 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7187 FAIL); can suppress it using the command Delsimps (ex_simps @
7188 all_simps); De Morgan laws are also now included, by default;
7190 * improved printing of ==> : ~:
7192 * new object-logic "Sequents" adds linear logic, while replacing LK
7193 and Modal (thanks to Sara Kalvala);
7195 * HOL/Auth: correctness proofs for authentication protocols;
7197 * HOL: new auto_tac combines rewriting and classical reasoning (many
7198 examples on HOL/Auth);
7200 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7201 the rewriter and classical reasoner simultaneously;
7203 * function uresult no longer returns theorems in "standard" format;
7204 regain previous version by: val uresult = standard o uresult;
7211 * oracles -- these establish an interface between Isabelle and trusted
7212 external reasoners, which may deliver results as theorems;
7214 * proof objects (in particular record all uses of oracles);
7216 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7218 * "constdefs" section in theory files;
7220 * "primrec" section (HOL) no longer requires names;
7222 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7229 * reduced space requirements;
7231 * automatic HTML generation from theories;
7233 * theory files no longer require "..." (quotes) around most types;
7235 * new examples, including two proofs of the Church-Rosser theorem;
7237 * non-curried (1994) version of HOL is no longer distributed;
7244 * greatly reduced space requirements;
7246 * theory files (.thy) no longer require \...\ escapes at line breaks;
7248 * searchable theorem database (see the section "Retrieving theorems" on
7249 page 8 of the Reference Manual);
7251 * new examples, including Grabczewski's monumental case study of the
7254 * The previous version of HOL renamed to Old_HOL;
7256 * The new version of HOL (previously called CHOL) uses a curried syntax
7257 for functions. Application looks like f a b instead of f(a,b);
7259 * Mutually recursive inductive definitions finally work in HOL;
7261 * In ZF, pattern-matching on tuples is now available in all abstractions and
7262 translates to the operator "split";
7269 * new infix operator, addss, allowing the classical reasoner to
7270 perform simplification at each step of its search. Example:
7271 fast_tac (cs addss ss)
7273 * a new logic, CHOL, the same as HOL, but with a curried syntax
7274 for functions. Application looks like f a b instead of f(a,b). Also pairs
7275 look like (a,b) instead of <a,b>;
7277 * PLEASE NOTE: CHOL will eventually replace HOL!
7279 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7280 It translates to the operator "split". A new theory of integers is available;
7282 * In ZF, integer numerals now denote two's-complement binary integers.
7283 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7285 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7286 of the Axiom of Choice;
7293 * Significantly faster resolution;
7295 * the different sections in a .thy file can now be mixed and repeated
7298 * Database of theorems for FOL, HOL and ZF. New
7299 commands including qed, qed_goal and bind_thm store theorems in the database.
7301 * Simple database queries: return a named theorem (get_thm) or all theorems of
7302 a given theory (thms_of), or find out what theory a theorem was proved in
7305 * Bugs fixed in the inductive definition and datatype packages;
7307 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7308 and HOL_dup_cs obsolete;
7310 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7313 * Simpler definition of function space in ZF;
7315 * new results about cardinal and ordinal arithmetic in ZF;
7317 * 'subtype' facility in HOL for introducing new types as subsets of existing
7320 :mode=text:wrap=hard:maxLineLen=72: