1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Schematic theorem statements need to be explicitly markup as such,
10 via commands 'schematic_lemma', 'schematic_theorem',
11 'schematic_corollary'. Thus the relevance of the proof is made
12 syntactically clear, which impacts performance in a parallel or
13 asynchronous interactive environment. Minor INCOMPATIBILITY.
15 * Authentic syntax for *all* logical entities (type classes, type
16 constructors, term constants): provides simple and robust
17 correspondence between formal entities and concrete syntax. Within
18 the parse tree / AST representations, "constants" are decorated by
19 their category (class, type, const) and spelled out explicitly with
20 their full internal name.
22 Substantial INCOMPATIBILITY concerning low-level syntax declarations
23 and translations (translation rules and translation functions in ML).
24 Some hints on upgrading:
26 - Many existing uses of 'syntax' and 'translations' can be replaced
27 by more modern 'type_notation', 'notation' and 'abbreviation',
28 which are independent of this issue.
30 - 'translations' require markup within the AST; the term syntax
31 provides the following special forms:
33 CONST c -- produces syntax version of constant c from context
34 XCONST c -- literally c, checked as constant from context
35 c -- literally c, if declared by 'syntax'
37 Plain identifiers are treated as AST variables -- occasionally the
38 system indicates accidental variables via the error "rhs contains
41 Type classes and type constructors are marked according to their
42 concrete syntax. Some old translations rules need to be written
43 for the "type" category, using type constructor application
44 instead of pseudo-term application of the default category
47 - 'parse_translation' etc. in ML may use the following
50 @{class_syntax c} -- type class c within parse tree / AST
51 @{term_syntax c} -- type constructor c within parse tree / AST
52 @{const_syntax c} -- ML version of "CONST c" above
53 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
55 - Literal types within 'typed_print_translations', i.e. those *not*
56 represented as pseudo-terms are represented verbatim. Use @{class
57 c} or @{type_name c} here instead of the above syntax
60 Note that old non-authentic syntax was based on unqualified base
61 names, so all of the above "constant" names would coincide. Recall
62 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
63 diagnose syntax problems.
65 * Type constructors admit general mixfix syntax, not just infix.
67 * Concrete syntax may be attached to local entities without a proof
68 body, too. This works via regular mixfix annotations for 'fix',
69 'def', 'obtain' etc. or via the explicit 'write' command, which is
70 similar to the 'notation' command in theory specifications.
72 * Use of cumulative prems via "!" in some proof methods has been
73 discontinued (legacy feature).
75 * References 'trace_simp' and 'debug_simp' have been replaced by
76 configuration options stored in the context. Enabling tracing (the
77 case of debugging is similar) in proofs works via
79 using [[trace_simp = true]]
81 Tracing is then active for all invocations of the simplifier in
82 subsequent goal refinement steps. Tracing may also still be enabled or
83 disabled via the ProofGeneral settings menu.
85 * Separate commands 'hide_class', 'hide_type', 'hide_const',
86 'hide_fact' replace the former 'hide' KIND command. Minor
92 * Predicates of locales introduces by classes carry a mandatory
93 "class" prefix. INCOMPATIBILITY.
95 * Command 'code_reflect' allows to incorporate generated ML code into
96 runtime environment; replaces immature code_datatype antiquotation.
99 * Empty class specifications observe default sort. INCOMPATIBILITY.
101 * Old 'axclass' command has been discontinued. Use 'class' instead.
104 * Code generator: simple concept for abstract datatypes obeying
107 * Local theory specifications may depend on extra type variables that
108 are not present in the result type -- arguments TYPE('a) :: 'a itself
109 are added internally. For example:
111 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
113 * Code generator: details of internal data cache have no impact on the
114 user space functionality any longer.
116 * Methods unfold_locales and intro_locales ignore non-locale subgoals.
117 This is more appropriate for interpretations with 'where'.
120 * Discontinued unnamed infix syntax (legacy feature for many years) --
121 need to specify constant name and syntax separately. Internal ML
122 datatype constructors have been renamed from InfixName to Infix etc.
123 Minor INCOMPATIBILITY.
125 * Command 'example_proof' opens an empty proof body. This allows to
126 experiment with Isar, without producing any persistent result.
128 * Commands 'type_notation' and 'no_type_notation' declare type syntax
129 within a local theory context, with explicit checking of the
130 constructors involved (in contrast to the raw 'syntax' versions).
132 * Commands 'types' and 'typedecl' now work within a local theory
133 context -- without introducing dependencies on parameters or
134 assumptions, which is not possible in Isabelle/Pure.
136 * Command 'defaultsort' has been renamed to 'default_sort', it works
137 within a local theory context. Minor INCOMPATIBILITY.
139 * Proof terms: Type substitutions on proof constants now use canonical
140 order of type variables. Potential INCOMPATIBILITY for tools working
146 * List membership infix mem operation is only an input abbreviation.
149 * Theory Library/Word.thy has been removed. Use library Word/Word.thy for
150 future developements; former Library/Word.thy is still present in the AFP
153 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
154 longer shadowed. INCOMPATIBILITY.
156 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
159 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
162 * Dropped normalizing_semiring etc; use the facts in semiring classes
163 instead. INCOMPATIBILITY.
165 * Dropped several real-specific versions of lemmas about floor and
166 ceiling; use the generic lemmas from Archimedean_Field.thy instead.
169 floor_number_of_eq ~> floor_number_of
170 le_floor_eq_number_of ~> number_of_le_floor
171 le_floor_eq_zero ~> zero_le_floor
172 le_floor_eq_one ~> one_le_floor
173 floor_less_eq_number_of ~> floor_less_number_of
174 floor_less_eq_zero ~> floor_less_zero
175 floor_less_eq_one ~> floor_less_one
176 less_floor_eq_number_of ~> number_of_less_floor
177 less_floor_eq_zero ~> zero_less_floor
178 less_floor_eq_one ~> one_less_floor
179 floor_le_eq_number_of ~> floor_le_number_of
180 floor_le_eq_zero ~> floor_le_zero
181 floor_le_eq_one ~> floor_le_one
182 floor_subtract_number_of ~> floor_diff_number_of
183 floor_subtract_one ~> floor_diff_one
184 ceiling_number_of_eq ~> ceiling_number_of
185 ceiling_le_eq_number_of ~> ceiling_le_number_of
186 ceiling_le_zero_eq ~> ceiling_le_zero
187 ceiling_le_eq_one ~> ceiling_le_one
188 less_ceiling_eq_number_of ~> number_of_less_ceiling
189 less_ceiling_eq_zero ~> zero_less_ceiling
190 less_ceiling_eq_one ~> one_less_ceiling
191 ceiling_less_eq_number_of ~> ceiling_less_number_of
192 ceiling_less_eq_zero ~> ceiling_less_zero
193 ceiling_less_eq_one ~> ceiling_less_one
194 le_ceiling_eq_number_of ~> number_of_le_ceiling
195 le_ceiling_eq_zero ~> zero_le_ceiling
196 le_ceiling_eq_one ~> one_le_ceiling
197 ceiling_subtract_number_of ~> ceiling_diff_number_of
198 ceiling_subtract_one ~> ceiling_diff_one
200 * Theory 'Finite_Set': various folding_XXX locales facilitate the
201 application of the various fold combinators on finite sets.
203 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
204 provides abstract red-black tree type which is backed by "RBT_Impl" as
205 implementation. INCOMPATIBILTY.
207 * Command 'typedef' now works within a local theory context -- without
208 introducing dependencies on parameters or assumptions, which is not
209 possible in Isabelle/Pure/HOL. Note that the logical environment may
210 contain multiple interpretations of local typedefs (with different
211 non-emptiness proofs), even in a global theory context.
213 * Theory Library/Coinductive_List has been removed -- superseded by
214 AFP/thys/Coinductive.
216 * Theory PReal, including the type "preal" and related operations, has
217 been removed. INCOMPATIBILITY.
219 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
220 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
222 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
223 "Int" etc. INCOMPATIBILITY.
225 * New set of rules "ac_simps" provides combined assoc / commute
226 rewrites for all interpretations of the appropriate generic locales.
228 * Renamed theory "OrderedGroup" to "Groups" and split theory
229 "Ring_and_Field" into theories "Rings" and "Fields"; for more
230 appropriate and more consistent names suitable for name prefixes
231 within the HOL theories. INCOMPATIBILITY.
233 * Some generic constants have been put to appropriate theories:
234 - less_eq, less: Orderings
235 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
236 - inverse, divide: Rings
239 * More consistent naming of type classes involving orderings (and
242 lower_semilattice ~> semilattice_inf
243 upper_semilattice ~> semilattice_sup
245 dense_linear_order ~> dense_linorder
247 pordered_ab_group_add ~> ordered_ab_group_add
248 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
249 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
250 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
251 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
252 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
253 pordered_cancel_semiring ~> ordered_cancel_semiring
254 pordered_comm_monoid_add ~> ordered_comm_monoid_add
255 pordered_comm_ring ~> ordered_comm_ring
256 pordered_comm_semiring ~> ordered_comm_semiring
257 pordered_ring ~> ordered_ring
258 pordered_ring_abs ~> ordered_ring_abs
259 pordered_semiring ~> ordered_semiring
261 ordered_ab_group_add ~> linordered_ab_group_add
262 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
263 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
264 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
265 ordered_field ~> linordered_field
266 ordered_field_no_lb ~> linordered_field_no_lb
267 ordered_field_no_ub ~> linordered_field_no_ub
268 ordered_field_dense_linear_order ~> dense_linordered_field
269 ordered_idom ~> linordered_idom
270 ordered_ring ~> linordered_ring
271 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
272 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
273 ordered_ring_strict ~> linordered_ring_strict
274 ordered_semidom ~> linordered_semidom
275 ordered_semiring ~> linordered_semiring
276 ordered_semiring_1 ~> linordered_semiring_1
277 ordered_semiring_1_strict ~> linordered_semiring_1_strict
278 ordered_semiring_strict ~> linordered_semiring_strict
280 The following slightly odd type classes have been moved to a
281 separate theory Library/Lattice_Algebras.thy:
283 lordered_ab_group_add ~> lattice_ab_group_add
284 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
285 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
286 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
287 lordered_ring ~> lattice_ring
291 * Refined field classes:
292 - classes division_ring_inverse_zero, field_inverse_zero,
293 linordered_field_inverse_zero include rule inverse 0 = 0 --
294 subsumes former division_by_zero class;
295 - numerous lemmas have been ported from field to division_ring.
298 * Refined algebra theorem collections:
299 - dropped theorem group group_simps, use algebra_simps instead;
300 - dropped theorem group ring_simps, use field_simps instead;
301 - proper theorem collection field_simps subsumes former theorem
302 groups field_eq_simps and field_simps;
303 - dropped lemma eq_minus_self_iff which is a duplicate for
307 * Theory Finite_Set and List: some lemmas have been generalized from
310 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
311 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
312 inter_Inter_fold_inter ~> inf_Inf_fold_inf
313 union_Union_fold_union ~> sup_Sup_fold_sup
314 Inter_fold_inter ~> Inf_fold_inf
315 Union_fold_union ~> Sup_fold_sup
316 inter_INTER_fold_inter ~> inf_INFI_fold_inf
317 union_UNION_fold_union ~> sup_SUPR_fold_sup
318 INTER_fold_inter ~> INFI_fold_inf
319 UNION_fold_union ~> SUPR_fold_sup
321 * Theory Complete_Lattice: lemmas top_def and bot_def have been
322 replaced by the more convenient lemmas Inf_empty and Sup_empty.
323 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
324 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
325 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
326 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
328 * HOLogic.strip_psplit: types are returned in syntactic order, similar
329 to other strip and tuple operations. INCOMPATIBILITY.
331 * Reorganized theory Multiset: swapped notation of pointwise and
333 - pointwise ordering is instance of class order with standard syntax
335 - multiset ordering has syntax <=# and <#; partial order properties
336 are provided by means of interpretation with prefix
338 - less duplication, less historical organization of sections,
339 conversion from associations lists to multisets, rudimentary code
341 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
344 multiset_eq_conv_count_eq -> multiset_ext_iff
345 multi_count_ext -> multiset_ext
346 diff_union_inverse2 -> diff_union_cancelR
349 * Theory Permutation: replaced local "remove" by List.remove1.
351 * Code generation: ML and OCaml code is decorated with signatures.
353 * Theory List: added transpose.
355 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
356 clash with new theory Quotient in Main HOL.
358 * Library/Nat_Bijection.thy is a collection of bijective functions
359 between nat and other types, which supersedes the older libraries
360 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
363 Nat_Int_Bij.nat2_to_nat ~> prod_encode
364 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
365 Nat_Int_Bij.int_to_nat_bij ~> int_encode
366 Nat_Int_Bij.nat_to_int_bij ~> int_decode
367 Countable.pair_encode ~> prod_encode
368 NatIso.prod2nat ~> prod_encode
369 NatIso.nat2prod ~> prod_decode
370 NatIso.sum2nat ~> sum_encode
371 NatIso.nat2sum ~> sum_decode
372 NatIso.list2nat ~> list_encode
373 NatIso.nat2list ~> list_decode
374 NatIso.set2nat ~> set_encode
375 NatIso.nat2set ~> set_decode
378 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
379 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
380 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
381 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
382 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
383 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
384 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
385 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
386 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
387 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
388 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
389 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
390 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
393 - Renamed ATP commands:
394 atp_info ~> sledgehammer running_atps
395 atp_kill ~> sledgehammer kill_atps
396 atp_messages ~> sledgehammer messages
397 atp_minimize ~> sledgehammer minimize
398 print_atps ~> sledgehammer available_atps
400 - Added user's manual ("isabelle doc sledgehammer").
401 - Added option syntax and "sledgehammer_params" to customize
402 Sledgehammer's behavior. See the manual for details.
403 - Modified the Isar proof reconstruction code so that it produces
404 direct proofs rather than proofs by contradiction. (This feature
405 is still experimental.)
406 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
408 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
411 - Added and implemented "binary_ints" and "bits" options.
412 - Added "std" option and implemented support for nonstandard models.
413 - Added and implemented "finitize" option to improve the precision
414 of infinite datatypes based on a monotonicity analysis.
415 - Added support for quotient types.
416 - Added support for "specification" and "ax_specification"
418 - Added support for local definitions (for "function" and
419 "termination" proofs).
420 - Added support for term postprocessors.
421 - Optimized "Multiset.multiset" and "FinFun.finfun".
422 - Improved efficiency of "destroy_constrs" optimization.
423 - Fixed soundness bugs related to "destroy_constrs" optimization and
425 - Fixed soundness bug related to higher-order constructors
426 - Improved precision of set constructs.
427 - Added cache to speed up repeated Kodkod invocations on the same
429 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
430 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
431 "SAT4J_Light". INCOMPATIBILITY.
432 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
433 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
438 * Variable names in lemmas generated by the domain package have
439 changed; the naming scheme is now consistent with the HOL datatype
440 package. Some proof scripts may be affected, INCOMPATIBILITY.
442 * The domain package no longer defines the function "foo_copy" for
443 recursive domain "foo". The reach lemma is now stated directly in
444 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
445 be reformulated in terms of "foo_take", INCOMPATIBILITY.
447 * Most definedness lemmas generated by the domain package (previously
448 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
449 like "foo$x = UU <-> x = UU", which works better as a simp rule.
450 Proof scripts that used definedness lemmas as intro rules may break,
451 potential INCOMPATIBILITY.
453 * Induction and casedist rules generated by the domain package now
454 declare proper case_names (one called "bottom", and one named for each
455 constructor). INCOMPATIBILITY.
457 * For mutually-recursive domains, separate "reach" and "take_lemma"
458 rules are generated for each domain, INCOMPATIBILITY.
460 foo_bar.reach ~> foo.reach bar.reach
461 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
463 * Some lemmas generated by the domain package have been renamed for
464 consistency with the datatype package, INCOMPATIBILITY.
466 foo.ind ~> foo.induct
467 foo.finite_ind ~> foo.finite_induct
468 foo.coind ~> foo.coinduct
469 foo.casedist ~> foo.exhaust
470 foo.exhaust ~> foo.nchotomy
472 * For consistency with other definition packages, the fixrec package
473 now generates qualified theorem names, INCOMPATIBILITY.
475 foo_simps ~> foo.simps
476 foo_unfold ~> foo.unfold
477 foo_induct ~> foo.induct
479 * The "contlub" predicate has been removed. Proof scripts should use
480 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
482 * The "admw" predicate has been removed, INCOMPATIBILITY.
484 * The constants cpair, cfst, and csnd have been removed in favor of
485 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
490 * Sorts.certify_sort and derived "cert" operations for types and terms
491 no longer minimize sorts. Thus certification at the boundary of the
492 inference kernel becomes invariant under addition of class relations,
493 which is an important monotonicity principle. Sorts are now minimized
494 in the syntax layer only, at the boundary between the end-user and the
495 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
496 explicitly in rare situations.
498 * Antiquotations for basic formal entities:
500 @{class NAME} -- type class
501 @{class_syntax NAME} -- syntax representation of the above
503 @{type_name NAME} -- logical type
504 @{type_abbrev NAME} -- type abbreviation
505 @{nonterminal NAME} -- type of concrete syntactic category
506 @{type_syntax NAME} -- syntax representation of any of the above
508 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
509 @{const_abbrev NAME} -- abbreviated constant
510 @{const_syntax NAME} -- syntax representation of any of the above
512 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
513 syntax constant (cf. 'syntax' command).
515 * Antiquotation @{make_string} inlines a function to print arbitrary
516 values similar to the ML toplevel. The result is compiler dependent
517 and may fall back on "?" in certain situations.
519 * Renamed old-style Drule.standard to Drule.export_without_context, to
520 emphasize that this is in no way a standard operation.
523 * Curried take and drop in library.ML; negative length is interpreted
524 as infinity (as in chop). INCOMPATIBILITY.
526 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
527 usual for resolution. Rare INCOMPATIBILITY.
529 * Discontinued old TheoryDataFun with its copy/init operation -- data
530 needs to be pure. Functor Theory_Data_PP retains the traditional
531 Pretty.pp argument to merge, which is absent in the standard
534 * Renamed varify/unvarify operations to varify_global/unvarify_global
535 to emphasize that these only work in a global situation (which is
538 * Configuration options now admit dynamic default values, depending on
539 the context or even global references.
541 * Most operations that refer to a global context are named
542 accordingly, e.g. Simplifier.global_context or
543 ProofContext.init_global. There are some situations where a global
544 context actually works, but under normal circumstances one needs to
545 pass the proper local context through the code!
547 * Renamed some important ML structures, while keeping the old names
548 for some time as aliases within the structure Legacy:
550 OuterKeyword ~> Keyword
553 OuterSyntax ~> Outer_Syntax
554 SpecParse ~> Parse_Spec
556 Note that "open Legacy" simplifies porting of sources, but forgetting
557 to remove it again will complicate porting again in the future.
562 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
563 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
564 proof terms are enabled unconditionally in the new HOL-Proofs image.
566 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
567 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
570 * Old lib/scripts/polyml-platform is superseded by the
571 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
572 variant, even on a 64 bit machine. The following example setting
573 prefers 64 bit if available:
575 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
579 New in Isabelle2009-1 (December 2009)
580 -------------------------------------
584 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
585 one backslash should be used, even in ML sources.
590 * Locale interpretation propagates mixins along the locale hierarchy.
591 The currently only available mixins are the equations used to map
592 local definitions to terms of the target domain of an interpretation.
594 * Reactivated diagnostic command 'print_interps'. Use "print_interps
595 loc" to print all interpretations of locale "loc" in the theory.
596 Interpretations in proofs are not shown.
598 * Thoroughly revised locales tutorial. New section on conditional
601 * On instantiation of classes, remaining undefined class parameters
602 are formally declared. INCOMPATIBILITY.
605 *** Document preparation ***
607 * New generalized style concept for printing terms: @{foo (style) ...}
608 instead of @{foo_style style ...} (old form is still retained for
609 backward compatibility). Styles can be also applied for
610 antiquotations prop, term_type and typeof.
615 * New proof method "smt" for a combination of first-order logic with
616 equality, linear and nonlinear (natural/integer/real) arithmetic, and
617 fixed-size bitvectors; there is also basic support for higher-order
618 features (esp. lambda abstractions). It is an incomplete decision
619 procedure based on external SMT solvers using the oracle mechanism;
620 for the SMT solver Z3, this method is proof-producing. Certificates
621 are provided to avoid calling the external solvers solely for
622 re-checking proofs. Due to a remote SMT service there is no need for
623 installing SMT solvers locally. See src/HOL/SMT.
625 * New commands to load and prove verification conditions generated by
626 the Boogie program verifier or derived systems (e.g. the Verifying C
627 Compiler (VCC) or Spec#). See src/HOL/Boogie.
629 * New counterexample generator tool 'nitpick' based on the Kodkod
630 relational model finder. See src/HOL/Tools/Nitpick and
631 src/HOL/Nitpick_Examples.
633 * New commands 'code_pred' and 'values' to invoke the predicate
634 compiler and to enumerate values of inductive predicates.
636 * A tabled implementation of the reflexive transitive closure.
638 * New implementation of quickcheck uses generic code generator;
639 default generators are provided for all suitable HOL types, records
640 and datatypes. Old quickcheck can be re-activated importing theory
641 Library/SML_Quickcheck.
643 * New testing tool Mirabelle for automated proof tools. Applies
644 several tools and tactics like sledgehammer, metis, or quickcheck, to
645 every proof step in a theory. To be used in batch mode via the
648 * New proof method "sos" (sum of squares) for nonlinear real
649 arithmetic (originally due to John Harison). It requires theory
650 Library/Sum_Of_Squares. It is not a complete decision procedure but
651 works well in practice on quantifier-free real arithmetic with +, -,
652 *, ^, =, <= and <, i.e. boolean combinations of equalities and
653 inequalities between polynomials. It makes use of external
654 semidefinite programming solvers. Method "sos" generates a
655 certificate that can be pasted into the proof thus avoiding the need
656 to call an external tool every time the proof is checked. See
657 src/HOL/Library/Sum_Of_Squares.
659 * New method "linarith" invokes existing linear arithmetic decision
662 * New command 'atp_minimal' reduces result produced by Sledgehammer.
664 * New Sledgehammer option "Full Types" in Proof General settings menu.
665 Causes full type information to be output to the ATPs. This slows
666 ATPs down considerably but eliminates a source of unsound "proofs"
669 * New method "metisFT": A version of metis that uses full type
670 information in order to avoid failures of proof reconstruction.
672 * New evaluator "approximate" approximates an real valued term using
673 the same method as the approximation method.
675 * Method "approximate" now supports arithmetic expressions as
676 boundaries of intervals and implements interval splitting and Taylor
679 * ML antiquotation @{code_datatype} inserts definition of a datatype
680 generated by the code generator; e.g. see src/HOL/Predicate.thy.
682 * New theory SupInf of the supremum and infimum operators for sets of
685 * New theory Probability, which contains a development of measure
686 theory, eventually leading to Lebesgue integration and probability.
688 * Extended Multivariate Analysis to include derivation and Brouwer's
691 * Reorganization of number theory, INCOMPATIBILITY:
692 - new number theory development for nat and int, in theories Divides
693 and GCD as well as in new session Number_Theory
694 - some constants and facts now suffixed with _nat and _int
696 - former session NumberTheory now named Old_Number_Theory, including
697 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
698 - moved theory Pocklington from src/HOL/Library to
699 src/HOL/Old_Number_Theory
701 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
702 lcm of finite and infinite sets. It is shown that they form a complete
705 * Class semiring_div requires superclass no_zero_divisors and proof of
706 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
707 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
708 generalized to class semiring_div, subsuming former theorems
709 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
710 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
713 * Refinements to lattice classes and sets:
714 - less default intro/elim rules in locale variant, more default
715 intro/elim rules in class variant: more uniformity
716 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
718 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
720 - renamed ACI to inf_sup_aci
721 - new class "boolean_algebra"
722 - class "complete_lattice" moved to separate theory
723 "Complete_Lattice"; corresponding constants (and abbreviations)
724 renamed and with authentic syntax:
725 Set.Inf ~> Complete_Lattice.Inf
726 Set.Sup ~> Complete_Lattice.Sup
727 Set.INFI ~> Complete_Lattice.INFI
728 Set.SUPR ~> Complete_Lattice.SUPR
729 Set.Inter ~> Complete_Lattice.Inter
730 Set.Union ~> Complete_Lattice.Union
731 Set.INTER ~> Complete_Lattice.INTER
732 Set.UNION ~> Complete_Lattice.UNION
733 - authentic syntax for
736 - mere abbreviations:
739 Set.inter (for inf, formerly Set.Int)
740 Set.union (for sup, formerly Set.Un)
741 Complete_Lattice.Inter (for Inf)
742 Complete_Lattice.Union (for Sup)
743 Complete_Lattice.INTER (for INFI)
744 Complete_Lattice.UNION (for SUPR)
745 - object-logic definitions as far as appropriate
747 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
748 Un_subset_iff are explicitly deleted as default simp rules; then also
749 their lattice counterparts le_inf_iff and le_sup_iff have to be
750 deleted to achieve the desired effect.
752 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
753 rules by default any longer; the same applies to min_max.inf_absorb1
754 etc. INCOMPATIBILITY.
756 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
757 pred_set_conv by default. INCOMPATIBILITY.
759 * Power operations on relations and functions are now one dedicated
760 constant "compow" with infix syntax "^^". Power operation on
761 multiplicative monoids retains syntax "^" and is now defined generic
762 in class power. INCOMPATIBILITY.
764 * Relation composition "R O S" now has a more standard argument order:
765 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
766 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
767 break, since the O_assoc rule was not rewritten like this. Fix using
768 O_assoc[symmetric]. The same applies to the curried version "R OO S".
770 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
771 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
774 * Most rules produced by inductive and datatype package have mandatory
775 prefixes. INCOMPATIBILITY.
777 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
778 the attribute of the same name. Each of the theorems in the list
779 DERIV_intros assumes composition with an additional function and
780 matches a variable to the derivative, which has to be solved by the
781 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
782 of most elementary terms. Former Maclauren.DERIV_tac and
783 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
786 * Code generator attributes follow the usual underscore convention:
787 code_unfold replaces code unfold
788 code_post replaces code post
793 sizechange -> size_change
794 induct_scheme -> induction_schema
797 * Discontinued abbreviation "arbitrary" of constant "undefined".
798 INCOMPATIBILITY, use "undefined" directly.
801 Suc_eq_add_numeral_1 -> Suc_eq_plus1
802 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
803 Suc_plus1 -> Suc_eq_plus1
804 *anti_sym -> *antisym*
805 vector_less_eq_def -> vector_le_def
808 * Added theorem List.map_map as [simp]. Removed List.map_compose.
811 * Removed predicate "M hassize n" (<--> card M = n & finite M).
817 * Theory Representable defines a class "rep" of domains that are
818 representable (via an ep-pair) in the universal domain type "udom".
819 Instances are provided for all type constructors defined in HOLCF.
821 * The 'new_domain' command is a purely definitional version of the
822 domain package, for representable domains. Syntax is identical to the
823 old domain package. The 'new_domain' package also supports indirect
824 recursion using previously-defined type constructors. See
825 src/HOLCF/ex/New_Domain.thy for examples.
827 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
828 on the left-hand side of an equation, and then performs
829 simplification. Rewriting is done using rules declared with the
830 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
831 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
833 * The pattern-match compiler in 'fixrec' can now handle constructors
834 with HOL function types. Pattern-match combinators for the Pair
835 constructor are pre-configured.
837 * The 'fixrec' package now produces better fixed-point induction rules
838 for mutually-recursive definitions: Induction rules have conclusions
839 of the form "P foo bar" instead of "P <foo, bar>".
841 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
842 been renamed to "below". The name "below" now replaces "less" in many
843 theorem names. (Legacy theorem names using "less" are still supported
846 * The 'fixrec' package now supports "bottom patterns". Bottom
847 patterns can be used to generate strictness rules, or to make
848 functions more strict (much like the bang-patterns supported by the
849 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
855 * Support for Poly/ML 5.3.0, with improved reporting of compiler
856 errors and run-time exceptions, including detailed source positions.
858 * Structure Name_Space (formerly NameSpace) now manages uniquely
859 identified entries, with some additional information such as source
860 position, logical grouping etc.
862 * Theory and context data is now introduced by the simplified and
863 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
864 to be pure, but the old TheoryDataFun for mutable data (with explicit
865 copy operation) is still available for some time.
867 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
868 provides a high-level programming interface to synchronized state
869 variables with atomic update. This works via pure function
870 application within a critical section -- its runtime should be as
871 short as possible; beware of deadlocks if critical code is nested,
872 either directly or indirectly via other synchronized variables!
874 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
875 wraps raw ML references, explicitly indicating their non-thread-safe
876 behaviour. The Isar toplevel keeps this structure open, to
877 accommodate Proof General as well as quick and dirty interactive
878 experiments with references.
880 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
881 parallel tactical reasoning.
883 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
884 are similar to SUBPROOF, but are slightly more flexible: only the
885 specified parts of the subgoal are imported into the context, and the
886 body tactic may introduce new subgoals and schematic variables.
888 * Old tactical METAHYPS, which does not observe the proof context, has
889 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
890 or Subgoal.FOCUS etc.
892 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
893 functors have their own ML name space there is no point to mark them
894 separately.) Minor INCOMPATIBILITY.
896 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
898 * Renamed several structures FooBar to Foo_Bar. Occasional,
901 * Operations of structure Skip_Proof no longer require quick_and_dirty
902 mode, which avoids critical setmp.
904 * Eliminated old Attrib.add_attributes, Method.add_methods and related
905 combinators for "args". INCOMPATIBILITY, need to use simplified
906 Attrib/Method.setup introduced in Isabelle2009.
908 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
909 back on global_simpset_of, global_claset_of, global_clasimpset_of as
910 last resort. INCOMPATIBILITY.
912 * Display.pretty_thm now requires a proper context (cf. former
913 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
914 or even Display.pretty_thm_without_context as last resort.
917 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
918 Syntax.pretty_typ/term directly, preferably with proper context
919 instead of global theory.
924 * Further fine tuning of parallel proof checking, scales up to 8 cores
925 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
928 * Support for additional "Isabelle components" via etc/components, see
929 also the system manual.
931 * The isabelle makeall tool now operates on all components with
932 IsaMakefile, not just hardwired "logics".
934 * Removed "compress" option from isabelle-process and isabelle usedir;
935 this is always enabled.
937 * Discontinued support for Poly/ML 4.x versions.
939 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
940 on a given logic image. This requires the lighttpd webserver and is
941 currently supported on Linux only.
945 New in Isabelle2009 (April 2009)
946 --------------------------------
950 * Simplified main Isabelle executables, with less surprises on
951 case-insensitive file-systems (such as Mac OS).
953 - The main Isabelle tool wrapper is now called "isabelle" instead of
956 - The former "isabelle" alias for "isabelle-process" has been
957 removed (should rarely occur to regular users).
959 - The former "isabelle-interface" and its alias "Isabelle" have been
960 removed (interfaces are now regular Isabelle tools).
962 Within scripts and make files, the Isabelle environment variables
963 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
964 respectively. (The latter are still available as legacy feature.)
966 The old isabelle-interface wrapper could react in confusing ways if
967 the interface was uninstalled or changed otherwise. Individual
968 interface tool configuration is now more explicit, see also the
969 Isabelle system manual. In particular, Proof General is now available
970 via "isabelle emacs".
972 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
973 purge installed copies of Isabelle executables and re-run "isabelle
974 install -p ...", or use symlinks.
976 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
977 old ~/isabelle, which was slightly non-standard and apt to cause
978 surprises on case-insensitive file-systems (such as Mac OS).
980 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
981 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
982 care is required when using older releases of Isabelle. Note that
983 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
984 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
986 * Proofs of fully specified statements are run in parallel on
987 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
988 a regular 4-core machine, if the initial heap space is made reasonably
989 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
991 * The main reference manuals ("isar-ref", "implementation", and
992 "system") have been updated and extended. Formally checked references
993 as hyperlinks are now available uniformly.
998 * Complete re-implementation of locales. INCOMPATIBILITY in several
999 respects. The most important changes are listed below. See the
1000 Tutorial on Locales ("locales" manual) for details.
1002 - In locale expressions, instantiation replaces renaming. Parameters
1003 must be declared in a for clause. To aid compatibility with previous
1004 parameter inheritance, in locale declarations, parameters that are not
1005 'touched' (instantiation position "_" or omitted) are implicitly added
1006 with their syntax at the beginning of the for clause.
1008 - Syntax from abbreviations and definitions in locales is available in
1009 locale expressions and context elements. The latter is particularly
1010 useful in locale declarations.
1012 - More flexible mechanisms to qualify names generated by locale
1013 expressions. Qualifiers (prefixes) may be specified in locale
1014 expressions, and can be marked as mandatory (syntax: "name!:") or
1015 optional (syntax "name?:"). The default depends for plain "name:"
1016 depends on the situation where a locale expression is used: in
1017 commands 'locale' and 'sublocale' prefixes are optional, in
1018 'interpretation' and 'interpret' prefixes are mandatory. The old
1019 implicit qualifiers derived from the parameter names of a locale are
1020 no longer generated.
1022 - Command "sublocale l < e" replaces "interpretation l < e". The
1023 instantiation clause in "interpretation" and "interpret" (square
1024 brackets) is no longer available. Use locale expressions.
1026 - When converting proof scripts, mandatory qualifiers in
1027 'interpretation' and 'interpret' should be retained by default, even
1028 if this is an INCOMPATIBILITY compared to former behavior. In the
1029 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1030 in locale expressions range over a single locale instance only.
1032 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1033 In existing theorem specifications replace the includes element by the
1034 respective context elements of the included locale, omitting those
1035 that are already present in the theorem specification. Multiple
1036 assume elements of a locale should be replaced by a single one
1037 involving the locale predicate. In the proof body, declarations (most
1038 notably theorems) may be regained by interpreting the respective
1039 locales in the proof context as required (command "interpret").
1041 If using "includes" in replacement of a target solely because the
1042 parameter types in the theorem are not as general as in the target,
1043 consider declaring a new locale with additional type constraints on
1044 the parameters (context element "constrains").
1046 - Discontinued "locale (open)". INCOMPATIBILITY.
1048 - Locale interpretation commands no longer attempt to simplify goal.
1049 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1050 methods intro_locales and unfold_locales to clarify.
1052 - Locale interpretation commands no longer accept interpretation
1053 attributes. INCOMPATIBILITY.
1055 * Class declaration: so-called "base sort" must not be given in import
1056 list any longer, but is inferred from the specification. Particularly
1063 class foo = type + ...
1065 * Class target: global versions of theorems stemming do not carry a
1066 parameter prefix any longer. INCOMPATIBILITY.
1068 * Class 'instance' command no longer accepts attached definitions.
1069 INCOMPATIBILITY, use proper 'instantiation' target instead.
1071 * Recovered hiding of consts, which was accidentally broken in
1072 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1073 makes c inaccessible; consider using ``hide (open) const c'' instead.
1075 * Slightly more coherent Pure syntax, with updated documentation in
1076 isar-ref manual. Removed locales meta_term_syntax and
1077 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1078 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1079 directly in regular applications.
1081 * There is a new syntactic category "float_const" for signed decimal
1082 fractions (e.g. 123.45 or -123.45).
1084 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1085 interface with 'setup' command instead.
1087 * Command 'local_setup' is similar to 'setup', but operates on a local
1090 * The 'axiomatization' command now only works within a global theory
1091 context. INCOMPATIBILITY.
1093 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1094 hypotheses. Sorts required in the course of reasoning need to be
1095 covered by the constraints in the initial statement, completed by the
1096 type instance information of the background theory. Non-trivial sort
1097 hypotheses, which rarely occur in practice, may be specified via
1098 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1100 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1102 The result contains an implicit sort hypotheses as before --
1103 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1106 * Generalized Isar history, with support for linear undo, direct state
1109 * Changed defaults for unify configuration options:
1111 unify_trace_bound = 50 (formerly 25)
1112 unify_search_bound = 60 (formerly 30)
1114 * Different bookkeeping for code equations (INCOMPATIBILITY):
1116 a) On theory merge, the last set of code equations for a particular
1117 constant is taken (in accordance with the policy applied by other
1118 parts of the code generator framework).
1120 b) Code equations stemming from explicit declarations (e.g. code
1121 attribute) gain priority over default code equations stemming
1122 from definition, primrec, fun etc.
1124 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1126 * Unified theorem tables for both code generators. Thus [code
1127 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1129 * Command 'find_consts' searches for constants based on type and name
1132 find_consts "_ => bool"
1134 By default, matching is against subtypes, but it may be restricted to
1135 the whole type. Searching by name is possible. Multiple queries are
1136 conjunctive and queries may be negated by prefixing them with a
1139 find_consts strict: "_ => bool" name: "Int" -"int => int"
1141 * New 'find_theorems' criterion "solves" matches theorems that
1142 directly solve the current goal (modulo higher-order unification).
1144 * Auto solve feature for main theorem statements: whenever a new goal
1145 is stated, "find_theorems solves" is called; any theorems that could
1146 solve the lemma directly are listed as part of the goal state.
1147 Cf. associated options in Proof General Isabelle settings menu,
1148 enabled by default, with reasonable timeout for pathological cases of
1149 higher-order unification.
1152 *** Document preparation ***
1154 * Antiquotation @{lemma} now imitates a regular terminal proof,
1155 demanding keyword 'by' and supporting the full method expression
1156 syntax just like the Isar command 'by'.
1161 * Integrated main parts of former image HOL-Complex with HOL. Entry
1162 points Main and Complex_Main remain as before.
1164 * Logic image HOL-Plain provides a minimal HOL with the most important
1165 tools available (inductive, datatype, primrec, ...). This facilitates
1166 experimentation and tool development. Note that user applications
1167 (and library theories) should never refer to anything below theory
1170 * Logic image HOL-Main stops at theory Main, and thus facilitates
1171 experimentation due to shorter build times.
1173 * Logic image HOL-NSA contains theories of nonstandard analysis which
1174 were previously part of former HOL-Complex. Entry point Hyperreal
1175 remains valid, but theories formerly using Complex_Main should now use
1176 new entry point Hypercomplex.
1178 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1179 Posix processes. Avoids potentially expensive forking of the ML
1180 process. New thread-based implementation also works on non-Unix
1181 platforms (Cygwin). Provers are no longer hardwired, but defined
1182 within the theory via plain ML wrapper functions. Basic Sledgehammer
1183 commands are covered in the isar-ref manual.
1185 * Wrapper scripts for remote SystemOnTPTP service allows to use
1186 sledgehammer without local ATP installation (Vampire etc.). Other
1187 provers may be included via suitable ML wrappers, see also
1188 src/HOL/ATP_Linkup.thy.
1190 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1193 * The metis method no longer fails because the theorem is too trivial
1194 (contains the empty clause).
1196 * The metis method now fails in the usual manner, rather than raising
1197 an exception, if it determines that it cannot prove the theorem.
1199 * Method "coherent" implements a prover for coherent logic (see also
1200 src/Tools/coherent.ML).
1202 * Constants "undefined" and "default" replace "arbitrary". Usually
1203 "undefined" is the right choice to replace "arbitrary", though
1204 logically there is no difference. INCOMPATIBILITY.
1206 * Command "value" now integrates different evaluation mechanisms. The
1207 result of the first successful evaluation mechanism is printed. In
1208 square brackets a particular named evaluation mechanisms may be
1209 specified (currently, [SML], [code] or [nbe]). See further
1210 src/HOL/ex/Eval_Examples.thy.
1212 * Normalization by evaluation now allows non-leftlinear equations.
1213 Declare with attribute [code nbe].
1215 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1216 as the structured Isar versions "cases" and "induct", cf. the
1217 corresponding "cases" and "induct" attributes. Mutual induction rules
1218 are now presented as a list of individual projections
1219 (e.g. foo_bar.inducts for types foo and bar); the old format with
1220 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1221 rare situations a different rule is selected --- notably nested tuple
1222 elimination instead of former prod.exhaust: use explicit (case_tac t
1223 rule: prod.exhaust) here.
1225 * Attributes "cases", "induct", "coinduct" support "del" option.
1227 * Removed fact "case_split_thm", which duplicates "case_split".
1229 * The option datatype has been moved to a new theory Option. Renamed
1230 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1232 * New predicate "strict_mono" classifies strict functions on partial
1233 orders. With strict functions on linear orders, reasoning about
1234 (in)equalities is facilitated by theorems "strict_mono_eq",
1235 "strict_mono_less_eq" and "strict_mono_less".
1237 * Some set operations are now proper qualified constants with
1238 authentic syntax. INCOMPATIBILITY:
1249 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1252 * Auxiliary class "itself" has disappeared -- classes without any
1253 parameter are treated as expected by the 'class' command.
1255 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1257 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1258 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1260 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1261 method "approximation". It proves formulas on real values by using
1262 interval arithmetic. In the formulas are also the transcendental
1263 functions sin, cos, tan, atan, ln, exp and the constant pi are
1264 allowed. For examples see
1265 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1267 * Theory "Reflection" now resides in HOL/Library.
1269 * Entry point to Word library now simply named "Word".
1272 * Made source layout more coherent with logical distribution
1275 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1276 src/HOL/Library/Code_Message.thy ~> src/HOL/
1277 src/HOL/Library/GCD.thy ~> src/HOL/
1278 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1279 src/HOL/Library/Parity.thy ~> src/HOL/
1280 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1281 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1282 src/HOL/Real/Lubs.thy ~> src/HOL/
1283 src/HOL/Real/PReal.thy ~> src/HOL/
1284 src/HOL/Real/Rational.thy ~> src/HOL/
1285 src/HOL/Real/RComplete.thy ~> src/HOL/
1286 src/HOL/Real/RealDef.thy ~> src/HOL/
1287 src/HOL/Real/RealPow.thy ~> src/HOL/
1288 src/HOL/Real/Real.thy ~> src/HOL/
1289 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1290 src/HOL/Complex/Complex.thy ~> src/HOL/
1291 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1292 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1293 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1294 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1295 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1296 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1297 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1298 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1299 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1300 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1301 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1302 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1303 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1304 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1305 src/HOL/Real/Float ~> src/HOL/Library/
1306 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1307 src/HOL/Real/RealVector.thy ~> src/HOL/
1309 src/HOL/arith_data.ML ~> src/HOL/Tools
1310 src/HOL/hologic.ML ~> src/HOL/Tools
1311 src/HOL/simpdata.ML ~> src/HOL/Tools
1312 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1313 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1314 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1315 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1316 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1317 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1318 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1320 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1321 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1322 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1323 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1324 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1325 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1327 * If methods "eval" and "evaluation" encounter a structured proof
1328 state with !!/==>, only the conclusion is evaluated to True (if
1329 possible), avoiding strange error messages.
1331 * Method "sizechange" automates termination proofs using (a
1332 modification of) the size-change principle. Requires SAT solver. See
1333 src/HOL/ex/Termination.thy for examples.
1335 * Simplifier: simproc for let expressions now unfolds if bound
1336 variable occurs at most once in let expression body. INCOMPATIBILITY.
1338 * Method "arith": Linear arithmetic now ignores all inequalities when
1339 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1341 * New attribute "arith" for facts that should always be used
1342 automatically by arithmetic. It is intended to be used locally in
1345 assumes [arith]: "x > 0"
1347 Global usage is discouraged because of possible performance impact.
1349 * New classes "top" and "bot" with corresponding operations "top" and
1350 "bot" in theory Orderings; instantiation of class "complete_lattice"
1351 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1353 * Changed definition lemma "less_fun_def" in order to provide an
1354 instance for preorders on functions; use lemma "less_le" instead.
1357 * Theory Orderings: class "wellorder" moved here, with explicit
1358 induction rule "less_induct" as assumption. For instantiation of
1359 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1362 * Theory Orderings: added class "preorder" as superclass of "order".
1363 INCOMPATIBILITY: Instantiation proofs for order, linorder
1364 etc. slightly changed. Some theorems named order_class.* now named
1367 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1370 * Theory Finite_Set: added a new fold combinator of type
1372 ('a => 'b => 'b) => 'b => 'a set => 'b
1374 Occasionally this is more convenient than the old fold combinator
1375 which is now defined in terms of the new one and renamed to
1378 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1379 and "ring_simps" have been replaced by "algebra_simps" (which can be
1380 extended with further lemmas!). At the moment both still exist but
1381 the former will disappear at some point.
1383 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1384 class recpower. Type-specific simp rules for various recpower types
1385 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1387 rat_power_0 -> power_0
1388 rat_power_Suc -> power_Suc
1389 realpow_0 -> power_0
1390 realpow_Suc -> power_Suc
1391 complexpow_0 -> power_0
1392 complexpow_Suc -> power_Suc
1393 power_poly_0 -> power_0
1394 power_poly_Suc -> power_Suc
1396 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1397 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1398 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1399 of lemmas from Divides has been generalized from nat to class
1400 semiring_div. INCOMPATIBILITY. This involves the following theorem
1401 renames resulting from duplicate elimination:
1403 dvd_def_mod ~> dvd_eq_mod_eq_0
1404 zero_dvd_iff ~> dvd_0_left_iff
1405 dvd_0 ~> dvd_0_right
1406 DIVISION_BY_ZERO_DIV ~> div_by_0
1407 DIVISION_BY_ZERO_MOD ~> mod_by_0
1408 mult_div ~> div_mult_self2_is_id
1409 mult_mod ~> mod_mult_self2_is_0
1411 * Theory IntDiv: removed many lemmas that are instances of class-based
1412 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1413 rename old lemmas as follows:
1415 dvd_diff -> nat_dvd_diff
1416 dvd_zminus_iff -> dvd_minus_iff
1417 mod_add1_eq -> mod_add_eq
1418 mod_mult1_eq -> mod_mult_right_eq
1419 mod_mult1_eq' -> mod_mult_left_eq
1420 mod_mult_distrib_mod -> mod_mult_eq
1421 nat_mod_add_left_eq -> mod_add_left_eq
1422 nat_mod_add_right_eq -> mod_add_right_eq
1423 nat_mod_div_trivial -> mod_div_trivial
1424 nat_mod_mod_trivial -> mod_mod_trivial
1425 zdiv_zadd_self1 -> div_add_self1
1426 zdiv_zadd_self2 -> div_add_self2
1427 zdiv_zmult_self1 -> div_mult_self2_is_id
1428 zdiv_zmult_self2 -> div_mult_self1_is_id
1429 zdvd_triv_left -> dvd_triv_left
1430 zdvd_triv_right -> dvd_triv_right
1431 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1432 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1433 zmod_zadd_left_eq -> mod_add_left_eq
1434 zmod_zadd_right_eq -> mod_add_right_eq
1435 zmod_zadd_self1 -> mod_add_self1
1436 zmod_zadd_self2 -> mod_add_self2
1437 zmod_zadd1_eq -> mod_add_eq
1438 zmod_zdiff1_eq -> mod_diff_eq
1439 zmod_zdvd_zmod -> mod_mod_cancel
1440 zmod_zmod_cancel -> mod_mod_cancel
1441 zmod_zmult_self1 -> mod_mult_self2_is_0
1442 zmod_zmult_self2 -> mod_mult_self1_is_0
1445 zdvd_abs1 -> abs_dvd_iff
1446 zdvd_abs2 -> dvd_abs_iff
1447 zdvd_refl -> dvd_refl
1448 zdvd_trans -> dvd_trans
1449 zdvd_zadd -> dvd_add
1450 zdvd_zdiff -> dvd_diff
1451 zdvd_zminus_iff -> dvd_minus_iff
1452 zdvd_zminus2_iff -> minus_dvd_iff
1453 zdvd_zmultD -> dvd_mult_right
1454 zdvd_zmultD2 -> dvd_mult_left
1455 zdvd_zmult_mono -> mult_dvd_mono
1456 zdvd_0_right -> dvd_0_right
1457 zdvd_0_left -> dvd_0_left_iff
1458 zdvd_1_left -> one_dvd
1459 zminus_dvd_iff -> minus_dvd_iff
1461 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1463 * The real numbers offer decimal input syntax: 12.34 is translated
1464 into 1234/10^2. This translation is not reversed upon output.
1466 * Theory Library/Polynomial defines an abstract type 'a poly of
1467 univariate polynomials with coefficients of type 'a. In addition to
1468 the standard ring operations, it also supports div and mod. Code
1469 generation is also supported, using list-style constructors.
1471 * Theory Library/Inner_Product defines a class of real_inner for real
1472 inner product spaces, with an overloaded operation inner :: 'a => 'a
1473 => real. Class real_inner is a subclass of real_normed_vector from
1476 * Theory Library/Product_Vector provides instances for the product
1477 type 'a * 'b of several classes from RealVector and Inner_Product.
1478 Definitions of addition, subtraction, scalar multiplication, norms,
1479 and inner products are included.
1481 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1482 addition to the field operations, numerals and case syntax are also
1485 * Theory Library/Diagonalize provides constructive version of Cantor's
1486 first diagonalization argument.
1488 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1489 zlcm (for int); carried together from various gcd/lcm developements in
1490 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1491 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1492 may recover tupled syntax as follows:
1494 hide (open) const gcd
1495 abbreviation gcd where
1496 "gcd == (%(a, b). GCD.gcd a b)"
1498 GCD.gcd ("gcd '(_, _')")
1500 The same works for lcm, zgcd, zlcm.
1502 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1503 instantiations for algebraic structures. Removed some duplicate
1504 theorems. Changes in simp rules. INCOMPATIBILITY.
1506 * ML antiquotation @{code} takes a constant as argument and generates
1507 corresponding code in background and inserts name of the corresponding
1508 resulting ML value/function/datatype constructor binding in place.
1509 All occurrences of @{code} with a single ML block are generated
1510 simultaneously. Provides a generic and safe interface for
1511 instrumentalizing code generation. See
1512 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1513 In future you ought to refrain from ad-hoc compiling generated SML
1514 code on the ML toplevel. Note that (for technical reasons) @{code}
1515 cannot refer to constants for which user-defined serializations are
1516 set. Refer to the corresponding ML counterpart directly in that
1519 * Command 'rep_datatype': instead of theorem names the command now
1520 takes a list of terms denoting the constructors of the type to be
1521 represented as datatype. The characteristic theorems have to be
1522 proven. INCOMPATIBILITY. Also observe that the following theorems
1523 have disappeared in favour of existing ones:
1525 unit_induct ~> unit.induct
1526 prod_induct ~> prod.induct
1527 sum_induct ~> sum.induct
1528 Suc_Suc_eq ~> nat.inject
1529 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1534 * New locales for orders and lattices where the equivalence relation
1535 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1536 locales use a record structure with field eq for the equivalence.
1538 * New theory of factorial domains.
1540 * Units_l_inv and Units_r_inv are now simp rules by default.
1541 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1542 and/or r_inv will now also require deletion of these lemmas.
1544 * Renamed the following theorems, INCOMPATIBILITY:
1546 UpperD ~> Upper_memD
1547 LowerD ~> Lower_memD
1548 least_carrier ~> least_closed
1549 greatest_carrier ~> greatest_closed
1550 greatest_Lower_above ~> greatest_Lower_below
1551 one_zero ~> carrier_one_zero
1552 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1557 * Nominal datatypes can now contain type-variables.
1559 * Commands 'nominal_inductive' and 'equivariance' work with local
1562 * Nominal primrec can now works with local theory targets and its
1563 specification syntax now conforms to the general format as seen in
1566 * Method "perm_simp" honours the standard simplifier attributes
1567 (no_asm), (no_asm_use) etc.
1569 * The new predicate #* is defined like freshness, except that on the
1570 left hand side can be a set or list of atoms.
1572 * Experimental command 'nominal_inductive2' derives strong induction
1573 principles for inductive definitions. In contrast to
1574 'nominal_inductive', which can only deal with a fixed number of
1575 binders, it can deal with arbitrary expressions standing for sets of
1576 atoms to be avoided. The only inductive definition we have at the
1577 moment that needs this generalisation is the typing rule for Lets in
1580 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1581 -----------------------------------------------------------------
1582 Gamma |- Let x be t1 in t2 : T2
1584 In this rule one wants to avoid all the binders that are introduced by
1585 "close Gamma T1". We are looking for other examples where this
1586 feature might be useful. Please let us know.
1591 * Reimplemented the simplification procedure for proving continuity
1592 subgoals. The new simproc is extensible; users can declare additional
1593 continuity introduction rules with the attribute [cont2cont].
1595 * The continuity simproc now uses a different introduction rule for
1596 solving continuity subgoals on terms with lambda abstractions. In
1597 some rare cases the new simproc may fail to solve subgoals that the
1598 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1599 Potential INCOMPATIBILITY.
1601 * Command 'fixrec': specification syntax now conforms to the general
1602 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1603 examples. INCOMPATIBILITY.
1608 * Proof of Zorn's Lemma for partial orders.
1613 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1614 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1615 depends on multithreading, so timouts will not work before Poly/ML
1618 * High-level support for concurrent ML programming, see
1619 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1620 particularly convenient to organize independent functional
1621 computations. The concept of "synchronized variables" provides a
1622 higher-order interface for components with shared state, avoiding the
1623 delicate details of mutexes and condition variables. (Requires
1624 Poly/ML 5.2.1 or later.)
1626 * ML bindings produced via Isar commands are stored within the Isar
1627 context (theory or proof). Consequently, commands like 'use' and 'ML'
1628 become thread-safe and work with undo as expected (concerning
1629 top-level bindings, not side-effects on global references).
1630 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1631 compiler at runtime; really global bindings need to be given outside a
1632 theory. (Requires Poly/ML 5.2 or later.)
1634 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1635 context. Top-level ML bindings are stored within the proof context in
1636 a purely sequential fashion, disregarding the nested proof structure.
1637 ML bindings introduced by 'ML_prf' are discarded at the end of the
1638 proof. (Requires Poly/ML 5.2 or later.)
1640 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1641 and Method.setup, as well as Isar commands 'attribute_setup' and
1642 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1643 existing code accordingly, or use plain 'setup' together with old
1646 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1647 to 'a -> thm, while results are always tagged with an authentic oracle
1648 name. The Isar command 'oracle' is now polymorphic, no argument type
1649 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1650 accordingly. Note that extra performance may be gained by producing
1651 the cterm carefully, avoiding slow Thm.cterm_of.
1653 * Simplified interface for defining document antiquotations via
1654 ThyOutput.antiquotation, ThyOutput.output, and optionally
1655 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1656 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1659 * More systematic treatment of long names, abstract name bindings, and
1660 name space operations. Basic operations on qualified names have been
1661 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1662 Long_Name.append. Old type bstring has been mostly replaced by
1663 abstract type binding (see structure Binding), which supports precise
1664 qualification by packages and local theory targets, as well as proper
1665 tracking of source positions. INCOMPATIBILITY, need to wrap old
1666 bstring values into Binding.name, or better pass through abstract
1667 bindings everywhere. See further src/Pure/General/long_name.ML,
1668 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1670 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1671 LocalTheory.note etc.) now refer to the *full* internal name, not the
1672 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1674 * Disposed old type and term read functions (Sign.read_def_typ,
1675 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1676 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1677 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1678 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1679 resort for legacy applications.
1681 * Disposed old declarations, tactics, tactic combinators that refer to
1682 the simpset or claset of an implicit theory (such as Addsimps,
1683 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1684 embedded ML text, or local_simpset_of with a proper context passed as
1685 explicit runtime argument.
1687 * Rules and tactics that read instantiations (read_instantiate,
1688 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1689 context, which is required for parsing and type-checking. Moreover,
1690 the variables are specified as plain indexnames, not string encodings
1691 thereof. INCOMPATIBILITY.
1693 * Generic Toplevel.add_hook interface allows to analyze the result of
1694 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1695 for theorem dependency output of transactions resulting in a new
1698 * ML antiquotations: block-structured compilation context indicated by
1699 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1701 @{binding name} - basic name binding
1702 @{let ?pat = term} - term abbreviation (HO matching)
1703 @{note name = fact} - fact abbreviation
1704 @{thm fact} - singleton fact (with attributes)
1705 @{thms fact} - general fact (with attributes)
1706 @{lemma prop by method} - singleton goal
1707 @{lemma prop by meth1 meth2} - singleton goal
1708 @{lemma prop1 ... propN by method} - general goal
1709 @{lemma prop1 ... propN by meth1 meth2} - general goal
1710 @{lemma (open) ...} - open derivation
1715 * The Isabelle "emacs" tool provides a specific interface to invoke
1716 Proof General / Emacs, with more explicit failure if that is not
1717 installed (the old isabelle-interface script silently falls back on
1718 isabelle-process). The PROOFGENERAL_HOME setting determines the
1719 installation location of the Proof General distribution.
1721 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1722 the Isabelle process into a JVM/Scala application. See
1723 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1724 process wrapper has been discontinued.)
1726 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1728 * Various status messages (with exact source position information) are
1729 emitted, if proper markup print mode is enabled. This allows
1730 user-interface components to provide detailed feedback on internal
1735 New in Isabelle2008 (June 2008)
1736 -------------------------------
1740 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1741 and updated, with formally checked references as hyperlinks.
1743 * Theory loader: use_thy (and similar operations) no longer set the
1744 implicit ML context, which was occasionally hard to predict and in
1745 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1746 provides a proper context already.
1748 * Theory loader: old-style ML proof scripts being *attached* to a thy
1749 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1750 'use' within a theory file will do the job.
1752 * Name space merge now observes canonical order, i.e. the second space
1753 is inserted into the first one, while existing entries in the first
1754 space take precedence. INCOMPATIBILITY in rare situations, may try to
1755 swap theory imports.
1757 * Syntax: symbol \<chi> is now considered a letter. Potential
1758 INCOMPATIBILITY in identifier syntax etc.
1760 * Outer syntax: string tokens no longer admit escaped white space,
1761 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1762 white space without escapes.
1764 * Outer syntax: string tokens may contain arbitrary character codes
1765 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1771 * Context-dependent token translations. Default setup reverts locally
1772 fixed variables, and adds hilite markup for undeclared frees.
1774 * Unused theorems can be found using the new command 'unused_thms'.
1775 There are three ways of invoking it:
1778 Only finds unused theorems in the current theory.
1780 (2) unused_thms thy_1 ... thy_n -
1781 Finds unused theorems in the current theory and all of its ancestors,
1782 excluding the theories thy_1 ... thy_n and all of their ancestors.
1784 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1785 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1786 their ancestors, excluding the theories thy_1 ... thy_n and all of
1789 In order to increase the readability of the list produced by
1790 unused_thms, theorems that have been created by a particular instance
1791 of a theory command such as 'inductive' or 'function' are considered
1792 to belong to the same "group", meaning that if at least one theorem in
1793 this group is used, the other theorems in the same group are no longer
1794 reported as unused. Moreover, if all theorems in the group are
1795 unused, only one theorem in the group is displayed.
1797 Note that proof objects have to be switched on in order for
1798 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1799 usually the case when using Proof General with the default settings).
1801 * Authentic naming of facts disallows ad-hoc overwriting of previous
1802 theorems within the same name space. INCOMPATIBILITY, need to remove
1803 duplicate fact bindings, or even accidental fact duplications. Note
1804 that tools may maintain dynamically scoped facts systematically, using
1805 PureThy.add_thms_dynamic.
1807 * Command 'hide' now allows to hide from "fact" name space as well.
1809 * Eliminated destructive theorem database, simpset, claset, and
1810 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1811 update of theories within ML code.
1813 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1814 INCOMPATIBILITY, object-logics depending on former Pure require
1815 additional setup PureThy.old_appl_syntax_setup; object-logics
1816 depending on former CPure need to refer to Pure.
1818 * Commands 'use' and 'ML' are now purely functional, operating on
1819 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1820 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1823 * Command 'setup': discontinued implicit version with ML reference.
1825 * Instantiation target allows for simultaneous specification of class
1826 instance operations together with an instantiation proof.
1827 Type-checking phase allows to refer to class operations uniformly.
1828 See src/HOL/Complex/Complex.thy for an Isar example and
1829 src/HOL/Library/Eval.thy for an ML example.
1831 * Indexing of literal facts: be more serious about including only
1832 facts from the visible specification/proof context, but not the
1833 background context (locale etc.). Affects `prop` notation and method
1834 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1837 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1838 "(open)" option, which used to expose internal bound variables to the
1841 * Isar statements: removed obsolete case "rule_context".
1842 INCOMPATIBILITY, better use explicit fixes/assumes.
1844 * Locale proofs: default proof step now includes 'unfold_locales';
1845 hence 'proof' without argument may be used to unfold locale
1849 *** Document preparation ***
1851 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1852 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1853 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1854 spot); renamed link color from "darkblue" to "linkcolor" (default
1855 value unchanged, can be redefined via \definecolor); no longer sets
1856 "a4paper" option (unnecessary or even intrusive).
1858 * Antiquotation @{lemma A method} proves proposition A by the given
1859 method (either a method name or a method name plus (optional) method
1860 arguments in parentheses) and prints A just like @{prop A}.
1865 * New primrec package. Specification syntax conforms in style to
1866 definition/function/.... No separate induction rule is provided. The
1867 "primrec" command distinguishes old-style and new-style specifications
1868 by syntax. The former primrec package is now named OldPrimrecPackage.
1869 When adjusting theories, beware: constants stemming from new-style
1870 primrec specifications have authentic syntax.
1872 * Metis prover is now an order of magnitude faster, and also works
1873 with multithreading.
1875 * Metis: the maximum number of clauses that can be produced from a
1876 theorem is now given by the attribute max_clauses. Theorems that
1877 exceed this number are ignored, with a warning printed.
1879 * Sledgehammer no longer produces structured proofs by default. To
1880 enable, declare [[sledgehammer_full = true]]. Attributes
1881 reconstruction_modulus, reconstruction_sorts renamed
1882 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1884 * Method "induct_scheme" derives user-specified induction rules
1885 from well-founded induction and completeness of patterns. This factors
1886 out some operations that are done internally by the function package
1887 and makes them available separately. See
1888 src/HOL/ex/Induction_Scheme.thy for examples.
1890 * More flexible generation of measure functions for termination
1891 proofs: Measure functions can be declared by proving a rule of the
1892 form "is_measure f" and giving it the [measure_function] attribute.
1893 The "is_measure" predicate is logically meaningless (always true), and
1894 just guides the heuristic. To find suitable measure functions, the
1895 termination prover sets up the goal "is_measure ?f" of the appropriate
1896 type and generates all solutions by prolog-style backwards proof using
1899 This setup also deals with rules like
1901 "is_measure f ==> is_measure (list_size f)"
1903 which accommodates nested datatypes that recurse through lists.
1904 Similar rules are predeclared for products and option types.
1906 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1910 - Definitions of overloaded constants on sets have to be replaced by
1911 definitions on => and bool.
1913 - Some definitions of overloaded operators on sets can now be proved
1914 using the definitions of the operators on => and bool. Therefore,
1915 the following theorems have been renamed:
1917 subset_def -> subset_eq
1918 psubset_def -> psubset_eq
1919 set_diff_def -> set_diff_eq
1920 Compl_def -> Compl_eq
1921 Sup_set_def -> Sup_set_eq
1922 Inf_set_def -> Inf_set_eq
1923 sup_set_def -> sup_set_eq
1924 inf_set_def -> inf_set_eq
1926 - Due to the incompleteness of the HO unification algorithm, some
1927 rules such as subst may require manual instantiation, if some of
1928 the unknowns in the rule is a set.
1930 - Higher order unification and forward proofs:
1933 have "P (S::'a set)" <...>
1934 then have "EX S. P S" ..
1936 no longer works (due to the incompleteness of the HO unification
1937 algorithm) and must be replaced by the pattern
1944 - Calculational reasoning with subst (or similar rules):
1947 have "P (S::'a set)" <...>
1948 also have "S = T" <...>
1949 finally have "P T" .
1951 no longer works (for similar reasons as the previous example) and
1952 must be replaced by something like
1954 have "P (S::'a set)" <...>
1955 moreover have "S = T" <...>
1956 ultimately have "P T" by simp
1958 - Tactics or packages written in ML code:
1959 Code performing pattern matching on types via
1961 Type ("set", [T]) => ...
1963 must be rewritten. Moreover, functions like strip_type or
1964 binder_types no longer return the right value when applied to a
1967 T1 => ... => Tn => U => bool
1971 T1 => ... => Tn => U set
1973 * Merged theories Wellfounded_Recursion, Accessible_Part and
1974 Wellfounded_Relations to theory Wellfounded.
1976 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1978 * Class finite no longer treats UNIV as class parameter. Use class
1979 enum from theory Library/Enum instead to achieve a similar effect.
1982 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1983 and "Cons". INCOMPATIBILITY.
1985 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1986 Potential INCOMPATIBILITY.
1988 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1989 injective_fst_snd removed, use split_eta and prod_eqI instead.
1990 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1992 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1993 the same name in theory Orderings:
2003 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2004 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2005 and different variable names.
2007 * Library/Option_ord.thy: Canonical order on option type.
2009 * Library/RBT.thy: Red-black trees, an efficient implementation of
2012 * Library/Countable.thy: Type class for countable types.
2014 * Theory Int: The representation of numerals has changed. The infix
2015 operator BIT and the bit datatype with constructors B0 and B1 have
2016 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2017 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2018 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2021 * Theory Nat: definition of <= and < on natural numbers no longer
2022 depend on well-founded relations. INCOMPATIBILITY. Definitions
2023 le_def and less_def have disappeared. Consider lemmas not_less
2024 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2026 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2027 (whose purpose mainly is for various fold_set functionals) have been
2028 abandoned in favor of the existing algebraic classes
2029 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2030 lower_semilattice (resp. upper_semilattice) and linorder.
2033 * Theory Transitive_Closure: induct and cases rules now declare proper
2034 case_names ("base" and "step"). INCOMPATIBILITY.
2036 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2037 lattices. The form set-specific version is available as
2038 Inductive.lfp_ordinal_induct_set.
2040 * Renamed theorems "power.simps" to "power_int.simps".
2043 * Class semiring_div provides basic abstract properties of semirings
2044 with division and modulo operations. Subsumes former class dvd_mod.
2046 * Merged theories IntDef, Numeral and IntArith into unified theory
2047 Int. INCOMPATIBILITY.
2049 * Theory Library/Code_Index: type "index" now represents natural
2050 numbers rather than integers. INCOMPATIBILITY.
2052 * New class "uminus" with operation "uminus" (split of from class
2053 "minus" which now only has operation "minus", binary).
2056 * Constants "card", "internal_split", "option_map" now with authentic
2057 syntax. INCOMPATIBILITY.
2059 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2060 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2061 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2062 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2063 Sup_set_def, le_def, less_def, option_map_def now with object
2064 equality. INCOMPATIBILITY.
2066 * Records. Removed K_record, and replaced it by pure lambda term
2067 %x. c. The simplifier setup is now more robust against eta expansion.
2068 INCOMPATIBILITY: in cases explicitly referring to K_record.
2070 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2072 * Library/ListVector: new theory of arithmetic vector operations.
2074 * Library/Order_Relation: new theory of various orderings as sets of
2075 pairs. Defines preorders, partial orders, linear orders and
2076 well-orders on sets and on types.
2081 * Renamed some theories to allow to loading both ZF and HOL in the
2084 Datatype -> Datatype_ZF
2085 Inductive -> Inductive_ZF
2092 INCOMPATIBILITY: ZF theories that import individual theories below
2093 Main might need to be adapted. Regular theory Main is still
2094 available, as trivial extension of Main_ZF.
2099 * ML within Isar: antiquotation @{const name} or @{const
2100 name(typargs)} produces statically-checked Const term.
2102 * Functor NamedThmsFun: data is available to the user as dynamic fact
2103 (of the same name). Removed obsolete print command.
2105 * Removed obsolete "use_legacy_bindings" function.
2107 * The ``print mode'' is now a thread-local value derived from a global
2108 template (the former print_mode reference), thus access becomes
2109 non-critical. The global print_mode reference is for session
2110 management only; user-code should use print_mode_value,
2111 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2113 * Functions system/system_out provide a robust way to invoke external
2114 shell commands, with propagation of interrupts (requires Poly/ML
2115 5.2.1). Do not use OS.Process.system etc. from the basis library!
2120 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2121 in accordance with Proof General 3.7, which prefers GNU emacs.
2123 * isatool tty runs Isabelle process with plain tty interaction;
2124 optional line editor may be specified via ISABELLE_LINE_EDITOR
2125 setting, the default settings attempt to locate "ledit" and "rlwrap".
2127 * isatool browser now works with Cygwin as well, using general
2128 "javapath" function defined in Isabelle process environment.
2130 * YXML notation provides a simple and efficient alternative to
2131 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2132 isatool yxml as described in the Isabelle system manual.
2134 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2135 provides general wrapper for managing an Isabelle process in a robust
2136 fashion, with ``cooked'' output from stdin/stderr.
2138 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2139 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2141 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2142 way of changing the user's settings is via
2143 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2146 * Multithreading.max_threads := 0 refers to the number of actual CPU
2147 cores of the underlying machine, which is a good starting point for
2148 optimal performance tuning. The corresponding usedir option -M allows
2149 "max" as an alias for "0". WARNING: does not work on certain versions
2150 of Mac OS (with Poly/ML 5.1).
2152 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2153 adverse effect of Isabelle flooding interactive front-ends (notably
2154 ProofGeneral / XEmacs).
2158 New in Isabelle2007 (November 2007)
2159 -----------------------------------
2163 * More uniform information about legacy features, notably a
2164 warning/error of "Legacy feature: ...", depending on the state of the
2165 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2166 legacy features will disappear eventually.
2168 * Theory syntax: the header format ``theory A = B + C:'' has been
2169 discontinued in favour of ``theory A imports B C begin''. Use isatool
2170 fixheaders to convert existing theory files. INCOMPATIBILITY.
2172 * Theory syntax: the old non-Isar theory file format has been
2173 discontinued altogether. Note that ML proof scripts may still be used
2174 with Isar theories; migration is usually quite simple with the ML
2175 function use_legacy_bindings. INCOMPATIBILITY.
2177 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2178 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2181 * Theory loader: be more serious about observing the static theory
2182 header specifications (including optional directories), but not the
2183 accidental file locations of previously successful loads. The strict
2184 update policy of former update_thy is now already performed by
2185 use_thy, so the former has been removed; use_thys updates several
2186 theories simultaneously, just as 'imports' within a theory header
2187 specification, but without merging the results. Potential
2188 INCOMPATIBILITY: may need to refine theory headers and commands
2189 ROOT.ML which depend on load order.
2191 * Theory loader: optional support for content-based file
2192 identification, instead of the traditional scheme of full physical
2193 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2194 (cf. the system manual). The new scheme allows to work with
2195 non-finished theories in persistent session images, such that source
2196 files may be moved later on without requiring reloads.
2198 * Theory loader: old-style ML proof scripts being *attached* to a thy
2199 file (with the same base name as the theory) are considered a legacy
2200 feature, which will disappear eventually. Even now, the theory loader
2201 no longer maintains dependencies on such files.
2203 * Syntax: the scope for resolving ambiguities via type-inference is
2204 now limited to individual terms, instead of whole simultaneous
2205 specifications as before. This greatly reduces the complexity of the
2206 syntax module and improves flexibility by separating parsing and
2207 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2208 'fixes' etc.) are required in rare situations.
2210 * Syntax: constants introduced by new-style packages ('definition',
2211 'abbreviation' etc.) are passed through the syntax module in
2212 ``authentic mode''. This means that associated mixfix annotations
2213 really stick to such constants, independently of potential name space
2214 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2215 trees are represented slightly differently, may need to adapt syntax
2216 translations accordingly. Use CONST marker in 'translations' and
2217 @{const_syntax} antiquotation in 'parse_translation' etc.
2219 * Legacy goal package: reduced interface to the bare minimum required
2220 to keep existing proof scripts running. Most other user-level
2221 functions are now part of the OldGoals structure, which is *not* open
2222 by default (consider isatool expandshort before open OldGoals).
2223 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2224 these tend to cause confusion about the actual goal (!) context being
2225 used here, which is not necessarily the same as the_context().
2227 * Command 'find_theorems': supports "*" wild-card in "name:"
2228 criterion; "with_dups" option. Certain ProofGeneral versions might
2229 support a specific search form (see ProofGeneral/CHANGES).
2231 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2232 by default, which means that "prems" (and also "fixed variables") are
2233 suppressed from proof state output. Note that the ProofGeneral
2234 settings mechanism allows to change and save options persistently, but
2235 older versions of Isabelle will fail to start up if a negative prems
2238 * Local theory targets may be specified by non-nested blocks of
2239 ``context/locale/class ... begin'' followed by ``end''. The body may
2240 contain definitions, theorems etc., including any derived mechanism
2241 that has been implemented on top of these primitives. This concept
2242 generalizes the existing ``theorem (in ...)'' towards more versatility
2245 * Proof General interface: proper undo of final 'end' command;
2246 discontinued Isabelle/classic mode (ML proof scripts).
2249 *** Document preparation ***
2251 * Added antiquotation @{theory name} which prints the given name,
2252 after checking that it refers to a valid ancestor theory in the
2255 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2256 check the given source text as ML type/structure, printing verbatim.
2258 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2259 "c args == rhs" given in the current context. (Any number of
2260 arguments may be given on the LHS.)
2265 * The 'class' package offers a combination of axclass and locale to
2266 achieve Haskell-like type classes in Isabelle. Definitions and
2267 theorems within a class context produce both relative results (with
2268 implicit parameters according to the locale context), and polymorphic
2269 constants with qualified polymorphism (according to the class
2270 context). Within the body context of a 'class' target, a separate
2271 syntax layer ("user space type system") takes care of converting
2272 between global polymorphic consts and internal locale representation.
2273 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2274 "isatool doc classes" provides a tutorial.
2276 * Generic code generator framework allows to generate executable
2277 code for ML and Haskell (including Isabelle classes). A short usage
2280 internal compilation:
2281 export_code <list of constants (term syntax)> in SML
2282 writing SML code to a file:
2283 export_code <list of constants (term syntax)> in SML <filename>
2284 writing OCaml code to a file:
2285 export_code <list of constants (term syntax)> in OCaml <filename>
2286 writing Haskell code to a bunch of files:
2287 export_code <list of constants (term syntax)> in Haskell <filename>
2289 evaluating closed propositions to True/False using code generation:
2292 Reasonable default setup of framework in HOL.
2294 Theorem attributs for selecting and transforming function equations theorems:
2296 [code fun]: select a theorem as function equation for a specific constant
2297 [code fun del]: deselect a theorem as function equation for a specific constant
2298 [code inline]: select an equation theorem for unfolding (inlining) in place
2299 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2301 User-defined serializations (target in {SML, OCaml, Haskell}):
2303 code_const <and-list of constants (term syntax)>
2304 {(target) <and-list of const target syntax>}+
2306 code_type <and-list of type constructors>
2307 {(target) <and-list of type target syntax>}+
2309 code_instance <and-list of instances>
2311 where instance ::= <type constructor> :: <class>
2313 code_class <and_list of classes>
2314 {(target) <and-list of class target syntax>}+
2315 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2317 code_instance and code_class only are effective to target Haskell.
2319 For example usage see src/HOL/ex/Codegenerator.thy and
2320 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2321 generation from Isabelle/HOL theories is available via "isatool doc
2324 * Code generator: consts in 'consts_code' Isar commands are now
2325 referred to by usual term syntax (including optional type
2328 * Command 'no_translations' removes translation rules from theory
2331 * Overloaded definitions are now actually checked for acyclic
2332 dependencies. The overloading scheme is slightly more general than
2333 that of Haskell98, although Isabelle does not demand an exact
2334 correspondence to type class and instance declarations.
2335 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2336 exotic versions of overloading -- at the discretion of the user!
2338 Polymorphic constants are represented via type arguments, i.e. the
2339 instantiation that matches an instance against the most general
2340 declaration given in the signature. For example, with the declaration
2341 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2342 as c(nat). Overloading is essentially simultaneous structural
2343 recursion over such type arguments. Incomplete specification patterns
2344 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2345 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2346 Command 'print_theory' outputs the normalized system of recursive
2347 equations, see section "definitions".
2349 * Configuration options are maintained within the theory or proof
2350 context (with name and type bool/int/string), providing a very simple
2351 interface to a poor-man's version of general context data. Tools may
2352 declare options in ML (e.g. using Attrib.config_int) and then refer to
2353 these values using Config.get etc. Users may change options via an
2354 associated attribute of the same name. This form of context
2355 declaration works particularly well with commands 'declare' or
2356 'using', for example ``declare [[foo = 42]]''. Thus it has become
2357 very easy to avoid global references, which would not observe Isar
2358 toplevel undo/redo and fail to work with multithreading.
2360 Various global ML references of Pure and HOL have been turned into
2361 configuration options:
2363 Unify.search_bound unify_search_bound
2364 Unify.trace_bound unify_trace_bound
2365 Unify.trace_simp unify_trace_simp
2366 Unify.trace_types unify_trace_types
2367 Simplifier.simp_depth_limit simp_depth_limit
2368 Blast.depth_limit blast_depth_limit
2369 DatatypeProp.dtK datatype_distinctness_limit
2370 fast_arith_neq_limit fast_arith_neq_limit
2371 fast_arith_split_limit fast_arith_split_limit
2373 * Named collections of theorems may be easily installed as context
2374 data using the functor NamedThmsFun (see also
2375 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2376 attributes; there is also a toplevel print command. This facility is
2377 just a common case of general context data, which is the preferred way
2378 for anything more complex than just a list of facts in canonical
2381 * Isar: command 'declaration' augments a local theory by generic
2382 declaration functions written in ML. This enables arbitrary content
2383 being added to the context, depending on a morphism that tells the
2384 difference of the original declaration context wrt. the application
2385 context encountered later on.
2387 * Isar: proper interfaces for simplification procedures. Command
2388 'simproc_setup' declares named simprocs (with match patterns, and body
2389 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2390 context. ML antiquotation @{simproc name} retrieves named simprocs.
2392 * Isar: an extra pair of brackets around attribute declarations
2393 abbreviates a theorem reference involving an internal dummy fact,
2394 which will be ignored later --- only the effect of the attribute on
2395 the background context will persist. This form of in-place
2396 declarations is particularly useful with commands like 'declare' and
2397 'using', for example ``have A using [[simproc a]] by simp''.
2399 * Isar: method "assumption" (and implicit closing of subproofs) now
2400 takes simple non-atomic goal assumptions into account: after applying
2401 an assumption as a rule the resulting subgoals are solved by atomic
2402 assumption steps. This is particularly useful to finish 'obtain'
2403 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2404 without referring to the original premise "!!x. P x ==> thesis" in the
2405 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2408 * Isar: implicit use of prems from the Isar proof context is
2409 considered a legacy feature. Common applications like ``have A .''
2410 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2411 referencing facts explicitly here improves readability and
2412 maintainability of proof texts.
2414 * Isar: improper proof element 'guess' is like 'obtain', but derives
2415 the obtained context from the course of reasoning! For example:
2417 assume "EX x y. A x & B y" -- "any previous fact"
2418 then guess x and y by clarify
2420 This technique is potentially adventurous, depending on the facts and
2421 proof tools being involved here.
2423 * Isar: known facts from the proof context may be specified as literal
2424 propositions, using ASCII back-quote syntax. This works wherever
2425 named facts used to be allowed so far, in proof commands, proof
2426 methods, attributes etc. Literal facts are retrieved from the context
2427 according to unification of type and term parameters. For example,
2428 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2429 theorems in the current context, then these are valid literal facts:
2430 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2432 There is also a proof method "fact" which does the same composition
2433 for explicit goal states, e.g. the following proof texts coincide with
2434 certain special cases of literal facts:
2436 have "A" by fact == note `A`
2437 have "A ==> B" by fact == note `A ==> B`
2438 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2439 have "P a ==> Q a" by fact == note `P a ==> Q a`
2441 * Isar: ":" (colon) is no longer a symbolic identifier character in
2442 outer syntax. Thus symbolic identifiers may be used without
2443 additional white space in declarations like this: ``assume *: A''.
2445 * Isar: 'print_facts' prints all local facts of the current context,
2446 both named and unnamed ones.
2448 * Isar: 'def' now admits simultaneous definitions, e.g.:
2450 def x == "t" and y == "u"
2452 * Isar: added command 'unfolding', which is structurally similar to
2453 'using', but affects both the goal state and facts by unfolding given
2454 rewrite rules. Thus many occurrences of the 'unfold' method or
2455 'unfolded' attribute may be replaced by first-class proof text.
2457 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2458 and command 'unfolding' now all support object-level equalities
2459 (potentially conditional). The underlying notion of rewrite rule is
2460 analogous to the 'rule_format' attribute, but *not* that of the
2461 Simplifier (which is usually more generous).
2463 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2464 premises of a theorem by n. Useful in conjunction with drule.
2466 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2467 method expression within a sandbox consisting of the first N
2468 sub-goals, which need to exist. For example, ``simp_all [3]''
2469 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2470 simplifies all new goals that emerge from applying rule foo to the
2471 originally first one.
2473 * Isar: schematic goals are no longer restricted to higher-order
2474 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2477 * Isar: the conclusion of a long theorem statement is now either
2478 'shows' (a simultaneous conjunction, as before), or 'obtains'
2479 (essentially a disjunction of cases with local parameters and
2480 assumptions). The latter allows to express general elimination rules
2481 adequately; in this notation common elimination rules look like this:
2483 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2485 obtains x where "P x"
2487 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2491 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2497 The subsequent classical rules even refer to the formal "thesis"
2500 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2503 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2504 obtains "thesis ==> something"
2506 The actual proof of an 'obtains' statement is analogous to that of the
2507 Isar proof element 'obtain', only that there may be several cases.
2508 Optional case names may be specified in parentheses; these will be
2509 available both in the present proof and as annotations in the
2510 resulting rule, for later use with the 'cases' method (cf. attribute
2513 * Isar: the assumptions of a long theorem statement are available as
2514 "assms" fact in the proof context. This is more appropriate than the
2515 (historical) "prems", which refers to all assumptions of the current
2516 context, including those from the target locale, proof body etc.
2518 * Isar: 'print_statement' prints theorems from the current theory or
2519 proof context in long statement form, according to the syntax of a
2522 * Isar: 'obtain' takes an optional case name for the local context
2523 introduction rule (default "that").
2525 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2526 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2529 * Pure: syntax "CONST name" produces a fully internalized constant
2530 according to the current context. This is particularly useful for
2531 syntax translations that should refer to internal constant
2532 representations independently of name spaces.
2534 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2535 instead of "FOO ". This allows multiple binder declarations to coexist
2536 in the same context. INCOMPATIBILITY.
2538 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2539 primitive that also works in a locale context (both for constants and
2540 fixed variables). Type declaration and internal syntactic representation
2541 of given constants retrieved from the context. Likewise, the
2542 'no_notation' command allows to remove given syntax annotations from the
2545 * Isar/locales: new derived specification elements 'axiomatization',
2546 'definition', 'abbreviation', which support type-inference, admit
2547 object-level specifications (equality, equivalence). See also the
2548 isar-ref manual. Examples:
2551 eq (infix "===" 50) where
2552 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2554 definition "f x y = x + y + 1"
2555 definition g where "g x = f x x"
2558 neq (infix "=!=" 50) where
2559 "x =!= y == ~ (x === y)"
2561 These specifications may be also used in a locale context. Then the
2562 constants being introduced depend on certain fixed parameters, and the
2563 constant name is qualified by the locale base name. An internal
2564 abbreviation takes care for convenient input and output, making the
2565 parameters implicit and using the original short name. See also
2566 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2567 entities from a monomorphic theory.
2569 Presently, abbreviations are only available 'in' a target locale, but
2570 not inherited by general import expressions. Also note that
2571 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2572 'translations' in common applications. The "no_abbrevs" print mode
2573 prevents folding of abbreviations in term output.
2575 Concrete syntax is attached to specified constants in internal form,
2576 independently of name spaces. The parse tree representation is
2577 slightly different -- use 'notation' instead of raw 'syntax', and
2578 'translations' with explicit "CONST" markup to accommodate this.
2580 * Pure/Isar: unified syntax for new-style specification mechanisms
2581 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2582 full type inference and dummy patterns ("_"). For example:
2584 definition "K x _ = x"
2586 inductive conj for A B
2587 where "A ==> B ==> conj A B"
2589 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2590 the current context. Print mode "no_abbrevs" prevents inversion of
2591 abbreviations on output.
2593 * Isar/locales: improved parameter handling: use of locales "var" and
2594 "struct" no longer necessary; - parameter renamings are no longer
2595 required to be injective. For example, this allows to define
2596 endomorphisms as locale endom = homom mult mult h.
2598 * Isar/locales: changed the way locales with predicates are defined.
2599 Instead of accumulating the specification, the imported expression is
2600 now an interpretation. INCOMPATIBILITY: different normal form of
2601 locale expressions. In particular, in interpretations of locales with
2602 predicates, goals repesenting already interpreted fragments are not
2603 removed automatically. Use methods `intro_locales' and
2604 `unfold_locales'; see below.
2606 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2607 provide backward reasoning on locales predicates. The methods are
2608 aware of interpretations and discharge corresponding goals.
2609 `intro_locales' is less aggressive then `unfold_locales' and does not
2610 unfold predicates to assumptions.
2612 * Isar/locales: the order in which locale fragments are accumulated
2613 has changed. This enables to override declarations from fragments due
2614 to interpretations -- for example, unwanted simp rules.
2616 * Isar/locales: interpretation in theories and proof contexts has been
2617 extended. One may now specify (and prove) equations, which are
2618 unfolded in interpreted theorems. This is useful for replacing
2619 defined concepts (constants depending on locale parameters) by
2620 concepts already existing in the target context. Example:
2622 interpretation partial_order ["op <= :: [int, int] => bool"]
2623 where "partial_order.less (op <=) (x::int) y = (x < y)"
2625 Typically, the constant `partial_order.less' is created by a
2626 definition specification element in the context of locale
2629 * Method "induct": improved internal context management to support
2630 local fixes and defines on-the-fly. Thus explicit meta-level
2631 connectives !! and ==> are rarely required anymore in inductive goals
2632 (using object-logic connectives for this purpose has been long
2633 obsolete anyway). Common proof patterns are explained in
2634 src/HOL/Induct/Common_Patterns.thy, see also
2635 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2638 * Method "induct": improved handling of simultaneous goals. Instead of
2639 introducing object-level conjunction, the statement is now split into
2640 several conclusions, while the corresponding symbolic cases are nested
2641 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2642 see src/HOL/Induct/Common_Patterns.thy, for example.
2644 * Method "induct": mutual induction rules are now specified as a list
2645 of rule sharing the same induction cases. HOL packages usually provide
2646 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2647 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2648 mutual induction rules differently, i.e. like this:
2650 (induct rule: foo_bar.inducts)
2651 (induct set: foo bar)
2652 (induct pred: foo bar)
2653 (induct type: foo bar)
2655 The ML function ProjectRule.projections turns old-style rules into the
2658 * Method "coinduct": dual of induction, see
2659 src/HOL/Library/Coinductive_List.thy for various examples.
2661 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2662 considered a legacy feature.
2664 * Attribute "symmetric" produces result with standardized schematic
2665 variables (index 0). Potential INCOMPATIBILITY.
2667 * Simplifier: by default the simplifier trace only shows top level
2668 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2669 default. Thus there is less danger of being flooded by the trace. The
2670 trace indicates where parts have been suppressed.
2672 * Provers/classical: removed obsolete classical version of elim_format
2673 attribute; classical elim/dest rules are now treated uniformly when
2674 manipulating the claset.
2676 * Provers/classical: stricter checks to ensure that supplied intro,
2677 dest and elim rules are well-formed; dest and elim rules must have at
2680 * Provers/classical: attributes dest/elim/intro take an optional
2681 weight argument for the rule (just as the Pure versions). Weights are
2682 ignored by automated tools, but determine the search order of single
2685 * Syntax: input syntax now supports dummy variable binding "%_. b",
2686 where the body does not mention the bound variable. Note that dummy
2687 patterns implicitly depend on their context of bounds, which makes
2688 "{_. _}" match any set comprehension as expected. Potential
2689 INCOMPATIBILITY -- parse translations need to cope with syntactic
2690 constant "_idtdummy" in the binding position.
2692 * Syntax: removed obsolete syntactic constant "_K" and its associated
2693 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2694 for example "A -> B" => "Pi A (%_. B)".
2696 * Pure: 'class_deps' command visualizes the subclass relation, using
2697 the graph browser tool.
2699 * Pure: 'print_theory' now suppresses certain internal declarations by
2700 default; use '!' option for full details.
2705 * Method "metis" proves goals by applying the Metis general-purpose
2706 resolution prover (see also http://gilith.com/software/metis/).
2707 Examples are in the directory MetisExamples. WARNING: the
2708 Isabelle/HOL-Metis integration does not yet work properly with
2711 * Command 'sledgehammer' invokes external automatic theorem provers as
2712 background processes. It generates calls to the "metis" method if
2713 successful. These can be pasted into the proof. Users do not have to
2714 wait for the automatic provers to return. WARNING: does not really
2715 work with multi-threading.
2717 * New "auto_quickcheck" feature tests outermost goal statements for
2718 potential counter-examples. Controlled by ML references
2719 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2720 5000 milliseconds). Fails silently if statements is outside of
2721 executable fragment, or any other codgenerator problem occurs.
2723 * New constant "undefined" with axiom "undefined x = undefined".
2725 * Added class "HOL.eq", allowing for code generation with polymorphic
2728 * Some renaming of class constants due to canonical name prefixing in
2729 the new 'class' package:
2731 HOL.abs ~> HOL.abs_class.abs
2732 HOL.divide ~> HOL.divide_class.divide
2733 0 ~> HOL.zero_class.zero
2734 1 ~> HOL.one_class.one
2735 op + ~> HOL.plus_class.plus
2736 op - ~> HOL.minus_class.minus
2737 uminus ~> HOL.minus_class.uminus
2738 op * ~> HOL.times_class.times
2739 op < ~> HOL.ord_class.less
2740 op <= > HOL.ord_class.less_eq
2741 Nat.power ~> Power.power_class.power
2742 Nat.size ~> Nat.size_class.size
2743 Numeral.number_of ~> Numeral.number_class.number_of
2744 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2745 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2746 Orderings.min ~> Orderings.ord_class.min
2747 Orderings.max ~> Orderings.ord_class.max
2748 Divides.op div ~> Divides.div_class.div
2749 Divides.op mod ~> Divides.div_class.mod
2750 Divides.op dvd ~> Divides.div_class.dvd
2752 INCOMPATIBILITY. Adaptions may be required in the following cases:
2754 a) User-defined constants using any of the names "plus", "minus",
2755 "times", "less" or "less_eq". The standard syntax translations for
2756 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2759 b) Variables named "plus", "minus", "times", "less", "less_eq"
2760 INCOMPATIBILITY: use more specific names.
2762 c) Permutative equations (e.g. "a + b = b + a")
2763 Since the change of names also changes the order of terms, permutative
2764 rewrite rules may get applied in a different order. Experience shows
2765 that this is rarely the case (only two adaptions in the whole Isabelle
2766 distribution). INCOMPATIBILITY: rewrite proofs
2768 d) ML code directly refering to constant names
2769 This in general only affects hand-written proof tactics, simprocs and
2770 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2771 Consider using @{const_name} antiquotation.
2773 * New class "default" with associated constant "default".
2775 * Function "sgn" is now overloaded and available on int, real, complex
2776 (and other numeric types), using class "sgn". Two possible defs of
2777 sgn are given as equational assumptions in the classes sgn_if and
2778 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2781 * Locale "partial_order" now unified with class "order" (cf. theory
2782 Orderings), added parameter "less". INCOMPATIBILITY.
2784 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2785 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2786 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2788 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2789 changed order of proof goals in instance proofs.
2791 * The transitivity reasoner for partial and linear orders is set up
2792 for classes "order" and "linorder". Instances of the reasoner are available
2793 in all contexts importing or interpreting the corresponding locales.
2794 Method "order" invokes the reasoner separately; the reasoner
2795 is also integrated with the Simplifier as a solver. Diagnostic
2796 command 'print_orders' shows the available instances of the reasoner
2797 in the current context.
2799 * Localized monotonicity predicate in theory "Orderings"; integrated
2800 lemmas max_of_mono and min_of_mono with this predicate.
2803 * Formulation of theorem "dense" changed slightly due to integration
2804 with new class dense_linear_order.
2806 * Uniform lattice theory development in HOL.
2808 constants "meet" and "join" now named "inf" and "sup"
2809 constant "Meet" now named "Inf"
2811 classes "meet_semilorder" and "join_semilorder" now named
2812 "lower_semilattice" and "upper_semilattice"
2813 class "lorder" now named "lattice"
2814 class "comp_lat" now named "complete_lattice"
2816 Instantiation of lattice classes allows explicit definitions
2817 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2819 INCOMPATIBILITY. Theorem renames:
2821 meet_left_le ~> inf_le1
2822 meet_right_le ~> inf_le2
2823 join_left_le ~> sup_ge1
2824 join_right_le ~> sup_ge2
2825 meet_join_le ~> inf_sup_ord
2828 le_meet ~> le_inf_iff
2829 le_join ~> ge_sup_conv
2830 meet_idempotent ~> inf_idem
2831 join_idempotent ~> sup_idem
2832 meet_comm ~> inf_commute
2833 join_comm ~> sup_commute
2834 meet_leI1 ~> le_infI1
2835 meet_leI2 ~> le_infI2
2836 le_joinI1 ~> le_supI1
2837 le_joinI2 ~> le_supI2
2838 meet_assoc ~> inf_assoc
2839 join_assoc ~> sup_assoc
2840 meet_left_comm ~> inf_left_commute
2841 meet_left_idempotent ~> inf_left_idem
2842 join_left_comm ~> sup_left_commute
2843 join_left_idempotent ~> sup_left_idem
2846 le_def_meet ~> le_iff_inf
2847 le_def_join ~> le_iff_sup
2848 join_absorp2 ~> sup_absorb2
2849 join_absorp1 ~> sup_absorb1
2850 meet_absorp1 ~> inf_absorb1
2851 meet_absorp2 ~> inf_absorb2
2852 meet_join_absorp ~> inf_sup_absorb
2853 join_meet_absorp ~> sup_inf_absorb
2854 distrib_join_le ~> distrib_sup_le
2855 distrib_meet_le ~> distrib_inf_le
2857 add_meet_distrib_left ~> add_inf_distrib_left
2858 add_join_distrib_left ~> add_sup_distrib_left
2859 is_join_neg_meet ~> is_join_neg_inf
2860 is_meet_neg_join ~> is_meet_neg_sup
2861 add_meet_distrib_right ~> add_inf_distrib_right
2862 add_join_distrib_right ~> add_sup_distrib_right
2863 add_meet_join_distribs ~> add_sup_inf_distribs
2864 join_eq_neg_meet ~> sup_eq_neg_inf
2865 meet_eq_neg_join ~> inf_eq_neg_sup
2866 add_eq_meet_join ~> add_eq_inf_sup
2867 meet_0_imp_0 ~> inf_0_imp_0
2868 join_0_imp_0 ~> sup_0_imp_0
2869 meet_0_eq_0 ~> inf_0_eq_0
2870 join_0_eq_0 ~> sup_0_eq_0
2871 neg_meet_eq_join ~> neg_inf_eq_sup
2872 neg_join_eq_meet ~> neg_sup_eq_inf
2873 join_eq_if ~> sup_eq_if
2875 mono_meet ~> mono_inf
2876 mono_join ~> mono_sup
2877 meet_bool_eq ~> inf_bool_eq
2878 join_bool_eq ~> sup_bool_eq
2879 meet_fun_eq ~> inf_fun_eq
2880 join_fun_eq ~> sup_fun_eq
2881 meet_set_eq ~> inf_set_eq
2882 join_set_eq ~> sup_set_eq
2883 meet1_iff ~> inf1_iff
2884 meet2_iff ~> inf2_iff
2893 join1_iff ~> sup1_iff
2894 join2_iff ~> sup2_iff
2904 is_meet_Meet ~> is_meet_Inf
2905 Meet_bool_def ~> Inf_bool_def
2906 Meet_fun_def ~> Inf_fun_def
2907 Meet_greatest ~> Inf_greatest
2908 Meet_lower ~> Inf_lower
2909 Meet_set_def ~> Inf_set_def
2912 Sup_bool_eq ~> Sup_bool_def
2913 Sup_fun_eq ~> Sup_fun_def
2914 Sup_set_eq ~> Sup_set_def
2916 listsp_meetI ~> listsp_infI
2917 listsp_meet_eq ~> listsp_inf_eq
2922 * Added syntactic class "size"; overloaded constant "size" now has
2923 type "'a::size ==> bool"
2925 * Internal reorganisation of `size' of datatypes: size theorems
2926 "foo.size" are no longer subsumed by "foo.simps" (but are still
2927 simplification rules by default!); theorems "prod.size" now named
2930 * Class "div" now inherits from class "times" rather than "type".
2933 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2934 Linorder etc. have disappeared; operations defined in terms of
2935 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2937 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2939 * HOL-Word: New extensive library and type for generic, fixed size
2940 machine words, with arithemtic, bit-wise, shifting and rotating
2941 operations, reflection into int, nat, and bool lists, automation for
2942 linear arithmetic (by automatic reflection into nat or int), including
2943 lemmas on overflow and monotonicity. Instantiated to all appropriate
2944 arithmetic type classes, supporting automatic simplification of
2945 numerals on all operations.
2947 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2949 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2951 * Code generator library theories:
2952 - Code_Integer represents HOL integers by big integer literals in target
2954 - Code_Char represents HOL characters by character literals in target
2956 - Code_Char_chr like Code_Char, but also offers treatment of character
2957 codes; includes Code_Integer.
2958 - Executable_Set allows to generate code for finite sets using lists.
2959 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2961 - Executable_Real implements a subset of real numbers, namly those
2962 representable by rational numbers.
2963 - Efficient_Nat implements natural numbers by integers, which in general will
2964 result in higher efficency; pattern matching with 0/Suc is eliminated;
2965 includes Code_Integer.
2966 - Code_Index provides an additional datatype index which is mapped to
2967 target-language built-in integers.
2968 - Code_Message provides an additional datatype message_string which is isomorphic to
2969 strings; messages are mapped to target-language strings.
2971 * New package for inductive predicates
2973 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2976 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2977 for z_1 :: U_1 and ... and z_n :: U_m
2979 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2982 with full support for type-inference, rather than
2984 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2986 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2987 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2989 inductive "s z_1 ... z_m"
2991 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2994 For backward compatibility, there is a wrapper allowing inductive
2995 sets to be defined with the new package via
2998 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2999 for z_1 :: U_1 and ... and z_n :: U_m
3001 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3007 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3008 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3009 for z_1 :: U_1 and ... and z_n :: U_m
3011 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3012 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3015 if the additional syntax "p ..." is required.
3017 Numerous examples can be found in the subdirectories src/HOL/Auth,
3018 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3022 - Since declaration and definition of inductive sets or predicates
3023 is no longer separated, abbreviations involving the newly
3024 introduced sets or predicates must be specified together with the
3025 introduction rules after the 'where' keyword (see above), rather
3026 than before the actual inductive definition.
3028 - The variables in induction and elimination rules are now
3029 quantified in the order of their occurrence in the introduction
3030 rules, rather than in alphabetical order. Since this may break
3031 some proofs, these proofs either have to be repaired, e.g. by
3032 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3033 statements of the form
3035 case (rule_i a_i_1 ... a_i_{k_i})
3037 or the old order of quantification has to be restored by explicitly adding
3038 meta-level quantifiers in the introduction rules, i.e.
3040 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3042 - The format of the elimination rules is now
3044 p z_1 ... z_m x_1 ... x_n ==>
3045 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3050 (x_1, ..., x_n) : s z_1 ... z_m ==>
3051 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3054 for sets rather than
3056 x : s z_1 ... z_m ==>
3057 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3060 This may require terms in goals to be expanded to n-tuples
3061 (e.g. using case_tac or simplification with the split_paired_all
3062 rule) before the above elimination rule is applicable.
3064 - The elimination or case analysis rules for (mutually) inductive
3065 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3066 list of rules "p_1_..._p_k.elims" is no longer available.
3068 * New package "function"/"fun" for general recursive functions,
3069 supporting mutual and nested recursion, definitions in local contexts,
3070 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3071 for small examples, and the separate tutorial on the function
3072 package. The old recdef "package" is still available as before, but
3073 users are encouraged to use the new package.
3075 * Method "lexicographic_order" automatically synthesizes termination
3076 relations as lexicographic combinations of size measures.
3078 * Case-expressions allow arbitrary constructor-patterns (including
3079 "_") and take their order into account, like in functional
3080 programming. Internally, this is translated into nested
3081 case-expressions; missing cases are added and mapped to the predefined
3082 constant "undefined". In complicated cases printing may no longer show
3083 the original input but the internal form. Lambda-abstractions allow
3084 the same form of pattern matching: "% pat1 => e1 | ..." is an
3085 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3088 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3089 is an abbreviation for "of_nat :: nat => int". The simplification
3090 rules for "of_nat" have been changed to work like "int" did
3091 previously. Potential INCOMPATIBILITY:
3092 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3093 - of_nat_diff and of_nat_mult are no longer default simp rules
3095 * Method "algebra" solves polynomial equations over (semi)rings using
3096 Groebner bases. The (semi)ring structure is defined by locales and the
3097 tool setup depends on that generic context. Installing the method for
3098 a specific type involves instantiating the locale and possibly adding
3099 declarations for computation on the coefficients. The method is
3100 already instantiated for natural numbers and for the axiomatic class
3101 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3102 CALCULEMUS 2007 for the general principles underlying this
3103 architecture of context-aware proof-tools.
3105 * Method "ferrack" implements quantifier elimination over
3106 special-purpose dense linear orders using locales (analogous to
3107 "algebra"). The method is already installed for class
3108 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3111 * Former constant "List.op @" now named "List.append". Use ML
3112 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3113 circumvent possible incompatibilities when working on ML level.
3115 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3117 * New function listsum :: 'a list => 'a for arbitrary monoids.
3118 Special syntax: "SUM x <- xs. f x" (and latex variants)
3120 * New syntax for Haskell-like list comprehension (input only), eg.
3121 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3123 * The special syntax for function "filter" has changed from [x :
3124 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3125 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3127 * [a..b] is now defined for arbitrary linear orders. It used to be
3128 defined on nat only, as an abbreviation for [a..<Suc b]
3131 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3133 * New functions "sorted" and "sort" in src/HOL/List.thy.
3135 * New lemma collection field_simps (an extension of ring_simps) for
3136 manipulating (in)equations involving division. Multiplies with all
3137 denominators that can be proved to be non-zero (in equations) or
3138 positive/negative (in inequations).
3140 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3141 have been improved and renamed to ring_simps, group_simps and
3142 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3143 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3145 * Theory Library/Commutative_Ring: switched from recdef to function
3146 package; constants add, mul, pow now curried. Infix syntax for
3147 algebraic operations.
3149 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3152 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3155 * HOL/records: generalised field-update to take a function on the
3156 field rather than the new value: r(|A := x|) is translated to A_update
3157 (K x) r The K-combinator that is internally used is called K_record.
3158 INCOMPATIBILITY: Usage of the plain update functions has to be
3161 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3162 * x = 0, which are required for a semiring. Richer structures do not
3163 inherit from semiring_0 anymore, because this property is a theorem
3164 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3165 there is more to prove, but this is mostly trivial.
3167 * Class "recpower" is generalized to arbitrary monoids, not just
3168 commutative semirings. INCOMPATIBILITY: may need to incorporate
3169 commutativity or semiring properties additionally.
3171 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3172 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3173 better use 'abbreviation'.
3175 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3177 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3178 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3179 significant changes for setting up numeral syntax for types:
3180 - New constants Numeral.pred and Numeral.succ instead
3181 of former Numeral.bin_pred and Numeral.bin_succ.
3182 - Use integer operations instead of bin_add, bin_mult and so on.
3183 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3184 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3186 See src/HOL/Integ/IntArith.thy for an example setup.
3188 * Command 'normal_form' computes the normal form of a term that may
3189 contain free variables. For example ``normal_form "rev [a, b, c]"''
3190 produces ``[b, c, a]'' (without proof). This command is suitable for
3191 heavy-duty computations because the functions are compiled to ML
3192 first. Correspondingly, a method "normalization" is provided. See
3193 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3195 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3196 25 like -->); output depends on the "iff" print_mode, the default is
3197 "A = B" (with priority 50).
3199 * Relations less (<) and less_eq (<=) are also available on type bool.
3200 Modified syntax to disallow nesting without explicit parentheses,
3201 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3204 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3206 * Relation composition operator "op O" now has precedence 75 and binds
3207 stronger than union and intersection. INCOMPATIBILITY.
3209 * The old set interval syntax "{m..n(}" (and relatives) has been
3210 removed. Use "{m..<n}" (and relatives) instead.
3212 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3213 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3214 ``declare [[simproc del: neq]]''.
3216 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3219 * Theorem Cons_eq_map_conv no longer declared as "simp".
3221 * Theorem setsum_mult renamed to setsum_right_distrib.
3223 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3226 * Reimplemented methods "sat" and "satx", with several improvements:
3227 goals no longer need to be stated as "<prems> ==> False", equivalences
3228 (i.e. "=" on type bool) are handled, variable names of the form
3229 "lit_<n>" are no longer reserved, significant speedup.
3231 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3232 zChaff is still supported as well.
3234 * 'inductive' and 'datatype': provide projections of mutual rules,
3235 bundled as foo_bar.inducts;
3237 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3240 * Library: moved theory Accessible_Part to main HOL.
3242 * Library: added theory Coinductive_List of potentially infinite lists
3243 as greatest fixed-point.
3245 * Library: added theory AssocList which implements (finite) maps as
3248 * Method "evaluation" solves goals (i.e. a boolean expression)
3249 efficiently by compiling it to ML. The goal is "proved" (via an
3250 oracle) if it evaluates to True.
3252 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3253 also when invoked by the simplifier. This results in the Simplifier
3254 being more powerful on arithmetic goals. INCOMPATIBILITY.
3255 Configuration option fast_arith_split_limit=0 recovers the old
3258 * Support for hex (0x20) and binary (0b1001) numerals.
3260 * New method: reify eqs (t), where eqs are equations for an
3261 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3262 parameter, computes a term s::'b and a list xs::'a list and proves the
3263 theorem I xs s = t. This is also known as reification or quoting. The
3264 resulting theorem is applied to the subgoal to substitute t with I xs
3265 s. If t is omitted, the subgoal itself is reified.
3267 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3268 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3269 where f is supposed to be a computable function (in the sense of code
3270 generattion). The method uses reify to compute s and xs as above then
3271 applies corr_thm and uses normalization by evaluation to "prove" f s =
3272 r and finally gets the theorem t = r, which is again applied to the
3273 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3275 * Reflection: Automatic reification now handels binding, an example is
3276 available in src/HOL/ex/ReflectionEx.thy
3278 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3279 command 'statespace' that is similar to 'record', but introduces an
3280 abstract specification based on the locale infrastructure instead of
3281 HOL types. This leads to extra flexibility in composing state spaces,
3282 in particular multiple inheritance and renaming of components.
3287 * Hyperreal: Functions root and sqrt are now defined on negative real
3288 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3289 Nonnegativity side conditions have been removed from many lemmas, so
3290 that more subgoals may now be solved by simplification; potential
3293 * Real: new type classes formalize real normed vector spaces and
3294 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3295 and norm :: 'a => real.
3297 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3298 reals into other types. The overloaded constant Reals :: 'a set is now
3299 defined as range of_real; potential INCOMPATIBILITY.
3301 * Real: proper support for ML code generation, including 'quickcheck'.
3302 Reals are implemented as arbitrary precision rationals.
3304 * Hyperreal: Several constants that previously worked only for the
3305 reals have been generalized, so they now work over arbitrary vector
3306 spaces. Type annotations may need to be added in some cases; potential
3309 Infinitesimal :: ('a::real_normed_vector) star set
3310 HFinite :: ('a::real_normed_vector) star set
3311 HInfinite :: ('a::real_normed_vector) star set
3312 approx :: ('a::real_normed_vector) star => 'a star => bool
3313 monad :: ('a::real_normed_vector) star => 'a star set
3314 galaxy :: ('a::real_normed_vector) star => 'a star set
3315 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3316 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3317 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3318 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3319 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3320 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3321 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3322 sgn :: 'a::real_normed_vector => 'a
3323 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3325 * Complex: Some complex-specific constants are now abbreviations for
3326 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3327 hnorm. Other constants have been entirely removed in favor of the
3328 polymorphic versions (INCOMPATIBILITY):
3332 HInfinite <-- CInfinite
3333 Infinitesimal <-- CInfinitesimal
3336 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3337 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3338 (ns)deriv <-- (ns)cderiv
3343 * Formalisation of ideals and the quotient construction over rings.
3345 * Order and lattice theory no longer based on records.
3348 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3349 greatest_closed. INCOMPATIBILITY.
3351 * Method algebra is now set up via an attribute. For examples see
3352 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3353 of algebraic structures.
3355 * Renamed theory CRing to Ring.
3360 * Substantial, yet incomplete support for nominal datatypes (binding
3361 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3362 src/HOL/Nominal/Examples. Prospective users should consult
3363 http://isabelle.in.tum.de/nominal/
3368 * ML basics: just one true type int, which coincides with IntInf.int
3371 * ML within Isar: antiquotations allow to embed statically-checked
3372 formal entities in the source, referring to the context available at
3373 compile-time. For example:
3375 ML {* @{sort "{zero,one}"} *}
3376 ML {* @{typ "'a => 'b"} *}
3377 ML {* @{term "%x. x"} *}
3378 ML {* @{prop "x == y"} *}
3379 ML {* @{ctyp "'a => 'b"} *}
3380 ML {* @{cterm "%x. x"} *}
3381 ML {* @{cprop "x == y"} *}
3382 ML {* @{thm asm_rl} *}
3383 ML {* @{thms asm_rl} *}
3384 ML {* @{type_name c} *}
3385 ML {* @{type_syntax c} *}
3386 ML {* @{const_name c} *}
3387 ML {* @{const_syntax c} *}
3390 ML {* @{theory Pure} *}
3391 ML {* @{theory_ref} *}
3392 ML {* @{theory_ref Pure} *}
3395 ML {* @{clasimpset} *}
3397 The same works for sources being ``used'' within an Isar context.
3399 * ML in Isar: improved error reporting; extra verbosity with
3400 ML_Context.trace enabled.
3402 * Pure/General/table.ML: the join operations now works via exceptions
3403 DUP/SAME instead of type option. This is simpler in simple cases, and
3404 admits slightly more efficient complex applications.
3406 * Pure: 'advanced' translation functions (parse_translation etc.) now
3407 use Context.generic instead of just theory.
3409 * Pure: datatype Context.generic joins theory/Proof.context and
3410 provides some facilities for code that works in either kind of
3411 context, notably GenericDataFun for uniform theory and proof data.
3413 * Pure: simplified internal attribute type, which is now always
3414 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3415 local (Proof.context) attributes have been discontinued, while
3416 minimizing code duplication. Thm.rule_attribute and
3417 Thm.declaration_attribute build canonical attributes; see also structure
3418 Context for further operations on Context.generic, notably
3419 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3420 declarations and definitions.
3422 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3423 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3424 init only required for impure data. INCOMPATIBILITY: empty really need
3425 to be empty (no dependencies on theory content!)
3427 * Pure/kernel: consts certification ignores sort constraints given in
3428 signature declarations. (This information is not relevant to the
3429 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3430 potential INCOMPATIBILITY.
3432 * Pure: axiomatic type classes are now purely definitional, with
3433 explicit proofs of class axioms and super class relations performed
3434 internally. See Pure/axclass.ML for the main internal interfaces --
3435 notably AxClass.define_class supercedes AxClass.add_axclass, and
3436 AxClass.axiomatize_class/classrel/arity supersede
3437 Sign.add_classes/classrel/arities.
3439 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3440 global/local versions on theory vs. Proof.context have been
3441 discontinued; Attrib.syntax and Method.syntax have been adapted
3442 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3443 attributes, methods, etc.
3445 * Pure: several functions of signature "... -> theory -> theory * ..."
3446 have been reoriented to "... -> theory -> ... * theory" in order to
3447 allow natural usage in combination with the ||>, ||>>, |-> and
3448 fold_map combinators.
3450 * Pure: official theorem names (closed derivations) and additional
3451 comments (tags) are now strictly separate. Name hints -- which are
3452 maintained as tags -- may be attached any time without affecting the
3455 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3456 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3457 achieve the old behaviour.
3459 * Pure: the "Goal" constant is now called "prop", supporting a
3460 slightly more general idea of ``protecting'' meta-level rule
3463 * Pure: Logic.(un)varify only works in a global context, which is now
3464 enforced instead of silently assumed. INCOMPATIBILITY, may use
3465 Logic.legacy_(un)varify as temporary workaround.
3467 * Pure: structure Name provides scalable operations for generating
3468 internal variable names, notably Name.variants etc. This replaces
3469 some popular functions from term.ML:
3471 Term.variant -> Name.variant
3472 Term.variantlist -> Name.variant_list
3473 Term.invent_names -> Name.invent_list
3475 Note that low-level renaming rarely occurs in new code -- operations
3476 from structure Variable are used instead (see below).
3478 * Pure: structure Variable provides fundamental operations for proper
3479 treatment of fixed/schematic variables in a context. For example,
3480 Variable.import introduces fixes for schematics of given facts and
3481 Variable.export reverses the effect (up to renaming) -- this replaces
3482 various freeze_thaw operations.
3484 * Pure: structure Goal provides simple interfaces for
3485 init/conclude/finish and tactical prove operations (replacing former
3486 Tactic.prove). Goal.prove is the canonical way to prove results
3487 within a given context; Goal.prove_global is a degraded version for
3488 theory level goals, including a global Drule.standard. Note that
3489 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3490 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3491 in a locale context).
3493 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3494 and type checking (Syntax.check_term etc.), with common combinations
3495 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3496 which are considered legacy and await removal.
3498 * Pure/Syntax: generic interfaces for type unchecking
3499 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3500 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3501 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3502 available for convenience, but refer to the very same operations using
3503 a mere theory instead of a full context.
3505 * Isar: simplified treatment of user-level errors, using exception
3506 ERROR of string uniformly. Function error now merely raises ERROR,
3507 without any side effect on output channels. The Isar toplevel takes
3508 care of proper display of ERROR exceptions. ML code may use plain
3509 handle/can/try; cat_error may be used to concatenate errors like this:
3511 ... handle ERROR msg => cat_error msg "..."
3513 Toplevel ML code (run directly or through the Isar toplevel) may be
3514 embedded into the Isar toplevel with exception display/debug like
3517 Isar.toplevel (fn () => ...)
3519 INCOMPATIBILITY, removed special transform_error facilities, removed
3520 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3521 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3522 -- use plain ERROR instead.
3524 * Isar: theory setup now has type (theory -> theory), instead of a
3525 list. INCOMPATIBILITY, may use #> to compose setup functions.
3527 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3528 ProofContext.debug/verbose flags.
3530 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3531 theory before entering a proof state. Transactions now always see a
3532 quasi-functional intermediate checkpoint, both in interactive and
3535 * Isar: simplified interfaces for outer syntax. Renamed
3536 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3537 OuterSyntax.add_parsers -- this functionality is now included in
3538 OuterSyntax.command etc. INCOMPATIBILITY.
3540 * Simplifier: the simpset of a running simplification process now
3541 contains a proof context (cf. Simplifier.the_context), which is the
3542 very context that the initial simpset has been retrieved from (by
3543 simpset_of/local_simpset_of). Consequently, all plug-in components
3544 (solver, looper etc.) may depend on arbitrary proof data.
3546 * Simplifier.inherit_context inherits the proof context (plus the
3547 local bounds) of the current simplification process; any simproc
3548 etc. that calls the Simplifier recursively should do this! Removed
3549 former Simplifier.inherit_bounds, which is already included here --
3550 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3551 specify an explicit context using Simplifier.context/theory_context.
3553 * Simplifier/Classical Reasoner: more abstract interfaces
3554 change_simpset/claset for modifying the simpset/claset reference of a
3555 theory; raw versions simpset/claset_ref etc. have been discontinued --
3558 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3564 * settings: the default heap location within ISABELLE_HOME_USER now
3565 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3566 Isabelle installations.
3568 * isabelle-process: option -S (secure mode) disables some critical
3569 operations, notably runtime compilation and evaluation of ML source
3572 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3574 * Support for parallel execution, using native multicore support of
3575 Poly/ML 5.1. The theory loader exploits parallelism when processing
3576 independent theories, according to the given theory header
3577 specifications. The maximum number of worker threads is specified via
3578 usedir option -M or the "max-threads" setting in Proof General. A
3579 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3580 to 6 on a 8-core machine. User-code needs to observe certain
3581 guidelines for thread-safe programming, see appendix A in the Isar
3582 Implementation manual.
3586 New in Isabelle2005 (October 2005)
3587 ----------------------------------
3591 * Theory headers: the new header syntax for Isar theories is
3594 imports <theory1> ... <theoryN>
3595 uses <file1> ... <fileM>
3598 where the 'uses' part is optional. The previous syntax
3600 theory <name> = <theory1> + ... + <theoryN>:
3602 will disappear in the next release. Use isatool fixheaders to convert
3603 existing theory files. Note that there is no change in ancient
3604 non-Isar theories now, but these will disappear soon.
3606 * Theory loader: parent theories can now also be referred to via
3607 relative and absolute paths.
3609 * Command 'find_theorems' searches for a list of criteria instead of a
3610 list of constants. Known criteria are: intro, elim, dest, name:string,
3611 simp:term, and any term. Criteria can be preceded by '-' to select
3612 theorems that do not match. Intro, elim, dest select theorems that
3613 match the current goal, name:s selects theorems whose fully qualified
3614 name contain s, and simp:term selects all simplification rules whose
3615 lhs match term. Any other term is interpreted as pattern and selects
3616 all theorems matching the pattern. Available in ProofGeneral under
3617 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3619 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3621 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3622 matching the current goal as introduction rule and not having "HOL."
3623 in their name (i.e. not being defined in theory HOL).
3625 * Command 'thms_containing' has been discontinued in favour of
3626 'find_theorems'; INCOMPATIBILITY.
3628 * Communication with Proof General is now 8bit clean, which means that
3629 Unicode text in UTF-8 encoding may be used within theory texts (both
3630 formal and informal parts). Cf. option -U of the Isabelle Proof
3631 General interface. Here are some simple examples (cf. src/HOL/ex):
3633 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3634 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3636 * Improved efficiency of the Simplifier and, to a lesser degree, the
3637 Classical Reasoner. Typical big applications run around 2 times
3641 *** Document preparation ***
3643 * Commands 'display_drafts' and 'print_drafts' perform simple output
3644 of raw sources. Only those symbols that do not require additional
3645 LaTeX packages (depending on comments in isabellesym.sty) are
3646 displayed properly, everything else is left verbatim. isatool display
3647 and isatool print are used as front ends (these are subject to the
3648 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3650 * Command tags control specific markup of certain regions of text,
3651 notably folding and hiding. Predefined tags include "theory" (for
3652 theory begin and end), "proof" for proof commands, and "ML" for
3653 commands involving ML code; the additional tags "visible" and
3654 "invisible" are unused by default. Users may give explicit tag
3655 specifications in the text, e.g. ''by %invisible (auto)''. The
3656 interpretation of tags is determined by the LaTeX job during document
3657 preparation: see option -V of isatool usedir, or options -n and -t of
3658 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3661 Several document versions may be produced at the same time via isatool
3662 usedir (the generated index.html will link all of them). Typical
3663 specifications include ''-V document=theory,proof,ML'' to present
3664 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3665 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3666 these parts without any formal replacement text. The Isabelle site
3667 default settings produce ''document'' and ''outline'' versions as
3670 * Several new antiquotations:
3672 @{term_type term} prints a term with its type annotated;
3674 @{typeof term} prints the type of a term;
3676 @{const const} is the same as @{term const}, but checks that the
3677 argument is a known logical constant;
3679 @{term_style style term} and @{thm_style style thm} print a term or
3680 theorem applying a "style" to it
3684 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3685 definitions, equations, inequations etc., 'concl' printing only the
3686 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3687 to print the specified premise. TermStyle.add_style provides an ML
3688 interface for introducing further styles. See also the "LaTeX Sugar"
3689 document practical applications. The ML antiquotation prints
3690 type-checked ML expressions verbatim.
3692 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3693 and 'text' support optional locale specification '(in loc)', which
3694 specifies the default context for interpreting antiquotations. For
3695 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3697 * Option 'locale=NAME' of antiquotations specifies an alternative
3698 context interpreting the subsequent argument. For example: @{thm
3699 [locale=lattice] inf_assoc}.
3701 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3704 * Proper output of antiquotations for theory commands involving a
3705 proof context (such as 'locale' or 'theorem (in loc) ...').
3707 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3708 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3710 * isatool usedir: new option -C (default true) controls whether option
3711 -D should include a copy of the original document directory; -C false
3712 prevents unwanted effects such as copying of administrative CVS data.
3717 * Considerably improved version of 'constdefs' command. Now performs
3718 automatic type-inference of declared constants; additional support for
3719 local structure declarations (cf. locales and HOL records), see also
3720 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3721 sequential dependencies of definitions within a single 'constdefs'
3722 section; moreover, the declared name needs to be an identifier. If
3723 all fails, consider to fall back on 'consts' and 'defs' separately.
3725 * Improved indexed syntax and implicit structures. First of all,
3726 indexed syntax provides a notational device for subscripted
3727 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3728 expressions. Secondly, in a local context with structure
3729 declarations, number indexes \<^sub>n or the empty index (default
3730 number 1) refer to a certain fixed variable implicitly; option
3731 show_structs controls printing of implicit structures. Typical
3732 applications of these concepts involve record types and locales.
3734 * New command 'no_syntax' removes grammar declarations (and
3735 translations) resulting from the given syntax specification, which is
3736 interpreted in the same manner as for the 'syntax' command.
3738 * 'Advanced' translation functions (parse_translation etc.) may depend
3739 on the signature of the theory context being presently used for
3740 parsing/printing, see also isar-ref manual.
3742 * Improved 'oracle' command provides a type-safe interface to turn an
3743 ML expression of type theory -> T -> term into a primitive rule of
3744 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3745 is already included here); see also FOL/ex/IffExample.thy;
3748 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3749 before); "cI" is no longer bound, use "c.intro" instead.
3750 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3751 axclasses vs. locales.
3753 * Improved internal renaming of symbolic identifiers -- attach primes
3754 instead of base 26 numbers.
3756 * New flag show_question_marks controls printing of leading question
3757 marks in schematic variable names.
3759 * In schematic variable names, *any* symbol following \<^isub> or
3760 \<^isup> is now treated as part of the base name. For example, the
3761 following works without printing of awkward ".0" indexes:
3763 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3766 * Inner syntax includes (*(*nested*) comments*).
3768 * Pretty printer now supports unbreakable blocks, specified in mixfix
3769 annotations as "(00...)".
3771 * Clear separation of logical types and nonterminals, where the latter
3772 may only occur in 'syntax' specifications or type abbreviations.
3773 Before that distinction was only partially implemented via type class
3774 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3775 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3776 exotic syntax specifications may require further adaption
3777 (e.g. Cube/Cube.thy).
3779 * Removed obsolete type class "logic", use the top sort {} instead.
3780 Note that non-logical types should be declared as 'nonterminals'
3781 rather than 'types'. INCOMPATIBILITY for new object-logic
3784 * Attributes 'induct' and 'cases': type or set names may now be
3785 locally fixed variables as well.
3787 * Simplifier: can now control the depth to which conditional rewriting
3788 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3791 * Simplifier: simplification procedures may now take the current
3792 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3793 interface), which is very useful for calling the Simplifier
3794 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3795 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3796 low-level mk_simproc no longer applies Logic.varify internally, to
3797 allow for use in a context of fixed variables.
3799 * thin_tac now works even if the assumption being deleted contains !!
3800 or ==>. More generally, erule now works even if the major premise of
3801 the elimination rule contains !! or ==>.
3803 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3805 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3806 from Pure, which contains all common declarations already. Both
3807 theories are defined via plain Isabelle/Isar .thy files.
3808 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3809 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3810 use isatool fixcpure to adapt your theory and ML sources.
3812 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3813 selections of theorems in named facts via index ranges.
3815 * 'print_theorems': in theory mode, really print the difference
3816 wrt. the last state (works for interactive theory development only),
3817 in proof mode print all local facts (cf. 'print_facts');
3819 * 'hide': option '(open)' hides only base names.
3821 * More efficient treatment of intermediate checkpoints in interactive
3824 * Code generator is now invoked via code_module (incremental code
3825 generation) and code_library (modular code generation, ML structures
3826 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3827 must be quoted when used as identifiers.
3829 * New 'value' command for reading, evaluating and printing terms using
3830 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3831 quoted when used as identifier.
3836 * New commands for the interpretation of locale expressions in
3837 theories (1), locales (2) and proof contexts (3). These generate
3838 proof obligations from the expression specification. After the
3839 obligations have been discharged, theorems of the expression are added
3840 to the theory, target locale or proof context. The synopsis of the
3841 commands is a follows:
3843 (1) interpretation expr inst
3844 (2) interpretation target < expr
3845 (3) interpret expr inst
3847 Interpretation in theories and proof contexts require a parameter
3848 instantiation of terms from the current context. This is applied to
3849 specifications and theorems of the interpreted expression.
3850 Interpretation in locales only permits parameter renaming through the
3851 locale expression. Interpretation is smart in that interpretations
3852 that are active already do not occur in proof obligations, neither are
3853 instantiated theorems stored in duplicate. Use 'print_interps' to
3854 inspect active interpretations of a particular locale. For details,
3855 see the Isar Reference manual. Examples can be found in
3856 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3858 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3859 'interpret' instead.
3861 * New context element 'constrains' for adding type constraints to
3864 * Context expressions: renaming of parameters with syntax
3867 * Locale declaration: 'includes' disallowed.
3869 * Proper static binding of attribute syntax -- i.e. types / terms /
3870 facts mentioned as arguments are always those of the locale definition
3871 context, independently of the context of later invocations. Moreover,
3872 locale operations (renaming and type / term instantiation) are applied
3873 to attribute arguments as expected.
3875 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3876 actual attributes; rare situations may require Attrib.attribute to
3877 embed those attributes into Attrib.src that lack concrete syntax.
3878 Attribute implementations need to cooperate properly with the static
3879 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3880 Attrib.XXX_thm etc. already do the right thing without further
3881 intervention. Only unusual applications -- such as "where" or "of"
3882 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3883 on the context and the facts involved -- may have to assign parsed
3884 values to argument tokens explicitly.
3886 * Changed parameter management in theorem generation for long goal
3887 statements with 'includes'. INCOMPATIBILITY: produces a different
3888 theorem statement in rare situations.
3890 * Locale inspection command 'print_locale' omits notes elements. Use
3891 'print_locale!' to have them included in the output.
3896 * Provers/hypsubst.ML: improved version of the subst method, for
3897 single-step rewriting: it now works in bound variable contexts. New is
3898 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3899 rewrite a different subterm than the original subst method, which is
3900 still available as 'simplesubst'.
3902 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3905 * Provers/trancl.ML: new transitivity reasoner for transitive and
3906 reflexive-transitive closure of relations.
3908 * Provers/blast.ML: new reference depth_limit to make blast's depth
3909 limit (previously hard-coded with a value of 20) user-definable.
3911 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3912 is peformed already. Object-logics merely need to finish their
3913 initial simpset configuration as before. INCOMPATIBILITY.
3918 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3921 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3923 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3924 and x-symbol; use option '-m epsilon' to get it actually printed.
3925 Moreover, the mathematically important symbolic identifier \<epsilon>
3926 becomes available as variable, constant etc. INCOMPATIBILITY,
3928 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3929 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3930 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3931 support corresponding Isar calculations.
3933 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3936 * theory SetInterval: changed the syntax for open intervals:
3945 The old syntax is still supported but will disappear in the next
3946 release. For conversion use the following Emacs search and replace
3947 patterns (these are not perfect but work quite well):
3949 {)\([^\.]*\)\.\. -> {\1<\.\.}
3950 \.\.\([^(}]*\)(} -> \.\.<\1}
3952 * Theory Commutative_Ring (in Library): method comm_ring for proving
3953 equalities in commutative rings; method 'algebra' provides a generic
3956 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3957 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3958 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3961 Some new syntax forms are available:
3963 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3964 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3965 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3966 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3968 The latter form "\<Sum>x < k. e" used to be based on a separate
3969 function "Summation", which has been discontinued.
3971 * theory Finite_Set: in structured induction proofs, the insert case
3972 is now 'case (insert x F)' instead of the old counterintuitive 'case
3975 * The 'refute' command has been extended to support a much larger
3976 fragment of HOL, including axiomatic type classes, constdefs and
3977 typedefs, inductive datatypes and recursion.
3979 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3980 Requires zChaff with proof generation to be installed. See
3981 HOL/ex/SAT_Examples.thy for examples.
3983 * Datatype induction via method 'induct' now preserves the name of the
3984 induction variable. For example, when proving P(xs::'a list) by
3985 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3986 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3987 in unstructured proof scripts.
3989 * Reworked implementation of records. Improved scalability for
3990 records with many fields, avoiding performance problems for type
3991 inference. Records are no longer composed of nested field types, but
3992 of nested extension types. Therefore the record type only grows linear
3993 in the number of extensions and not in the number of fields. The
3994 top-level (users) view on records is preserved. Potential
3995 INCOMPATIBILITY only in strange cases, where the theory depends on the
3996 old record representation. The type generated for a record is called
3997 <record_name>_ext_type.
3999 Flag record_quick_and_dirty_sensitive can be enabled to skip the
4000 proofs triggered by a record definition or a simproc (if
4001 quick_and_dirty is enabled). Definitions of large records can take
4004 New simproc record_upd_simproc for simplification of multiple record
4005 updates enabled by default. Moreover, trivial updates are also
4006 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4007 occasionally, since simplification is more powerful by default.
4009 * typedef: proper support for polymorphic sets, which contain extra
4010 type-variables in the term.
4012 * Simplifier: automatically reasons about transitivity chains
4013 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4014 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4015 old proofs break occasionally as simplification may now solve more
4016 goals than previously.
4018 * Simplifier: converts x <= y into x = y if assumption y <= x is
4019 present. Works for all partial orders (class "order"), in particular
4020 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4023 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4024 bound variable or a constant then the let is unfolded. Otherwise
4025 first a is simplified to b, and then f b is simplified to g. If
4026 possible we abstract b from g arriving at "let x = b in h x",
4027 otherwise we unfold the let and arrive at g. The simproc can be
4028 enabled/disabled by the reference use_let_simproc. Potential
4029 INCOMPATIBILITY since simplification is more powerful by default.
4031 * Classical reasoning: the meson method now accepts theorems as arguments.
4033 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4034 jobs to provide advice on the provability of subgoals.
4036 * Theory OrderedGroup and Ring_and_Field: various additions and
4037 improvements to faciliate calculations involving equalities and
4040 The following theorems have been eliminated or modified
4043 abs_eq now named abs_of_nonneg
4044 abs_of_ge_0 now named abs_of_nonneg
4045 abs_minus_eq now named abs_of_nonpos
4046 imp_abs_id now named abs_of_nonneg
4047 imp_abs_neg_id now named abs_of_nonpos
4048 mult_pos now named mult_pos_pos
4049 mult_pos_le now named mult_nonneg_nonneg
4050 mult_pos_neg_le now named mult_nonneg_nonpos
4051 mult_pos_neg2_le now named mult_nonneg_nonpos2
4052 mult_neg now named mult_neg_neg
4053 mult_neg_le now named mult_nonpos_nonpos
4055 * The following lemmas in Ring_and_Field have been added to the simplifier:
4058 not_square_less_zero
4060 The following lemmas have been deleted from Real/RealPow:
4070 * Theory Parity: added rules for simplifying exponents.
4074 The following theorems have been eliminated or modified
4077 list_all_Nil now named list_all.simps(1)
4078 list_all_Cons now named list_all.simps(2)
4079 list_all_conv now named list_all_iff
4080 set_mem_eq now named mem_iff
4082 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4083 asymptotic "big O" calculations. See the notes in BigO.thy.
4088 * Theory RealDef: better support for embedding natural numbers and
4089 integers in the reals.
4091 The following theorems have been eliminated or modified
4094 exp_ge_add_one_self now requires no hypotheses
4095 real_of_int_add reversed direction of equality (use [symmetric])
4096 real_of_int_minus reversed direction of equality (use [symmetric])
4097 real_of_int_diff reversed direction of equality (use [symmetric])
4098 real_of_int_mult reversed direction of equality (use [symmetric])
4100 * Theory RComplete: expanded support for floor and ceiling functions.
4102 * Theory Ln is new, with properties of the natural logarithm
4104 * Hyperreal: There is a new type constructor "star" for making
4105 nonstandard types. The old type names are now type synonyms:
4109 hcomplex = complex star
4111 * Hyperreal: Many groups of similarly-defined constants have been
4112 replaced by polymorphic versions (INCOMPATIBILITY):
4114 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4116 starset <-- starsetNat, starsetC
4117 *s* <-- *sNat*, *sc*
4118 starset_n <-- starsetNat_n, starsetC_n
4119 *sn* <-- *sNatn*, *scn*
4120 InternalSets <-- InternalNatSets, InternalCSets
4122 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4123 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4124 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4125 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4126 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4128 * Hyperreal: Many type-specific theorems have been removed in favor of
4129 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4131 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4132 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4133 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4134 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4135 right_minus <-- hypreal_add_minus
4136 left_minus <-- {hypreal,hcomplex}_add_minus_left
4137 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4138 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4139 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4140 mult_1_right <-- hcomplex_mult_one_right
4141 mult_zero_left <-- hcomplex_mult_zero_left
4142 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4143 right_distrib <-- hypnat_add_mult_distrib2
4144 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4145 right_inverse <-- hypreal_mult_inverse
4146 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4147 order_refl <-- {hypreal,hypnat}_le_refl
4148 order_trans <-- {hypreal,hypnat}_le_trans
4149 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4150 order_less_le <-- {hypreal,hypnat}_less_le
4151 linorder_linear <-- {hypreal,hypnat}_le_linear
4152 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4153 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4154 add_nonneg_nonneg <-- hypreal_le_add_order
4156 * Hyperreal: Separate theorems having to do with type-specific
4157 versions of constants have been merged into theorems that apply to the
4158 new polymorphic constants (INCOMPATIBILITY):
4160 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4161 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4162 STAR_Un <-- {STAR,NatStar,STARC}_Un
4163 STAR_Int <-- {STAR,NatStar,STARC}_Int
4164 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4165 STAR_subset <-- {STAR,NatStar,STARC}_subset
4166 STAR_mem <-- {STAR,NatStar,STARC}_mem
4167 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4168 STAR_diff <-- {STAR,STARC}_diff
4169 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4170 STARC_hcomplex_of_complex}_image_subset
4171 starset_n_Un <-- starset{Nat,C}_n_Un
4172 starset_n_Int <-- starset{Nat,C}_n_Int
4173 starset_n_Compl <-- starset{Nat,C}_n_Compl
4174 starset_n_diff <-- starset{Nat,C}_n_diff
4175 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4176 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4177 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4178 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4179 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4180 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4181 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4182 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4183 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4184 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4185 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4186 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4187 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4188 starfun_diff <-- starfun{C,RC,CR}_diff
4189 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4190 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4191 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4192 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4193 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4194 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4195 starfun_Id <-- starfunC_Id
4196 starfun_approx <-- starfun{Nat,CR}_approx
4197 starfun_capprox <-- starfun{C,RC}_capprox
4198 starfun_abs <-- starfunNat_rabs
4199 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4200 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4201 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4202 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4203 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4204 starfun_add_approx <-- starfunCR_add_approx
4205 starfun_inverse_inverse <-- starfunC_inverse_inverse
4206 starfun_divide <-- starfun{C,CR,RC}_divide
4207 starfun_n <-- starfun{Nat,C}_n
4208 starfun_n_mult <-- starfun{Nat,C}_n_mult
4209 starfun_n_add <-- starfun{Nat,C}_n_add
4210 starfun_n_add_minus <-- starfunNat_n_add_minus
4211 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4212 starfun_n_minus <-- starfun{Nat,C}_n_minus
4213 starfun_n_eq <-- starfun{Nat,C}_n_eq
4215 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4216 star_n_minus <-- {hypreal,hcomplex}_minus
4217 star_n_diff <-- {hypreal,hcomplex}_diff
4218 star_n_mult <-- {hypreal,hcomplex}_mult
4219 star_n_inverse <-- {hypreal,hcomplex}_inverse
4220 star_n_le <-- {hypreal,hypnat}_le
4221 star_n_less <-- {hypreal,hypnat}_less
4222 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4223 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4224 star_n_abs <-- hypreal_hrabs
4225 star_n_divide <-- hcomplex_divide
4227 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4228 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4229 star_of_diff <-- hypreal_of_real_diff
4230 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4231 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4232 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4233 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4234 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4235 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4236 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4237 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4238 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4239 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4240 star_of_number_of <-- {hypreal,hcomplex}_number_of
4241 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4242 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4243 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4244 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4245 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4246 star_of_power <-- hypreal_of_real_power
4247 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4249 * Hyperreal: new method "transfer" that implements the transfer
4250 principle of nonstandard analysis. With a subgoal that mentions
4251 nonstandard types like "'a star", the command "apply transfer"
4252 replaces it with an equivalent one that mentions only standard types.
4253 To be successful, all free variables must have standard types; non-
4254 standard variables must have explicit universal quantifiers.
4256 * Hyperreal: A theory of Taylor series.
4261 * Discontinued special version of 'constdefs' (which used to support
4262 continuous functions) in favor of the general Pure one with full
4265 * New simplification procedure for solving continuity conditions; it
4266 is much faster on terms with many nested lambda abstractions (cubic
4267 instead of exponential time).
4269 * New syntax for domain package: selector names are now optional.
4270 Parentheses should be omitted unless argument is lazy, for example:
4272 domain 'a stream = cons "'a" (lazy "'a stream")
4274 * New command 'fixrec' for defining recursive functions with pattern
4275 matching; defining multiple functions with mutual recursion is also
4276 supported. Patterns may include the constants cpair, spair, up, sinl,
4277 sinr, or any data constructor defined by the domain package. The given
4278 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4279 syntax and examples.
4281 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4282 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4283 but the proof obligation additionally includes an admissibility
4284 requirement. The packages generate instances of class cpo or pcpo,
4285 with continuity and strictness theorems for Rep and Abs.
4287 * HOLCF: Many theorems have been renamed according to a more standard naming
4288 scheme (INCOMPATIBILITY):
4290 foo_inject: "foo$x = foo$y ==> x = y"
4291 foo_eq: "(foo$x = foo$y) = (x = y)"
4292 foo_less: "(foo$x << foo$y) = (x << y)"
4293 foo_strict: "foo$UU = UU"
4294 foo_defined: "... ==> foo$x ~= UU"
4295 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4300 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4301 including the First Isomorphism Theorem (on quotienting by the kernel
4304 * ZF/Simplifier: install second copy of type solver that actually
4305 makes use of TC rules declared to Isar proof contexts (or locales);
4306 the old version is still required for ML proof scripts.
4311 * Converted to Isar theory format; use locales instead of axiomatic
4317 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4320 * Pure/library.ML no longer defines its own option datatype, but uses
4321 that of the SML basis, which has constructors NONE and SOME instead of
4322 None and Some, as well as exception Option.Option instead of OPTION.
4323 The functions the, if_none, is_some, is_none have been adapted
4324 accordingly, while Option.map replaces apsome.
4326 * Pure/library.ML: the exception LIST has been given up in favour of
4327 the standard exceptions Empty and Subscript, as well as
4328 Library.UnequalLengths. Function like Library.hd and Library.tl are
4329 superceded by the standard hd and tl functions etc.
4331 A number of basic list functions are no longer exported to the ML
4332 toplevel, as they are variants of predefined functions. The following
4333 suggests how one can translate existing code:
4335 rev_append xs ys = List.revAppend (xs, ys)
4336 nth_elem (i, xs) = List.nth (xs, i)
4337 last_elem xs = List.last xs
4338 flat xss = List.concat xss
4339 seq fs = List.app fs
4340 partition P xs = List.partition P xs
4341 mapfilter f xs = List.mapPartial f xs
4343 * Pure/library.ML: several combinators for linear functional
4344 transformations, notably reverse application and composition:
4347 (x, y) |-> f f #-> g
4349 * Pure/library.ML: introduced/changed precedence of infix operators:
4351 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4353 infix 3 o oo ooo oooo;
4354 infix 4 ~~ upto downto;
4356 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4359 * Pure/library.ML: natural list combinators fold, fold_rev, and
4360 fold_map support linear functional transformations and nesting. For
4363 fold f [x1, ..., xN] y =
4364 y |> f x1 |> ... |> f xN
4366 (fold o fold) f [xs1, ..., xsN] y =
4367 y |> fold f xs1 |> ... |> fold f xsN
4369 fold f [x1, ..., xN] =
4372 (fold o fold) f [xs1, ..., xsN] =
4373 fold f xs1 #> ... #> fold f xsN
4375 * Pure/library.ML: the following selectors on type 'a option are
4378 the: 'a option -> 'a (*partial*)
4379 these: 'a option -> 'a where 'a = 'b list
4380 the_default: 'a -> 'a option -> 'a
4381 the_list: 'a option -> 'a list
4383 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4384 basic operations for association lists, following natural argument
4385 order; moreover the explicit equality predicate passed here avoids
4386 potentially expensive polymorphic runtime equality checks.
4387 The old functions may be expressed as follows:
4389 assoc = uncurry (AList.lookup (op =))
4390 assocs = these oo AList.lookup (op =)
4391 overwrite = uncurry (AList.update (op =)) o swap
4393 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4395 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4396 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4398 replacing make_keylist and keyfilter (occassionally used)
4401 make_keylist = AList.make
4402 keyfilter = AList.find (op =)
4404 * eq_fst and eq_snd now take explicit equality parameter, thus
4405 avoiding eqtypes. Naive rewrites:
4407 eq_fst = eq_fst (op =)
4408 eq_snd = eq_snd (op =)
4410 * Removed deprecated apl and apr (rarely used).
4413 apl (n, op) =>>= curry op n
4414 apr (op, m) =>>= fn n => op (n, m)
4416 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4417 provides a reasonably efficient light-weight implementation of sets as
4420 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4421 few new operations; existing lookup and update are now curried to
4422 follow natural argument order (for use with fold etc.);
4423 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4425 * Pure/General: output via the Isabelle channels of
4426 writeln/warning/error etc. is now passed through Output.output, with a
4427 hook for arbitrary transformations depending on the print_mode
4428 (cf. Output.add_mode -- the first active mode that provides a output
4429 function wins). Already formatted output may be embedded into further
4430 text via Output.raw; the result of Pretty.string_of/str_of and derived
4431 functions (string_of_term/cterm/thm etc.) is already marked raw to
4432 accommodate easy composition of diagnostic messages etc. Programmers
4433 rarely need to care about Output.output or Output.raw at all, with
4434 some notable exceptions: Output.output is required when bypassing the
4435 standard channels (writeln etc.), or in token translations to produce
4436 properly formatted results; Output.raw is required when capturing
4437 already output material that will eventually be presented to the user
4438 a second time. For the default print mode, both Output.output and
4439 Output.raw have no effect.
4441 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4442 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4443 cumulative results are displayed at the end of a batch session.
4445 * Pure/General: File.sysify_path and File.quote_sysify path have been
4446 replaced by File.platform_path and File.shell_path (with appropriate
4447 hooks). This provides a clean interface for unusual systems where the
4448 internal and external process view of file names are different.
4450 * Pure: more efficient orders for basic syntactic entities: added
4451 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4452 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4453 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4454 orders now -- potential INCOMPATIBILITY for code that depends on a
4455 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4456 Library.sort_strings on result).
4458 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4459 fold_types traverse types/terms from left to right, observing natural
4460 argument order. Supercedes previous foldl_XXX versions, add_frees,
4461 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4463 * Pure: name spaces have been refined, with significant changes of the
4464 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4465 to extern(_table). The plain name entry path is superceded by a
4466 general 'naming' context, which also includes the 'policy' to produce
4467 a fully qualified name and external accesses of a fully qualified
4468 name; NameSpace.extend is superceded by context dependent
4469 Sign.declare_name. Several theory and proof context operations modify
4470 the naming context. Especially note Theory.restore_naming and
4471 ProofContext.restore_naming to get back to a sane state; note that
4472 Theory.add_path is no longer sufficient to recover from
4473 Theory.absolute_path in particular.
4475 * Pure: new flags short_names (default false) and unique_names
4476 (default true) for controlling output of qualified names. If
4477 short_names is set, names are printed unqualified. If unique_names is
4478 reset, the name prefix is reduced to the minimum required to achieve
4479 the original result when interning again, even if there is an overlap
4480 with earlier declarations.
4482 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4483 now 'extend', and 'merge' gets an additional Pretty.pp argument
4484 (useful for printing error messages). INCOMPATIBILITY.
4486 * Pure: major reorganization of the theory context. Type Sign.sg and
4487 Theory.theory are now identified, referring to the universal
4488 Context.theory (see Pure/context.ML). Actual signature and theory
4489 content is managed as theory data. The old code and interfaces were
4490 spread over many files and structures; the new arrangement introduces
4491 considerable INCOMPATIBILITY to gain more clarity:
4493 Context -- theory management operations (name, identity, inclusion,
4494 parents, ancestors, merge, etc.), plus generic theory data;
4496 Sign -- logical signature and syntax operations (declaring consts,
4497 types, etc.), plus certify/read for common entities;
4499 Theory -- logical theory operations (stating axioms, definitions,
4500 oracles), plus a copy of logical signature operations (consts,
4501 types, etc.); also a few basic management operations (Theory.copy,
4504 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4505 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4506 for convenience -- they merely return the theory.
4508 * Pure: type Type.tsig is superceded by theory in most interfaces.
4510 * Pure: the Isar proof context type is already defined early in Pure
4511 as Context.proof (note that ProofContext.context and Proof.context are
4512 aliases, where the latter is the preferred name). This enables other
4513 Isabelle components to refer to that type even before Isar is present.
4515 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4516 typeK, constK, axiomK, oracleK), but provide explicit operations for
4517 any of these kinds. For example, Sign.intern typeK is now
4518 Sign.intern_type, Theory.hide_space Sign.typeK is now
4519 Theory.hide_types. Also note that former
4520 Theory.hide_classes/types/consts are now
4521 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4522 internalize their arguments! INCOMPATIBILITY.
4524 * Pure: get_thm interface (of PureThy and ProofContext) expects
4525 datatype thmref (with constructors Name and NameSelection) instead of
4526 plain string -- INCOMPATIBILITY;
4528 * Pure: cases produced by proof methods specify options, where NONE
4529 means to remove case bindings -- INCOMPATIBILITY in
4532 * Pure: the following operations retrieve axioms or theorems from a
4533 theory node or theory hierarchy, respectively:
4535 Theory.axioms_of: theory -> (string * term) list
4536 Theory.all_axioms_of: theory -> (string * term) list
4537 PureThy.thms_of: theory -> (string * thm) list
4538 PureThy.all_thms_of: theory -> (string * thm) list
4540 * Pure: print_tac now outputs the goal through the trace channel.
4542 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4543 Reference Toplevel.debug (default false) controls detailed printing
4544 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4545 controls execution profiling -- set to 1 for time and 2 for space
4546 (both increase the runtime).
4548 * Isar session: The initial use of ROOT.ML is now always timed,
4549 i.e. the log will show the actual process times, in contrast to the
4550 elapsed wall-clock time that the outer shell wrapper produces.
4552 * Simplifier: improved handling of bound variables (nameless
4553 representation, avoid allocating new strings). Simprocs that invoke
4554 the Simplifier recursively should use Simplifier.inherit_bounds to
4555 avoid local name clashes. Failure to do so produces warnings
4556 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4557 for further details.
4559 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4560 bindings for all theorems stored within a given theory; this may help
4561 in porting non-Isar theories to Isar ones, while keeping ML proof
4562 scripts for the time being.
4564 * ML operator HTML.with_charset specifies the charset begin used for
4565 generated HTML files. For example:
4567 HTML.with_charset "utf-8" use_thy "Hebrew";
4568 HTML.with_charset "utf-8" use_thy "Chinese";
4573 * Allow symlinks to all proper Isabelle executables (Isabelle,
4574 isabelle, isatool etc.).
4576 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4577 isatool doc, isatool mkdir, display_drafts etc.).
4579 * isatool usedir: option -f allows specification of the ML file to be
4580 used by Isabelle; default is ROOT.ML.
4582 * New isatool version outputs the version identifier of the Isabelle
4583 distribution being used.
4585 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4586 (containing Boolean satisfiability problems) into Isabelle/HOL
4591 New in Isabelle2004 (April 2004)
4592 --------------------------------
4596 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4597 Replaces linorder.ML.
4599 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4600 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4601 (\<a>...\<z>), are now considered normal letters, and can therefore
4602 be used anywhere where an ASCII letter (a...zA...Z) has until
4603 now. COMPATIBILITY: This obviously changes the parsing of some
4604 terms, especially where a symbol has been used as a binder, say
4605 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4606 as an identifier. Fix it by inserting a space around former
4607 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4608 existing theory and ML files.
4610 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4612 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4613 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4614 a normal (but invisible) letter. For multiple letter subscripts repeat
4615 \<^isub> like this: x\<^isub>1\<^isub>2.
4617 * Pure: There are now sub-/superscripts that can span more than one
4618 character. Text between \<^bsub> and \<^esub> is set in subscript in
4619 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4620 superscript. The new control characters are not identifier parts.
4622 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4623 content of "..." to the latex file instead of \isacntrl... . The "..."
4624 may consist of any printable characters excluding the end bracket >.
4626 * Pure: Using new Isar command "finalconsts" (or the ML functions
4627 Theory.add_finals or Theory.add_finals_i) it is now possible to
4628 declare constants "final", which prevents their being given a definition
4629 later. It is useful for constants whose behaviour is fixed axiomatically
4630 rather than definitionally, such as the meta-logic connectives.
4632 * Pure: 'instance' now handles general arities with general sorts
4633 (i.e. intersections of classes),
4635 * Presentation: generated HTML now uses a CSS style sheet to make layout
4636 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4637 It can be changed to alter the colors/layout of generated pages.
4642 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4643 cut_tac, subgoal_tac and thin_tac:
4644 - Now understand static (Isar) contexts. As a consequence, users of Isar
4645 locales are no longer forced to write Isar proof scripts.
4646 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4648 - INCOMPATIBILITY: names of variables to be instantiated may no
4649 longer be enclosed in quotes. Instead, precede variable name with `?'.
4650 This is consistent with the instantiation attribute "where".
4652 * Attributes "where" and "of":
4653 - Now take type variables of instantiated theorem into account when reading
4654 the instantiation string. This fixes a bug that caused instantiated
4655 theorems to have too special types in some circumstances.
4656 - "where" permits explicit instantiations of type variables.
4658 * Calculation commands "moreover" and "also" no longer interfere with
4659 current facts ("this"), admitting arbitrary combinations with "then"
4663 - Goal statements involving the context element "includes" no longer
4664 generate theorems with internal delta predicates (those ending on
4665 "_axioms") in the premise.
4666 Resolve particular premise with <locale>.intro to obtain old form.
4667 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4668 specification and "includes" elements in goal statement.
4669 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4670 [intro?] and [elim?] (respectively) by default.
4671 - Experimental command for instantiation of locales in proof contexts:
4672 instantiate <label>[<attrs>]: <loc>
4673 Instantiates locale <loc> and adds all its theorems to the current context
4674 taking into account their attributes. Label and attrs are optional
4675 modifiers, like in theorem declarations. If present, names of
4676 instantiated theorems are qualified with <label>, and the attributes
4677 <attrs> are applied after any attributes these theorems might have already.
4678 If the locale has assumptions, a chained fact of the form
4679 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4680 are derived. The command does not support old-style locales declared
4681 with "locale (open)".
4682 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4684 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4690 * Proof import: new image HOL4 contains the imported library from
4691 the HOL4 system with about 2500 theorems. It is imported by
4692 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4693 can be used like any other Isabelle image. See
4694 HOL/Import/HOL/README for more information.
4697 - Much improved handling of linear and partial orders.
4698 Reasoners for linear and partial orders are set up for type classes
4699 "linorder" and "order" respectively, and are added to the default simpset
4700 as solvers. This means that the simplifier can build transitivity chains
4701 to solve goals from the assumptions.
4702 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4703 of blast or auto after simplification become unnecessary because the goal
4704 is solved by simplification already.
4706 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4707 all proved in axiomatic type classes for semirings, rings and fields.
4710 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4711 now formalized using the Ring_and_Field theory mentioned above.
4712 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4713 than before, because now they are set up once in a generic manner.
4714 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4715 Look for the general versions in Ring_and_Field (and Power if they concern
4718 * Type "rat" of the rational numbers is now available in HOL-Complex.
4721 - Record types are now by default printed with their type abbreviation
4722 instead of the list of all field types. This can be configured via
4723 the reference "print_record_type_abbr".
4724 - Simproc "record_upd_simproc" for simplification of multiple updates added
4725 (not enabled by default).
4726 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4727 EX x. x = sel r to True (not enabled by default).
4728 - Tactic "record_split_simp_tac" to split and simplify records added.
4730 * 'specification' command added, allowing for definition by
4731 specification. There is also an 'ax_specification' command that
4732 introduces the new constants axiomatically.
4734 * arith(_tac) is now able to generate counterexamples for reals as well.
4736 * HOL-Algebra: new locale "ring" for non-commutative rings.
4738 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4739 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4741 * HOL-Matrix: a first theory for matrices in HOL with an application of
4742 matrix theory to linear programming.
4744 * Unions and Intersections:
4745 The latex output syntax of UN and INT has been changed
4746 from "\Union x \in A. B" to "\Union_{x \in A} B"
4747 i.e. the index formulae has become a subscript.
4748 Similarly for "\Union x. B", and for \Inter instead of \Union.
4750 * Unions and Intersections over Intervals:
4751 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4752 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4753 like in normal math, and corresponding versions for < and for intersection.
4755 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4756 lexicographic dictonary ordering has been added as "lexord".
4758 * ML: the legacy theory structures Int and List have been removed. They had
4759 conflicted with ML Basis Library structures having the same names.
4761 * 'refute' command added to search for (finite) countermodels. Only works
4762 for a fragment of HOL. The installation of an external SAT solver is
4763 highly recommended. See "HOL/Refute.thy" for details.
4765 * 'quickcheck' command: Allows to find counterexamples by evaluating
4766 formulae under an assignment of free variables to random values.
4767 In contrast to 'refute', it can deal with inductive datatypes,
4768 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4774 * Streams now come with concatenation and are part of the HOLCF image
4778 New in Isabelle2003 (May 2003)
4779 ------------------------------
4783 * Provers/simplifier:
4785 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4786 Assumptions are now subject to complete mutual simplification,
4787 not just from left to right. The simplifier now preserves
4788 the order of assumptions.
4790 Potential INCOMPATIBILITY:
4792 -- simp sometimes diverges where the old version did
4793 not, e.g. invoking simp on the goal
4795 [| P (f x); y = x; f x = f y |] ==> Q
4797 now gives rise to the infinite reduction sequence
4799 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4801 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4804 -- Tactics combining classical reasoner and simplification (such as auto)
4805 are also affected by this change, because many of them rely on
4806 simp. They may sometimes diverge as well or yield a different numbers
4807 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4808 in case of problems. Sometimes subsequent calls to the classical
4809 reasoner will fail because a preceeding call to the simplifier too
4810 eagerly simplified the goal, e.g. deleted redundant premises.
4812 - The simplifier trace now shows the names of the applied rewrite rules
4814 - You can limit the number of recursive invocations of the simplifier
4815 during conditional rewriting (where the simplifie tries to solve the
4816 conditions before applying the rewrite rule):
4817 ML "simp_depth_limit := n"
4818 where n is an integer. Thus you can force termination where previously
4819 the simplifier would diverge.
4821 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4823 - No longer aborts on failed congruence proof. Instead, the
4824 congruence is ignored.
4826 * Pure: New generic framework for extracting programs from constructive
4827 proofs. See HOL/Extraction.thy for an example instantiation, as well
4828 as HOL/Extraction for some case studies.
4830 * Pure: The main goal of the proof state is no longer shown by default, only
4831 the subgoals. This behaviour is controlled by a new flag.
4832 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4833 (ML: Proof.show_main_goal).
4835 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4836 rules whose conclusion matches subgoal 1:
4837 PG menu: Isabelle/Isar -> Show me -> matching rules
4838 The rules are ordered by how closely they match the subgoal.
4839 In particular, rules that solve a subgoal outright are displayed first
4840 (or rather last, the way they are printed).
4841 (ML: ProofGeneral.print_intros())
4843 * Pure: New flag trace_unify_fail causes unification to print
4844 diagnostic information (PG: in trace buffer) when it fails. This is
4845 useful for figuring out why single step proofs like rule, erule or
4848 * Pure: Locale specifications now produce predicate definitions
4849 according to the body of text (covering assumptions modulo local
4850 definitions); predicate "loc_axioms" covers newly introduced text,
4851 while "loc" is cumulative wrt. all included locale expressions; the
4852 latter view is presented only on export into the global theory
4853 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4854 on the old view without predicates;
4856 * Pure: predefined locales "var" and "struct" are useful for sharing
4857 parameters (as in CASL, for example); just specify something like
4858 ``var x + var y + struct M'' as import;
4860 * Pure: improved thms_containing: proper indexing of facts instead of
4861 raw theorems; check validity of results wrt. current name space;
4862 include local facts of proof configuration (also covers active
4863 locales), cover fixed variables in index; may use "_" in term
4864 specification; an optional limit for the number of printed facts may
4865 be given (the default is 40);
4867 * Pure: disallow duplicate fact bindings within new-style theory files
4870 * Provers: improved induct method: assumptions introduced by case
4871 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4872 the goal statement); "foo" still refers to all facts collectively;
4874 * Provers: the function blast.overloaded has been removed: all constants
4875 are regarded as potentially overloaded, which improves robustness in exchange
4876 for slight decrease in efficiency;
4878 * Provers/linorder: New generic prover for transitivity reasoning over
4879 linear orders. Note: this prover is not efficient!
4881 * Isar: preview of problems to finish 'show' now produce an error
4882 rather than just a warning (in interactive mode);
4889 - Produces a counter example if it cannot prove a goal.
4890 Note that the counter example may be spurious if the goal is not a formula
4891 of quantifier-free linear arithmetic.
4892 In ProofGeneral the counter example appears in the trace buffer.
4894 - Knows about div k and mod k where k is a numeral of type nat or int.
4896 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4897 linear arithmetic fails. This takes account of quantifiers and divisibility.
4898 Presburger arithmetic can also be called explicitly via presburger(_tac).
4900 * simp's arithmetic capabilities have been enhanced a bit: it now
4901 takes ~= in premises into account (by performing a case split);
4903 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4904 are distributed over a sum of terms;
4906 * New tactic "trans_tac" and method "trans" instantiate
4907 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4910 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4911 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4913 * 'typedef' command has new option "open" to suppress the set
4916 * functions Min and Max on finite sets have been introduced (theory
4919 * attribute [symmetric] now works for relations as well; it turns
4920 (x,y) : R^-1 into (y,x) : R, and vice versa;
4922 * induct over a !!-quantified statement (say !!x1..xn):
4923 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4925 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4926 %x. None. Warning: empty_def now refers to the previously hidden definition
4929 * Algebra: formalization of classical algebra. Intended as base for
4930 any algebraic development in Isabelle. Currently covers group theory
4931 (up to Sylow's theorem) and ring theory (Universal Property of
4932 Univariate Polynomials). Contributions welcome;
4934 * GroupTheory: deleted, since its material has been moved to Algebra;
4936 * Complex: new directory of the complex numbers with numeric constants,
4937 nonstandard complex numbers, and some complex analysis, standard and
4938 nonstandard (Jacques Fleuriot);
4940 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4942 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4945 * Real/HahnBanach: updated and adapted to locales;
4947 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4950 * UNITY: added the Meier-Sanders theory of progress sets;
4952 * MicroJava: bytecode verifier and lightweight bytecode verifier
4953 as abstract algorithms, instantiated to the JVM;
4955 * Bali: Java source language formalization. Type system, operational
4956 semantics, axiomatic semantics. Supported language features:
4957 classes, interfaces, objects,virtual methods, static methods,
4958 static/instance fields, arrays, access modifiers, definite
4959 assignment, exceptions.
4964 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4967 * Main ZF: virtually all theories converted to new-style format;
4972 * Pure: Tactic.prove provides sane interface for internal proofs;
4973 omits the infamous "standard" operation, so this is more appropriate
4974 than prove_goalw_cterm in many situations (e.g. in simprocs);
4976 * Pure: improved error reporting of simprocs;
4978 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4982 *** Document preparation ***
4984 * uses \par instead of \\ for line breaks in theory text. This may
4985 shift some page breaks in large documents. To get the old behaviour
4986 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4988 * minimized dependencies of isabelle.sty and isabellesym.sty on
4991 * \<euro> now needs package babel/greek instead of marvosym (which
4994 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4999 New in Isabelle2002 (March 2002)
5000 --------------------------------
5002 *** Document preparation ***
5004 * greatly simplified document preparation setup, including more
5005 graceful interpretation of isatool usedir -i/-d/-D options, and more
5006 instructive isatool mkdir; users should basically be able to get
5007 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5008 users may run a separate document processing stage manually like this:
5009 "isatool usedir -D output HOL Test && isatool document Test/output";
5011 * theory dependency graph may now be incorporated into documents;
5012 isatool usedir -g true will produce session_graph.eps/.pdf for use
5013 with \includegraphics of LaTeX;
5015 * proper spacing of consecutive markup elements, especially text
5016 blocks after section headings;
5018 * support bold style (for single symbols only), input syntax is like
5019 this: "\<^bold>\<alpha>" or "\<^bold>A";
5021 * \<bullet> is now output as bold \cdot by default, which looks much
5022 better in printed text;
5024 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5025 note that these symbols are currently unavailable in Proof General /
5026 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5028 * isatool latex no longer depends on changed TEXINPUTS, instead
5029 isatool document copies the Isabelle style files to the target
5035 * Pure/Provers: improved proof by cases and induction;
5036 - 'case' command admits impromptu naming of parameters (such as
5038 - 'induct' method divinates rule instantiation from the inductive
5039 claim; no longer requires excessive ?P bindings for proper
5040 instantiation of cases;
5041 - 'induct' method properly enumerates all possibilities of set/type
5042 rules; as a consequence facts may be also passed through *type*
5043 rules without further ado;
5044 - 'induct' method now derives symbolic cases from the *rulified*
5045 rule (before it used to rulify cases stemming from the internal
5046 atomized version); this means that the context of a non-atomic
5047 statement becomes is included in the hypothesis, avoiding the
5048 slightly cumbersome show "PROP ?case" form;
5049 - 'induct' may now use elim-style induction rules without chaining
5050 facts, using ``missing'' premises from the goal state; this allows
5051 rules stemming from inductive sets to be applied in unstructured
5052 scripts, while still benefitting from proper handling of non-atomic
5053 statements; NB: major inductive premises need to be put first, all
5054 the rest of the goal is passed through the induction;
5055 - 'induct' proper support for mutual induction involving non-atomic
5056 rule statements (uses the new concept of simultaneous goals, see
5058 - append all possible rule selections, but only use the first
5059 success (no backtracking);
5060 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5061 - undeclared rule case names default to numbers 1, 2, 3, ...;
5062 - added 'print_induct_rules' (covered by help item in recent Proof
5064 - moved induct/cases attributes to Pure, methods to Provers;
5065 - generic method setup instantiated for FOL and HOL;
5067 * Pure: support multiple simultaneous goal statements, for example
5068 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5069 meta-level mechanism, this acts as if several individual goals had
5070 been stated separately; in particular common proof methods need to be
5071 repeated in order to cover all claims; note that a single elimination
5072 step is *not* sufficient to establish the two conjunctions, so this
5075 assume "A & B" then have A and B .. (*".." fails*)
5077 better use "obtain" in situations as above; alternative refer to
5078 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5080 * Pure: proper integration with ``locales''; unlike the original
5081 version by Florian Kammller, Isar locales package high-level proof
5082 contexts rather than raw logical ones (e.g. we admit to include
5083 attributes everywhere); operations on locales include merge and
5084 rename; support for implicit arguments (``structures''); simultaneous
5085 type-inference over imports and text; see also HOL/ex/Locales.thy for
5088 * Pure: the following commands have been ``localized'', supporting a
5089 target locale specification "(in name)": 'lemma', 'theorem',
5090 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5091 stored both within the locale and at the theory level (exported and
5092 qualified by the locale name);
5094 * Pure: theory goals may now be specified in ``long'' form, with
5095 ad-hoc contexts consisting of arbitrary locale elements. for example
5096 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5097 definitions may be given, too); the result is a meta-level rule with
5098 the context elements being discharged in the obvious way;
5100 * Pure: new proof command 'using' allows to augment currently used
5101 facts after a goal statement ('using' is syntactically analogous to
5102 'apply', but acts on the goal's facts only); this allows chained facts
5103 to be separated into parts given before and after a claim, as in
5104 ``from a and b have C using d and e <proof>'';
5106 * Pure: renamed "antecedent" case to "rule_context";
5108 * Pure: new 'judgment' command records explicit information about the
5109 object-logic embedding (used by several tools internally); no longer
5110 use hard-wired "Trueprop";
5112 * Pure: added 'corollary' command;
5114 * Pure: fixed 'token_translation' command;
5116 * Pure: removed obsolete 'exported' attribute;
5118 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5119 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5120 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5122 * Pure: method 'atomize' presents local goal premises as object-level
5123 statements (atomic meta-level propositions); setup controlled via
5124 rewrite rules declarations of 'atomize' attribute; example
5125 application: 'induct' method with proper rule statements in improper
5128 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5129 now consider the syntactic context of assumptions, giving a better
5130 chance to get type-inference of the arguments right (this is
5131 especially important for locales);
5133 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5136 * Pure/obtain: the formal conclusion "thesis", being marked as
5137 ``internal'', may no longer be reference directly in the text;
5138 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5141 * Pure: generic 'sym' attribute which declares a rule both as pure
5142 'elim?' and for the 'symmetric' operation;
5144 * Pure: marginal comments ``--'' may now occur just anywhere in the
5145 text; the fixed correlation with particular command syntax has been
5148 * Pure: new method 'rules' is particularly well-suited for proof
5149 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5150 but often produces more compact proof terms with less detours;
5152 * Pure/Provers/classical: simplified integration with pure rule
5153 attributes and methods; the classical "intro?/elim?/dest?"
5154 declarations coincide with the pure ones; the "rule" method no longer
5155 includes classically swapped intros; "intro" and "elim" methods no
5156 longer pick rules from the context; also got rid of ML declarations
5157 AddXIs/AddXEs/AddXDs; all of this has some potential for
5160 * Provers/classical: attribute 'swapped' produces classical inversions
5161 of introduction rules;
5163 * Provers/simplifier: 'simplified' attribute may refer to explicit
5164 rules instead of full simplifier context; 'iff' attribute handles
5167 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5169 * HOL: 'recdef' now fails on unfinished automated proofs, use
5170 "(permissive)" option to recover old behavior;
5172 * HOL: 'inductive' no longer features separate (collective) attributes
5173 for 'intros' (was found too confusing);
5175 * HOL: properly declared induction rules less_induct and
5181 * HOL: moved over to sane numeral syntax; the new policy is as
5184 - 0 and 1 are polymorphic constants, which are defined on any
5185 numeric type (nat, int, real etc.);
5187 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5188 binary representation internally;
5190 - type nat has special constructor Suc, and generally prefers Suc 0
5191 over 1::nat and Suc (Suc 0) over 2::nat;
5193 This change may cause significant problems of INCOMPATIBILITY; here
5194 are some hints on converting existing sources:
5196 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5197 entities, so expressions involving "-" (unary or binary minus) need
5198 to be spaced properly;
5200 - existing occurrences of "1" may need to be constraint "1::nat" or
5201 even replaced by Suc 0; similar for old "2";
5203 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5205 - remove all special provisions on numerals in proofs;
5207 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5208 representation (depends on bin_arith_simps in the default context);
5210 * HOL: symbolic syntax for x^2 (numeral 2);
5212 * HOL: the class of all HOL types is now called "type" rather than
5213 "term"; INCOMPATIBILITY, need to adapt references to this type class
5214 in axclass/classes, instance/arities, and (usually rare) occurrences
5215 in typings (of consts etc.); internally the class is called
5216 "HOL.type", ML programs should refer to HOLogic.typeS;
5218 * HOL/record package improvements:
5219 - new derived operations "fields" to build a partial record section,
5220 "extend" to promote a fixed record to a record scheme, and
5221 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5222 declared as simp by default;
5223 - shared operations ("more", "fields", etc.) now need to be always
5224 qualified) --- potential INCOMPATIBILITY;
5225 - removed "make_scheme" operations (use "make" with "extend") --
5227 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5228 - provides cases/induct rules for use with corresponding Isar
5229 methods (for concrete records, record schemes, concrete more
5230 parts, and schematic more parts -- in that order);
5231 - internal definitions directly based on a light-weight abstract
5232 theory of product types over typedef rather than datatype;
5234 * HOL: generic code generator for generating executable ML code from
5235 specifications; specific support for HOL constructs such as inductive
5236 datatypes and sets, as well as recursive functions; can be invoked
5237 via 'generate_code' theory section;
5239 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5241 * HOL: consolidated and renamed several theories. In particular:
5242 Ord.thy has been absorbed into HOL.thy
5243 String.thy has been absorbed into List.thy
5245 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5246 (beware of argument permutation!);
5248 * HOL: linorder_less_split superseded by linorder_cases;
5250 * HOL/List: "nodups" renamed to "distinct";
5252 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5253 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5254 - Ex_def has changed, now need to use some_eq_ex
5256 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5257 in this (rare) case use:
5259 delSWrapper "split_all_tac"
5260 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5262 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5265 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5266 Isabelle's type classes, ^ on functions and relations has too general
5267 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5268 necessary to attach explicit type constraints;
5270 * HOL/Relation: the prefix name of the infix "O" has been changed from
5271 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5272 renamed accordingly (eg "compI" -> "rel_compI").
5274 * HOL: syntax translations now work properly with numerals and records
5277 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5278 of "lam" -- INCOMPATIBILITY;
5280 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5281 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5282 renamed "Product_Type.unit";
5284 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5286 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5287 the "cases" method);
5289 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5292 * HOL/IMP: updated and converted to new-style theory format; several
5293 parts turned into readable document, with proper Isar proof texts and
5294 some explanations (by Gerwin Klein);
5296 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5298 * HOL-Hyperreal is now a logic image;
5303 * Isar: consts/constdefs supports mixfix syntax for continuous
5306 * Isar: domain package adapted to new-style theory format, e.g. see
5309 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5310 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5311 lift.induct_tac, always use UU instead of Undef;
5313 * HOLCF/IMP: updated and converted to new-style theory;
5318 * Isar: proper integration of logic-specific tools and packages,
5319 including theory commands '(co)inductive', '(co)datatype',
5320 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5321 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5323 * theory Main no longer includes AC; for the Axiom of Choice, base
5324 your theory on Main_ZFC;
5326 * the integer library now covers quotients and remainders, with many
5327 laws relating division to addition, multiplication, etc.;
5329 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5330 typeless version of the formalism;
5332 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5335 * ZF/Induct: new directory for examples of inductive definitions,
5336 including theory Multiset for multiset orderings; converted to
5337 new-style theory format;
5339 * ZF: many new theorems about lists, ordinals, etc.;
5344 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5345 variable proof controls level of detail: 0 = no proofs (only oracle
5346 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5347 also ref manual for further ML interfaces;
5349 * Pure/axclass: removed obsolete ML interface
5350 goal_subclass/goal_arity;
5352 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5353 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5354 separate tokens, so expressions involving minus need to be spaced
5357 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5358 rather than "infixl" or "infixr";
5360 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5361 sort constraint specifications in type inference; e.g. "x::_::foo"
5362 ensures that the type of "x" is of sort "foo" (but not necessarily a
5365 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5366 control output of nested => (types); the default behavior is
5369 * Pure/syntax: builtin parse translation for "_constify" turns valued
5370 tokens into AST constants;
5372 * Pure/syntax: prefer later declarations of translations and print
5373 translation functions; potential INCOMPATIBILITY: need to reverse
5374 multiple declarations for same syntax element constant;
5376 * Pure/show_hyps reset by default (in accordance to existing Isar
5379 * Provers/classical: renamed addaltern to addafter, addSaltern to
5382 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5385 * system: tested support for MacOS X; should be able to get Isabelle +
5386 Proof General to work in a plain Terminal after installing Poly/ML
5387 (e.g. from the Isabelle distribution area) and GNU bash alone
5388 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5389 support requires further installations, e.g. from
5390 http://fink.sourceforge.net/);
5392 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5394 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5395 of 40 MB), cf. ML_OPTIONS;
5397 * system: Proof General keywords specification is now part of the
5398 Isabelle distribution (see etc/isar-keywords.el);
5400 * system: support for persistent Proof General sessions (refrain from
5401 outdating all loaded theories on startup); user may create writable
5402 logic images like this: ``isabelle -q HOL Test'';
5404 * system: smart selection of Isabelle process versus Isabelle
5405 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5406 run both "isabelle" and "Isabelle" even if file names are badly
5407 damaged (executable inspects the case of the first letter of its own
5408 name); added separate "isabelle-process" and "isabelle-interface";
5410 * system: refrain from any attempt at filtering input streams; no
5411 longer support ``8bit'' encoding of old isabelle font, instead proper
5412 iso-latin characters may now be used; the related isatools
5413 "symbolinput" and "nonascii" have disappeared as well;
5415 * system: removed old "xterm" interface (the print modes "xterm" and
5416 "xterm_color" are still available for direct use in a suitable
5421 New in Isabelle99-2 (February 2001)
5422 -----------------------------------
5424 *** Overview of INCOMPATIBILITIES ***
5426 * HOL: please note that theories in the Library and elsewhere often use the
5427 new-style (Isar) format; to refer to their theorems in an ML script you must
5428 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5430 * HOL: inductive package no longer splits induction rule aggressively,
5431 but only as far as specified by the introductions given; the old
5432 format may be recovered via ML function complete_split_rule or attribute
5433 'split_rule (complete)';
5435 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5436 gfp_Tarski to gfp_unfold;
5438 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5440 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5441 relation); infix "^^" has been renamed "``"; infix "``" has been
5442 renamed "`"; "univalent" has been renamed "single_valued";
5444 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5447 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5449 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5451 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5452 consequence, it is no longer monotonic wrt. the local goal context
5453 (which is now passed through the inductive cases);
5455 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5456 \<gg> to \<ggreater>;
5459 *** Document preparation ***
5461 * \isabellestyle{NAME} selects version of Isabelle output (currently
5462 available: are "it" for near math-mode best-style output, "sl" for
5463 slanted text style, and "tt" for plain type-writer; if no
5464 \isabellestyle command is given, output is according to slanted
5467 * support sub/super scripts (for single symbols only), input syntax is
5468 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5470 * some more standard symbols; see Appendix A of the system manual for
5471 the complete list of symbols defined in isabellesym.sty;
5473 * improved isabelle style files; more abstract symbol implementation
5474 (should now use \isamath{...} and \isatext{...} in custom symbol
5477 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5478 state; Note that presentation of goal states does not conform to
5479 actual human-readable proof documents. Please do not include goal
5480 states into document output unless you really know what you are doing!
5482 * proper indentation of antiquoted output with proportional LaTeX
5485 * no_document ML operator temporarily disables LaTeX document
5488 * isatool unsymbolize tunes sources for plain ASCII communication;
5493 * Pure: Isar now suffers initial goal statements to contain unbound
5494 schematic variables (this does not conform to actual readable proof
5495 documents, due to unpredictable outcome and non-compositional proof
5496 checking); users who know what they are doing may use schematic goals
5497 for Prolog-style synthesis of proven results;
5499 * Pure: assumption method (an implicit finishing) now handles actual
5502 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5503 initial goal, declare "that" only as Pure intro (only for single
5504 steps); the "that" rule assumption may now be involved in implicit
5505 finishing, thus ".." becomes a feasible for trivial obtains;
5507 * Pure: default proof step now includes 'intro_classes'; thus trivial
5508 instance proofs may be performed by "..";
5510 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5513 * Pure: more robust selection of calculational rules;
5515 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5516 rule (as well as the assumption rule);
5518 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5519 lemmas, using the graph browser tool;
5521 * Pure: predict failure of "show" in interactive mode;
5523 * Pure: 'thms_containing' now takes actual terms as arguments;
5525 * HOL: improved method 'induct' --- now handles non-atomic goals
5526 (potential INCOMPATIBILITY); tuned error handling;
5528 * HOL: cases and induct rules now provide explicit hints about the
5529 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5530 any remaining facts are inserted into the goal verbatim;
5532 * HOL: local contexts (aka cases) may now contain term bindings as
5533 well; the 'cases' and 'induct' methods new provide a ?case binding for
5534 the result to be shown in each case;
5536 * HOL: added 'recdef_tc' command;
5538 * isatool convert assists in eliminating legacy ML scripts;
5543 * HOL/Library: a collection of generic theories to be used together
5544 with main HOL; the theory loader path already includes this directory
5545 by default; the following existing theories have been moved here:
5546 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5547 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5549 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5550 modelling and verification task performed in Isabelle/HOL +
5551 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5553 * HOL/Algebra: special summation operator SUM no longer exists, it has
5554 been replaced by setsum; infix 'assoc' now has priority 50 (like
5555 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5556 'domain', this makes the theory consistent with mathematical
5559 * HOL basics: added overloaded operations "inverse" and "divide"
5560 (infix "/"), syntax for generic "abs" operation, generic summation
5563 * HOL/typedef: simplified package, provide more useful rules (see also
5566 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5567 now expressed as a proper nested rule (old-style tactic scripts may
5568 require atomize_strip_tac to cope with non-atomic premises);
5570 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5571 to "split_conv" (old name still available for compatibility);
5573 * HOL: improved concrete syntax for strings (e.g. allows translation
5574 rules with string literals);
5576 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5577 and Fleuriot's mechanization of analysis, including the transcendental
5578 functions for the reals;
5580 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5585 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5586 "lam" is displayed as TWO lambda-symbols
5588 * CTT: theory Main now available, containing everything (that is, Bool
5594 * Pure: the Simplifier has been implemented properly as a derived rule
5595 outside of the actual kernel (at last!); the overall performance
5596 penalty in practical applications is about 50%, while reliability of
5597 the Isabelle inference kernel has been greatly improved;
5599 * print modes "brackets" and "no_brackets" control output of nested =>
5600 (types) and ==> (props); the default behaviour is "brackets";
5602 * Provers: fast_tac (and friends) now handle actual object-logic rules
5603 as assumptions as well;
5605 * system: support Poly/ML 4.0;
5607 * system: isatool install handles KDE version 1 or 2;
5611 New in Isabelle99-1 (October 2000)
5612 ----------------------------------
5614 *** Overview of INCOMPATIBILITIES ***
5616 * HOL: simplification of natural numbers is much changed; to partly
5617 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5618 issue the following ML commands:
5620 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5621 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5623 * HOL: simplification no longer dives into case-expressions; this is
5624 controlled by "t.weak_case_cong" for each datatype t;
5626 * HOL: nat_less_induct renamed to less_induct;
5628 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5629 fixsome to patch .thy and .ML sources automatically;
5631 select_equality -> some_equality
5632 select_eq_Ex -> some_eq_ex
5633 selectI2EX -> someI2_ex
5636 select1_equality -> some1_equality
5637 Eps_sym_eq -> some_sym_eq_trivial
5638 Eps_eq -> some_eq_trivial
5640 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5642 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5645 * HOL: the recursion equations generated by 'recdef' are now called
5646 f.simps instead of f.rules;
5648 * HOL: qed_spec_mp now also handles bounded ALL as well;
5650 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5651 sometimes be needed;
5653 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5655 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5657 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5658 product is now "<*>" instead of "Times"; the lexicographic product is
5659 now "<*lex*>" instead of "**";
5661 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5662 of main HOL, but was unused); better use HOL's datatype package;
5664 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5665 the old syntax may be recovered as follows:
5668 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5669 (infixl "\\<oplus>" 100)
5671 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5673 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5674 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5677 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5678 changed from A/r to A//r;
5680 * ZF: new treatment of arithmetic (nat & int) may break some old
5683 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5684 rulify -> rule_format, elimify -> elim_format, ...);
5686 * Isar/Provers: intro/elim/dest attributes changed; renamed
5687 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5688 should have to change intro!! to intro? only); replaced "delrule" by
5691 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5693 * Provers: strengthened force_tac by using new first_best_tac;
5695 * LaTeX document preparation: several changes of isabelle.sty (see
5699 *** Document preparation ***
5701 * formal comments (text blocks etc.) in new-style theories may now
5702 contain antiquotations of thm/prop/term/typ/text to be presented
5703 according to latex print mode; concrete syntax is like this:
5704 @{term[show_types] "f(x) = a + x"};
5706 * isatool mkdir provides easy setup of Isabelle session directories,
5707 including proper document sources;
5709 * generated LaTeX sources are now deleted after successful run
5710 (isatool document -c); may retain a copy somewhere else via -D option
5713 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5714 style files, achieving self-contained LaTeX sources and simplifying
5717 * old-style theories now produce (crude) LaTeX output as well;
5719 * browser info session directories are now self-contained (may be put
5720 on WWW server seperately); improved graphs of nested sessions; removed
5721 graph for 'all sessions';
5723 * several improvements in isabelle style files; \isabellestyle{it}
5724 produces fake math mode output; \isamarkupheader is now \section by
5725 default; see lib/texinputs/isabelle.sty etc.;
5730 * Isar/Pure: local results and corresponding term bindings are now
5731 subject to Hindley-Milner polymorphism (similar to ML); this
5732 accommodates incremental type-inference very nicely;
5734 * Isar/Pure: new derived language element 'obtain' supports
5735 generalized existence reasoning;
5737 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5738 support accumulation of results, without applying any rules yet;
5739 useful to collect intermediate results without explicit name
5740 references, and for use with transitivity rules with more than 2
5743 * Isar/Pure: scalable support for case-analysis type proofs: new
5744 'case' language element refers to local contexts symbolically, as
5745 produced by certain proof methods; internally, case names are attached
5746 to theorems as "tags";
5748 * Isar/Pure: theory command 'hide' removes declarations from
5749 class/type/const name spaces;
5751 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5752 indicate potential overloading;
5754 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5756 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5757 "{a,b,c}" instead of {a,b,c};
5759 * Isar/Pure now provides its own version of intro/elim/dest
5760 attributes; useful for building new logics, but beware of confusion
5761 with the version in Provers/classical;
5763 * Isar/Pure: the local context of (non-atomic) goals is provided via
5764 case name 'antecedent';
5766 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5767 to the current context is now done automatically);
5769 * Isar/Pure: theory command 'method_setup' provides a simple interface
5770 for definining proof methods in ML;
5772 * Isar/Provers: intro/elim/dest attributes changed; renamed
5773 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5774 most cases, one should have to change intro!! to intro? only);
5775 replaced "delrule" by "rule del";
5777 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5778 'symmetric' attribute (the latter supercedes [RS sym]);
5780 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5781 method modifier); 'simp' method: 'only:' modifier removes loopers as
5782 well (including splits);
5784 * Isar/Provers: Simplifier and Classical methods now support all kind
5785 of modifiers used in the past, including 'cong', 'iff', etc.
5787 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5788 of Simplifier and Classical reasoner);
5790 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5791 now support named cases; major packages (inductive, datatype, primrec,
5792 recdef) support case names and properly name parameters;
5794 * Isar/HOL: new transitivity rules for substitution in inequalities --
5795 monotonicity conditions are extracted to be proven at end of
5798 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5801 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5802 split_if split_if_asm; datatype package provides theorems foo.splits =
5803 foo.split foo.split_asm for each datatype;
5805 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5806 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5807 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5808 use "(cases (simplified))" method in proper proof texts);
5810 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5812 * Isar: names of theorems etc. may be natural numbers as well;
5814 * Isar: 'pr' command: optional arguments for goals_limit and
5815 ProofContext.prems_limit; no longer prints theory contexts, but only
5818 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5819 additional print modes to be specified; e.g. "pr(latex)" will print
5820 proof state according to the Isabelle LaTeX style;
5822 * Isar: improved support for emulating tactic scripts, including proof
5823 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5824 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5825 (for HOL datatypes);
5827 * Isar: simplified (more robust) goal selection of proof methods: 1st
5828 goal, all goals, or explicit goal specifier (tactic emulation); thus
5829 'proof method scripts' have to be in depth-first order;
5831 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5833 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5834 should instead use individual commands for printing items
5835 (print_commands, print_methods etc.);
5837 * Isar: added 'nothing' --- the empty list of theorems;
5842 * HOL/MicroJava: formalization of a fragment of Java, together with a
5843 corresponding virtual machine and a specification of its bytecode
5844 verifier and a lightweight bytecode verifier, including proofs of
5845 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5846 Cornelia Pusch (see also the homepage of project Bali at
5847 http://isabelle.in.tum.de/Bali/);
5849 * HOL/Algebra: new theory of rings and univariate polynomials, by
5852 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5853 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5856 * HOL/Lattice: fundamental concepts of lattice theory and order
5857 structures, including duals, properties of bounds versus algebraic
5858 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5859 Theorem for complete lattices etc.; may also serve as a demonstration
5860 for abstract algebraic reasoning using axiomatic type classes, and
5861 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5863 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5866 * HOL/IMPP: extension of IMP with local variables and mutually
5867 recursive procedures, by David von Oheimb;
5869 * HOL/Lambda: converted into new-style theory and document;
5871 * HOL/ex/Multiquote: example of multiple nested quotations and
5872 anti-quotations -- basically a generalized version of de-Bruijn
5873 representation; very useful in avoiding lifting of operations;
5875 * HOL/record: added general record equality rule to simpset; fixed
5876 select-update simplification procedure to handle extended records as
5877 well; admit "r" as field name;
5879 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5880 other numeric types and also as the identity of groups, rings, etc.;
5882 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5883 Types nat and int belong to this axclass;
5885 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5886 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5887 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5888 two terms #m*u and #n*u are replaced by #(m+n)*u
5889 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5890 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5891 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5893 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5894 powerful prover for predicate logic but knows nothing of clasets; see
5895 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5897 * HOL: new version of "case_tac" subsumes both boolean case split and
5898 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5899 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5901 * HOL: simplification no longer dives into case-expressions: only the
5902 selector expression is simplified, but not the remaining arms; to
5903 enable full simplification of case-expressions for datatype t, you may
5904 remove t.weak_case_cong from the simpset, either globally (Delcongs
5905 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5907 * HOL/recdef: the recursion equations generated by 'recdef' for
5908 function 'f' are now called f.simps instead of f.rules; if all
5909 termination conditions are proved automatically, these simplification
5910 rules are added to the simpset, as in primrec; rules may be named
5911 individually as well, resulting in a separate list of theorems for
5914 * HOL/While is a new theory that provides a while-combinator. It
5915 permits the definition of tail-recursive functions without the
5916 provision of a termination measure. The latter is necessary once the
5917 invariant proof rule for while is applied.
5919 * HOL: new (overloaded) notation for the set of elements below/above
5920 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5922 * HOL: theorems impI, allI, ballI bound as "strip";
5924 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5925 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5926 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5928 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5930 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5931 main HOL, but was unused);
5933 * HOL: fewer consts declared as global (e.g. have to refer to
5934 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5936 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5937 in case of overlap with user translations (e.g. judgements over
5938 tuples); (note that the underlying logical represenation is still
5944 * ZF: simplification automatically cancels common terms in arithmetic
5945 expressions over nat and int;
5947 * ZF: new treatment of nat to minimize type-checking: all operators
5948 coerce their operands to a natural number using the function natify,
5949 making the algebraic laws unconditional;
5951 * ZF: as above, for int: operators coerce their operands to an integer
5952 using the function intify;
5954 * ZF: the integer library now contains many of the usual laws for the
5955 orderings, including $<=, and monotonicity laws for $+ and $*;
5957 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5960 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5961 to the simplifier and classical reasoner simultaneously;
5966 * Provers: blast_tac now handles actual object-logic rules as
5967 assumptions; note that auto_tac uses blast_tac internally as well;
5969 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5970 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5972 * Provers: delrules now handles destruct rules as well (no longer need
5973 explicit make_elim);
5975 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5976 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5977 use instead the strong form,
5978 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5979 in HOL, FOL and ZF the function cla_make_elim will create such rules
5980 from destruct-rules;
5982 * Provers: Simplifier.easy_setup provides a fast path to basic
5983 Simplifier setup for new object-logics;
5985 * Pure: AST translation rules no longer require constant head on LHS;
5987 * Pure: improved name spaces: ambiguous output is qualified; support
5988 for hiding of names;
5990 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5991 XSYMBOL_HOME; no longer need to do manual configuration in most
5994 * system: compression of ML heaps images may now be controlled via -c
5995 option of isabelle and isatool usedir (currently only observed by
5998 * system: isatool installfonts may handle X-Symbol fonts as well (very
5999 useful for remote X11);
6001 * system: provide TAGS file for Isabelle sources;
6003 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6006 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6007 timing flag supersedes proof_timing and Toplevel.trace;
6009 * ML: new combinators |>> and |>>> for incremental transformations
6010 with secondary results (e.g. certain theory extensions):
6012 * ML: PureThy.add_defs gets additional argument to indicate potential
6013 overloading (usually false);
6015 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6020 New in Isabelle99 (October 1999)
6021 --------------------------------
6023 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6025 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6026 are no longer simplified. (This allows the simplifier to unfold recursive
6027 functional programs.) To restore the old behaviour, declare
6029 Delcongs [if_weak_cong];
6031 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6034 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6036 * HOL/datatype: mutual_induct_tac no longer exists --
6037 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6039 * HOL/typedef: fixed type inference for representing set; type
6040 arguments now have to occur explicitly on the rhs as type constraints;
6042 * ZF: The con_defs part of an inductive definition may no longer refer
6043 to constants declared in the same theory;
6045 * HOL, ZF: the function mk_cases, generated by the inductive
6046 definition package, has lost an argument. To simplify its result, it
6047 uses the default simpset instead of a supplied list of theorems.
6049 * HOL/List: the constructors of type list are now Nil and Cons;
6051 * Simplifier: the type of the infix ML functions
6052 setSSolver addSSolver setSolver addSolver
6053 is now simpset * solver -> simpset where `solver' is a new abstract type
6054 for packaging solvers. A solver is created via
6055 mk_solver: string -> (thm list -> int -> tactic) -> solver
6056 where the string argument is only a comment.
6061 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6062 decision procedure for linear arithmetic. Currently it is used for
6063 types `nat', `int', and `real' in HOL (see below); it can, should and
6064 will be instantiated for other types and logics as well.
6066 * The simplifier now accepts rewrite rules with flexible heads, eg
6067 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6068 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6074 * New Isabelle/Isar subsystem provides an alternative to traditional
6075 tactical theorem proving; together with the ProofGeneral/isar user
6076 interface it offers an interactive environment for developing human
6077 readable proof documents (Isar == Intelligible semi-automated
6078 reasoning); for further information see isatool doc isar-ref,
6079 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6081 * improved and simplified presentation of theories: better HTML markup
6082 (including colors), graph views in several sizes; isatool usedir now
6083 provides a proper interface for user theories (via -P option); actual
6084 document preparation based on (PDF)LaTeX is available as well (for
6085 new-style theories only); see isatool doc system for more information;
6087 * native support for Proof General, both for classic Isabelle and
6090 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6091 using the graph browser tool;
6093 * Isabelle manuals now also available as PDF;
6095 * theory loader rewritten from scratch (may not be fully
6096 bug-compatible); old loadpath variable has been replaced by show_path,
6097 add_path, del_path, reset_path functions; new operations such as
6098 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6101 * improved isatool install: option -k creates KDE application icon,
6102 option -p DIR installs standalone binaries;
6104 * added ML_PLATFORM setting (useful for cross-platform installations);
6105 more robust handling of platform specific ML images for SML/NJ;
6107 * the settings environment is now statically scoped, i.e. it is never
6108 created again in sub-processes invoked from isabelle, isatool, or
6111 * path element specification '~~' refers to '$ISABELLE_HOME';
6113 * in locales, the "assumes" and "defines" parts may be omitted if
6116 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6119 * new print_mode "HTML";
6121 * new flag show_tags controls display of tags of theorems (which are
6122 basically just comments that may be attached by some tools);
6124 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6125 mode and goal output format:
6127 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6129 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6131 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6132 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6134 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6136 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6138 * function bind_thms stores lists of theorems (cf. bind_thm);
6140 * new shorthand tactics ftac, eatac, datac, fatac;
6142 * qed (and friends) now accept "" as result name; in that case the
6143 theorem is not stored, but proper checks and presentation of the
6146 * theorem database now also indexes constants "Trueprop", "all",
6147 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6152 ** HOL arithmetic **
6154 * There are now decision procedures for linear arithmetic over nat and
6157 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6158 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6159 are treated as atomic; subformulae not involving type `nat' or `int'
6160 are ignored; quantified subformulae are ignored unless they are
6161 positive universal or negative existential. The tactic has to be
6162 invoked by hand and can be a little bit slow. In particular, the
6163 running time is exponential in the number of occurrences of `min' and
6164 `max', and `-' on `nat'.
6166 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6167 (negated) (in)equalities among the premises and the conclusion into
6168 account (i.e. no compound formulae) and does not know about `min' and
6169 `max', and `-' on `nat'. It is fast and is used automatically by the
6172 NB: At the moment, these decision procedures do not cope with mixed
6173 nat/int formulae where the two parts interact, such as `m < n ==>
6176 * HOL/Numeral provides a generic theory of numerals (encoded
6177 efficiently as bit strings); setup for types nat/int/real is in place;
6178 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6179 int, existing theories and proof scripts may require a few additional
6182 * integer division and remainder can now be performed on constant
6185 * many properties of integer multiplication, division and remainder
6188 * An interface to the Stanford Validity Checker (SVC) is available through the
6189 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6190 are proved automatically. SVC must be installed separately, and its results
6191 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6192 invocation of the underlying oracle). For SVC see
6193 http://verify.stanford.edu/SVC
6195 * IsaMakefile: the HOL-Real target now builds an actual image;
6200 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6201 (in Isabelle/Isar) -- by Gertrud Bauer;
6203 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6204 analysis for assembly languages with subtypes;
6206 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6207 -- avoids syntactic ambiguities and treats state, transition, and
6208 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6209 changed syntax and (many) tactics;
6211 * HOL/inductive: Now also handles more general introduction rules such
6212 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6213 theorems are now maintained within the theory (maintained via the
6216 * HOL/datatype: Now also handles arbitrarily branching datatypes
6217 (using function types) such as
6219 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6221 * HOL/record: record_simproc (part of the default simpset) takes care
6222 of selectors applied to updated records; record_split_tac is no longer
6223 part of the default claset; update_defs may now be removed from the
6224 simpset in many cases; COMPATIBILITY: old behavior achieved by
6226 claset_ref () := claset() addSWrapper record_split_wrapper;
6227 Delsimprocs [record_simproc]
6229 * HOL/typedef: fixed type inference for representing set; type
6230 arguments now have to occur explicitly on the rhs as type constraints;
6232 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6233 names rather than an ML expression;
6235 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6236 supplied later. Program schemes can be defined, such as
6237 "While B C s = (if B s then While B C (C s) else s)"
6238 where the well-founded relation can be chosen after B and C have been given.
6240 * HOL/List: the constructors of type list are now Nil and Cons;
6241 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6242 course, ML tools referring to List.list.op # etc. have to be adapted;
6244 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6245 disabled by default; run isabelle with option -m HOL to get back to
6246 the original Gordon/HOL-style output;
6248 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6249 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6251 * HOL basic syntax simplified (more orthogonal): all variants of
6252 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6253 Eps operator is provided as well: "SOME x. P[x]";
6255 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6257 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6258 thus available for user theories;
6260 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6261 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6264 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6265 several times and then mp;
6270 * the notation <<...>> is now available as a notation for sequences of
6273 * the simplifier is now installed
6275 * the axiom system has been generalized (thanks to Soren Heilmann)
6277 * the classical reasoner now has a default rule database
6282 * new primrec section allows primitive recursive functions to be given
6283 directly (as in HOL) over datatypes and the natural numbers;
6285 * new tactics induct_tac and exhaust_tac for induction (or case
6286 analysis) over datatypes and the natural numbers;
6288 * the datatype declaration of type T now defines the recursor T_rec;
6290 * simplification automatically does freeness reasoning for datatype
6293 * automatic type-inference, with AddTCs command to insert new
6294 type-checking rules;
6296 * datatype introduction rules are now added as Safe Introduction rules
6299 * the syntax "if P then x else y" is now available in addition to
6303 *** Internal programming interfaces ***
6305 * tuned simplifier trace output; new flag debug_simp;
6307 * structures Vartab / Termtab (instances of TableFun) offer efficient
6308 tables indexed by indexname_ord / term_ord (compatible with aconv);
6310 * AxClass.axclass_tac lost the theory argument;
6312 * tuned current_goals_markers semantics: begin / end goal avoids
6313 printing empty lines;
6315 * removed prs and prs_fn hook, which was broken because it did not
6316 include \n in its semantics, forcing writeln to add one
6317 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6318 string -> unit if you really want to output text without newline;
6320 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6321 plain output, interface builders may have to enable 'isabelle_font'
6322 mode to get Isabelle font glyphs as before;
6324 * refined token_translation interface; INCOMPATIBILITY: output length
6325 now of type real instead of int;
6327 * theory loader actions may be traced via new ThyInfo.add_hook
6328 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6329 your own database of information attached to *whole* theories -- as
6330 opposed to intra-theory data slots offered via TheoryDataFun;
6332 * proper handling of dangling sort hypotheses (at last!);
6333 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6334 extra sort hypotheses that can be witnessed from the type signature;
6335 the force_strip_shyps flag is gone, any remaining shyps are simply
6336 left in the theorem (with a warning issued by strip_shyps_warning);
6340 New in Isabelle98-1 (October 1998)
6341 ----------------------------------
6343 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6345 * several changes of automated proof tools;
6347 * HOL: major changes to the inductive and datatype packages, including
6348 some minor incompatibilities of theory syntax;
6350 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6353 * HOL: removed duplicate thms in Arith:
6354 less_imp_add_less should be replaced by trans_less_add1
6355 le_imp_add_le should be replaced by trans_le_add1
6357 * HOL: unary minus is now overloaded (new type constraints may be
6360 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6361 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6362 now taken as an integer constant.
6364 * Pure: ML function 'theory_of' renamed to 'theory';
6370 1. Asm_full_simp_tac is now more aggressive.
6371 1. It will sometimes reorient premises if that increases their power to
6373 2. It does no longer proceed strictly from left to right but may also
6374 rotate premises to achieve further simplification.
6375 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6376 old Asm_full_simp_tac in that it does not rotate premises.
6377 2. The simplifier now knows a little bit about nat-arithmetic.
6379 * Classical reasoner: wrapper mechanism for the classical reasoner now
6380 allows for selected deletion of wrappers, by introduction of names for
6381 wrapper functionals. This implies that addbefore, addSbefore,
6382 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6383 and that adding two tactics with the same name overwrites the first
6384 one (emitting a warning).
6385 type wrapper = (int -> tactic) -> (int -> tactic)
6386 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6387 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6388 delWrapper, delSWrapper: claset * string -> claset
6389 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6391 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6392 semantics; addbefore now affects only the unsafe part of step_tac
6393 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6394 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6397 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6398 compWrapper; added safe wrapper (and access functions for it);
6400 * HOL/split_all_tac is now much faster and fails if there is nothing
6401 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6402 and the names of the automatically generated variables have changed.
6403 split_all_tac has moved within claset() from unsafe wrappers to safe
6404 wrappers, which means that !!-bound variables are split much more
6405 aggressively, and safe_tac and clarify_tac now split such variables.
6406 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6407 Note: the same holds for record_split_tac, which does the job of
6408 split_all_tac for record fields.
6410 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6411 permanently to the default simpset using Addsplits just like
6412 Addsimps. They can be removed via Delsplits just like
6413 Delsimps. Lower-case versions are also available.
6415 * HOL/Simplifier: The rule split_if is now part of the default
6416 simpset. This means that the simplifier will eliminate all occurrences
6417 of if-then-else in the conclusion of a goal. To prevent this, you can
6418 either remove split_if completely from the default simpset by
6419 `Delsplits [split_if]' or remove it in a specific call of the
6420 simplifier using `... delsplits [split_if]'. You can also add/delete
6421 other case splitting rules to/from the default simpset: every datatype
6422 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6423 t is the name of the datatype).
6425 * Classical reasoner / Simplifier combination: new force_tac (and
6426 derivatives Force_tac, force) combines rewriting and classical
6427 reasoning (and whatever other tools) similarly to auto_tac, but is
6428 aimed to solve the given subgoal completely.
6433 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6434 and `goalw': the theory is no longer needed as an explicit argument -
6435 the current theory context is used; assumptions are no longer returned
6436 at the ML-level unless one of them starts with ==> or !!; it is
6437 recommended to convert to these new commands using isatool fixgoal
6438 (backup your sources first!);
6440 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6441 the current theory context, and 'theory' to lookup stored theories;
6443 * new theory section 'locale' for declaring constants, assumptions and
6444 definitions that have local scope;
6446 * new theory section 'nonterminals' for purely syntactic types;
6448 * new theory section 'setup' for generic ML setup functions
6449 (e.g. package initialization);
6451 * the distribution now includes Isabelle icons: see
6452 lib/logo/isabelle-{small,tiny}.xpm;
6454 * isatool install - install binaries with absolute references to
6457 * isatool logo -- create instances of the Isabelle logo (as EPS);
6459 * print mode 'emacs' reserved for Isamode;
6461 * support multiple print (ast) translations per constant name;
6463 * theorems involving oracles are now printed with a suffixed [!];
6468 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6470 * HOL/inductive package reorganized and improved: now supports mutual
6476 oddI "n : EVEN ==> Suc n : ODD"
6477 evenI "n : ODD ==> Suc n : EVEN"
6479 new theorem list "elims" contains an elimination rule for each of the
6480 recursive sets; inductive definitions now handle disjunctive premises
6481 correctly (also ZF);
6483 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6484 "mutual_induct" no longer exists - the induction rule is always
6485 contained in "induct";
6488 * HOL/datatype package re-implemented and greatly improved: now
6489 supports mutually recursive datatypes such as
6492 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6493 | SUM ('a aexp) ('a aexp)
6494 | DIFF ('a aexp) ('a aexp)
6497 'a bexp = LESS ('a aexp) ('a aexp)
6498 | AND ('a bexp) ('a bexp)
6499 | OR ('a bexp) ('a bexp)
6501 as well as indirectly recursive datatypes such as
6504 ('a, 'b) term = Var 'a
6505 | App 'b ((('a, 'b) term) list)
6507 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6508 induction on mutually / indirectly recursive datatypes.
6510 Primrec equations are now stored in theory and can be accessed via
6511 <function_name>.simps.
6515 - Theories using datatypes must now have theory Datatype as an
6517 - The specific <typename>.induct_tac no longer exists - use the
6518 generic induct_tac instead.
6519 - natE has been renamed to nat.exhaust - use exhaust_tac
6520 instead of res_inst_tac ... natE. Note that the variable
6521 names in nat.exhaust differ from the names in natE, this
6522 may cause some "fragile" proofs to fail.
6523 - The theorems split_<typename>_case and split_<typename>_case_asm
6524 have been renamed to <typename>.split and <typename>.split_asm.
6525 - Since default sorts of type variables are now handled correctly,
6526 some datatype definitions may have to be annotated with explicit
6528 - Primrec definitions no longer require function name and type
6529 of recursive argument.
6531 Consider using isatool fixdatatype to adapt your theories and proof
6532 scripts to the new package (backup your sources first!).
6535 * HOL/record package: considerably improved implementation; now
6536 includes concrete syntax for record types, terms, updates; theorems
6537 for surjective pairing and splitting !!-bound record variables; proof
6538 support is as follows:
6540 1) standard conversions (selectors or updates applied to record
6541 constructor terms) are part of the standard simpset;
6543 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6544 made part of standard simpset and claset via addIffs;
6546 3) a tactic for record field splitting (record_split_tac) is part of
6547 the standard claset (addSWrapper);
6549 To get a better idea about these rules you may retrieve them via
6550 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6551 the name of your record type.
6553 The split tactic 3) conceptually simplifies by the following rule:
6555 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6557 Thus any record variable that is bound by meta-all will automatically
6558 blow up into some record constructor term, consequently the
6559 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6560 solve record problems automatically.
6563 * reorganized the main HOL image: HOL/Integ and String loaded by
6564 default; theory Main includes everything;
6566 * automatic simplification of integer sums and comparisons, using cancellation;
6568 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6570 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6572 * many new identities for unions, intersections, set difference, etc.;
6574 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6575 called split_if, split_split, split_sum_case and split_nat_case (to go
6576 with add/delsplits);
6578 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6579 (?x::unit) = (); this is made part of the default simpset, which COULD
6580 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6581 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6582 unit_abs_eta_conv is added in order to counter the effect of
6583 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6586 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6589 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6590 It and 'sym RS equals0D' are now in the default claset, giving automatic
6591 disjointness reasoning but breaking a few old proofs.
6593 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6594 to 'converse' from 'inverse' (for compatibility with ZF and some
6597 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6598 the well-founded relation;
6600 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6601 Compl A. The "Compl" syntax remains available as input syntax for this
6604 * HOL/Update: new theory of function updates:
6605 f(a:=b) == %x. if x=a then b else f x
6606 may also be iterated as in f(a:=b,c:=d,...);
6608 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6611 - new function list_update written xs[i:=v] that updates the i-th
6612 list position. May also be iterated as in xs[i:=a,j:=b,...].
6613 - new function `upt' written [i..j(] which generates the list
6614 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6615 bound write [i..j], which is a shorthand for [i..j+1(].
6616 - new lexicographic orderings and corresponding wellfoundedness theorems.
6619 - removed 'pred' (predecessor) function;
6620 - generalized some theorems about n-1;
6621 - many new laws about "div" and "mod";
6622 - new laws about greatest common divisors (see theory ex/Primes);
6624 * HOL/Relation: renamed the relational operator r^-1 "converse"
6625 instead of "inverse";
6627 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6628 of the multiset ordering;
6630 * directory HOL/Real: a construction of the reals using Dedekind cuts
6631 (not included by default);
6633 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6635 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6636 programs, i.e. different program variables may have different types.
6638 * calling (stac rew i) now fails if "rew" has no effect on the goal
6639 [previously, this check worked only if the rewrite rule was unconditional]
6640 Now rew can involve either definitions or equalities (either == or =).
6645 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6646 only the theorems proved on ZF.ML;
6648 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6649 It and 'sym RS equals0D' are now in the default claset, giving automatic
6650 disjointness reasoning but breaking a few old proofs.
6652 * ZF/Update: new theory of function updates
6653 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6654 may also be iterated as in f(a:=b,c:=d,...);
6656 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6658 * calling (stac rew i) now fails if "rew" has no effect on the goal
6659 [previously, this check worked only if the rewrite rule was unconditional]
6660 Now rew can involve either definitions or equalities (either == or =).
6662 * case_tac provided for compatibility with HOL
6663 (like the old excluded_middle_tac, but with subgoals swapped)
6666 *** Internal programming interfaces ***
6668 * Pure: several new basic modules made available for general use, see
6669 also src/Pure/README;
6671 * improved the theory data mechanism to support encapsulation (data
6672 kind name replaced by private Object.kind, acting as authorization
6673 key); new type-safe user interface via functor TheoryDataFun; generic
6674 print_data function becomes basically useless;
6676 * removed global_names compatibility flag -- all theory declarations
6677 are qualified by default;
6679 * module Pure/Syntax now offers quote / antiquote translation
6680 functions (useful for Hoare logic etc. with implicit dependencies);
6681 see HOL/ex/Antiquote for an example use;
6683 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6686 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6689 * Display.print_goals function moved to Locale.print_goals;
6691 * standard print function for goals supports current_goals_markers
6692 variable for marking begin of proof, end of proof, start of goal; the
6693 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6694 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6699 New in Isabelle98 (January 1998)
6700 --------------------------------
6702 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6704 * changed lexical syntax of terms / types: dots made part of long
6705 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6707 * simpset (and claset) reference variable replaced by functions
6708 simpset / simpset_ref;
6710 * no longer supports theory aliases (via merge) and non-trivial
6711 implicit merge of thms' signatures;
6713 * most internal names of constants changed due to qualified names;
6715 * changed Pure/Sequence interface (see Pure/seq.ML);
6718 *** General Changes ***
6720 * hierachically structured name spaces (for consts, types, axms, thms
6721 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6722 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6723 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6724 long_names for fully qualified output names; NOTE: ML programs
6725 (special tactics, packages etc.) referring to internal names may have
6726 to be adapted to cope with fully qualified names; in case of severe
6727 backward campatibility problems try setting 'global_names' at compile
6728 time to have enrything declared within a flat name space; one may also
6729 fine tune name declarations in theories via the 'global' and 'local'
6732 * reimplemented the implicit simpset and claset using the new anytype
6733 data filed in signatures; references simpset:simpset ref etc. are
6734 replaced by functions simpset:unit->simpset and
6735 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6736 to patch your ML files accordingly;
6738 * HTML output now includes theory graph data for display with Java
6739 applet or isatool browser; data generated automatically via isatool
6740 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6742 * defs may now be conditional; improved rewrite_goals_tac to handle
6743 conditional equations;
6745 * defs now admits additional type arguments, using TYPE('a) syntax;
6747 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6748 creates a new theory node; implicit merge of thms' signatures is
6749 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6750 transfer:theory->thm->thm in (rare) cases;
6752 * improved handling of draft signatures / theories; draft thms (and
6753 ctyps, cterms) are automatically promoted to real ones;
6755 * slightly changed interfaces for oracles: admit many per theory, named
6756 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6758 * print_goals: optional output of const types (set show_consts and
6761 * improved output of warnings (###) and errors (***);
6763 * subgoal_tac displays a warning if the new subgoal has type variables;
6765 * removed old README and Makefiles;
6767 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6769 * removed obsolete init_pps and init_database;
6771 * deleted the obsolete tactical STATE, which was declared by
6772 fun STATE tacfun st = tacfun st st;
6774 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6775 (which abbreviates $HOME);
6777 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6778 use isatool fixseq to adapt your ML programs (this works for fully
6779 qualified references to the Sequence structure only!);
6781 * use_thy no longer requires writable current directory; it always
6782 reloads .ML *and* .thy file, if either one is out of date;
6785 *** Classical Reasoner ***
6787 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6788 tactics that use classical reasoning to simplify a subgoal without
6789 splitting it into several subgoals;
6791 * Safe_tac: like safe_tac but uses the default claset;
6796 * added simplification meta rules:
6797 (asm_)(full_)simplify: simpset -> thm -> thm;
6799 * simplifier.ML no longer part of Pure -- has to be loaded by object
6802 * added prems argument to simplification procedures;
6804 * HOL, FOL, ZF: added infix function `addsplits':
6805 instead of `<simpset> setloop (split_tac <thms>)'
6806 you can simply write `<simpset> addsplits <thms>'
6811 * TYPE('a) syntax for type reflection terms;
6813 * no longer handles consts with name "" -- declare as 'syntax' instead;
6815 * pretty printer: changed order of mixfix annotation preference (again!);
6817 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6822 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6823 with `addloop' of the simplifier to faciliate case splitting in premises.
6825 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6827 * HOL/Auth: new protocol proofs including some for the Internet
6830 * HOL/Map: new theory of `maps' a la VDM;
6832 * HOL/simplifier: simplification procedures nat_cancel_sums for
6833 cancelling out common nat summands from =, <, <= (in)equalities, or
6834 differences; simplification procedures nat_cancel_factor for
6835 cancelling common factor from =, <, <= (in)equalities over natural
6836 sums; nat_cancel contains both kinds of procedures, it is installed by
6837 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6839 * HOL/simplifier: terms of the form
6840 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6842 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6843 and those of the form
6844 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6846 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6849 Each datatype `t' now comes with a theorem `split_t_case' of the form
6851 P(t_case f1 ... fn x) =
6852 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6854 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6857 and a theorem `split_t_case_asm' of the form
6859 P(t_case f1 ... fn x) =
6860 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6862 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6864 which can be added to a simpset via `addsplits'. The existing theorems
6865 expand_list_case and expand_option_case have been renamed to
6866 split_list_case and split_option_case.
6869 - `pred n' is automatically converted to `n-1'.
6870 Users are strongly encouraged not to use `pred' any longer,
6871 because it will disappear altogether at some point.
6872 - Users are strongly encouraged to write "0 < n" rather than
6873 "n ~= 0". Theorems and proof tools have been modified towards this
6877 the function "set_of_list" has been renamed "set" (and its theorems too);
6878 the function "nth" now takes its arguments in the reverse order and
6879 has acquired the infix notation "!" as in "xs!n".
6881 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6883 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6884 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6886 * HOL/record: extensible records with schematic structural subtyping
6887 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6888 still lacks various theorems and concrete record syntax;
6893 * removed "axioms" and "generated by" sections;
6895 * replaced "ops" section by extended "consts" section, which is capable of
6896 handling the continuous function space "->" directly;
6899 . proves theorems immediately and stores them in the theory,
6900 . creates hierachical name space,
6901 . now uses normal mixfix annotations (instead of cinfix...),
6902 . minor changes to some names and values (for consistency),
6903 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6904 . separator between mutual domain defs: changed "," to "and",
6905 . improved handling of sort constraints; now they have to
6906 appear on the left-hand side of the equations only;
6908 * fixed LAM <x,y,zs>.b syntax;
6910 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6911 adm (%x. P (t x)), where P is chainfinite and t continuous;
6916 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6917 with `addloop' of the simplifier to faciliate case splitting in premises.
6919 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6920 in HOL, they strip ALL and --> from proved theorems;
6924 New in Isabelle94-8 (May 1997)
6925 ------------------------------
6927 *** General Changes ***
6929 * new utilities to build / run / maintain Isabelle etc. (in parts
6930 still somewhat experimental); old Makefiles etc. still functional;
6932 * new 'Isabelle System Manual';
6934 * INSTALL text, together with ./configure and ./build scripts;
6936 * reimplemented type inference for greater efficiency, better error
6937 messages and clean internal interface;
6939 * prlim command for dealing with lots of subgoals (an easier way of
6940 setting goals_limit);
6945 * supports alternative (named) syntax tables (parser and pretty
6946 printer); internal interface is provided by add_modesyntax(_i);
6948 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6949 be used in conjunction with the Isabelle symbol font; uses the
6950 "symbols" syntax table;
6952 * added token_translation interface (may translate name tokens in
6953 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6954 the current print_mode); IMPORTANT: user print translation functions
6955 are responsible for marking newly introduced bounds
6956 (Syntax.mark_boundT);
6958 * token translations for modes "xterm" and "xterm_color" that display
6959 names in bold, underline etc. or colors (which requires a color
6962 * infixes may now be declared with names independent of their syntax;
6964 * added typed_print_translation (like print_translation, but may
6965 access type of constant);
6968 *** Classical Reasoner ***
6970 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6971 some limitations. Blast_tac...
6972 + ignores addss, addbefore, addafter; this restriction is intrinsic
6973 + ignores elimination rules that don't have the correct format
6974 (the conclusion MUST be a formula variable)
6975 + ignores types, which can make HOL proofs fail
6976 + rules must not require higher-order unification, e.g. apply_type in ZF
6977 [message "Function Var's argument not a bound variable" relates to this]
6978 + its proof strategy is more general but can actually be slower
6980 * substitution with equality assumptions no longer permutes other
6983 * minor changes in semantics of addafter (now called addaltern); renamed
6984 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6985 (and access functions for it);
6987 * improved combination of classical reasoner and simplifier:
6988 + functions for handling clasimpsets
6989 + improvement of addss: now the simplifier is called _after_ the
6991 + safe variant of addss called addSss: uses safe simplifications
6992 _during_ the safe steps. It is more complete as it allows multiple
6993 instantiations of unknowns (e.g. with slow_tac).
6997 * added interface for simplification procedures (functions that
6998 produce *proven* rewrite rules on the fly, depending on current
7001 * ordering on terms as parameter (used for ordered rewriting);
7003 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7005 * the solver is now split into a safe and an unsafe part.
7006 This should be invisible for the normal user, except that the
7007 functions setsolver and addsolver have been renamed to setSolver and
7008 addSolver; added safe_asm_full_simp_tac;
7013 * a generic induction tactic `induct_tac' which works for all datatypes and
7014 also for type `nat';
7016 * a generic case distinction tactic `exhaust_tac' which works for all
7017 datatypes and also for type `nat';
7019 * each datatype comes with a function `size';
7021 * patterns in case expressions allow tuple patterns as arguments to
7022 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7024 * primrec now also works with type nat;
7026 * recdef: a new declaration form, allows general recursive functions to be
7027 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7029 * the constant for negation has been renamed from "not" to "Not" to
7030 harmonize with FOL, ZF, LK, etc.;
7032 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7035 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7037 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7038 problems in commutative rings, using axiomatic type classes for + and *;
7040 * more examples in HOL/MiniML and HOL/Auth;
7042 * more default rewrite rules for quantifiers, union/intersection;
7044 * a new constant `arbitrary == @x.False';
7046 * HOLCF/IOA replaces old HOL/IOA;
7048 * HOLCF changes: derived all rules and arities
7049 + axiomatic type classes instead of classes
7050 + typedef instead of faking type definitions
7051 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7052 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7053 + eliminated the types void, one, tr
7054 + use unit lift and bool lift (with translations) instead of one and tr
7055 + eliminated blift from Lift3.thy (use Def instead of blift)
7056 all eliminated rules are derived as theorems --> no visible changes ;
7061 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7062 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7063 as ZF_cs addSIs [equalityI];
7067 New in Isabelle94-7 (November 96)
7068 ---------------------------------
7070 * allowing negative levels (as offsets) in prlev and choplev;
7072 * super-linear speedup for large simplifications;
7074 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7075 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7076 FAIL); can suppress it using the command Delsimps (ex_simps @
7077 all_simps); De Morgan laws are also now included, by default;
7079 * improved printing of ==> : ~:
7081 * new object-logic "Sequents" adds linear logic, while replacing LK
7082 and Modal (thanks to Sara Kalvala);
7084 * HOL/Auth: correctness proofs for authentication protocols;
7086 * HOL: new auto_tac combines rewriting and classical reasoning (many
7087 examples on HOL/Auth);
7089 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7090 the rewriter and classical reasoner simultaneously;
7092 * function uresult no longer returns theorems in "standard" format;
7093 regain previous version by: val uresult = standard o uresult;
7100 * oracles -- these establish an interface between Isabelle and trusted
7101 external reasoners, which may deliver results as theorems;
7103 * proof objects (in particular record all uses of oracles);
7105 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7107 * "constdefs" section in theory files;
7109 * "primrec" section (HOL) no longer requires names;
7111 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7118 * reduced space requirements;
7120 * automatic HTML generation from theories;
7122 * theory files no longer require "..." (quotes) around most types;
7124 * new examples, including two proofs of the Church-Rosser theorem;
7126 * non-curried (1994) version of HOL is no longer distributed;
7133 * greatly reduced space requirements;
7135 * theory files (.thy) no longer require \...\ escapes at line breaks;
7137 * searchable theorem database (see the section "Retrieving theorems" on
7138 page 8 of the Reference Manual);
7140 * new examples, including Grabczewski's monumental case study of the
7143 * The previous version of HOL renamed to Old_HOL;
7145 * The new version of HOL (previously called CHOL) uses a curried syntax
7146 for functions. Application looks like f a b instead of f(a,b);
7148 * Mutually recursive inductive definitions finally work in HOL;
7150 * In ZF, pattern-matching on tuples is now available in all abstractions and
7151 translates to the operator "split";
7158 * new infix operator, addss, allowing the classical reasoner to
7159 perform simplification at each step of its search. Example:
7160 fast_tac (cs addss ss)
7162 * a new logic, CHOL, the same as HOL, but with a curried syntax
7163 for functions. Application looks like f a b instead of f(a,b). Also pairs
7164 look like (a,b) instead of <a,b>;
7166 * PLEASE NOTE: CHOL will eventually replace HOL!
7168 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7169 It translates to the operator "split". A new theory of integers is available;
7171 * In ZF, integer numerals now denote two's-complement binary integers.
7172 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7174 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7175 of the Axiom of Choice;
7182 * Significantly faster resolution;
7184 * the different sections in a .thy file can now be mixed and repeated
7187 * Database of theorems for FOL, HOL and ZF. New
7188 commands including qed, qed_goal and bind_thm store theorems in the database.
7190 * Simple database queries: return a named theorem (get_thm) or all theorems of
7191 a given theory (thms_of), or find out what theory a theorem was proved in
7194 * Bugs fixed in the inductive definition and datatype packages;
7196 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7197 and HOL_dup_cs obsolete;
7199 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7202 * Simpler definition of function space in ZF;
7204 * new results about cardinal and ordinal arithmetic in ZF;
7206 * 'subtype' facility in HOL for introducing new types as subsets of existing
7209 :mode=text:wrap=hard:maxLineLen=72: