improved values command to handle a special case with tuples and polymorphic predicates more correctly
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 * Theory Library/Word.thy has been removed. Use library Word/Word.thy for
147 future developements; former Library/Word.thy is still present in the AFP
150 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
151 longer shadowed. INCOMPATIBILITY.
153 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
156 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
159 * Dropped normalizing_semiring etc; use the facts in semiring classes
160 instead. INCOMPATIBILITY.
162 * Dropped several real-specific versions of lemmas about floor and
163 ceiling; use the generic lemmas from Archimedean_Field.thy instead.
166 floor_number_of_eq ~> floor_number_of
167 le_floor_eq_number_of ~> number_of_le_floor
168 le_floor_eq_zero ~> zero_le_floor
169 le_floor_eq_one ~> one_le_floor
170 floor_less_eq_number_of ~> floor_less_number_of
171 floor_less_eq_zero ~> floor_less_zero
172 floor_less_eq_one ~> floor_less_one
173 less_floor_eq_number_of ~> number_of_less_floor
174 less_floor_eq_zero ~> zero_less_floor
175 less_floor_eq_one ~> one_less_floor
176 floor_le_eq_number_of ~> floor_le_number_of
177 floor_le_eq_zero ~> floor_le_zero
178 floor_le_eq_one ~> floor_le_one
179 floor_subtract_number_of ~> floor_diff_number_of
180 floor_subtract_one ~> floor_diff_one
181 ceiling_number_of_eq ~> ceiling_number_of
182 ceiling_le_eq_number_of ~> ceiling_le_number_of
183 ceiling_le_zero_eq ~> ceiling_le_zero
184 ceiling_le_eq_one ~> ceiling_le_one
185 less_ceiling_eq_number_of ~> number_of_less_ceiling
186 less_ceiling_eq_zero ~> zero_less_ceiling
187 less_ceiling_eq_one ~> one_less_ceiling
188 ceiling_less_eq_number_of ~> ceiling_less_number_of
189 ceiling_less_eq_zero ~> ceiling_less_zero
190 ceiling_less_eq_one ~> ceiling_less_one
191 le_ceiling_eq_number_of ~> number_of_le_ceiling
192 le_ceiling_eq_zero ~> zero_le_ceiling
193 le_ceiling_eq_one ~> one_le_ceiling
194 ceiling_subtract_number_of ~> ceiling_diff_number_of
195 ceiling_subtract_one ~> ceiling_diff_one
197 * Theory 'Finite_Set': various folding_XXX locales facilitate the
198 application of the various fold combinators on finite sets.
200 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
201 provides abstract red-black tree type which is backed by "RBT_Impl" as
202 implementation. INCOMPATIBILTY.
204 * Command 'typedef' now works within a local theory context -- without
205 introducing dependencies on parameters or assumptions, which is not
206 possible in Isabelle/Pure/HOL. Note that the logical environment may
207 contain multiple interpretations of local typedefs (with different
208 non-emptiness proofs), even in a global theory context.
210 * Theory Library/Coinductive_List has been removed -- superseded by
211 AFP/thys/Coinductive.
213 * Theory PReal, including the type "preal" and related operations, has
214 been removed. INCOMPATIBILITY.
216 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
217 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
219 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
220 "Int" etc. INCOMPATIBILITY.
222 * New set of rules "ac_simps" provides combined assoc / commute
223 rewrites for all interpretations of the appropriate generic locales.
225 * Renamed theory "OrderedGroup" to "Groups" and split theory
226 "Ring_and_Field" into theories "Rings" and "Fields"; for more
227 appropriate and more consistent names suitable for name prefixes
228 within the HOL theories. INCOMPATIBILITY.
230 * Some generic constants have been put to appropriate theories:
231 - less_eq, less: Orderings
232 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
233 - inverse, divide: Rings
236 * More consistent naming of type classes involving orderings (and
239 lower_semilattice ~> semilattice_inf
240 upper_semilattice ~> semilattice_sup
242 dense_linear_order ~> dense_linorder
244 pordered_ab_group_add ~> ordered_ab_group_add
245 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
246 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
247 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
248 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
249 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
250 pordered_cancel_semiring ~> ordered_cancel_semiring
251 pordered_comm_monoid_add ~> ordered_comm_monoid_add
252 pordered_comm_ring ~> ordered_comm_ring
253 pordered_comm_semiring ~> ordered_comm_semiring
254 pordered_ring ~> ordered_ring
255 pordered_ring_abs ~> ordered_ring_abs
256 pordered_semiring ~> ordered_semiring
258 ordered_ab_group_add ~> linordered_ab_group_add
259 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
260 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
261 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
262 ordered_field ~> linordered_field
263 ordered_field_no_lb ~> linordered_field_no_lb
264 ordered_field_no_ub ~> linordered_field_no_ub
265 ordered_field_dense_linear_order ~> dense_linordered_field
266 ordered_idom ~> linordered_idom
267 ordered_ring ~> linordered_ring
268 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
269 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
270 ordered_ring_strict ~> linordered_ring_strict
271 ordered_semidom ~> linordered_semidom
272 ordered_semiring ~> linordered_semiring
273 ordered_semiring_1 ~> linordered_semiring_1
274 ordered_semiring_1_strict ~> linordered_semiring_1_strict
275 ordered_semiring_strict ~> linordered_semiring_strict
277 The following slightly odd type classes have been moved to a
278 separate theory Library/Lattice_Algebras.thy:
280 lordered_ab_group_add ~> lattice_ab_group_add
281 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
282 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
283 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
284 lordered_ring ~> lattice_ring
288 * Refined field classes:
289 - classes division_ring_inverse_zero, field_inverse_zero,
290 linordered_field_inverse_zero include rule inverse 0 = 0 --
291 subsumes former division_by_zero class;
292 - numerous lemmas have been ported from field to division_ring.
295 * Refined algebra theorem collections:
296 - dropped theorem group group_simps, use algebra_simps instead;
297 - dropped theorem group ring_simps, use field_simps instead;
298 - proper theorem collection field_simps subsumes former theorem
299 groups field_eq_simps and field_simps;
300 - dropped lemma eq_minus_self_iff which is a duplicate for
304 * Theory Finite_Set and List: some lemmas have been generalized from
307 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
308 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
309 inter_Inter_fold_inter ~> inf_Inf_fold_inf
310 union_Union_fold_union ~> sup_Sup_fold_sup
311 Inter_fold_inter ~> Inf_fold_inf
312 Union_fold_union ~> Sup_fold_sup
313 inter_INTER_fold_inter ~> inf_INFI_fold_inf
314 union_UNION_fold_union ~> sup_SUPR_fold_sup
315 INTER_fold_inter ~> INFI_fold_inf
316 UNION_fold_union ~> SUPR_fold_sup
318 * Theory Complete_Lattice: lemmas top_def and bot_def have been
319 replaced by the more convenient lemmas Inf_empty and Sup_empty.
320 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
321 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
322 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
323 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
325 * HOLogic.strip_psplit: types are returned in syntactic order, similar
326 to other strip and tuple operations. INCOMPATIBILITY.
328 * Reorganized theory Multiset: swapped notation of pointwise and
330 - pointwise ordering is instance of class order with standard syntax
332 - multiset ordering has syntax <=# and <#; partial order properties
333 are provided by means of interpretation with prefix
335 - less duplication, less historical organization of sections,
336 conversion from associations lists to multisets, rudimentary code
338 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
341 multiset_eq_conv_count_eq -> multiset_ext_iff
342 multi_count_ext -> multiset_ext
343 diff_union_inverse2 -> diff_union_cancelR
346 * Theory Permutation: replaced local "remove" by List.remove1.
348 * Code generation: ML and OCaml code is decorated with signatures.
350 * Theory List: added transpose.
352 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
353 clash with new theory Quotient in Main HOL.
355 * Library/Nat_Bijection.thy is a collection of bijective functions
356 between nat and other types, which supersedes the older libraries
357 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
360 Nat_Int_Bij.nat2_to_nat ~> prod_encode
361 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
362 Nat_Int_Bij.int_to_nat_bij ~> int_encode
363 Nat_Int_Bij.nat_to_int_bij ~> int_decode
364 Countable.pair_encode ~> prod_encode
365 NatIso.prod2nat ~> prod_encode
366 NatIso.nat2prod ~> prod_decode
367 NatIso.sum2nat ~> sum_encode
368 NatIso.nat2sum ~> sum_decode
369 NatIso.list2nat ~> list_encode
370 NatIso.nat2list ~> list_decode
371 NatIso.set2nat ~> set_encode
372 NatIso.nat2set ~> set_decode
375 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
376 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
377 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
378 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
379 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
380 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
381 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
382 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
383 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
384 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
385 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
386 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
387 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
390 - Renamed ATP commands:
391 atp_info ~> sledgehammer running_atps
392 atp_kill ~> sledgehammer kill_atps
393 atp_messages ~> sledgehammer messages
394 atp_minimize ~> sledgehammer minimize
395 print_atps ~> sledgehammer available_atps
397 - Added user's manual ("isabelle doc sledgehammer").
398 - Added option syntax and "sledgehammer_params" to customize
399 Sledgehammer's behavior. See the manual for details.
400 - Modified the Isar proof reconstruction code so that it produces
401 direct proofs rather than proofs by contradiction. (This feature
402 is still experimental.)
403 - Made Isar proof reconstruction work for SPASS, remote ATPs, and in
405 - Added support for TPTP syntax for SPASS via the "spass_tptp" ATP.
408 - Added and implemented "binary_ints" and "bits" options.
409 - Added "std" option and implemented support for nonstandard models.
410 - Added and implemented "finitize" option to improve the precision
411 of infinite datatypes based on a monotonicity analysis.
412 - Added support for quotient types.
413 - Added support for "specification" and "ax_specification"
415 - Added support for local definitions (for "function" and
416 "termination" proofs).
417 - Added support for term postprocessors.
418 - Optimized "Multiset.multiset" and "FinFun.finfun".
419 - Improved efficiency of "destroy_constrs" optimization.
420 - Fixed soundness bugs related to "destroy_constrs" optimization and
422 - Fixed soundness bug related to higher-order constructors
423 - Improved precision of set constructs.
424 - Added cache to speed up repeated Kodkod invocations on the same
426 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
427 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
428 "SAT4J_Light". INCOMPATIBILITY.
429 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
430 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
435 * Variable names in lemmas generated by the domain package have
436 changed; the naming scheme is now consistent with the HOL datatype
437 package. Some proof scripts may be affected, INCOMPATIBILITY.
439 * The domain package no longer defines the function "foo_copy" for
440 recursive domain "foo". The reach lemma is now stated directly in
441 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
442 be reformulated in terms of "foo_take", INCOMPATIBILITY.
444 * Most definedness lemmas generated by the domain package (previously
445 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
446 like "foo$x = UU <-> x = UU", which works better as a simp rule.
447 Proof scripts that used definedness lemmas as intro rules may break,
448 potential INCOMPATIBILITY.
450 * Induction and casedist rules generated by the domain package now
451 declare proper case_names (one called "bottom", and one named for each
452 constructor). INCOMPATIBILITY.
454 * For mutually-recursive domains, separate "reach" and "take_lemma"
455 rules are generated for each domain, INCOMPATIBILITY.
457 foo_bar.reach ~> foo.reach bar.reach
458 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
460 * Some lemmas generated by the domain package have been renamed for
461 consistency with the datatype package, INCOMPATIBILITY.
463 foo.ind ~> foo.induct
464 foo.finite_ind ~> foo.finite_induct
465 foo.coind ~> foo.coinduct
466 foo.casedist ~> foo.exhaust
467 foo.exhaust ~> foo.nchotomy
469 * For consistency with other definition packages, the fixrec package
470 now generates qualified theorem names, INCOMPATIBILITY.
472 foo_simps ~> foo.simps
473 foo_unfold ~> foo.unfold
474 foo_induct ~> foo.induct
476 * The "contlub" predicate has been removed. Proof scripts should use
477 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
479 * The "admw" predicate has been removed, INCOMPATIBILITY.
481 * The constants cpair, cfst, and csnd have been removed in favor of
482 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
487 * Sorts.certify_sort and derived "cert" operations for types and terms
488 no longer minimize sorts. Thus certification at the boundary of the
489 inference kernel becomes invariant under addition of class relations,
490 which is an important monotonicity principle. Sorts are now minimized
491 in the syntax layer only, at the boundary between the end-user and the
492 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
493 explicitly in rare situations.
495 * Antiquotations for basic formal entities:
497 @{class NAME} -- type class
498 @{class_syntax NAME} -- syntax representation of the above
500 @{type_name NAME} -- logical type
501 @{type_abbrev NAME} -- type abbreviation
502 @{nonterminal NAME} -- type of concrete syntactic category
503 @{type_syntax NAME} -- syntax representation of any of the above
505 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
506 @{const_abbrev NAME} -- abbreviated constant
507 @{const_syntax NAME} -- syntax representation of any of the above
509 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
510 syntax constant (cf. 'syntax' command).
512 * Antiquotation @{make_string} inlines a function to print arbitrary
513 values similar to the ML toplevel. The result is compiler dependent
514 and may fall back on "?" in certain situations.
516 * Renamed old-style Drule.standard to Drule.export_without_context, to
517 emphasize that this is in no way a standard operation.
520 * Curried take and drop in library.ML; negative length is interpreted
521 as infinity (as in chop). INCOMPATIBILITY.
523 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
524 usual for resolution. Rare INCOMPATIBILITY.
526 * Discontinued old TheoryDataFun with its copy/init operation -- data
527 needs to be pure. Functor Theory_Data_PP retains the traditional
528 Pretty.pp argument to merge, which is absent in the standard
531 * Renamed varify/unvarify operations to varify_global/unvarify_global
532 to emphasize that these only work in a global situation (which is
535 * Configuration options now admit dynamic default values, depending on
536 the context or even global references.
538 * Most operations that refer to a global context are named
539 accordingly, e.g. Simplifier.global_context or
540 ProofContext.init_global. There are some situations where a global
541 context actually works, but under normal circumstances one needs to
542 pass the proper local context through the code!
544 * Renamed some important ML structures, while keeping the old names
545 for some time as aliases within the structure Legacy:
547 OuterKeyword ~> Keyword
550 OuterSyntax ~> Outer_Syntax
551 SpecParse ~> Parse_Spec
553 Note that "open Legacy" simplifies porting of sources, but forgetting
554 to remove it again will complicate porting again in the future.
559 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
560 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
561 proof terms are enabled unconditionally in the new HOL-Proofs image.
563 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
564 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
567 * Old lib/scripts/polyml-platform is superseded by the
568 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
569 variant, even on a 64 bit machine. The following example setting
570 prefers 64 bit if available:
572 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
576 New in Isabelle2009-1 (December 2009)
577 -------------------------------------
581 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
582 one backslash should be used, even in ML sources.
587 * Locale interpretation propagates mixins along the locale hierarchy.
588 The currently only available mixins are the equations used to map
589 local definitions to terms of the target domain of an interpretation.
591 * Reactivated diagnostic command 'print_interps'. Use "print_interps
592 loc" to print all interpretations of locale "loc" in the theory.
593 Interpretations in proofs are not shown.
595 * Thoroughly revised locales tutorial. New section on conditional
598 * On instantiation of classes, remaining undefined class parameters
599 are formally declared. INCOMPATIBILITY.
602 *** Document preparation ***
604 * New generalized style concept for printing terms: @{foo (style) ...}
605 instead of @{foo_style style ...} (old form is still retained for
606 backward compatibility). Styles can be also applied for
607 antiquotations prop, term_type and typeof.
612 * New proof method "smt" for a combination of first-order logic with
613 equality, linear and nonlinear (natural/integer/real) arithmetic, and
614 fixed-size bitvectors; there is also basic support for higher-order
615 features (esp. lambda abstractions). It is an incomplete decision
616 procedure based on external SMT solvers using the oracle mechanism;
617 for the SMT solver Z3, this method is proof-producing. Certificates
618 are provided to avoid calling the external solvers solely for
619 re-checking proofs. Due to a remote SMT service there is no need for
620 installing SMT solvers locally. See src/HOL/SMT.
622 * New commands to load and prove verification conditions generated by
623 the Boogie program verifier or derived systems (e.g. the Verifying C
624 Compiler (VCC) or Spec#). See src/HOL/Boogie.
626 * New counterexample generator tool 'nitpick' based on the Kodkod
627 relational model finder. See src/HOL/Tools/Nitpick and
628 src/HOL/Nitpick_Examples.
630 * New commands 'code_pred' and 'values' to invoke the predicate
631 compiler and to enumerate values of inductive predicates.
633 * A tabled implementation of the reflexive transitive closure.
635 * New implementation of quickcheck uses generic code generator;
636 default generators are provided for all suitable HOL types, records
637 and datatypes. Old quickcheck can be re-activated importing theory
638 Library/SML_Quickcheck.
640 * New testing tool Mirabelle for automated proof tools. Applies
641 several tools and tactics like sledgehammer, metis, or quickcheck, to
642 every proof step in a theory. To be used in batch mode via the
645 * New proof method "sos" (sum of squares) for nonlinear real
646 arithmetic (originally due to John Harison). It requires theory
647 Library/Sum_Of_Squares. It is not a complete decision procedure but
648 works well in practice on quantifier-free real arithmetic with +, -,
649 *, ^, =, <= and <, i.e. boolean combinations of equalities and
650 inequalities between polynomials. It makes use of external
651 semidefinite programming solvers. Method "sos" generates a
652 certificate that can be pasted into the proof thus avoiding the need
653 to call an external tool every time the proof is checked. See
654 src/HOL/Library/Sum_Of_Squares.
656 * New method "linarith" invokes existing linear arithmetic decision
659 * New command 'atp_minimal' reduces result produced by Sledgehammer.
661 * New Sledgehammer option "Full Types" in Proof General settings menu.
662 Causes full type information to be output to the ATPs. This slows
663 ATPs down considerably but eliminates a source of unsound "proofs"
666 * New method "metisFT": A version of metis that uses full type
667 information in order to avoid failures of proof reconstruction.
669 * New evaluator "approximate" approximates an real valued term using
670 the same method as the approximation method.
672 * Method "approximate" now supports arithmetic expressions as
673 boundaries of intervals and implements interval splitting and Taylor
676 * ML antiquotation @{code_datatype} inserts definition of a datatype
677 generated by the code generator; e.g. see src/HOL/Predicate.thy.
679 * New theory SupInf of the supremum and infimum operators for sets of
682 * New theory Probability, which contains a development of measure
683 theory, eventually leading to Lebesgue integration and probability.
685 * Extended Multivariate Analysis to include derivation and Brouwer's
688 * Reorganization of number theory, INCOMPATIBILITY:
689 - new number theory development for nat and int, in theories Divides
690 and GCD as well as in new session Number_Theory
691 - some constants and facts now suffixed with _nat and _int
693 - former session NumberTheory now named Old_Number_Theory, including
694 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
695 - moved theory Pocklington from src/HOL/Library to
696 src/HOL/Old_Number_Theory
698 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
699 lcm of finite and infinite sets. It is shown that they form a complete
702 * Class semiring_div requires superclass no_zero_divisors and proof of
703 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
704 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
705 generalized to class semiring_div, subsuming former theorems
706 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
707 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
710 * Refinements to lattice classes and sets:
711 - less default intro/elim rules in locale variant, more default
712 intro/elim rules in class variant: more uniformity
713 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
715 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
717 - renamed ACI to inf_sup_aci
718 - new class "boolean_algebra"
719 - class "complete_lattice" moved to separate theory
720 "Complete_Lattice"; corresponding constants (and abbreviations)
721 renamed and with authentic syntax:
722 Set.Inf ~> Complete_Lattice.Inf
723 Set.Sup ~> Complete_Lattice.Sup
724 Set.INFI ~> Complete_Lattice.INFI
725 Set.SUPR ~> Complete_Lattice.SUPR
726 Set.Inter ~> Complete_Lattice.Inter
727 Set.Union ~> Complete_Lattice.Union
728 Set.INTER ~> Complete_Lattice.INTER
729 Set.UNION ~> Complete_Lattice.UNION
730 - authentic syntax for
733 - mere abbreviations:
736 Set.inter (for inf, formerly Set.Int)
737 Set.union (for sup, formerly Set.Un)
738 Complete_Lattice.Inter (for Inf)
739 Complete_Lattice.Union (for Sup)
740 Complete_Lattice.INTER (for INFI)
741 Complete_Lattice.UNION (for SUPR)
742 - object-logic definitions as far as appropriate
744 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
745 Un_subset_iff are explicitly deleted as default simp rules; then also
746 their lattice counterparts le_inf_iff and le_sup_iff have to be
747 deleted to achieve the desired effect.
749 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
750 rules by default any longer; the same applies to min_max.inf_absorb1
751 etc. INCOMPATIBILITY.
753 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
754 pred_set_conv by default. INCOMPATIBILITY.
756 * Power operations on relations and functions are now one dedicated
757 constant "compow" with infix syntax "^^". Power operation on
758 multiplicative monoids retains syntax "^" and is now defined generic
759 in class power. INCOMPATIBILITY.
761 * Relation composition "R O S" now has a more standard argument order:
762 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
763 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
764 break, since the O_assoc rule was not rewritten like this. Fix using
765 O_assoc[symmetric]. The same applies to the curried version "R OO S".
767 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
768 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
771 * Most rules produced by inductive and datatype package have mandatory
772 prefixes. INCOMPATIBILITY.
774 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
775 the attribute of the same name. Each of the theorems in the list
776 DERIV_intros assumes composition with an additional function and
777 matches a variable to the derivative, which has to be solved by the
778 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
779 of most elementary terms. Former Maclauren.DERIV_tac and
780 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
783 * Code generator attributes follow the usual underscore convention:
784 code_unfold replaces code unfold
785 code_post replaces code post
790 sizechange -> size_change
791 induct_scheme -> induction_schema
794 * Discontinued abbreviation "arbitrary" of constant "undefined".
795 INCOMPATIBILITY, use "undefined" directly.
798 Suc_eq_add_numeral_1 -> Suc_eq_plus1
799 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
800 Suc_plus1 -> Suc_eq_plus1
801 *anti_sym -> *antisym*
802 vector_less_eq_def -> vector_le_def
805 * Added theorem List.map_map as [simp]. Removed List.map_compose.
808 * Removed predicate "M hassize n" (<--> card M = n & finite M).
814 * Theory Representable defines a class "rep" of domains that are
815 representable (via an ep-pair) in the universal domain type "udom".
816 Instances are provided for all type constructors defined in HOLCF.
818 * The 'new_domain' command is a purely definitional version of the
819 domain package, for representable domains. Syntax is identical to the
820 old domain package. The 'new_domain' package also supports indirect
821 recursion using previously-defined type constructors. See
822 src/HOLCF/ex/New_Domain.thy for examples.
824 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
825 on the left-hand side of an equation, and then performs
826 simplification. Rewriting is done using rules declared with the
827 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
828 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
830 * The pattern-match compiler in 'fixrec' can now handle constructors
831 with HOL function types. Pattern-match combinators for the Pair
832 constructor are pre-configured.
834 * The 'fixrec' package now produces better fixed-point induction rules
835 for mutually-recursive definitions: Induction rules have conclusions
836 of the form "P foo bar" instead of "P <foo, bar>".
838 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
839 been renamed to "below". The name "below" now replaces "less" in many
840 theorem names. (Legacy theorem names using "less" are still supported
843 * The 'fixrec' package now supports "bottom patterns". Bottom
844 patterns can be used to generate strictness rules, or to make
845 functions more strict (much like the bang-patterns supported by the
846 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
852 * Support for Poly/ML 5.3.0, with improved reporting of compiler
853 errors and run-time exceptions, including detailed source positions.
855 * Structure Name_Space (formerly NameSpace) now manages uniquely
856 identified entries, with some additional information such as source
857 position, logical grouping etc.
859 * Theory and context data is now introduced by the simplified and
860 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
861 to be pure, but the old TheoryDataFun for mutable data (with explicit
862 copy operation) is still available for some time.
864 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
865 provides a high-level programming interface to synchronized state
866 variables with atomic update. This works via pure function
867 application within a critical section -- its runtime should be as
868 short as possible; beware of deadlocks if critical code is nested,
869 either directly or indirectly via other synchronized variables!
871 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
872 wraps raw ML references, explicitly indicating their non-thread-safe
873 behaviour. The Isar toplevel keeps this structure open, to
874 accommodate Proof General as well as quick and dirty interactive
875 experiments with references.
877 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
878 parallel tactical reasoning.
880 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
881 are similar to SUBPROOF, but are slightly more flexible: only the
882 specified parts of the subgoal are imported into the context, and the
883 body tactic may introduce new subgoals and schematic variables.
885 * Old tactical METAHYPS, which does not observe the proof context, has
886 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
887 or Subgoal.FOCUS etc.
889 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
890 functors have their own ML name space there is no point to mark them
891 separately.) Minor INCOMPATIBILITY.
893 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
895 * Renamed several structures FooBar to Foo_Bar. Occasional,
898 * Operations of structure Skip_Proof no longer require quick_and_dirty
899 mode, which avoids critical setmp.
901 * Eliminated old Attrib.add_attributes, Method.add_methods and related
902 combinators for "args". INCOMPATIBILITY, need to use simplified
903 Attrib/Method.setup introduced in Isabelle2009.
905 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
906 back on global_simpset_of, global_claset_of, global_clasimpset_of as
907 last resort. INCOMPATIBILITY.
909 * Display.pretty_thm now requires a proper context (cf. former
910 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
911 or even Display.pretty_thm_without_context as last resort.
914 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
915 Syntax.pretty_typ/term directly, preferably with proper context
916 instead of global theory.
921 * Further fine tuning of parallel proof checking, scales up to 8 cores
922 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
925 * Support for additional "Isabelle components" via etc/components, see
926 also the system manual.
928 * The isabelle makeall tool now operates on all components with
929 IsaMakefile, not just hardwired "logics".
931 * Removed "compress" option from isabelle-process and isabelle usedir;
932 this is always enabled.
934 * Discontinued support for Poly/ML 4.x versions.
936 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
937 on a given logic image. This requires the lighttpd webserver and is
938 currently supported on Linux only.
942 New in Isabelle2009 (April 2009)
943 --------------------------------
947 * Simplified main Isabelle executables, with less surprises on
948 case-insensitive file-systems (such as Mac OS).
950 - The main Isabelle tool wrapper is now called "isabelle" instead of
953 - The former "isabelle" alias for "isabelle-process" has been
954 removed (should rarely occur to regular users).
956 - The former "isabelle-interface" and its alias "Isabelle" have been
957 removed (interfaces are now regular Isabelle tools).
959 Within scripts and make files, the Isabelle environment variables
960 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
961 respectively. (The latter are still available as legacy feature.)
963 The old isabelle-interface wrapper could react in confusing ways if
964 the interface was uninstalled or changed otherwise. Individual
965 interface tool configuration is now more explicit, see also the
966 Isabelle system manual. In particular, Proof General is now available
967 via "isabelle emacs".
969 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
970 purge installed copies of Isabelle executables and re-run "isabelle
971 install -p ...", or use symlinks.
973 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
974 old ~/isabelle, which was slightly non-standard and apt to cause
975 surprises on case-insensitive file-systems (such as Mac OS).
977 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
978 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
979 care is required when using older releases of Isabelle. Note that
980 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
981 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
983 * Proofs of fully specified statements are run in parallel on
984 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
985 a regular 4-core machine, if the initial heap space is made reasonably
986 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
988 * The main reference manuals ("isar-ref", "implementation", and
989 "system") have been updated and extended. Formally checked references
990 as hyperlinks are now available uniformly.
995 * Complete re-implementation of locales. INCOMPATIBILITY in several
996 respects. The most important changes are listed below. See the
997 Tutorial on Locales ("locales" manual) for details.
999 - In locale expressions, instantiation replaces renaming. Parameters
1000 must be declared in a for clause. To aid compatibility with previous
1001 parameter inheritance, in locale declarations, parameters that are not
1002 'touched' (instantiation position "_" or omitted) are implicitly added
1003 with their syntax at the beginning of the for clause.
1005 - Syntax from abbreviations and definitions in locales is available in
1006 locale expressions and context elements. The latter is particularly
1007 useful in locale declarations.
1009 - More flexible mechanisms to qualify names generated by locale
1010 expressions. Qualifiers (prefixes) may be specified in locale
1011 expressions, and can be marked as mandatory (syntax: "name!:") or
1012 optional (syntax "name?:"). The default depends for plain "name:"
1013 depends on the situation where a locale expression is used: in
1014 commands 'locale' and 'sublocale' prefixes are optional, in
1015 'interpretation' and 'interpret' prefixes are mandatory. The old
1016 implicit qualifiers derived from the parameter names of a locale are
1017 no longer generated.
1019 - Command "sublocale l < e" replaces "interpretation l < e". The
1020 instantiation clause in "interpretation" and "interpret" (square
1021 brackets) is no longer available. Use locale expressions.
1023 - When converting proof scripts, mandatory qualifiers in
1024 'interpretation' and 'interpret' should be retained by default, even
1025 if this is an INCOMPATIBILITY compared to former behavior. In the
1026 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
1027 in locale expressions range over a single locale instance only.
1029 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
1030 In existing theorem specifications replace the includes element by the
1031 respective context elements of the included locale, omitting those
1032 that are already present in the theorem specification. Multiple
1033 assume elements of a locale should be replaced by a single one
1034 involving the locale predicate. In the proof body, declarations (most
1035 notably theorems) may be regained by interpreting the respective
1036 locales in the proof context as required (command "interpret").
1038 If using "includes" in replacement of a target solely because the
1039 parameter types in the theorem are not as general as in the target,
1040 consider declaring a new locale with additional type constraints on
1041 the parameters (context element "constrains").
1043 - Discontinued "locale (open)". INCOMPATIBILITY.
1045 - Locale interpretation commands no longer attempt to simplify goal.
1046 INCOMPATIBILITY: in rare situations the generated goal differs. Use
1047 methods intro_locales and unfold_locales to clarify.
1049 - Locale interpretation commands no longer accept interpretation
1050 attributes. INCOMPATIBILITY.
1052 * Class declaration: so-called "base sort" must not be given in import
1053 list any longer, but is inferred from the specification. Particularly
1060 class foo = type + ...
1062 * Class target: global versions of theorems stemming do not carry a
1063 parameter prefix any longer. INCOMPATIBILITY.
1065 * Class 'instance' command no longer accepts attached definitions.
1066 INCOMPATIBILITY, use proper 'instantiation' target instead.
1068 * Recovered hiding of consts, which was accidentally broken in
1069 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1070 makes c inaccessible; consider using ``hide (open) const c'' instead.
1072 * Slightly more coherent Pure syntax, with updated documentation in
1073 isar-ref manual. Removed locales meta_term_syntax and
1074 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1075 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1076 directly in regular applications.
1078 * There is a new syntactic category "float_const" for signed decimal
1079 fractions (e.g. 123.45 or -123.45).
1081 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1082 interface with 'setup' command instead.
1084 * Command 'local_setup' is similar to 'setup', but operates on a local
1087 * The 'axiomatization' command now only works within a global theory
1088 context. INCOMPATIBILITY.
1090 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1091 hypotheses. Sorts required in the course of reasoning need to be
1092 covered by the constraints in the initial statement, completed by the
1093 type instance information of the background theory. Non-trivial sort
1094 hypotheses, which rarely occur in practice, may be specified via
1095 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1097 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1099 The result contains an implicit sort hypotheses as before --
1100 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1103 * Generalized Isar history, with support for linear undo, direct state
1106 * Changed defaults for unify configuration options:
1108 unify_trace_bound = 50 (formerly 25)
1109 unify_search_bound = 60 (formerly 30)
1111 * Different bookkeeping for code equations (INCOMPATIBILITY):
1113 a) On theory merge, the last set of code equations for a particular
1114 constant is taken (in accordance with the policy applied by other
1115 parts of the code generator framework).
1117 b) Code equations stemming from explicit declarations (e.g. code
1118 attribute) gain priority over default code equations stemming
1119 from definition, primrec, fun etc.
1121 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1123 * Unified theorem tables for both code generators. Thus [code
1124 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1126 * Command 'find_consts' searches for constants based on type and name
1129 find_consts "_ => bool"
1131 By default, matching is against subtypes, but it may be restricted to
1132 the whole type. Searching by name is possible. Multiple queries are
1133 conjunctive and queries may be negated by prefixing them with a
1136 find_consts strict: "_ => bool" name: "Int" -"int => int"
1138 * New 'find_theorems' criterion "solves" matches theorems that
1139 directly solve the current goal (modulo higher-order unification).
1141 * Auto solve feature for main theorem statements: whenever a new goal
1142 is stated, "find_theorems solves" is called; any theorems that could
1143 solve the lemma directly are listed as part of the goal state.
1144 Cf. associated options in Proof General Isabelle settings menu,
1145 enabled by default, with reasonable timeout for pathological cases of
1146 higher-order unification.
1149 *** Document preparation ***
1151 * Antiquotation @{lemma} now imitates a regular terminal proof,
1152 demanding keyword 'by' and supporting the full method expression
1153 syntax just like the Isar command 'by'.
1158 * Integrated main parts of former image HOL-Complex with HOL. Entry
1159 points Main and Complex_Main remain as before.
1161 * Logic image HOL-Plain provides a minimal HOL with the most important
1162 tools available (inductive, datatype, primrec, ...). This facilitates
1163 experimentation and tool development. Note that user applications
1164 (and library theories) should never refer to anything below theory
1167 * Logic image HOL-Main stops at theory Main, and thus facilitates
1168 experimentation due to shorter build times.
1170 * Logic image HOL-NSA contains theories of nonstandard analysis which
1171 were previously part of former HOL-Complex. Entry point Hyperreal
1172 remains valid, but theories formerly using Complex_Main should now use
1173 new entry point Hypercomplex.
1175 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1176 Posix processes. Avoids potentially expensive forking of the ML
1177 process. New thread-based implementation also works on non-Unix
1178 platforms (Cygwin). Provers are no longer hardwired, but defined
1179 within the theory via plain ML wrapper functions. Basic Sledgehammer
1180 commands are covered in the isar-ref manual.
1182 * Wrapper scripts for remote SystemOnTPTP service allows to use
1183 sledgehammer without local ATP installation (Vampire etc.). Other
1184 provers may be included via suitable ML wrappers, see also
1185 src/HOL/ATP_Linkup.thy.
1187 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1190 * The metis method no longer fails because the theorem is too trivial
1191 (contains the empty clause).
1193 * The metis method now fails in the usual manner, rather than raising
1194 an exception, if it determines that it cannot prove the theorem.
1196 * Method "coherent" implements a prover for coherent logic (see also
1197 src/Tools/coherent.ML).
1199 * Constants "undefined" and "default" replace "arbitrary". Usually
1200 "undefined" is the right choice to replace "arbitrary", though
1201 logically there is no difference. INCOMPATIBILITY.
1203 * Command "value" now integrates different evaluation mechanisms. The
1204 result of the first successful evaluation mechanism is printed. In
1205 square brackets a particular named evaluation mechanisms may be
1206 specified (currently, [SML], [code] or [nbe]). See further
1207 src/HOL/ex/Eval_Examples.thy.
1209 * Normalization by evaluation now allows non-leftlinear equations.
1210 Declare with attribute [code nbe].
1212 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1213 as the structured Isar versions "cases" and "induct", cf. the
1214 corresponding "cases" and "induct" attributes. Mutual induction rules
1215 are now presented as a list of individual projections
1216 (e.g. foo_bar.inducts for types foo and bar); the old format with
1217 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1218 rare situations a different rule is selected --- notably nested tuple
1219 elimination instead of former prod.exhaust: use explicit (case_tac t
1220 rule: prod.exhaust) here.
1222 * Attributes "cases", "induct", "coinduct" support "del" option.
1224 * Removed fact "case_split_thm", which duplicates "case_split".
1226 * The option datatype has been moved to a new theory Option. Renamed
1227 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1229 * New predicate "strict_mono" classifies strict functions on partial
1230 orders. With strict functions on linear orders, reasoning about
1231 (in)equalities is facilitated by theorems "strict_mono_eq",
1232 "strict_mono_less_eq" and "strict_mono_less".
1234 * Some set operations are now proper qualified constants with
1235 authentic syntax. INCOMPATIBILITY:
1246 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1249 * Auxiliary class "itself" has disappeared -- classes without any
1250 parameter are treated as expected by the 'class' command.
1252 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1254 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1255 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1257 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1258 method "approximation". It proves formulas on real values by using
1259 interval arithmetic. In the formulas are also the transcendental
1260 functions sin, cos, tan, atan, ln, exp and the constant pi are
1261 allowed. For examples see
1262 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1264 * Theory "Reflection" now resides in HOL/Library.
1266 * Entry point to Word library now simply named "Word".
1269 * Made source layout more coherent with logical distribution
1272 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1273 src/HOL/Library/Code_Message.thy ~> src/HOL/
1274 src/HOL/Library/GCD.thy ~> src/HOL/
1275 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1276 src/HOL/Library/Parity.thy ~> src/HOL/
1277 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1278 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1279 src/HOL/Real/Lubs.thy ~> src/HOL/
1280 src/HOL/Real/PReal.thy ~> src/HOL/
1281 src/HOL/Real/Rational.thy ~> src/HOL/
1282 src/HOL/Real/RComplete.thy ~> src/HOL/
1283 src/HOL/Real/RealDef.thy ~> src/HOL/
1284 src/HOL/Real/RealPow.thy ~> src/HOL/
1285 src/HOL/Real/Real.thy ~> src/HOL/
1286 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1287 src/HOL/Complex/Complex.thy ~> src/HOL/
1288 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1289 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1290 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1291 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1292 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1293 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1294 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1295 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1296 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1297 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1298 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1299 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1300 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1301 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1302 src/HOL/Real/Float ~> src/HOL/Library/
1303 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1304 src/HOL/Real/RealVector.thy ~> src/HOL/
1306 src/HOL/arith_data.ML ~> src/HOL/Tools
1307 src/HOL/hologic.ML ~> src/HOL/Tools
1308 src/HOL/simpdata.ML ~> src/HOL/Tools
1309 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1310 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1311 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1312 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1313 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1314 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1315 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1317 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1318 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1319 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1320 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1321 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1322 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1324 * If methods "eval" and "evaluation" encounter a structured proof
1325 state with !!/==>, only the conclusion is evaluated to True (if
1326 possible), avoiding strange error messages.
1328 * Method "sizechange" automates termination proofs using (a
1329 modification of) the size-change principle. Requires SAT solver. See
1330 src/HOL/ex/Termination.thy for examples.
1332 * Simplifier: simproc for let expressions now unfolds if bound
1333 variable occurs at most once in let expression body. INCOMPATIBILITY.
1335 * Method "arith": Linear arithmetic now ignores all inequalities when
1336 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1338 * New attribute "arith" for facts that should always be used
1339 automatically by arithmetic. It is intended to be used locally in
1342 assumes [arith]: "x > 0"
1344 Global usage is discouraged because of possible performance impact.
1346 * New classes "top" and "bot" with corresponding operations "top" and
1347 "bot" in theory Orderings; instantiation of class "complete_lattice"
1348 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1350 * Changed definition lemma "less_fun_def" in order to provide an
1351 instance for preorders on functions; use lemma "less_le" instead.
1354 * Theory Orderings: class "wellorder" moved here, with explicit
1355 induction rule "less_induct" as assumption. For instantiation of
1356 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1359 * Theory Orderings: added class "preorder" as superclass of "order".
1360 INCOMPATIBILITY: Instantiation proofs for order, linorder
1361 etc. slightly changed. Some theorems named order_class.* now named
1364 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1367 * Theory Finite_Set: added a new fold combinator of type
1369 ('a => 'b => 'b) => 'b => 'a set => 'b
1371 Occasionally this is more convenient than the old fold combinator
1372 which is now defined in terms of the new one and renamed to
1375 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1376 and "ring_simps" have been replaced by "algebra_simps" (which can be
1377 extended with further lemmas!). At the moment both still exist but
1378 the former will disappear at some point.
1380 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1381 class recpower. Type-specific simp rules for various recpower types
1382 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1384 rat_power_0 -> power_0
1385 rat_power_Suc -> power_Suc
1386 realpow_0 -> power_0
1387 realpow_Suc -> power_Suc
1388 complexpow_0 -> power_0
1389 complexpow_Suc -> power_Suc
1390 power_poly_0 -> power_0
1391 power_poly_Suc -> power_Suc
1393 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1394 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1395 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1396 of lemmas from Divides has been generalized from nat to class
1397 semiring_div. INCOMPATIBILITY. This involves the following theorem
1398 renames resulting from duplicate elimination:
1400 dvd_def_mod ~> dvd_eq_mod_eq_0
1401 zero_dvd_iff ~> dvd_0_left_iff
1402 dvd_0 ~> dvd_0_right
1403 DIVISION_BY_ZERO_DIV ~> div_by_0
1404 DIVISION_BY_ZERO_MOD ~> mod_by_0
1405 mult_div ~> div_mult_self2_is_id
1406 mult_mod ~> mod_mult_self2_is_0
1408 * Theory IntDiv: removed many lemmas that are instances of class-based
1409 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1410 rename old lemmas as follows:
1412 dvd_diff -> nat_dvd_diff
1413 dvd_zminus_iff -> dvd_minus_iff
1414 mod_add1_eq -> mod_add_eq
1415 mod_mult1_eq -> mod_mult_right_eq
1416 mod_mult1_eq' -> mod_mult_left_eq
1417 mod_mult_distrib_mod -> mod_mult_eq
1418 nat_mod_add_left_eq -> mod_add_left_eq
1419 nat_mod_add_right_eq -> mod_add_right_eq
1420 nat_mod_div_trivial -> mod_div_trivial
1421 nat_mod_mod_trivial -> mod_mod_trivial
1422 zdiv_zadd_self1 -> div_add_self1
1423 zdiv_zadd_self2 -> div_add_self2
1424 zdiv_zmult_self1 -> div_mult_self2_is_id
1425 zdiv_zmult_self2 -> div_mult_self1_is_id
1426 zdvd_triv_left -> dvd_triv_left
1427 zdvd_triv_right -> dvd_triv_right
1428 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1429 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1430 zmod_zadd_left_eq -> mod_add_left_eq
1431 zmod_zadd_right_eq -> mod_add_right_eq
1432 zmod_zadd_self1 -> mod_add_self1
1433 zmod_zadd_self2 -> mod_add_self2
1434 zmod_zadd1_eq -> mod_add_eq
1435 zmod_zdiff1_eq -> mod_diff_eq
1436 zmod_zdvd_zmod -> mod_mod_cancel
1437 zmod_zmod_cancel -> mod_mod_cancel
1438 zmod_zmult_self1 -> mod_mult_self2_is_0
1439 zmod_zmult_self2 -> mod_mult_self1_is_0
1442 zdvd_abs1 -> abs_dvd_iff
1443 zdvd_abs2 -> dvd_abs_iff
1444 zdvd_refl -> dvd_refl
1445 zdvd_trans -> dvd_trans
1446 zdvd_zadd -> dvd_add
1447 zdvd_zdiff -> dvd_diff
1448 zdvd_zminus_iff -> dvd_minus_iff
1449 zdvd_zminus2_iff -> minus_dvd_iff
1450 zdvd_zmultD -> dvd_mult_right
1451 zdvd_zmultD2 -> dvd_mult_left
1452 zdvd_zmult_mono -> mult_dvd_mono
1453 zdvd_0_right -> dvd_0_right
1454 zdvd_0_left -> dvd_0_left_iff
1455 zdvd_1_left -> one_dvd
1456 zminus_dvd_iff -> minus_dvd_iff
1458 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1460 * The real numbers offer decimal input syntax: 12.34 is translated
1461 into 1234/10^2. This translation is not reversed upon output.
1463 * Theory Library/Polynomial defines an abstract type 'a poly of
1464 univariate polynomials with coefficients of type 'a. In addition to
1465 the standard ring operations, it also supports div and mod. Code
1466 generation is also supported, using list-style constructors.
1468 * Theory Library/Inner_Product defines a class of real_inner for real
1469 inner product spaces, with an overloaded operation inner :: 'a => 'a
1470 => real. Class real_inner is a subclass of real_normed_vector from
1473 * Theory Library/Product_Vector provides instances for the product
1474 type 'a * 'b of several classes from RealVector and Inner_Product.
1475 Definitions of addition, subtraction, scalar multiplication, norms,
1476 and inner products are included.
1478 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1479 addition to the field operations, numerals and case syntax are also
1482 * Theory Library/Diagonalize provides constructive version of Cantor's
1483 first diagonalization argument.
1485 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1486 zlcm (for int); carried together from various gcd/lcm developements in
1487 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1488 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1489 may recover tupled syntax as follows:
1491 hide (open) const gcd
1492 abbreviation gcd where
1493 "gcd == (%(a, b). GCD.gcd a b)"
1495 GCD.gcd ("gcd '(_, _')")
1497 The same works for lcm, zgcd, zlcm.
1499 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1500 instantiations for algebraic structures. Removed some duplicate
1501 theorems. Changes in simp rules. INCOMPATIBILITY.
1503 * ML antiquotation @{code} takes a constant as argument and generates
1504 corresponding code in background and inserts name of the corresponding
1505 resulting ML value/function/datatype constructor binding in place.
1506 All occurrences of @{code} with a single ML block are generated
1507 simultaneously. Provides a generic and safe interface for
1508 instrumentalizing code generation. See
1509 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1510 In future you ought to refrain from ad-hoc compiling generated SML
1511 code on the ML toplevel. Note that (for technical reasons) @{code}
1512 cannot refer to constants for which user-defined serializations are
1513 set. Refer to the corresponding ML counterpart directly in that
1516 * Command 'rep_datatype': instead of theorem names the command now
1517 takes a list of terms denoting the constructors of the type to be
1518 represented as datatype. The characteristic theorems have to be
1519 proven. INCOMPATIBILITY. Also observe that the following theorems
1520 have disappeared in favour of existing ones:
1522 unit_induct ~> unit.induct
1523 prod_induct ~> prod.induct
1524 sum_induct ~> sum.induct
1525 Suc_Suc_eq ~> nat.inject
1526 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1531 * New locales for orders and lattices where the equivalence relation
1532 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1533 locales use a record structure with field eq for the equivalence.
1535 * New theory of factorial domains.
1537 * Units_l_inv and Units_r_inv are now simp rules by default.
1538 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1539 and/or r_inv will now also require deletion of these lemmas.
1541 * Renamed the following theorems, INCOMPATIBILITY:
1543 UpperD ~> Upper_memD
1544 LowerD ~> Lower_memD
1545 least_carrier ~> least_closed
1546 greatest_carrier ~> greatest_closed
1547 greatest_Lower_above ~> greatest_Lower_below
1548 one_zero ~> carrier_one_zero
1549 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1554 * Nominal datatypes can now contain type-variables.
1556 * Commands 'nominal_inductive' and 'equivariance' work with local
1559 * Nominal primrec can now works with local theory targets and its
1560 specification syntax now conforms to the general format as seen in
1563 * Method "perm_simp" honours the standard simplifier attributes
1564 (no_asm), (no_asm_use) etc.
1566 * The new predicate #* is defined like freshness, except that on the
1567 left hand side can be a set or list of atoms.
1569 * Experimental command 'nominal_inductive2' derives strong induction
1570 principles for inductive definitions. In contrast to
1571 'nominal_inductive', which can only deal with a fixed number of
1572 binders, it can deal with arbitrary expressions standing for sets of
1573 atoms to be avoided. The only inductive definition we have at the
1574 moment that needs this generalisation is the typing rule for Lets in
1577 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1578 -----------------------------------------------------------------
1579 Gamma |- Let x be t1 in t2 : T2
1581 In this rule one wants to avoid all the binders that are introduced by
1582 "close Gamma T1". We are looking for other examples where this
1583 feature might be useful. Please let us know.
1588 * Reimplemented the simplification procedure for proving continuity
1589 subgoals. The new simproc is extensible; users can declare additional
1590 continuity introduction rules with the attribute [cont2cont].
1592 * The continuity simproc now uses a different introduction rule for
1593 solving continuity subgoals on terms with lambda abstractions. In
1594 some rare cases the new simproc may fail to solve subgoals that the
1595 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1596 Potential INCOMPATIBILITY.
1598 * Command 'fixrec': specification syntax now conforms to the general
1599 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1600 examples. INCOMPATIBILITY.
1605 * Proof of Zorn's Lemma for partial orders.
1610 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1611 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1612 depends on multithreading, so timouts will not work before Poly/ML
1615 * High-level support for concurrent ML programming, see
1616 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1617 particularly convenient to organize independent functional
1618 computations. The concept of "synchronized variables" provides a
1619 higher-order interface for components with shared state, avoiding the
1620 delicate details of mutexes and condition variables. (Requires
1621 Poly/ML 5.2.1 or later.)
1623 * ML bindings produced via Isar commands are stored within the Isar
1624 context (theory or proof). Consequently, commands like 'use' and 'ML'
1625 become thread-safe and work with undo as expected (concerning
1626 top-level bindings, not side-effects on global references).
1627 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1628 compiler at runtime; really global bindings need to be given outside a
1629 theory. (Requires Poly/ML 5.2 or later.)
1631 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1632 context. Top-level ML bindings are stored within the proof context in
1633 a purely sequential fashion, disregarding the nested proof structure.
1634 ML bindings introduced by 'ML_prf' are discarded at the end of the
1635 proof. (Requires Poly/ML 5.2 or later.)
1637 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1638 and Method.setup, as well as Isar commands 'attribute_setup' and
1639 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1640 existing code accordingly, or use plain 'setup' together with old
1643 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1644 to 'a -> thm, while results are always tagged with an authentic oracle
1645 name. The Isar command 'oracle' is now polymorphic, no argument type
1646 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1647 accordingly. Note that extra performance may be gained by producing
1648 the cterm carefully, avoiding slow Thm.cterm_of.
1650 * Simplified interface for defining document antiquotations via
1651 ThyOutput.antiquotation, ThyOutput.output, and optionally
1652 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1653 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1656 * More systematic treatment of long names, abstract name bindings, and
1657 name space operations. Basic operations on qualified names have been
1658 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1659 Long_Name.append. Old type bstring has been mostly replaced by
1660 abstract type binding (see structure Binding), which supports precise
1661 qualification by packages and local theory targets, as well as proper
1662 tracking of source positions. INCOMPATIBILITY, need to wrap old
1663 bstring values into Binding.name, or better pass through abstract
1664 bindings everywhere. See further src/Pure/General/long_name.ML,
1665 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1667 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1668 LocalTheory.note etc.) now refer to the *full* internal name, not the
1669 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1671 * Disposed old type and term read functions (Sign.read_def_typ,
1672 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1673 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1674 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1675 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1676 resort for legacy applications.
1678 * Disposed old declarations, tactics, tactic combinators that refer to
1679 the simpset or claset of an implicit theory (such as Addsimps,
1680 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1681 embedded ML text, or local_simpset_of with a proper context passed as
1682 explicit runtime argument.
1684 * Rules and tactics that read instantiations (read_instantiate,
1685 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1686 context, which is required for parsing and type-checking. Moreover,
1687 the variables are specified as plain indexnames, not string encodings
1688 thereof. INCOMPATIBILITY.
1690 * Generic Toplevel.add_hook interface allows to analyze the result of
1691 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1692 for theorem dependency output of transactions resulting in a new
1695 * ML antiquotations: block-structured compilation context indicated by
1696 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1698 @{binding name} - basic name binding
1699 @{let ?pat = term} - term abbreviation (HO matching)
1700 @{note name = fact} - fact abbreviation
1701 @{thm fact} - singleton fact (with attributes)
1702 @{thms fact} - general fact (with attributes)
1703 @{lemma prop by method} - singleton goal
1704 @{lemma prop by meth1 meth2} - singleton goal
1705 @{lemma prop1 ... propN by method} - general goal
1706 @{lemma prop1 ... propN by meth1 meth2} - general goal
1707 @{lemma (open) ...} - open derivation
1712 * The Isabelle "emacs" tool provides a specific interface to invoke
1713 Proof General / Emacs, with more explicit failure if that is not
1714 installed (the old isabelle-interface script silently falls back on
1715 isabelle-process). The PROOFGENERAL_HOME setting determines the
1716 installation location of the Proof General distribution.
1718 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1719 the Isabelle process into a JVM/Scala application. See
1720 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1721 process wrapper has been discontinued.)
1723 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1725 * Various status messages (with exact source position information) are
1726 emitted, if proper markup print mode is enabled. This allows
1727 user-interface components to provide detailed feedback on internal
1732 New in Isabelle2008 (June 2008)
1733 -------------------------------
1737 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1738 and updated, with formally checked references as hyperlinks.
1740 * Theory loader: use_thy (and similar operations) no longer set the
1741 implicit ML context, which was occasionally hard to predict and in
1742 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1743 provides a proper context already.
1745 * Theory loader: old-style ML proof scripts being *attached* to a thy
1746 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1747 'use' within a theory file will do the job.
1749 * Name space merge now observes canonical order, i.e. the second space
1750 is inserted into the first one, while existing entries in the first
1751 space take precedence. INCOMPATIBILITY in rare situations, may try to
1752 swap theory imports.
1754 * Syntax: symbol \<chi> is now considered a letter. Potential
1755 INCOMPATIBILITY in identifier syntax etc.
1757 * Outer syntax: string tokens no longer admit escaped white space,
1758 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1759 white space without escapes.
1761 * Outer syntax: string tokens may contain arbitrary character codes
1762 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1768 * Context-dependent token translations. Default setup reverts locally
1769 fixed variables, and adds hilite markup for undeclared frees.
1771 * Unused theorems can be found using the new command 'unused_thms'.
1772 There are three ways of invoking it:
1775 Only finds unused theorems in the current theory.
1777 (2) unused_thms thy_1 ... thy_n -
1778 Finds unused theorems in the current theory and all of its ancestors,
1779 excluding the theories thy_1 ... thy_n and all of their ancestors.
1781 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1782 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1783 their ancestors, excluding the theories thy_1 ... thy_n and all of
1786 In order to increase the readability of the list produced by
1787 unused_thms, theorems that have been created by a particular instance
1788 of a theory command such as 'inductive' or 'function' are considered
1789 to belong to the same "group", meaning that if at least one theorem in
1790 this group is used, the other theorems in the same group are no longer
1791 reported as unused. Moreover, if all theorems in the group are
1792 unused, only one theorem in the group is displayed.
1794 Note that proof objects have to be switched on in order for
1795 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1796 usually the case when using Proof General with the default settings).
1798 * Authentic naming of facts disallows ad-hoc overwriting of previous
1799 theorems within the same name space. INCOMPATIBILITY, need to remove
1800 duplicate fact bindings, or even accidental fact duplications. Note
1801 that tools may maintain dynamically scoped facts systematically, using
1802 PureThy.add_thms_dynamic.
1804 * Command 'hide' now allows to hide from "fact" name space as well.
1806 * Eliminated destructive theorem database, simpset, claset, and
1807 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1808 update of theories within ML code.
1810 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1811 INCOMPATIBILITY, object-logics depending on former Pure require
1812 additional setup PureThy.old_appl_syntax_setup; object-logics
1813 depending on former CPure need to refer to Pure.
1815 * Commands 'use' and 'ML' are now purely functional, operating on
1816 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1817 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1820 * Command 'setup': discontinued implicit version with ML reference.
1822 * Instantiation target allows for simultaneous specification of class
1823 instance operations together with an instantiation proof.
1824 Type-checking phase allows to refer to class operations uniformly.
1825 See src/HOL/Complex/Complex.thy for an Isar example and
1826 src/HOL/Library/Eval.thy for an ML example.
1828 * Indexing of literal facts: be more serious about including only
1829 facts from the visible specification/proof context, but not the
1830 background context (locale etc.). Affects `prop` notation and method
1831 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1834 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1835 "(open)" option, which used to expose internal bound variables to the
1838 * Isar statements: removed obsolete case "rule_context".
1839 INCOMPATIBILITY, better use explicit fixes/assumes.
1841 * Locale proofs: default proof step now includes 'unfold_locales';
1842 hence 'proof' without argument may be used to unfold locale
1846 *** Document preparation ***
1848 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1849 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1850 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1851 spot); renamed link color from "darkblue" to "linkcolor" (default
1852 value unchanged, can be redefined via \definecolor); no longer sets
1853 "a4paper" option (unnecessary or even intrusive).
1855 * Antiquotation @{lemma A method} proves proposition A by the given
1856 method (either a method name or a method name plus (optional) method
1857 arguments in parentheses) and prints A just like @{prop A}.
1862 * New primrec package. Specification syntax conforms in style to
1863 definition/function/.... No separate induction rule is provided. The
1864 "primrec" command distinguishes old-style and new-style specifications
1865 by syntax. The former primrec package is now named OldPrimrecPackage.
1866 When adjusting theories, beware: constants stemming from new-style
1867 primrec specifications have authentic syntax.
1869 * Metis prover is now an order of magnitude faster, and also works
1870 with multithreading.
1872 * Metis: the maximum number of clauses that can be produced from a
1873 theorem is now given by the attribute max_clauses. Theorems that
1874 exceed this number are ignored, with a warning printed.
1876 * Sledgehammer no longer produces structured proofs by default. To
1877 enable, declare [[sledgehammer_full = true]]. Attributes
1878 reconstruction_modulus, reconstruction_sorts renamed
1879 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1881 * Method "induct_scheme" derives user-specified induction rules
1882 from well-founded induction and completeness of patterns. This factors
1883 out some operations that are done internally by the function package
1884 and makes them available separately. See
1885 src/HOL/ex/Induction_Scheme.thy for examples.
1887 * More flexible generation of measure functions for termination
1888 proofs: Measure functions can be declared by proving a rule of the
1889 form "is_measure f" and giving it the [measure_function] attribute.
1890 The "is_measure" predicate is logically meaningless (always true), and
1891 just guides the heuristic. To find suitable measure functions, the
1892 termination prover sets up the goal "is_measure ?f" of the appropriate
1893 type and generates all solutions by prolog-style backwards proof using
1896 This setup also deals with rules like
1898 "is_measure f ==> is_measure (list_size f)"
1900 which accommodates nested datatypes that recurse through lists.
1901 Similar rules are predeclared for products and option types.
1903 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1907 - Definitions of overloaded constants on sets have to be replaced by
1908 definitions on => and bool.
1910 - Some definitions of overloaded operators on sets can now be proved
1911 using the definitions of the operators on => and bool. Therefore,
1912 the following theorems have been renamed:
1914 subset_def -> subset_eq
1915 psubset_def -> psubset_eq
1916 set_diff_def -> set_diff_eq
1917 Compl_def -> Compl_eq
1918 Sup_set_def -> Sup_set_eq
1919 Inf_set_def -> Inf_set_eq
1920 sup_set_def -> sup_set_eq
1921 inf_set_def -> inf_set_eq
1923 - Due to the incompleteness of the HO unification algorithm, some
1924 rules such as subst may require manual instantiation, if some of
1925 the unknowns in the rule is a set.
1927 - Higher order unification and forward proofs:
1930 have "P (S::'a set)" <...>
1931 then have "EX S. P S" ..
1933 no longer works (due to the incompleteness of the HO unification
1934 algorithm) and must be replaced by the pattern
1941 - Calculational reasoning with subst (or similar rules):
1944 have "P (S::'a set)" <...>
1945 also have "S = T" <...>
1946 finally have "P T" .
1948 no longer works (for similar reasons as the previous example) and
1949 must be replaced by something like
1951 have "P (S::'a set)" <...>
1952 moreover have "S = T" <...>
1953 ultimately have "P T" by simp
1955 - Tactics or packages written in ML code:
1956 Code performing pattern matching on types via
1958 Type ("set", [T]) => ...
1960 must be rewritten. Moreover, functions like strip_type or
1961 binder_types no longer return the right value when applied to a
1964 T1 => ... => Tn => U => bool
1968 T1 => ... => Tn => U set
1970 * Merged theories Wellfounded_Recursion, Accessible_Part and
1971 Wellfounded_Relations to theory Wellfounded.
1973 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1975 * Class finite no longer treats UNIV as class parameter. Use class
1976 enum from theory Library/Enum instead to achieve a similar effect.
1979 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1980 and "Cons". INCOMPATIBILITY.
1982 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1983 Potential INCOMPATIBILITY.
1985 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1986 injective_fst_snd removed, use split_eta and prod_eqI instead.
1987 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1989 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1990 the same name in theory Orderings:
2000 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
2001 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
2002 and different variable names.
2004 * Library/Option_ord.thy: Canonical order on option type.
2006 * Library/RBT.thy: Red-black trees, an efficient implementation of
2009 * Library/Countable.thy: Type class for countable types.
2011 * Theory Int: The representation of numerals has changed. The infix
2012 operator BIT and the bit datatype with constructors B0 and B1 have
2013 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
2014 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
2015 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
2018 * Theory Nat: definition of <= and < on natural numbers no longer
2019 depend on well-founded relations. INCOMPATIBILITY. Definitions
2020 le_def and less_def have disappeared. Consider lemmas not_less
2021 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
2023 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
2024 (whose purpose mainly is for various fold_set functionals) have been
2025 abandoned in favor of the existing algebraic classes
2026 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
2027 lower_semilattice (resp. upper_semilattice) and linorder.
2030 * Theory Transitive_Closure: induct and cases rules now declare proper
2031 case_names ("base" and "step"). INCOMPATIBILITY.
2033 * Theorem Inductive.lfp_ordinal_induct generalized to complete
2034 lattices. The form set-specific version is available as
2035 Inductive.lfp_ordinal_induct_set.
2037 * Renamed theorems "power.simps" to "power_int.simps".
2040 * Class semiring_div provides basic abstract properties of semirings
2041 with division and modulo operations. Subsumes former class dvd_mod.
2043 * Merged theories IntDef, Numeral and IntArith into unified theory
2044 Int. INCOMPATIBILITY.
2046 * Theory Library/Code_Index: type "index" now represents natural
2047 numbers rather than integers. INCOMPATIBILITY.
2049 * New class "uminus" with operation "uminus" (split of from class
2050 "minus" which now only has operation "minus", binary).
2053 * Constants "card", "internal_split", "option_map" now with authentic
2054 syntax. INCOMPATIBILITY.
2056 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
2057 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
2058 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
2059 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
2060 Sup_set_def, le_def, less_def, option_map_def now with object
2061 equality. INCOMPATIBILITY.
2063 * Records. Removed K_record, and replaced it by pure lambda term
2064 %x. c. The simplifier setup is now more robust against eta expansion.
2065 INCOMPATIBILITY: in cases explicitly referring to K_record.
2067 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2069 * Library/ListVector: new theory of arithmetic vector operations.
2071 * Library/Order_Relation: new theory of various orderings as sets of
2072 pairs. Defines preorders, partial orders, linear orders and
2073 well-orders on sets and on types.
2078 * Renamed some theories to allow to loading both ZF and HOL in the
2081 Datatype -> Datatype_ZF
2082 Inductive -> Inductive_ZF
2089 INCOMPATIBILITY: ZF theories that import individual theories below
2090 Main might need to be adapted. Regular theory Main is still
2091 available, as trivial extension of Main_ZF.
2096 * ML within Isar: antiquotation @{const name} or @{const
2097 name(typargs)} produces statically-checked Const term.
2099 * Functor NamedThmsFun: data is available to the user as dynamic fact
2100 (of the same name). Removed obsolete print command.
2102 * Removed obsolete "use_legacy_bindings" function.
2104 * The ``print mode'' is now a thread-local value derived from a global
2105 template (the former print_mode reference), thus access becomes
2106 non-critical. The global print_mode reference is for session
2107 management only; user-code should use print_mode_value,
2108 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2110 * Functions system/system_out provide a robust way to invoke external
2111 shell commands, with propagation of interrupts (requires Poly/ML
2112 5.2.1). Do not use OS.Process.system etc. from the basis library!
2117 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2118 in accordance with Proof General 3.7, which prefers GNU emacs.
2120 * isatool tty runs Isabelle process with plain tty interaction;
2121 optional line editor may be specified via ISABELLE_LINE_EDITOR
2122 setting, the default settings attempt to locate "ledit" and "rlwrap".
2124 * isatool browser now works with Cygwin as well, using general
2125 "javapath" function defined in Isabelle process environment.
2127 * YXML notation provides a simple and efficient alternative to
2128 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2129 isatool yxml as described in the Isabelle system manual.
2131 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2132 provides general wrapper for managing an Isabelle process in a robust
2133 fashion, with ``cooked'' output from stdin/stderr.
2135 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2136 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2138 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2139 way of changing the user's settings is via
2140 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2143 * Multithreading.max_threads := 0 refers to the number of actual CPU
2144 cores of the underlying machine, which is a good starting point for
2145 optimal performance tuning. The corresponding usedir option -M allows
2146 "max" as an alias for "0". WARNING: does not work on certain versions
2147 of Mac OS (with Poly/ML 5.1).
2149 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2150 adverse effect of Isabelle flooding interactive front-ends (notably
2151 ProofGeneral / XEmacs).
2155 New in Isabelle2007 (November 2007)
2156 -----------------------------------
2160 * More uniform information about legacy features, notably a
2161 warning/error of "Legacy feature: ...", depending on the state of the
2162 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2163 legacy features will disappear eventually.
2165 * Theory syntax: the header format ``theory A = B + C:'' has been
2166 discontinued in favour of ``theory A imports B C begin''. Use isatool
2167 fixheaders to convert existing theory files. INCOMPATIBILITY.
2169 * Theory syntax: the old non-Isar theory file format has been
2170 discontinued altogether. Note that ML proof scripts may still be used
2171 with Isar theories; migration is usually quite simple with the ML
2172 function use_legacy_bindings. INCOMPATIBILITY.
2174 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2175 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2178 * Theory loader: be more serious about observing the static theory
2179 header specifications (including optional directories), but not the
2180 accidental file locations of previously successful loads. The strict
2181 update policy of former update_thy is now already performed by
2182 use_thy, so the former has been removed; use_thys updates several
2183 theories simultaneously, just as 'imports' within a theory header
2184 specification, but without merging the results. Potential
2185 INCOMPATIBILITY: may need to refine theory headers and commands
2186 ROOT.ML which depend on load order.
2188 * Theory loader: optional support for content-based file
2189 identification, instead of the traditional scheme of full physical
2190 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2191 (cf. the system manual). The new scheme allows to work with
2192 non-finished theories in persistent session images, such that source
2193 files may be moved later on without requiring reloads.
2195 * Theory loader: old-style ML proof scripts being *attached* to a thy
2196 file (with the same base name as the theory) are considered a legacy
2197 feature, which will disappear eventually. Even now, the theory loader
2198 no longer maintains dependencies on such files.
2200 * Syntax: the scope for resolving ambiguities via type-inference is
2201 now limited to individual terms, instead of whole simultaneous
2202 specifications as before. This greatly reduces the complexity of the
2203 syntax module and improves flexibility by separating parsing and
2204 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2205 'fixes' etc.) are required in rare situations.
2207 * Syntax: constants introduced by new-style packages ('definition',
2208 'abbreviation' etc.) are passed through the syntax module in
2209 ``authentic mode''. This means that associated mixfix annotations
2210 really stick to such constants, independently of potential name space
2211 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2212 trees are represented slightly differently, may need to adapt syntax
2213 translations accordingly. Use CONST marker in 'translations' and
2214 @{const_syntax} antiquotation in 'parse_translation' etc.
2216 * Legacy goal package: reduced interface to the bare minimum required
2217 to keep existing proof scripts running. Most other user-level
2218 functions are now part of the OldGoals structure, which is *not* open
2219 by default (consider isatool expandshort before open OldGoals).
2220 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2221 these tend to cause confusion about the actual goal (!) context being
2222 used here, which is not necessarily the same as the_context().
2224 * Command 'find_theorems': supports "*" wild-card in "name:"
2225 criterion; "with_dups" option. Certain ProofGeneral versions might
2226 support a specific search form (see ProofGeneral/CHANGES).
2228 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2229 by default, which means that "prems" (and also "fixed variables") are
2230 suppressed from proof state output. Note that the ProofGeneral
2231 settings mechanism allows to change and save options persistently, but
2232 older versions of Isabelle will fail to start up if a negative prems
2235 * Local theory targets may be specified by non-nested blocks of
2236 ``context/locale/class ... begin'' followed by ``end''. The body may
2237 contain definitions, theorems etc., including any derived mechanism
2238 that has been implemented on top of these primitives. This concept
2239 generalizes the existing ``theorem (in ...)'' towards more versatility
2242 * Proof General interface: proper undo of final 'end' command;
2243 discontinued Isabelle/classic mode (ML proof scripts).
2246 *** Document preparation ***
2248 * Added antiquotation @{theory name} which prints the given name,
2249 after checking that it refers to a valid ancestor theory in the
2252 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2253 check the given source text as ML type/structure, printing verbatim.
2255 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2256 "c args == rhs" given in the current context. (Any number of
2257 arguments may be given on the LHS.)
2262 * The 'class' package offers a combination of axclass and locale to
2263 achieve Haskell-like type classes in Isabelle. Definitions and
2264 theorems within a class context produce both relative results (with
2265 implicit parameters according to the locale context), and polymorphic
2266 constants with qualified polymorphism (according to the class
2267 context). Within the body context of a 'class' target, a separate
2268 syntax layer ("user space type system") takes care of converting
2269 between global polymorphic consts and internal locale representation.
2270 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2271 "isatool doc classes" provides a tutorial.
2273 * Generic code generator framework allows to generate executable
2274 code for ML and Haskell (including Isabelle classes). A short usage
2277 internal compilation:
2278 export_code <list of constants (term syntax)> in SML
2279 writing SML code to a file:
2280 export_code <list of constants (term syntax)> in SML <filename>
2281 writing OCaml code to a file:
2282 export_code <list of constants (term syntax)> in OCaml <filename>
2283 writing Haskell code to a bunch of files:
2284 export_code <list of constants (term syntax)> in Haskell <filename>
2286 evaluating closed propositions to True/False using code generation:
2289 Reasonable default setup of framework in HOL.
2291 Theorem attributs for selecting and transforming function equations theorems:
2293 [code fun]: select a theorem as function equation for a specific constant
2294 [code fun del]: deselect a theorem as function equation for a specific constant
2295 [code inline]: select an equation theorem for unfolding (inlining) in place
2296 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2298 User-defined serializations (target in {SML, OCaml, Haskell}):
2300 code_const <and-list of constants (term syntax)>
2301 {(target) <and-list of const target syntax>}+
2303 code_type <and-list of type constructors>
2304 {(target) <and-list of type target syntax>}+
2306 code_instance <and-list of instances>
2308 where instance ::= <type constructor> :: <class>
2310 code_class <and_list of classes>
2311 {(target) <and-list of class target syntax>}+
2312 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2314 code_instance and code_class only are effective to target Haskell.
2316 For example usage see src/HOL/ex/Codegenerator.thy and
2317 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2318 generation from Isabelle/HOL theories is available via "isatool doc
2321 * Code generator: consts in 'consts_code' Isar commands are now
2322 referred to by usual term syntax (including optional type
2325 * Command 'no_translations' removes translation rules from theory
2328 * Overloaded definitions are now actually checked for acyclic
2329 dependencies. The overloading scheme is slightly more general than
2330 that of Haskell98, although Isabelle does not demand an exact
2331 correspondence to type class and instance declarations.
2332 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2333 exotic versions of overloading -- at the discretion of the user!
2335 Polymorphic constants are represented via type arguments, i.e. the
2336 instantiation that matches an instance against the most general
2337 declaration given in the signature. For example, with the declaration
2338 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2339 as c(nat). Overloading is essentially simultaneous structural
2340 recursion over such type arguments. Incomplete specification patterns
2341 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2342 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2343 Command 'print_theory' outputs the normalized system of recursive
2344 equations, see section "definitions".
2346 * Configuration options are maintained within the theory or proof
2347 context (with name and type bool/int/string), providing a very simple
2348 interface to a poor-man's version of general context data. Tools may
2349 declare options in ML (e.g. using Attrib.config_int) and then refer to
2350 these values using Config.get etc. Users may change options via an
2351 associated attribute of the same name. This form of context
2352 declaration works particularly well with commands 'declare' or
2353 'using', for example ``declare [[foo = 42]]''. Thus it has become
2354 very easy to avoid global references, which would not observe Isar
2355 toplevel undo/redo and fail to work with multithreading.
2357 Various global ML references of Pure and HOL have been turned into
2358 configuration options:
2360 Unify.search_bound unify_search_bound
2361 Unify.trace_bound unify_trace_bound
2362 Unify.trace_simp unify_trace_simp
2363 Unify.trace_types unify_trace_types
2364 Simplifier.simp_depth_limit simp_depth_limit
2365 Blast.depth_limit blast_depth_limit
2366 DatatypeProp.dtK datatype_distinctness_limit
2367 fast_arith_neq_limit fast_arith_neq_limit
2368 fast_arith_split_limit fast_arith_split_limit
2370 * Named collections of theorems may be easily installed as context
2371 data using the functor NamedThmsFun (see also
2372 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2373 attributes; there is also a toplevel print command. This facility is
2374 just a common case of general context data, which is the preferred way
2375 for anything more complex than just a list of facts in canonical
2378 * Isar: command 'declaration' augments a local theory by generic
2379 declaration functions written in ML. This enables arbitrary content
2380 being added to the context, depending on a morphism that tells the
2381 difference of the original declaration context wrt. the application
2382 context encountered later on.
2384 * Isar: proper interfaces for simplification procedures. Command
2385 'simproc_setup' declares named simprocs (with match patterns, and body
2386 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2387 context. ML antiquotation @{simproc name} retrieves named simprocs.
2389 * Isar: an extra pair of brackets around attribute declarations
2390 abbreviates a theorem reference involving an internal dummy fact,
2391 which will be ignored later --- only the effect of the attribute on
2392 the background context will persist. This form of in-place
2393 declarations is particularly useful with commands like 'declare' and
2394 'using', for example ``have A using [[simproc a]] by simp''.
2396 * Isar: method "assumption" (and implicit closing of subproofs) now
2397 takes simple non-atomic goal assumptions into account: after applying
2398 an assumption as a rule the resulting subgoals are solved by atomic
2399 assumption steps. This is particularly useful to finish 'obtain'
2400 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2401 without referring to the original premise "!!x. P x ==> thesis" in the
2402 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2405 * Isar: implicit use of prems from the Isar proof context is
2406 considered a legacy feature. Common applications like ``have A .''
2407 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2408 referencing facts explicitly here improves readability and
2409 maintainability of proof texts.
2411 * Isar: improper proof element 'guess' is like 'obtain', but derives
2412 the obtained context from the course of reasoning! For example:
2414 assume "EX x y. A x & B y" -- "any previous fact"
2415 then guess x and y by clarify
2417 This technique is potentially adventurous, depending on the facts and
2418 proof tools being involved here.
2420 * Isar: known facts from the proof context may be specified as literal
2421 propositions, using ASCII back-quote syntax. This works wherever
2422 named facts used to be allowed so far, in proof commands, proof
2423 methods, attributes etc. Literal facts are retrieved from the context
2424 according to unification of type and term parameters. For example,
2425 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2426 theorems in the current context, then these are valid literal facts:
2427 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2429 There is also a proof method "fact" which does the same composition
2430 for explicit goal states, e.g. the following proof texts coincide with
2431 certain special cases of literal facts:
2433 have "A" by fact == note `A`
2434 have "A ==> B" by fact == note `A ==> B`
2435 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2436 have "P a ==> Q a" by fact == note `P a ==> Q a`
2438 * Isar: ":" (colon) is no longer a symbolic identifier character in
2439 outer syntax. Thus symbolic identifiers may be used without
2440 additional white space in declarations like this: ``assume *: A''.
2442 * Isar: 'print_facts' prints all local facts of the current context,
2443 both named and unnamed ones.
2445 * Isar: 'def' now admits simultaneous definitions, e.g.:
2447 def x == "t" and y == "u"
2449 * Isar: added command 'unfolding', which is structurally similar to
2450 'using', but affects both the goal state and facts by unfolding given
2451 rewrite rules. Thus many occurrences of the 'unfold' method or
2452 'unfolded' attribute may be replaced by first-class proof text.
2454 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2455 and command 'unfolding' now all support object-level equalities
2456 (potentially conditional). The underlying notion of rewrite rule is
2457 analogous to the 'rule_format' attribute, but *not* that of the
2458 Simplifier (which is usually more generous).
2460 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2461 premises of a theorem by n. Useful in conjunction with drule.
2463 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2464 method expression within a sandbox consisting of the first N
2465 sub-goals, which need to exist. For example, ``simp_all [3]''
2466 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2467 simplifies all new goals that emerge from applying rule foo to the
2468 originally first one.
2470 * Isar: schematic goals are no longer restricted to higher-order
2471 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2474 * Isar: the conclusion of a long theorem statement is now either
2475 'shows' (a simultaneous conjunction, as before), or 'obtains'
2476 (essentially a disjunction of cases with local parameters and
2477 assumptions). The latter allows to express general elimination rules
2478 adequately; in this notation common elimination rules look like this:
2480 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2482 obtains x where "P x"
2484 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2488 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2494 The subsequent classical rules even refer to the formal "thesis"
2497 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2500 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2501 obtains "thesis ==> something"
2503 The actual proof of an 'obtains' statement is analogous to that of the
2504 Isar proof element 'obtain', only that there may be several cases.
2505 Optional case names may be specified in parentheses; these will be
2506 available both in the present proof and as annotations in the
2507 resulting rule, for later use with the 'cases' method (cf. attribute
2510 * Isar: the assumptions of a long theorem statement are available as
2511 "assms" fact in the proof context. This is more appropriate than the
2512 (historical) "prems", which refers to all assumptions of the current
2513 context, including those from the target locale, proof body etc.
2515 * Isar: 'print_statement' prints theorems from the current theory or
2516 proof context in long statement form, according to the syntax of a
2519 * Isar: 'obtain' takes an optional case name for the local context
2520 introduction rule (default "that").
2522 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2523 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2526 * Pure: syntax "CONST name" produces a fully internalized constant
2527 according to the current context. This is particularly useful for
2528 syntax translations that should refer to internal constant
2529 representations independently of name spaces.
2531 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2532 instead of "FOO ". This allows multiple binder declarations to coexist
2533 in the same context. INCOMPATIBILITY.
2535 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2536 primitive that also works in a locale context (both for constants and
2537 fixed variables). Type declaration and internal syntactic representation
2538 of given constants retrieved from the context. Likewise, the
2539 'no_notation' command allows to remove given syntax annotations from the
2542 * Isar/locales: new derived specification elements 'axiomatization',
2543 'definition', 'abbreviation', which support type-inference, admit
2544 object-level specifications (equality, equivalence). See also the
2545 isar-ref manual. Examples:
2548 eq (infix "===" 50) where
2549 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2551 definition "f x y = x + y + 1"
2552 definition g where "g x = f x x"
2555 neq (infix "=!=" 50) where
2556 "x =!= y == ~ (x === y)"
2558 These specifications may be also used in a locale context. Then the
2559 constants being introduced depend on certain fixed parameters, and the
2560 constant name is qualified by the locale base name. An internal
2561 abbreviation takes care for convenient input and output, making the
2562 parameters implicit and using the original short name. See also
2563 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2564 entities from a monomorphic theory.
2566 Presently, abbreviations are only available 'in' a target locale, but
2567 not inherited by general import expressions. Also note that
2568 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2569 'translations' in common applications. The "no_abbrevs" print mode
2570 prevents folding of abbreviations in term output.
2572 Concrete syntax is attached to specified constants in internal form,
2573 independently of name spaces. The parse tree representation is
2574 slightly different -- use 'notation' instead of raw 'syntax', and
2575 'translations' with explicit "CONST" markup to accommodate this.
2577 * Pure/Isar: unified syntax for new-style specification mechanisms
2578 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2579 full type inference and dummy patterns ("_"). For example:
2581 definition "K x _ = x"
2583 inductive conj for A B
2584 where "A ==> B ==> conj A B"
2586 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2587 the current context. Print mode "no_abbrevs" prevents inversion of
2588 abbreviations on output.
2590 * Isar/locales: improved parameter handling: use of locales "var" and
2591 "struct" no longer necessary; - parameter renamings are no longer
2592 required to be injective. For example, this allows to define
2593 endomorphisms as locale endom = homom mult mult h.
2595 * Isar/locales: changed the way locales with predicates are defined.
2596 Instead of accumulating the specification, the imported expression is
2597 now an interpretation. INCOMPATIBILITY: different normal form of
2598 locale expressions. In particular, in interpretations of locales with
2599 predicates, goals repesenting already interpreted fragments are not
2600 removed automatically. Use methods `intro_locales' and
2601 `unfold_locales'; see below.
2603 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2604 provide backward reasoning on locales predicates. The methods are
2605 aware of interpretations and discharge corresponding goals.
2606 `intro_locales' is less aggressive then `unfold_locales' and does not
2607 unfold predicates to assumptions.
2609 * Isar/locales: the order in which locale fragments are accumulated
2610 has changed. This enables to override declarations from fragments due
2611 to interpretations -- for example, unwanted simp rules.
2613 * Isar/locales: interpretation in theories and proof contexts has been
2614 extended. One may now specify (and prove) equations, which are
2615 unfolded in interpreted theorems. This is useful for replacing
2616 defined concepts (constants depending on locale parameters) by
2617 concepts already existing in the target context. Example:
2619 interpretation partial_order ["op <= :: [int, int] => bool"]
2620 where "partial_order.less (op <=) (x::int) y = (x < y)"
2622 Typically, the constant `partial_order.less' is created by a
2623 definition specification element in the context of locale
2626 * Method "induct": improved internal context management to support
2627 local fixes and defines on-the-fly. Thus explicit meta-level
2628 connectives !! and ==> are rarely required anymore in inductive goals
2629 (using object-logic connectives for this purpose has been long
2630 obsolete anyway). Common proof patterns are explained in
2631 src/HOL/Induct/Common_Patterns.thy, see also
2632 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2635 * Method "induct": improved handling of simultaneous goals. Instead of
2636 introducing object-level conjunction, the statement is now split into
2637 several conclusions, while the corresponding symbolic cases are nested
2638 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2639 see src/HOL/Induct/Common_Patterns.thy, for example.
2641 * Method "induct": mutual induction rules are now specified as a list
2642 of rule sharing the same induction cases. HOL packages usually provide
2643 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2644 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2645 mutual induction rules differently, i.e. like this:
2647 (induct rule: foo_bar.inducts)
2648 (induct set: foo bar)
2649 (induct pred: foo bar)
2650 (induct type: foo bar)
2652 The ML function ProjectRule.projections turns old-style rules into the
2655 * Method "coinduct": dual of induction, see
2656 src/HOL/Library/Coinductive_List.thy for various examples.
2658 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2659 considered a legacy feature.
2661 * Attribute "symmetric" produces result with standardized schematic
2662 variables (index 0). Potential INCOMPATIBILITY.
2664 * Simplifier: by default the simplifier trace only shows top level
2665 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2666 default. Thus there is less danger of being flooded by the trace. The
2667 trace indicates where parts have been suppressed.
2669 * Provers/classical: removed obsolete classical version of elim_format
2670 attribute; classical elim/dest rules are now treated uniformly when
2671 manipulating the claset.
2673 * Provers/classical: stricter checks to ensure that supplied intro,
2674 dest and elim rules are well-formed; dest and elim rules must have at
2677 * Provers/classical: attributes dest/elim/intro take an optional
2678 weight argument for the rule (just as the Pure versions). Weights are
2679 ignored by automated tools, but determine the search order of single
2682 * Syntax: input syntax now supports dummy variable binding "%_. b",
2683 where the body does not mention the bound variable. Note that dummy
2684 patterns implicitly depend on their context of bounds, which makes
2685 "{_. _}" match any set comprehension as expected. Potential
2686 INCOMPATIBILITY -- parse translations need to cope with syntactic
2687 constant "_idtdummy" in the binding position.
2689 * Syntax: removed obsolete syntactic constant "_K" and its associated
2690 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2691 for example "A -> B" => "Pi A (%_. B)".
2693 * Pure: 'class_deps' command visualizes the subclass relation, using
2694 the graph browser tool.
2696 * Pure: 'print_theory' now suppresses certain internal declarations by
2697 default; use '!' option for full details.
2702 * Method "metis" proves goals by applying the Metis general-purpose
2703 resolution prover (see also http://gilith.com/software/metis/).
2704 Examples are in the directory MetisExamples. WARNING: the
2705 Isabelle/HOL-Metis integration does not yet work properly with
2708 * Command 'sledgehammer' invokes external automatic theorem provers as
2709 background processes. It generates calls to the "metis" method if
2710 successful. These can be pasted into the proof. Users do not have to
2711 wait for the automatic provers to return. WARNING: does not really
2712 work with multi-threading.
2714 * New "auto_quickcheck" feature tests outermost goal statements for
2715 potential counter-examples. Controlled by ML references
2716 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2717 5000 milliseconds). Fails silently if statements is outside of
2718 executable fragment, or any other codgenerator problem occurs.
2720 * New constant "undefined" with axiom "undefined x = undefined".
2722 * Added class "HOL.eq", allowing for code generation with polymorphic
2725 * Some renaming of class constants due to canonical name prefixing in
2726 the new 'class' package:
2728 HOL.abs ~> HOL.abs_class.abs
2729 HOL.divide ~> HOL.divide_class.divide
2730 0 ~> HOL.zero_class.zero
2731 1 ~> HOL.one_class.one
2732 op + ~> HOL.plus_class.plus
2733 op - ~> HOL.minus_class.minus
2734 uminus ~> HOL.minus_class.uminus
2735 op * ~> HOL.times_class.times
2736 op < ~> HOL.ord_class.less
2737 op <= > HOL.ord_class.less_eq
2738 Nat.power ~> Power.power_class.power
2739 Nat.size ~> Nat.size_class.size
2740 Numeral.number_of ~> Numeral.number_class.number_of
2741 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2742 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2743 Orderings.min ~> Orderings.ord_class.min
2744 Orderings.max ~> Orderings.ord_class.max
2745 Divides.op div ~> Divides.div_class.div
2746 Divides.op mod ~> Divides.div_class.mod
2747 Divides.op dvd ~> Divides.div_class.dvd
2749 INCOMPATIBILITY. Adaptions may be required in the following cases:
2751 a) User-defined constants using any of the names "plus", "minus",
2752 "times", "less" or "less_eq". The standard syntax translations for
2753 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2756 b) Variables named "plus", "minus", "times", "less", "less_eq"
2757 INCOMPATIBILITY: use more specific names.
2759 c) Permutative equations (e.g. "a + b = b + a")
2760 Since the change of names also changes the order of terms, permutative
2761 rewrite rules may get applied in a different order. Experience shows
2762 that this is rarely the case (only two adaptions in the whole Isabelle
2763 distribution). INCOMPATIBILITY: rewrite proofs
2765 d) ML code directly refering to constant names
2766 This in general only affects hand-written proof tactics, simprocs and
2767 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2768 Consider using @{const_name} antiquotation.
2770 * New class "default" with associated constant "default".
2772 * Function "sgn" is now overloaded and available on int, real, complex
2773 (and other numeric types), using class "sgn". Two possible defs of
2774 sgn are given as equational assumptions in the classes sgn_if and
2775 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2778 * Locale "partial_order" now unified with class "order" (cf. theory
2779 Orderings), added parameter "less". INCOMPATIBILITY.
2781 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2782 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2783 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2785 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2786 changed order of proof goals in instance proofs.
2788 * The transitivity reasoner for partial and linear orders is set up
2789 for classes "order" and "linorder". Instances of the reasoner are available
2790 in all contexts importing or interpreting the corresponding locales.
2791 Method "order" invokes the reasoner separately; the reasoner
2792 is also integrated with the Simplifier as a solver. Diagnostic
2793 command 'print_orders' shows the available instances of the reasoner
2794 in the current context.
2796 * Localized monotonicity predicate in theory "Orderings"; integrated
2797 lemmas max_of_mono and min_of_mono with this predicate.
2800 * Formulation of theorem "dense" changed slightly due to integration
2801 with new class dense_linear_order.
2803 * Uniform lattice theory development in HOL.
2805 constants "meet" and "join" now named "inf" and "sup"
2806 constant "Meet" now named "Inf"
2808 classes "meet_semilorder" and "join_semilorder" now named
2809 "lower_semilattice" and "upper_semilattice"
2810 class "lorder" now named "lattice"
2811 class "comp_lat" now named "complete_lattice"
2813 Instantiation of lattice classes allows explicit definitions
2814 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2816 INCOMPATIBILITY. Theorem renames:
2818 meet_left_le ~> inf_le1
2819 meet_right_le ~> inf_le2
2820 join_left_le ~> sup_ge1
2821 join_right_le ~> sup_ge2
2822 meet_join_le ~> inf_sup_ord
2825 le_meet ~> le_inf_iff
2826 le_join ~> ge_sup_conv
2827 meet_idempotent ~> inf_idem
2828 join_idempotent ~> sup_idem
2829 meet_comm ~> inf_commute
2830 join_comm ~> sup_commute
2831 meet_leI1 ~> le_infI1
2832 meet_leI2 ~> le_infI2
2833 le_joinI1 ~> le_supI1
2834 le_joinI2 ~> le_supI2
2835 meet_assoc ~> inf_assoc
2836 join_assoc ~> sup_assoc
2837 meet_left_comm ~> inf_left_commute
2838 meet_left_idempotent ~> inf_left_idem
2839 join_left_comm ~> sup_left_commute
2840 join_left_idempotent ~> sup_left_idem
2843 le_def_meet ~> le_iff_inf
2844 le_def_join ~> le_iff_sup
2845 join_absorp2 ~> sup_absorb2
2846 join_absorp1 ~> sup_absorb1
2847 meet_absorp1 ~> inf_absorb1
2848 meet_absorp2 ~> inf_absorb2
2849 meet_join_absorp ~> inf_sup_absorb
2850 join_meet_absorp ~> sup_inf_absorb
2851 distrib_join_le ~> distrib_sup_le
2852 distrib_meet_le ~> distrib_inf_le
2854 add_meet_distrib_left ~> add_inf_distrib_left
2855 add_join_distrib_left ~> add_sup_distrib_left
2856 is_join_neg_meet ~> is_join_neg_inf
2857 is_meet_neg_join ~> is_meet_neg_sup
2858 add_meet_distrib_right ~> add_inf_distrib_right
2859 add_join_distrib_right ~> add_sup_distrib_right
2860 add_meet_join_distribs ~> add_sup_inf_distribs
2861 join_eq_neg_meet ~> sup_eq_neg_inf
2862 meet_eq_neg_join ~> inf_eq_neg_sup
2863 add_eq_meet_join ~> add_eq_inf_sup
2864 meet_0_imp_0 ~> inf_0_imp_0
2865 join_0_imp_0 ~> sup_0_imp_0
2866 meet_0_eq_0 ~> inf_0_eq_0
2867 join_0_eq_0 ~> sup_0_eq_0
2868 neg_meet_eq_join ~> neg_inf_eq_sup
2869 neg_join_eq_meet ~> neg_sup_eq_inf
2870 join_eq_if ~> sup_eq_if
2872 mono_meet ~> mono_inf
2873 mono_join ~> mono_sup
2874 meet_bool_eq ~> inf_bool_eq
2875 join_bool_eq ~> sup_bool_eq
2876 meet_fun_eq ~> inf_fun_eq
2877 join_fun_eq ~> sup_fun_eq
2878 meet_set_eq ~> inf_set_eq
2879 join_set_eq ~> sup_set_eq
2880 meet1_iff ~> inf1_iff
2881 meet2_iff ~> inf2_iff
2890 join1_iff ~> sup1_iff
2891 join2_iff ~> sup2_iff
2901 is_meet_Meet ~> is_meet_Inf
2902 Meet_bool_def ~> Inf_bool_def
2903 Meet_fun_def ~> Inf_fun_def
2904 Meet_greatest ~> Inf_greatest
2905 Meet_lower ~> Inf_lower
2906 Meet_set_def ~> Inf_set_def
2909 Sup_bool_eq ~> Sup_bool_def
2910 Sup_fun_eq ~> Sup_fun_def
2911 Sup_set_eq ~> Sup_set_def
2913 listsp_meetI ~> listsp_infI
2914 listsp_meet_eq ~> listsp_inf_eq
2919 * Added syntactic class "size"; overloaded constant "size" now has
2920 type "'a::size ==> bool"
2922 * Internal reorganisation of `size' of datatypes: size theorems
2923 "foo.size" are no longer subsumed by "foo.simps" (but are still
2924 simplification rules by default!); theorems "prod.size" now named
2927 * Class "div" now inherits from class "times" rather than "type".
2930 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2931 Linorder etc. have disappeared; operations defined in terms of
2932 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2934 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2936 * HOL-Word: New extensive library and type for generic, fixed size
2937 machine words, with arithemtic, bit-wise, shifting and rotating
2938 operations, reflection into int, nat, and bool lists, automation for
2939 linear arithmetic (by automatic reflection into nat or int), including
2940 lemmas on overflow and monotonicity. Instantiated to all appropriate
2941 arithmetic type classes, supporting automatic simplification of
2942 numerals on all operations.
2944 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2946 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2948 * Code generator library theories:
2949 - Code_Integer represents HOL integers by big integer literals in target
2951 - Code_Char represents HOL characters by character literals in target
2953 - Code_Char_chr like Code_Char, but also offers treatment of character
2954 codes; includes Code_Integer.
2955 - Executable_Set allows to generate code for finite sets using lists.
2956 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2958 - Executable_Real implements a subset of real numbers, namly those
2959 representable by rational numbers.
2960 - Efficient_Nat implements natural numbers by integers, which in general will
2961 result in higher efficency; pattern matching with 0/Suc is eliminated;
2962 includes Code_Integer.
2963 - Code_Index provides an additional datatype index which is mapped to
2964 target-language built-in integers.
2965 - Code_Message provides an additional datatype message_string which is isomorphic to
2966 strings; messages are mapped to target-language strings.
2968 * New package for inductive predicates
2970 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2973 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2974 for z_1 :: U_1 and ... and z_n :: U_m
2976 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2979 with full support for type-inference, rather than
2981 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2983 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2984 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2986 inductive "s z_1 ... z_m"
2988 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2991 For backward compatibility, there is a wrapper allowing inductive
2992 sets to be defined with the new package via
2995 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2996 for z_1 :: U_1 and ... and z_n :: U_m
2998 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
3004 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
3005 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
3006 for z_1 :: U_1 and ... and z_n :: U_m
3008 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
3009 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
3012 if the additional syntax "p ..." is required.
3014 Numerous examples can be found in the subdirectories src/HOL/Auth,
3015 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
3019 - Since declaration and definition of inductive sets or predicates
3020 is no longer separated, abbreviations involving the newly
3021 introduced sets or predicates must be specified together with the
3022 introduction rules after the 'where' keyword (see above), rather
3023 than before the actual inductive definition.
3025 - The variables in induction and elimination rules are now
3026 quantified in the order of their occurrence in the introduction
3027 rules, rather than in alphabetical order. Since this may break
3028 some proofs, these proofs either have to be repaired, e.g. by
3029 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
3030 statements of the form
3032 case (rule_i a_i_1 ... a_i_{k_i})
3034 or the old order of quantification has to be restored by explicitly adding
3035 meta-level quantifiers in the introduction rules, i.e.
3037 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
3039 - The format of the elimination rules is now
3041 p z_1 ... z_m x_1 ... x_n ==>
3042 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3047 (x_1, ..., x_n) : s z_1 ... z_m ==>
3048 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
3051 for sets rather than
3053 x : s z_1 ... z_m ==>
3054 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
3057 This may require terms in goals to be expanded to n-tuples
3058 (e.g. using case_tac or simplification with the split_paired_all
3059 rule) before the above elimination rule is applicable.
3061 - The elimination or case analysis rules for (mutually) inductive
3062 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
3063 list of rules "p_1_..._p_k.elims" is no longer available.
3065 * New package "function"/"fun" for general recursive functions,
3066 supporting mutual and nested recursion, definitions in local contexts,
3067 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
3068 for small examples, and the separate tutorial on the function
3069 package. The old recdef "package" is still available as before, but
3070 users are encouraged to use the new package.
3072 * Method "lexicographic_order" automatically synthesizes termination
3073 relations as lexicographic combinations of size measures.
3075 * Case-expressions allow arbitrary constructor-patterns (including
3076 "_") and take their order into account, like in functional
3077 programming. Internally, this is translated into nested
3078 case-expressions; missing cases are added and mapped to the predefined
3079 constant "undefined". In complicated cases printing may no longer show
3080 the original input but the internal form. Lambda-abstractions allow
3081 the same form of pattern matching: "% pat1 => e1 | ..." is an
3082 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3085 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3086 is an abbreviation for "of_nat :: nat => int". The simplification
3087 rules for "of_nat" have been changed to work like "int" did
3088 previously. Potential INCOMPATIBILITY:
3089 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3090 - of_nat_diff and of_nat_mult are no longer default simp rules
3092 * Method "algebra" solves polynomial equations over (semi)rings using
3093 Groebner bases. The (semi)ring structure is defined by locales and the
3094 tool setup depends on that generic context. Installing the method for
3095 a specific type involves instantiating the locale and possibly adding
3096 declarations for computation on the coefficients. The method is
3097 already instantiated for natural numbers and for the axiomatic class
3098 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3099 CALCULEMUS 2007 for the general principles underlying this
3100 architecture of context-aware proof-tools.
3102 * Method "ferrack" implements quantifier elimination over
3103 special-purpose dense linear orders using locales (analogous to
3104 "algebra"). The method is already installed for class
3105 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3108 * Former constant "List.op @" now named "List.append". Use ML
3109 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3110 circumvent possible incompatibilities when working on ML level.
3112 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3114 * New function listsum :: 'a list => 'a for arbitrary monoids.
3115 Special syntax: "SUM x <- xs. f x" (and latex variants)
3117 * New syntax for Haskell-like list comprehension (input only), eg.
3118 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3120 * The special syntax for function "filter" has changed from [x :
3121 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3122 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3124 * [a..b] is now defined for arbitrary linear orders. It used to be
3125 defined on nat only, as an abbreviation for [a..<Suc b]
3128 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3130 * New functions "sorted" and "sort" in src/HOL/List.thy.
3132 * New lemma collection field_simps (an extension of ring_simps) for
3133 manipulating (in)equations involving division. Multiplies with all
3134 denominators that can be proved to be non-zero (in equations) or
3135 positive/negative (in inequations).
3137 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3138 have been improved and renamed to ring_simps, group_simps and
3139 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3140 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3142 * Theory Library/Commutative_Ring: switched from recdef to function
3143 package; constants add, mul, pow now curried. Infix syntax for
3144 algebraic operations.
3146 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3149 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3152 * HOL/records: generalised field-update to take a function on the
3153 field rather than the new value: r(|A := x|) is translated to A_update
3154 (K x) r The K-combinator that is internally used is called K_record.
3155 INCOMPATIBILITY: Usage of the plain update functions has to be
3158 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3159 * x = 0, which are required for a semiring. Richer structures do not
3160 inherit from semiring_0 anymore, because this property is a theorem
3161 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3162 there is more to prove, but this is mostly trivial.
3164 * Class "recpower" is generalized to arbitrary monoids, not just
3165 commutative semirings. INCOMPATIBILITY: may need to incorporate
3166 commutativity or semiring properties additionally.
3168 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3169 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3170 better use 'abbreviation'.
3172 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3174 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3175 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3176 significant changes for setting up numeral syntax for types:
3177 - New constants Numeral.pred and Numeral.succ instead
3178 of former Numeral.bin_pred and Numeral.bin_succ.
3179 - Use integer operations instead of bin_add, bin_mult and so on.
3180 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3181 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3183 See src/HOL/Integ/IntArith.thy for an example setup.
3185 * Command 'normal_form' computes the normal form of a term that may
3186 contain free variables. For example ``normal_form "rev [a, b, c]"''
3187 produces ``[b, c, a]'' (without proof). This command is suitable for
3188 heavy-duty computations because the functions are compiled to ML
3189 first. Correspondingly, a method "normalization" is provided. See
3190 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3192 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3193 25 like -->); output depends on the "iff" print_mode, the default is
3194 "A = B" (with priority 50).
3196 * Relations less (<) and less_eq (<=) are also available on type bool.
3197 Modified syntax to disallow nesting without explicit parentheses,
3198 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3201 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3203 * Relation composition operator "op O" now has precedence 75 and binds
3204 stronger than union and intersection. INCOMPATIBILITY.
3206 * The old set interval syntax "{m..n(}" (and relatives) has been
3207 removed. Use "{m..<n}" (and relatives) instead.
3209 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3210 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3211 ``declare [[simproc del: neq]]''.
3213 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3216 * Theorem Cons_eq_map_conv no longer declared as "simp".
3218 * Theorem setsum_mult renamed to setsum_right_distrib.
3220 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3223 * Reimplemented methods "sat" and "satx", with several improvements:
3224 goals no longer need to be stated as "<prems> ==> False", equivalences
3225 (i.e. "=" on type bool) are handled, variable names of the form
3226 "lit_<n>" are no longer reserved, significant speedup.
3228 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3229 zChaff is still supported as well.
3231 * 'inductive' and 'datatype': provide projections of mutual rules,
3232 bundled as foo_bar.inducts;
3234 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3237 * Library: moved theory Accessible_Part to main HOL.
3239 * Library: added theory Coinductive_List of potentially infinite lists
3240 as greatest fixed-point.
3242 * Library: added theory AssocList which implements (finite) maps as
3245 * Method "evaluation" solves goals (i.e. a boolean expression)
3246 efficiently by compiling it to ML. The goal is "proved" (via an
3247 oracle) if it evaluates to True.
3249 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3250 also when invoked by the simplifier. This results in the Simplifier
3251 being more powerful on arithmetic goals. INCOMPATIBILITY.
3252 Configuration option fast_arith_split_limit=0 recovers the old
3255 * Support for hex (0x20) and binary (0b1001) numerals.
3257 * New method: reify eqs (t), where eqs are equations for an
3258 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3259 parameter, computes a term s::'b and a list xs::'a list and proves the
3260 theorem I xs s = t. This is also known as reification or quoting. The
3261 resulting theorem is applied to the subgoal to substitute t with I xs
3262 s. If t is omitted, the subgoal itself is reified.
3264 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3265 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3266 where f is supposed to be a computable function (in the sense of code
3267 generattion). The method uses reify to compute s and xs as above then
3268 applies corr_thm and uses normalization by evaluation to "prove" f s =
3269 r and finally gets the theorem t = r, which is again applied to the
3270 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3272 * Reflection: Automatic reification now handels binding, an example is
3273 available in src/HOL/ex/ReflectionEx.thy
3275 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3276 command 'statespace' that is similar to 'record', but introduces an
3277 abstract specification based on the locale infrastructure instead of
3278 HOL types. This leads to extra flexibility in composing state spaces,
3279 in particular multiple inheritance and renaming of components.
3284 * Hyperreal: Functions root and sqrt are now defined on negative real
3285 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3286 Nonnegativity side conditions have been removed from many lemmas, so
3287 that more subgoals may now be solved by simplification; potential
3290 * Real: new type classes formalize real normed vector spaces and
3291 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3292 and norm :: 'a => real.
3294 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3295 reals into other types. The overloaded constant Reals :: 'a set is now
3296 defined as range of_real; potential INCOMPATIBILITY.
3298 * Real: proper support for ML code generation, including 'quickcheck'.
3299 Reals are implemented as arbitrary precision rationals.
3301 * Hyperreal: Several constants that previously worked only for the
3302 reals have been generalized, so they now work over arbitrary vector
3303 spaces. Type annotations may need to be added in some cases; potential
3306 Infinitesimal :: ('a::real_normed_vector) star set
3307 HFinite :: ('a::real_normed_vector) star set
3308 HInfinite :: ('a::real_normed_vector) star set
3309 approx :: ('a::real_normed_vector) star => 'a star => bool
3310 monad :: ('a::real_normed_vector) star => 'a star set
3311 galaxy :: ('a::real_normed_vector) star => 'a star set
3312 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3313 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3314 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3315 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3316 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3317 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3318 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3319 sgn :: 'a::real_normed_vector => 'a
3320 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3322 * Complex: Some complex-specific constants are now abbreviations for
3323 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3324 hnorm. Other constants have been entirely removed in favor of the
3325 polymorphic versions (INCOMPATIBILITY):
3329 HInfinite <-- CInfinite
3330 Infinitesimal <-- CInfinitesimal
3333 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3334 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3335 (ns)deriv <-- (ns)cderiv
3340 * Formalisation of ideals and the quotient construction over rings.
3342 * Order and lattice theory no longer based on records.
3345 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3346 greatest_closed. INCOMPATIBILITY.
3348 * Method algebra is now set up via an attribute. For examples see
3349 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3350 of algebraic structures.
3352 * Renamed theory CRing to Ring.
3357 * Substantial, yet incomplete support for nominal datatypes (binding
3358 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3359 src/HOL/Nominal/Examples. Prospective users should consult
3360 http://isabelle.in.tum.de/nominal/
3365 * ML basics: just one true type int, which coincides with IntInf.int
3368 * ML within Isar: antiquotations allow to embed statically-checked
3369 formal entities in the source, referring to the context available at
3370 compile-time. For example:
3372 ML {* @{sort "{zero,one}"} *}
3373 ML {* @{typ "'a => 'b"} *}
3374 ML {* @{term "%x. x"} *}
3375 ML {* @{prop "x == y"} *}
3376 ML {* @{ctyp "'a => 'b"} *}
3377 ML {* @{cterm "%x. x"} *}
3378 ML {* @{cprop "x == y"} *}
3379 ML {* @{thm asm_rl} *}
3380 ML {* @{thms asm_rl} *}
3381 ML {* @{type_name c} *}
3382 ML {* @{type_syntax c} *}
3383 ML {* @{const_name c} *}
3384 ML {* @{const_syntax c} *}
3387 ML {* @{theory Pure} *}
3388 ML {* @{theory_ref} *}
3389 ML {* @{theory_ref Pure} *}
3392 ML {* @{clasimpset} *}
3394 The same works for sources being ``used'' within an Isar context.
3396 * ML in Isar: improved error reporting; extra verbosity with
3397 ML_Context.trace enabled.
3399 * Pure/General/table.ML: the join operations now works via exceptions
3400 DUP/SAME instead of type option. This is simpler in simple cases, and
3401 admits slightly more efficient complex applications.
3403 * Pure: 'advanced' translation functions (parse_translation etc.) now
3404 use Context.generic instead of just theory.
3406 * Pure: datatype Context.generic joins theory/Proof.context and
3407 provides some facilities for code that works in either kind of
3408 context, notably GenericDataFun for uniform theory and proof data.
3410 * Pure: simplified internal attribute type, which is now always
3411 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3412 local (Proof.context) attributes have been discontinued, while
3413 minimizing code duplication. Thm.rule_attribute and
3414 Thm.declaration_attribute build canonical attributes; see also structure
3415 Context for further operations on Context.generic, notably
3416 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3417 declarations and definitions.
3419 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3420 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3421 init only required for impure data. INCOMPATIBILITY: empty really need
3422 to be empty (no dependencies on theory content!)
3424 * Pure/kernel: consts certification ignores sort constraints given in
3425 signature declarations. (This information is not relevant to the
3426 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3427 potential INCOMPATIBILITY.
3429 * Pure: axiomatic type classes are now purely definitional, with
3430 explicit proofs of class axioms and super class relations performed
3431 internally. See Pure/axclass.ML for the main internal interfaces --
3432 notably AxClass.define_class supercedes AxClass.add_axclass, and
3433 AxClass.axiomatize_class/classrel/arity supersede
3434 Sign.add_classes/classrel/arities.
3436 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3437 global/local versions on theory vs. Proof.context have been
3438 discontinued; Attrib.syntax and Method.syntax have been adapted
3439 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3440 attributes, methods, etc.
3442 * Pure: several functions of signature "... -> theory -> theory * ..."
3443 have been reoriented to "... -> theory -> ... * theory" in order to
3444 allow natural usage in combination with the ||>, ||>>, |-> and
3445 fold_map combinators.
3447 * Pure: official theorem names (closed derivations) and additional
3448 comments (tags) are now strictly separate. Name hints -- which are
3449 maintained as tags -- may be attached any time without affecting the
3452 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3453 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3454 achieve the old behaviour.
3456 * Pure: the "Goal" constant is now called "prop", supporting a
3457 slightly more general idea of ``protecting'' meta-level rule
3460 * Pure: Logic.(un)varify only works in a global context, which is now
3461 enforced instead of silently assumed. INCOMPATIBILITY, may use
3462 Logic.legacy_(un)varify as temporary workaround.
3464 * Pure: structure Name provides scalable operations for generating
3465 internal variable names, notably Name.variants etc. This replaces
3466 some popular functions from term.ML:
3468 Term.variant -> Name.variant
3469 Term.variantlist -> Name.variant_list
3470 Term.invent_names -> Name.invent_list
3472 Note that low-level renaming rarely occurs in new code -- operations
3473 from structure Variable are used instead (see below).
3475 * Pure: structure Variable provides fundamental operations for proper
3476 treatment of fixed/schematic variables in a context. For example,
3477 Variable.import introduces fixes for schematics of given facts and
3478 Variable.export reverses the effect (up to renaming) -- this replaces
3479 various freeze_thaw operations.
3481 * Pure: structure Goal provides simple interfaces for
3482 init/conclude/finish and tactical prove operations (replacing former
3483 Tactic.prove). Goal.prove is the canonical way to prove results
3484 within a given context; Goal.prove_global is a degraded version for
3485 theory level goals, including a global Drule.standard. Note that
3486 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3487 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3488 in a locale context).
3490 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3491 and type checking (Syntax.check_term etc.), with common combinations
3492 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3493 which are considered legacy and await removal.
3495 * Pure/Syntax: generic interfaces for type unchecking
3496 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3497 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3498 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3499 available for convenience, but refer to the very same operations using
3500 a mere theory instead of a full context.
3502 * Isar: simplified treatment of user-level errors, using exception
3503 ERROR of string uniformly. Function error now merely raises ERROR,
3504 without any side effect on output channels. The Isar toplevel takes
3505 care of proper display of ERROR exceptions. ML code may use plain
3506 handle/can/try; cat_error may be used to concatenate errors like this:
3508 ... handle ERROR msg => cat_error msg "..."
3510 Toplevel ML code (run directly or through the Isar toplevel) may be
3511 embedded into the Isar toplevel with exception display/debug like
3514 Isar.toplevel (fn () => ...)
3516 INCOMPATIBILITY, removed special transform_error facilities, removed
3517 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3518 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3519 -- use plain ERROR instead.
3521 * Isar: theory setup now has type (theory -> theory), instead of a
3522 list. INCOMPATIBILITY, may use #> to compose setup functions.
3524 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3525 ProofContext.debug/verbose flags.
3527 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3528 theory before entering a proof state. Transactions now always see a
3529 quasi-functional intermediate checkpoint, both in interactive and
3532 * Isar: simplified interfaces for outer syntax. Renamed
3533 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3534 OuterSyntax.add_parsers -- this functionality is now included in
3535 OuterSyntax.command etc. INCOMPATIBILITY.
3537 * Simplifier: the simpset of a running simplification process now
3538 contains a proof context (cf. Simplifier.the_context), which is the
3539 very context that the initial simpset has been retrieved from (by
3540 simpset_of/local_simpset_of). Consequently, all plug-in components
3541 (solver, looper etc.) may depend on arbitrary proof data.
3543 * Simplifier.inherit_context inherits the proof context (plus the
3544 local bounds) of the current simplification process; any simproc
3545 etc. that calls the Simplifier recursively should do this! Removed
3546 former Simplifier.inherit_bounds, which is already included here --
3547 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3548 specify an explicit context using Simplifier.context/theory_context.
3550 * Simplifier/Classical Reasoner: more abstract interfaces
3551 change_simpset/claset for modifying the simpset/claset reference of a
3552 theory; raw versions simpset/claset_ref etc. have been discontinued --
3555 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3561 * settings: the default heap location within ISABELLE_HOME_USER now
3562 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3563 Isabelle installations.
3565 * isabelle-process: option -S (secure mode) disables some critical
3566 operations, notably runtime compilation and evaluation of ML source
3569 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3571 * Support for parallel execution, using native multicore support of
3572 Poly/ML 5.1. The theory loader exploits parallelism when processing
3573 independent theories, according to the given theory header
3574 specifications. The maximum number of worker threads is specified via
3575 usedir option -M or the "max-threads" setting in Proof General. A
3576 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3577 to 6 on a 8-core machine. User-code needs to observe certain
3578 guidelines for thread-safe programming, see appendix A in the Isar
3579 Implementation manual.
3583 New in Isabelle2005 (October 2005)
3584 ----------------------------------
3588 * Theory headers: the new header syntax for Isar theories is
3591 imports <theory1> ... <theoryN>
3592 uses <file1> ... <fileM>
3595 where the 'uses' part is optional. The previous syntax
3597 theory <name> = <theory1> + ... + <theoryN>:
3599 will disappear in the next release. Use isatool fixheaders to convert
3600 existing theory files. Note that there is no change in ancient
3601 non-Isar theories now, but these will disappear soon.
3603 * Theory loader: parent theories can now also be referred to via
3604 relative and absolute paths.
3606 * Command 'find_theorems' searches for a list of criteria instead of a
3607 list of constants. Known criteria are: intro, elim, dest, name:string,
3608 simp:term, and any term. Criteria can be preceded by '-' to select
3609 theorems that do not match. Intro, elim, dest select theorems that
3610 match the current goal, name:s selects theorems whose fully qualified
3611 name contain s, and simp:term selects all simplification rules whose
3612 lhs match term. Any other term is interpreted as pattern and selects
3613 all theorems matching the pattern. Available in ProofGeneral under
3614 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3616 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3618 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3619 matching the current goal as introduction rule and not having "HOL."
3620 in their name (i.e. not being defined in theory HOL).
3622 * Command 'thms_containing' has been discontinued in favour of
3623 'find_theorems'; INCOMPATIBILITY.
3625 * Communication with Proof General is now 8bit clean, which means that
3626 Unicode text in UTF-8 encoding may be used within theory texts (both
3627 formal and informal parts). Cf. option -U of the Isabelle Proof
3628 General interface. Here are some simple examples (cf. src/HOL/ex):
3630 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3631 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3633 * Improved efficiency of the Simplifier and, to a lesser degree, the
3634 Classical Reasoner. Typical big applications run around 2 times
3638 *** Document preparation ***
3640 * Commands 'display_drafts' and 'print_drafts' perform simple output
3641 of raw sources. Only those symbols that do not require additional
3642 LaTeX packages (depending on comments in isabellesym.sty) are
3643 displayed properly, everything else is left verbatim. isatool display
3644 and isatool print are used as front ends (these are subject to the
3645 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3647 * Command tags control specific markup of certain regions of text,
3648 notably folding and hiding. Predefined tags include "theory" (for
3649 theory begin and end), "proof" for proof commands, and "ML" for
3650 commands involving ML code; the additional tags "visible" and
3651 "invisible" are unused by default. Users may give explicit tag
3652 specifications in the text, e.g. ''by %invisible (auto)''. The
3653 interpretation of tags is determined by the LaTeX job during document
3654 preparation: see option -V of isatool usedir, or options -n and -t of
3655 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3658 Several document versions may be produced at the same time via isatool
3659 usedir (the generated index.html will link all of them). Typical
3660 specifications include ''-V document=theory,proof,ML'' to present
3661 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3662 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3663 these parts without any formal replacement text. The Isabelle site
3664 default settings produce ''document'' and ''outline'' versions as
3667 * Several new antiquotations:
3669 @{term_type term} prints a term with its type annotated;
3671 @{typeof term} prints the type of a term;
3673 @{const const} is the same as @{term const}, but checks that the
3674 argument is a known logical constant;
3676 @{term_style style term} and @{thm_style style thm} print a term or
3677 theorem applying a "style" to it
3681 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3682 definitions, equations, inequations etc., 'concl' printing only the
3683 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3684 to print the specified premise. TermStyle.add_style provides an ML
3685 interface for introducing further styles. See also the "LaTeX Sugar"
3686 document practical applications. The ML antiquotation prints
3687 type-checked ML expressions verbatim.
3689 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3690 and 'text' support optional locale specification '(in loc)', which
3691 specifies the default context for interpreting antiquotations. For
3692 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3694 * Option 'locale=NAME' of antiquotations specifies an alternative
3695 context interpreting the subsequent argument. For example: @{thm
3696 [locale=lattice] inf_assoc}.
3698 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3701 * Proper output of antiquotations for theory commands involving a
3702 proof context (such as 'locale' or 'theorem (in loc) ...').
3704 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3705 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3707 * isatool usedir: new option -C (default true) controls whether option
3708 -D should include a copy of the original document directory; -C false
3709 prevents unwanted effects such as copying of administrative CVS data.
3714 * Considerably improved version of 'constdefs' command. Now performs
3715 automatic type-inference of declared constants; additional support for
3716 local structure declarations (cf. locales and HOL records), see also
3717 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3718 sequential dependencies of definitions within a single 'constdefs'
3719 section; moreover, the declared name needs to be an identifier. If
3720 all fails, consider to fall back on 'consts' and 'defs' separately.
3722 * Improved indexed syntax and implicit structures. First of all,
3723 indexed syntax provides a notational device for subscripted
3724 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3725 expressions. Secondly, in a local context with structure
3726 declarations, number indexes \<^sub>n or the empty index (default
3727 number 1) refer to a certain fixed variable implicitly; option
3728 show_structs controls printing of implicit structures. Typical
3729 applications of these concepts involve record types and locales.
3731 * New command 'no_syntax' removes grammar declarations (and
3732 translations) resulting from the given syntax specification, which is
3733 interpreted in the same manner as for the 'syntax' command.
3735 * 'Advanced' translation functions (parse_translation etc.) may depend
3736 on the signature of the theory context being presently used for
3737 parsing/printing, see also isar-ref manual.
3739 * Improved 'oracle' command provides a type-safe interface to turn an
3740 ML expression of type theory -> T -> term into a primitive rule of
3741 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3742 is already included here); see also FOL/ex/IffExample.thy;
3745 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3746 before); "cI" is no longer bound, use "c.intro" instead.
3747 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3748 axclasses vs. locales.
3750 * Improved internal renaming of symbolic identifiers -- attach primes
3751 instead of base 26 numbers.
3753 * New flag show_question_marks controls printing of leading question
3754 marks in schematic variable names.
3756 * In schematic variable names, *any* symbol following \<^isub> or
3757 \<^isup> is now treated as part of the base name. For example, the
3758 following works without printing of awkward ".0" indexes:
3760 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3763 * Inner syntax includes (*(*nested*) comments*).
3765 * Pretty printer now supports unbreakable blocks, specified in mixfix
3766 annotations as "(00...)".
3768 * Clear separation of logical types and nonterminals, where the latter
3769 may only occur in 'syntax' specifications or type abbreviations.
3770 Before that distinction was only partially implemented via type class
3771 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3772 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3773 exotic syntax specifications may require further adaption
3774 (e.g. Cube/Cube.thy).
3776 * Removed obsolete type class "logic", use the top sort {} instead.
3777 Note that non-logical types should be declared as 'nonterminals'
3778 rather than 'types'. INCOMPATIBILITY for new object-logic
3781 * Attributes 'induct' and 'cases': type or set names may now be
3782 locally fixed variables as well.
3784 * Simplifier: can now control the depth to which conditional rewriting
3785 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3788 * Simplifier: simplification procedures may now take the current
3789 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3790 interface), which is very useful for calling the Simplifier
3791 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3792 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3793 low-level mk_simproc no longer applies Logic.varify internally, to
3794 allow for use in a context of fixed variables.
3796 * thin_tac now works even if the assumption being deleted contains !!
3797 or ==>. More generally, erule now works even if the major premise of
3798 the elimination rule contains !! or ==>.
3800 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3802 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3803 from Pure, which contains all common declarations already. Both
3804 theories are defined via plain Isabelle/Isar .thy files.
3805 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3806 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3807 use isatool fixcpure to adapt your theory and ML sources.
3809 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3810 selections of theorems in named facts via index ranges.
3812 * 'print_theorems': in theory mode, really print the difference
3813 wrt. the last state (works for interactive theory development only),
3814 in proof mode print all local facts (cf. 'print_facts');
3816 * 'hide': option '(open)' hides only base names.
3818 * More efficient treatment of intermediate checkpoints in interactive
3821 * Code generator is now invoked via code_module (incremental code
3822 generation) and code_library (modular code generation, ML structures
3823 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3824 must be quoted when used as identifiers.
3826 * New 'value' command for reading, evaluating and printing terms using
3827 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3828 quoted when used as identifier.
3833 * New commands for the interpretation of locale expressions in
3834 theories (1), locales (2) and proof contexts (3). These generate
3835 proof obligations from the expression specification. After the
3836 obligations have been discharged, theorems of the expression are added
3837 to the theory, target locale or proof context. The synopsis of the
3838 commands is a follows:
3840 (1) interpretation expr inst
3841 (2) interpretation target < expr
3842 (3) interpret expr inst
3844 Interpretation in theories and proof contexts require a parameter
3845 instantiation of terms from the current context. This is applied to
3846 specifications and theorems of the interpreted expression.
3847 Interpretation in locales only permits parameter renaming through the
3848 locale expression. Interpretation is smart in that interpretations
3849 that are active already do not occur in proof obligations, neither are
3850 instantiated theorems stored in duplicate. Use 'print_interps' to
3851 inspect active interpretations of a particular locale. For details,
3852 see the Isar Reference manual. Examples can be found in
3853 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3855 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3856 'interpret' instead.
3858 * New context element 'constrains' for adding type constraints to
3861 * Context expressions: renaming of parameters with syntax
3864 * Locale declaration: 'includes' disallowed.
3866 * Proper static binding of attribute syntax -- i.e. types / terms /
3867 facts mentioned as arguments are always those of the locale definition
3868 context, independently of the context of later invocations. Moreover,
3869 locale operations (renaming and type / term instantiation) are applied
3870 to attribute arguments as expected.
3872 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3873 actual attributes; rare situations may require Attrib.attribute to
3874 embed those attributes into Attrib.src that lack concrete syntax.
3875 Attribute implementations need to cooperate properly with the static
3876 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3877 Attrib.XXX_thm etc. already do the right thing without further
3878 intervention. Only unusual applications -- such as "where" or "of"
3879 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3880 on the context and the facts involved -- may have to assign parsed
3881 values to argument tokens explicitly.
3883 * Changed parameter management in theorem generation for long goal
3884 statements with 'includes'. INCOMPATIBILITY: produces a different
3885 theorem statement in rare situations.
3887 * Locale inspection command 'print_locale' omits notes elements. Use
3888 'print_locale!' to have them included in the output.
3893 * Provers/hypsubst.ML: improved version of the subst method, for
3894 single-step rewriting: it now works in bound variable contexts. New is
3895 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3896 rewrite a different subterm than the original subst method, which is
3897 still available as 'simplesubst'.
3899 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3902 * Provers/trancl.ML: new transitivity reasoner for transitive and
3903 reflexive-transitive closure of relations.
3905 * Provers/blast.ML: new reference depth_limit to make blast's depth
3906 limit (previously hard-coded with a value of 20) user-definable.
3908 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3909 is peformed already. Object-logics merely need to finish their
3910 initial simpset configuration as before. INCOMPATIBILITY.
3915 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3918 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3920 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3921 and x-symbol; use option '-m epsilon' to get it actually printed.
3922 Moreover, the mathematically important symbolic identifier \<epsilon>
3923 becomes available as variable, constant etc. INCOMPATIBILITY,
3925 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3926 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3927 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3928 support corresponding Isar calculations.
3930 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3933 * theory SetInterval: changed the syntax for open intervals:
3942 The old syntax is still supported but will disappear in the next
3943 release. For conversion use the following Emacs search and replace
3944 patterns (these are not perfect but work quite well):
3946 {)\([^\.]*\)\.\. -> {\1<\.\.}
3947 \.\.\([^(}]*\)(} -> \.\.<\1}
3949 * Theory Commutative_Ring (in Library): method comm_ring for proving
3950 equalities in commutative rings; method 'algebra' provides a generic
3953 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3954 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3955 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3958 Some new syntax forms are available:
3960 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3961 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3962 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3963 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3965 The latter form "\<Sum>x < k. e" used to be based on a separate
3966 function "Summation", which has been discontinued.
3968 * theory Finite_Set: in structured induction proofs, the insert case
3969 is now 'case (insert x F)' instead of the old counterintuitive 'case
3972 * The 'refute' command has been extended to support a much larger
3973 fragment of HOL, including axiomatic type classes, constdefs and
3974 typedefs, inductive datatypes and recursion.
3976 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3977 Requires zChaff with proof generation to be installed. See
3978 HOL/ex/SAT_Examples.thy for examples.
3980 * Datatype induction via method 'induct' now preserves the name of the
3981 induction variable. For example, when proving P(xs::'a list) by
3982 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3983 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3984 in unstructured proof scripts.
3986 * Reworked implementation of records. Improved scalability for
3987 records with many fields, avoiding performance problems for type
3988 inference. Records are no longer composed of nested field types, but
3989 of nested extension types. Therefore the record type only grows linear
3990 in the number of extensions and not in the number of fields. The
3991 top-level (users) view on records is preserved. Potential
3992 INCOMPATIBILITY only in strange cases, where the theory depends on the
3993 old record representation. The type generated for a record is called
3994 <record_name>_ext_type.
3996 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3997 proofs triggered by a record definition or a simproc (if
3998 quick_and_dirty is enabled). Definitions of large records can take
4001 New simproc record_upd_simproc for simplification of multiple record
4002 updates enabled by default. Moreover, trivial updates are also
4003 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
4004 occasionally, since simplification is more powerful by default.
4006 * typedef: proper support for polymorphic sets, which contain extra
4007 type-variables in the term.
4009 * Simplifier: automatically reasons about transitivity chains
4010 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
4011 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
4012 old proofs break occasionally as simplification may now solve more
4013 goals than previously.
4015 * Simplifier: converts x <= y into x = y if assumption y <= x is
4016 present. Works for all partial orders (class "order"), in particular
4017 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
4020 * Simplifier: new simproc for "let x = a in f x". If a is a free or
4021 bound variable or a constant then the let is unfolded. Otherwise
4022 first a is simplified to b, and then f b is simplified to g. If
4023 possible we abstract b from g arriving at "let x = b in h x",
4024 otherwise we unfold the let and arrive at g. The simproc can be
4025 enabled/disabled by the reference use_let_simproc. Potential
4026 INCOMPATIBILITY since simplification is more powerful by default.
4028 * Classical reasoning: the meson method now accepts theorems as arguments.
4030 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
4031 jobs to provide advice on the provability of subgoals.
4033 * Theory OrderedGroup and Ring_and_Field: various additions and
4034 improvements to faciliate calculations involving equalities and
4037 The following theorems have been eliminated or modified
4040 abs_eq now named abs_of_nonneg
4041 abs_of_ge_0 now named abs_of_nonneg
4042 abs_minus_eq now named abs_of_nonpos
4043 imp_abs_id now named abs_of_nonneg
4044 imp_abs_neg_id now named abs_of_nonpos
4045 mult_pos now named mult_pos_pos
4046 mult_pos_le now named mult_nonneg_nonneg
4047 mult_pos_neg_le now named mult_nonneg_nonpos
4048 mult_pos_neg2_le now named mult_nonneg_nonpos2
4049 mult_neg now named mult_neg_neg
4050 mult_neg_le now named mult_nonpos_nonpos
4052 * The following lemmas in Ring_and_Field have been added to the simplifier:
4055 not_square_less_zero
4057 The following lemmas have been deleted from Real/RealPow:
4067 * Theory Parity: added rules for simplifying exponents.
4071 The following theorems have been eliminated or modified
4074 list_all_Nil now named list_all.simps(1)
4075 list_all_Cons now named list_all.simps(2)
4076 list_all_conv now named list_all_iff
4077 set_mem_eq now named mem_iff
4079 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4080 asymptotic "big O" calculations. See the notes in BigO.thy.
4085 * Theory RealDef: better support for embedding natural numbers and
4086 integers in the reals.
4088 The following theorems have been eliminated or modified
4091 exp_ge_add_one_self now requires no hypotheses
4092 real_of_int_add reversed direction of equality (use [symmetric])
4093 real_of_int_minus reversed direction of equality (use [symmetric])
4094 real_of_int_diff reversed direction of equality (use [symmetric])
4095 real_of_int_mult reversed direction of equality (use [symmetric])
4097 * Theory RComplete: expanded support for floor and ceiling functions.
4099 * Theory Ln is new, with properties of the natural logarithm
4101 * Hyperreal: There is a new type constructor "star" for making
4102 nonstandard types. The old type names are now type synonyms:
4106 hcomplex = complex star
4108 * Hyperreal: Many groups of similarly-defined constants have been
4109 replaced by polymorphic versions (INCOMPATIBILITY):
4111 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4113 starset <-- starsetNat, starsetC
4114 *s* <-- *sNat*, *sc*
4115 starset_n <-- starsetNat_n, starsetC_n
4116 *sn* <-- *sNatn*, *scn*
4117 InternalSets <-- InternalNatSets, InternalCSets
4119 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4120 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4121 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4122 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4123 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4125 * Hyperreal: Many type-specific theorems have been removed in favor of
4126 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4128 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4129 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4130 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4131 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4132 right_minus <-- hypreal_add_minus
4133 left_minus <-- {hypreal,hcomplex}_add_minus_left
4134 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4135 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4136 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4137 mult_1_right <-- hcomplex_mult_one_right
4138 mult_zero_left <-- hcomplex_mult_zero_left
4139 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4140 right_distrib <-- hypnat_add_mult_distrib2
4141 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4142 right_inverse <-- hypreal_mult_inverse
4143 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4144 order_refl <-- {hypreal,hypnat}_le_refl
4145 order_trans <-- {hypreal,hypnat}_le_trans
4146 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4147 order_less_le <-- {hypreal,hypnat}_less_le
4148 linorder_linear <-- {hypreal,hypnat}_le_linear
4149 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4150 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4151 add_nonneg_nonneg <-- hypreal_le_add_order
4153 * Hyperreal: Separate theorems having to do with type-specific
4154 versions of constants have been merged into theorems that apply to the
4155 new polymorphic constants (INCOMPATIBILITY):
4157 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4158 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4159 STAR_Un <-- {STAR,NatStar,STARC}_Un
4160 STAR_Int <-- {STAR,NatStar,STARC}_Int
4161 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4162 STAR_subset <-- {STAR,NatStar,STARC}_subset
4163 STAR_mem <-- {STAR,NatStar,STARC}_mem
4164 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4165 STAR_diff <-- {STAR,STARC}_diff
4166 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4167 STARC_hcomplex_of_complex}_image_subset
4168 starset_n_Un <-- starset{Nat,C}_n_Un
4169 starset_n_Int <-- starset{Nat,C}_n_Int
4170 starset_n_Compl <-- starset{Nat,C}_n_Compl
4171 starset_n_diff <-- starset{Nat,C}_n_diff
4172 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4173 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4174 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4175 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4176 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4177 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4178 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4179 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4180 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4181 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4182 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4183 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4184 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4185 starfun_diff <-- starfun{C,RC,CR}_diff
4186 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4187 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4188 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4189 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4190 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4191 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4192 starfun_Id <-- starfunC_Id
4193 starfun_approx <-- starfun{Nat,CR}_approx
4194 starfun_capprox <-- starfun{C,RC}_capprox
4195 starfun_abs <-- starfunNat_rabs
4196 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4197 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4198 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4199 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4200 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4201 starfun_add_approx <-- starfunCR_add_approx
4202 starfun_inverse_inverse <-- starfunC_inverse_inverse
4203 starfun_divide <-- starfun{C,CR,RC}_divide
4204 starfun_n <-- starfun{Nat,C}_n
4205 starfun_n_mult <-- starfun{Nat,C}_n_mult
4206 starfun_n_add <-- starfun{Nat,C}_n_add
4207 starfun_n_add_minus <-- starfunNat_n_add_minus
4208 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4209 starfun_n_minus <-- starfun{Nat,C}_n_minus
4210 starfun_n_eq <-- starfun{Nat,C}_n_eq
4212 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4213 star_n_minus <-- {hypreal,hcomplex}_minus
4214 star_n_diff <-- {hypreal,hcomplex}_diff
4215 star_n_mult <-- {hypreal,hcomplex}_mult
4216 star_n_inverse <-- {hypreal,hcomplex}_inverse
4217 star_n_le <-- {hypreal,hypnat}_le
4218 star_n_less <-- {hypreal,hypnat}_less
4219 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4220 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4221 star_n_abs <-- hypreal_hrabs
4222 star_n_divide <-- hcomplex_divide
4224 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4225 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4226 star_of_diff <-- hypreal_of_real_diff
4227 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4228 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4229 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4230 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4231 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4232 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4233 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4234 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4235 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4236 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4237 star_of_number_of <-- {hypreal,hcomplex}_number_of
4238 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4239 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4240 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4241 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4242 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4243 star_of_power <-- hypreal_of_real_power
4244 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4246 * Hyperreal: new method "transfer" that implements the transfer
4247 principle of nonstandard analysis. With a subgoal that mentions
4248 nonstandard types like "'a star", the command "apply transfer"
4249 replaces it with an equivalent one that mentions only standard types.
4250 To be successful, all free variables must have standard types; non-
4251 standard variables must have explicit universal quantifiers.
4253 * Hyperreal: A theory of Taylor series.
4258 * Discontinued special version of 'constdefs' (which used to support
4259 continuous functions) in favor of the general Pure one with full
4262 * New simplification procedure for solving continuity conditions; it
4263 is much faster on terms with many nested lambda abstractions (cubic
4264 instead of exponential time).
4266 * New syntax for domain package: selector names are now optional.
4267 Parentheses should be omitted unless argument is lazy, for example:
4269 domain 'a stream = cons "'a" (lazy "'a stream")
4271 * New command 'fixrec' for defining recursive functions with pattern
4272 matching; defining multiple functions with mutual recursion is also
4273 supported. Patterns may include the constants cpair, spair, up, sinl,
4274 sinr, or any data constructor defined by the domain package. The given
4275 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4276 syntax and examples.
4278 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4279 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4280 but the proof obligation additionally includes an admissibility
4281 requirement. The packages generate instances of class cpo or pcpo,
4282 with continuity and strictness theorems for Rep and Abs.
4284 * HOLCF: Many theorems have been renamed according to a more standard naming
4285 scheme (INCOMPATIBILITY):
4287 foo_inject: "foo$x = foo$y ==> x = y"
4288 foo_eq: "(foo$x = foo$y) = (x = y)"
4289 foo_less: "(foo$x << foo$y) = (x << y)"
4290 foo_strict: "foo$UU = UU"
4291 foo_defined: "... ==> foo$x ~= UU"
4292 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4297 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4298 including the First Isomorphism Theorem (on quotienting by the kernel
4301 * ZF/Simplifier: install second copy of type solver that actually
4302 makes use of TC rules declared to Isar proof contexts (or locales);
4303 the old version is still required for ML proof scripts.
4308 * Converted to Isar theory format; use locales instead of axiomatic
4314 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4317 * Pure/library.ML no longer defines its own option datatype, but uses
4318 that of the SML basis, which has constructors NONE and SOME instead of
4319 None and Some, as well as exception Option.Option instead of OPTION.
4320 The functions the, if_none, is_some, is_none have been adapted
4321 accordingly, while Option.map replaces apsome.
4323 * Pure/library.ML: the exception LIST has been given up in favour of
4324 the standard exceptions Empty and Subscript, as well as
4325 Library.UnequalLengths. Function like Library.hd and Library.tl are
4326 superceded by the standard hd and tl functions etc.
4328 A number of basic list functions are no longer exported to the ML
4329 toplevel, as they are variants of predefined functions. The following
4330 suggests how one can translate existing code:
4332 rev_append xs ys = List.revAppend (xs, ys)
4333 nth_elem (i, xs) = List.nth (xs, i)
4334 last_elem xs = List.last xs
4335 flat xss = List.concat xss
4336 seq fs = List.app fs
4337 partition P xs = List.partition P xs
4338 mapfilter f xs = List.mapPartial f xs
4340 * Pure/library.ML: several combinators for linear functional
4341 transformations, notably reverse application and composition:
4344 (x, y) |-> f f #-> g
4346 * Pure/library.ML: introduced/changed precedence of infix operators:
4348 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4350 infix 3 o oo ooo oooo;
4351 infix 4 ~~ upto downto;
4353 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4356 * Pure/library.ML: natural list combinators fold, fold_rev, and
4357 fold_map support linear functional transformations and nesting. For
4360 fold f [x1, ..., xN] y =
4361 y |> f x1 |> ... |> f xN
4363 (fold o fold) f [xs1, ..., xsN] y =
4364 y |> fold f xs1 |> ... |> fold f xsN
4366 fold f [x1, ..., xN] =
4369 (fold o fold) f [xs1, ..., xsN] =
4370 fold f xs1 #> ... #> fold f xsN
4372 * Pure/library.ML: the following selectors on type 'a option are
4375 the: 'a option -> 'a (*partial*)
4376 these: 'a option -> 'a where 'a = 'b list
4377 the_default: 'a -> 'a option -> 'a
4378 the_list: 'a option -> 'a list
4380 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4381 basic operations for association lists, following natural argument
4382 order; moreover the explicit equality predicate passed here avoids
4383 potentially expensive polymorphic runtime equality checks.
4384 The old functions may be expressed as follows:
4386 assoc = uncurry (AList.lookup (op =))
4387 assocs = these oo AList.lookup (op =)
4388 overwrite = uncurry (AList.update (op =)) o swap
4390 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4392 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4393 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4395 replacing make_keylist and keyfilter (occassionally used)
4398 make_keylist = AList.make
4399 keyfilter = AList.find (op =)
4401 * eq_fst and eq_snd now take explicit equality parameter, thus
4402 avoiding eqtypes. Naive rewrites:
4404 eq_fst = eq_fst (op =)
4405 eq_snd = eq_snd (op =)
4407 * Removed deprecated apl and apr (rarely used).
4410 apl (n, op) =>>= curry op n
4411 apr (op, m) =>>= fn n => op (n, m)
4413 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4414 provides a reasonably efficient light-weight implementation of sets as
4417 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4418 few new operations; existing lookup and update are now curried to
4419 follow natural argument order (for use with fold etc.);
4420 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4422 * Pure/General: output via the Isabelle channels of
4423 writeln/warning/error etc. is now passed through Output.output, with a
4424 hook for arbitrary transformations depending on the print_mode
4425 (cf. Output.add_mode -- the first active mode that provides a output
4426 function wins). Already formatted output may be embedded into further
4427 text via Output.raw; the result of Pretty.string_of/str_of and derived
4428 functions (string_of_term/cterm/thm etc.) is already marked raw to
4429 accommodate easy composition of diagnostic messages etc. Programmers
4430 rarely need to care about Output.output or Output.raw at all, with
4431 some notable exceptions: Output.output is required when bypassing the
4432 standard channels (writeln etc.), or in token translations to produce
4433 properly formatted results; Output.raw is required when capturing
4434 already output material that will eventually be presented to the user
4435 a second time. For the default print mode, both Output.output and
4436 Output.raw have no effect.
4438 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4439 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4440 cumulative results are displayed at the end of a batch session.
4442 * Pure/General: File.sysify_path and File.quote_sysify path have been
4443 replaced by File.platform_path and File.shell_path (with appropriate
4444 hooks). This provides a clean interface for unusual systems where the
4445 internal and external process view of file names are different.
4447 * Pure: more efficient orders for basic syntactic entities: added
4448 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4449 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4450 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4451 orders now -- potential INCOMPATIBILITY for code that depends on a
4452 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4453 Library.sort_strings on result).
4455 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4456 fold_types traverse types/terms from left to right, observing natural
4457 argument order. Supercedes previous foldl_XXX versions, add_frees,
4458 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4460 * Pure: name spaces have been refined, with significant changes of the
4461 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4462 to extern(_table). The plain name entry path is superceded by a
4463 general 'naming' context, which also includes the 'policy' to produce
4464 a fully qualified name and external accesses of a fully qualified
4465 name; NameSpace.extend is superceded by context dependent
4466 Sign.declare_name. Several theory and proof context operations modify
4467 the naming context. Especially note Theory.restore_naming and
4468 ProofContext.restore_naming to get back to a sane state; note that
4469 Theory.add_path is no longer sufficient to recover from
4470 Theory.absolute_path in particular.
4472 * Pure: new flags short_names (default false) and unique_names
4473 (default true) for controlling output of qualified names. If
4474 short_names is set, names are printed unqualified. If unique_names is
4475 reset, the name prefix is reduced to the minimum required to achieve
4476 the original result when interning again, even if there is an overlap
4477 with earlier declarations.
4479 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4480 now 'extend', and 'merge' gets an additional Pretty.pp argument
4481 (useful for printing error messages). INCOMPATIBILITY.
4483 * Pure: major reorganization of the theory context. Type Sign.sg and
4484 Theory.theory are now identified, referring to the universal
4485 Context.theory (see Pure/context.ML). Actual signature and theory
4486 content is managed as theory data. The old code and interfaces were
4487 spread over many files and structures; the new arrangement introduces
4488 considerable INCOMPATIBILITY to gain more clarity:
4490 Context -- theory management operations (name, identity, inclusion,
4491 parents, ancestors, merge, etc.), plus generic theory data;
4493 Sign -- logical signature and syntax operations (declaring consts,
4494 types, etc.), plus certify/read for common entities;
4496 Theory -- logical theory operations (stating axioms, definitions,
4497 oracles), plus a copy of logical signature operations (consts,
4498 types, etc.); also a few basic management operations (Theory.copy,
4501 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4502 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4503 for convenience -- they merely return the theory.
4505 * Pure: type Type.tsig is superceded by theory in most interfaces.
4507 * Pure: the Isar proof context type is already defined early in Pure
4508 as Context.proof (note that ProofContext.context and Proof.context are
4509 aliases, where the latter is the preferred name). This enables other
4510 Isabelle components to refer to that type even before Isar is present.
4512 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4513 typeK, constK, axiomK, oracleK), but provide explicit operations for
4514 any of these kinds. For example, Sign.intern typeK is now
4515 Sign.intern_type, Theory.hide_space Sign.typeK is now
4516 Theory.hide_types. Also note that former
4517 Theory.hide_classes/types/consts are now
4518 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4519 internalize their arguments! INCOMPATIBILITY.
4521 * Pure: get_thm interface (of PureThy and ProofContext) expects
4522 datatype thmref (with constructors Name and NameSelection) instead of
4523 plain string -- INCOMPATIBILITY;
4525 * Pure: cases produced by proof methods specify options, where NONE
4526 means to remove case bindings -- INCOMPATIBILITY in
4529 * Pure: the following operations retrieve axioms or theorems from a
4530 theory node or theory hierarchy, respectively:
4532 Theory.axioms_of: theory -> (string * term) list
4533 Theory.all_axioms_of: theory -> (string * term) list
4534 PureThy.thms_of: theory -> (string * thm) list
4535 PureThy.all_thms_of: theory -> (string * thm) list
4537 * Pure: print_tac now outputs the goal through the trace channel.
4539 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4540 Reference Toplevel.debug (default false) controls detailed printing
4541 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4542 controls execution profiling -- set to 1 for time and 2 for space
4543 (both increase the runtime).
4545 * Isar session: The initial use of ROOT.ML is now always timed,
4546 i.e. the log will show the actual process times, in contrast to the
4547 elapsed wall-clock time that the outer shell wrapper produces.
4549 * Simplifier: improved handling of bound variables (nameless
4550 representation, avoid allocating new strings). Simprocs that invoke
4551 the Simplifier recursively should use Simplifier.inherit_bounds to
4552 avoid local name clashes. Failure to do so produces warnings
4553 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4554 for further details.
4556 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4557 bindings for all theorems stored within a given theory; this may help
4558 in porting non-Isar theories to Isar ones, while keeping ML proof
4559 scripts for the time being.
4561 * ML operator HTML.with_charset specifies the charset begin used for
4562 generated HTML files. For example:
4564 HTML.with_charset "utf-8" use_thy "Hebrew";
4565 HTML.with_charset "utf-8" use_thy "Chinese";
4570 * Allow symlinks to all proper Isabelle executables (Isabelle,
4571 isabelle, isatool etc.).
4573 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4574 isatool doc, isatool mkdir, display_drafts etc.).
4576 * isatool usedir: option -f allows specification of the ML file to be
4577 used by Isabelle; default is ROOT.ML.
4579 * New isatool version outputs the version identifier of the Isabelle
4580 distribution being used.
4582 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4583 (containing Boolean satisfiability problems) into Isabelle/HOL
4588 New in Isabelle2004 (April 2004)
4589 --------------------------------
4593 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4594 Replaces linorder.ML.
4596 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4597 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4598 (\<a>...\<z>), are now considered normal letters, and can therefore
4599 be used anywhere where an ASCII letter (a...zA...Z) has until
4600 now. COMPATIBILITY: This obviously changes the parsing of some
4601 terms, especially where a symbol has been used as a binder, say
4602 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4603 as an identifier. Fix it by inserting a space around former
4604 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4605 existing theory and ML files.
4607 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4609 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4610 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4611 a normal (but invisible) letter. For multiple letter subscripts repeat
4612 \<^isub> like this: x\<^isub>1\<^isub>2.
4614 * Pure: There are now sub-/superscripts that can span more than one
4615 character. Text between \<^bsub> and \<^esub> is set in subscript in
4616 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4617 superscript. The new control characters are not identifier parts.
4619 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4620 content of "..." to the latex file instead of \isacntrl... . The "..."
4621 may consist of any printable characters excluding the end bracket >.
4623 * Pure: Using new Isar command "finalconsts" (or the ML functions
4624 Theory.add_finals or Theory.add_finals_i) it is now possible to
4625 declare constants "final", which prevents their being given a definition
4626 later. It is useful for constants whose behaviour is fixed axiomatically
4627 rather than definitionally, such as the meta-logic connectives.
4629 * Pure: 'instance' now handles general arities with general sorts
4630 (i.e. intersections of classes),
4632 * Presentation: generated HTML now uses a CSS style sheet to make layout
4633 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4634 It can be changed to alter the colors/layout of generated pages.
4639 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4640 cut_tac, subgoal_tac and thin_tac:
4641 - Now understand static (Isar) contexts. As a consequence, users of Isar
4642 locales are no longer forced to write Isar proof scripts.
4643 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4645 - INCOMPATIBILITY: names of variables to be instantiated may no
4646 longer be enclosed in quotes. Instead, precede variable name with `?'.
4647 This is consistent with the instantiation attribute "where".
4649 * Attributes "where" and "of":
4650 - Now take type variables of instantiated theorem into account when reading
4651 the instantiation string. This fixes a bug that caused instantiated
4652 theorems to have too special types in some circumstances.
4653 - "where" permits explicit instantiations of type variables.
4655 * Calculation commands "moreover" and "also" no longer interfere with
4656 current facts ("this"), admitting arbitrary combinations with "then"
4660 - Goal statements involving the context element "includes" no longer
4661 generate theorems with internal delta predicates (those ending on
4662 "_axioms") in the premise.
4663 Resolve particular premise with <locale>.intro to obtain old form.
4664 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4665 specification and "includes" elements in goal statement.
4666 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4667 [intro?] and [elim?] (respectively) by default.
4668 - Experimental command for instantiation of locales in proof contexts:
4669 instantiate <label>[<attrs>]: <loc>
4670 Instantiates locale <loc> and adds all its theorems to the current context
4671 taking into account their attributes. Label and attrs are optional
4672 modifiers, like in theorem declarations. If present, names of
4673 instantiated theorems are qualified with <label>, and the attributes
4674 <attrs> are applied after any attributes these theorems might have already.
4675 If the locale has assumptions, a chained fact of the form
4676 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4677 are derived. The command does not support old-style locales declared
4678 with "locale (open)".
4679 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4681 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4687 * Proof import: new image HOL4 contains the imported library from
4688 the HOL4 system with about 2500 theorems. It is imported by
4689 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4690 can be used like any other Isabelle image. See
4691 HOL/Import/HOL/README for more information.
4694 - Much improved handling of linear and partial orders.
4695 Reasoners for linear and partial orders are set up for type classes
4696 "linorder" and "order" respectively, and are added to the default simpset
4697 as solvers. This means that the simplifier can build transitivity chains
4698 to solve goals from the assumptions.
4699 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4700 of blast or auto after simplification become unnecessary because the goal
4701 is solved by simplification already.
4703 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4704 all proved in axiomatic type classes for semirings, rings and fields.
4707 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4708 now formalized using the Ring_and_Field theory mentioned above.
4709 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4710 than before, because now they are set up once in a generic manner.
4711 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4712 Look for the general versions in Ring_and_Field (and Power if they concern
4715 * Type "rat" of the rational numbers is now available in HOL-Complex.
4718 - Record types are now by default printed with their type abbreviation
4719 instead of the list of all field types. This can be configured via
4720 the reference "print_record_type_abbr".
4721 - Simproc "record_upd_simproc" for simplification of multiple updates added
4722 (not enabled by default).
4723 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4724 EX x. x = sel r to True (not enabled by default).
4725 - Tactic "record_split_simp_tac" to split and simplify records added.
4727 * 'specification' command added, allowing for definition by
4728 specification. There is also an 'ax_specification' command that
4729 introduces the new constants axiomatically.
4731 * arith(_tac) is now able to generate counterexamples for reals as well.
4733 * HOL-Algebra: new locale "ring" for non-commutative rings.
4735 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4736 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4738 * HOL-Matrix: a first theory for matrices in HOL with an application of
4739 matrix theory to linear programming.
4741 * Unions and Intersections:
4742 The latex output syntax of UN and INT has been changed
4743 from "\Union x \in A. B" to "\Union_{x \in A} B"
4744 i.e. the index formulae has become a subscript.
4745 Similarly for "\Union x. B", and for \Inter instead of \Union.
4747 * Unions and Intersections over Intervals:
4748 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4749 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4750 like in normal math, and corresponding versions for < and for intersection.
4752 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4753 lexicographic dictonary ordering has been added as "lexord".
4755 * ML: the legacy theory structures Int and List have been removed. They had
4756 conflicted with ML Basis Library structures having the same names.
4758 * 'refute' command added to search for (finite) countermodels. Only works
4759 for a fragment of HOL. The installation of an external SAT solver is
4760 highly recommended. See "HOL/Refute.thy" for details.
4762 * 'quickcheck' command: Allows to find counterexamples by evaluating
4763 formulae under an assignment of free variables to random values.
4764 In contrast to 'refute', it can deal with inductive datatypes,
4765 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4771 * Streams now come with concatenation and are part of the HOLCF image
4775 New in Isabelle2003 (May 2003)
4776 ------------------------------
4780 * Provers/simplifier:
4782 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4783 Assumptions are now subject to complete mutual simplification,
4784 not just from left to right. The simplifier now preserves
4785 the order of assumptions.
4787 Potential INCOMPATIBILITY:
4789 -- simp sometimes diverges where the old version did
4790 not, e.g. invoking simp on the goal
4792 [| P (f x); y = x; f x = f y |] ==> Q
4794 now gives rise to the infinite reduction sequence
4796 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4798 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4801 -- Tactics combining classical reasoner and simplification (such as auto)
4802 are also affected by this change, because many of them rely on
4803 simp. They may sometimes diverge as well or yield a different numbers
4804 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4805 in case of problems. Sometimes subsequent calls to the classical
4806 reasoner will fail because a preceeding call to the simplifier too
4807 eagerly simplified the goal, e.g. deleted redundant premises.
4809 - The simplifier trace now shows the names of the applied rewrite rules
4811 - You can limit the number of recursive invocations of the simplifier
4812 during conditional rewriting (where the simplifie tries to solve the
4813 conditions before applying the rewrite rule):
4814 ML "simp_depth_limit := n"
4815 where n is an integer. Thus you can force termination where previously
4816 the simplifier would diverge.
4818 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4820 - No longer aborts on failed congruence proof. Instead, the
4821 congruence is ignored.
4823 * Pure: New generic framework for extracting programs from constructive
4824 proofs. See HOL/Extraction.thy for an example instantiation, as well
4825 as HOL/Extraction for some case studies.
4827 * Pure: The main goal of the proof state is no longer shown by default, only
4828 the subgoals. This behaviour is controlled by a new flag.
4829 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4830 (ML: Proof.show_main_goal).
4832 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4833 rules whose conclusion matches subgoal 1:
4834 PG menu: Isabelle/Isar -> Show me -> matching rules
4835 The rules are ordered by how closely they match the subgoal.
4836 In particular, rules that solve a subgoal outright are displayed first
4837 (or rather last, the way they are printed).
4838 (ML: ProofGeneral.print_intros())
4840 * Pure: New flag trace_unify_fail causes unification to print
4841 diagnostic information (PG: in trace buffer) when it fails. This is
4842 useful for figuring out why single step proofs like rule, erule or
4845 * Pure: Locale specifications now produce predicate definitions
4846 according to the body of text (covering assumptions modulo local
4847 definitions); predicate "loc_axioms" covers newly introduced text,
4848 while "loc" is cumulative wrt. all included locale expressions; the
4849 latter view is presented only on export into the global theory
4850 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4851 on the old view without predicates;
4853 * Pure: predefined locales "var" and "struct" are useful for sharing
4854 parameters (as in CASL, for example); just specify something like
4855 ``var x + var y + struct M'' as import;
4857 * Pure: improved thms_containing: proper indexing of facts instead of
4858 raw theorems; check validity of results wrt. current name space;
4859 include local facts of proof configuration (also covers active
4860 locales), cover fixed variables in index; may use "_" in term
4861 specification; an optional limit for the number of printed facts may
4862 be given (the default is 40);
4864 * Pure: disallow duplicate fact bindings within new-style theory files
4867 * Provers: improved induct method: assumptions introduced by case
4868 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4869 the goal statement); "foo" still refers to all facts collectively;
4871 * Provers: the function blast.overloaded has been removed: all constants
4872 are regarded as potentially overloaded, which improves robustness in exchange
4873 for slight decrease in efficiency;
4875 * Provers/linorder: New generic prover for transitivity reasoning over
4876 linear orders. Note: this prover is not efficient!
4878 * Isar: preview of problems to finish 'show' now produce an error
4879 rather than just a warning (in interactive mode);
4886 - Produces a counter example if it cannot prove a goal.
4887 Note that the counter example may be spurious if the goal is not a formula
4888 of quantifier-free linear arithmetic.
4889 In ProofGeneral the counter example appears in the trace buffer.
4891 - Knows about div k and mod k where k is a numeral of type nat or int.
4893 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4894 linear arithmetic fails. This takes account of quantifiers and divisibility.
4895 Presburger arithmetic can also be called explicitly via presburger(_tac).
4897 * simp's arithmetic capabilities have been enhanced a bit: it now
4898 takes ~= in premises into account (by performing a case split);
4900 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4901 are distributed over a sum of terms;
4903 * New tactic "trans_tac" and method "trans" instantiate
4904 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4907 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4908 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4910 * 'typedef' command has new option "open" to suppress the set
4913 * functions Min and Max on finite sets have been introduced (theory
4916 * attribute [symmetric] now works for relations as well; it turns
4917 (x,y) : R^-1 into (y,x) : R, and vice versa;
4919 * induct over a !!-quantified statement (say !!x1..xn):
4920 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4922 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4923 %x. None. Warning: empty_def now refers to the previously hidden definition
4926 * Algebra: formalization of classical algebra. Intended as base for
4927 any algebraic development in Isabelle. Currently covers group theory
4928 (up to Sylow's theorem) and ring theory (Universal Property of
4929 Univariate Polynomials). Contributions welcome;
4931 * GroupTheory: deleted, since its material has been moved to Algebra;
4933 * Complex: new directory of the complex numbers with numeric constants,
4934 nonstandard complex numbers, and some complex analysis, standard and
4935 nonstandard (Jacques Fleuriot);
4937 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4939 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4942 * Real/HahnBanach: updated and adapted to locales;
4944 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4947 * UNITY: added the Meier-Sanders theory of progress sets;
4949 * MicroJava: bytecode verifier and lightweight bytecode verifier
4950 as abstract algorithms, instantiated to the JVM;
4952 * Bali: Java source language formalization. Type system, operational
4953 semantics, axiomatic semantics. Supported language features:
4954 classes, interfaces, objects,virtual methods, static methods,
4955 static/instance fields, arrays, access modifiers, definite
4956 assignment, exceptions.
4961 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4964 * Main ZF: virtually all theories converted to new-style format;
4969 * Pure: Tactic.prove provides sane interface for internal proofs;
4970 omits the infamous "standard" operation, so this is more appropriate
4971 than prove_goalw_cterm in many situations (e.g. in simprocs);
4973 * Pure: improved error reporting of simprocs;
4975 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4979 *** Document preparation ***
4981 * uses \par instead of \\ for line breaks in theory text. This may
4982 shift some page breaks in large documents. To get the old behaviour
4983 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4985 * minimized dependencies of isabelle.sty and isabellesym.sty on
4988 * \<euro> now needs package babel/greek instead of marvosym (which
4991 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4996 New in Isabelle2002 (March 2002)
4997 --------------------------------
4999 *** Document preparation ***
5001 * greatly simplified document preparation setup, including more
5002 graceful interpretation of isatool usedir -i/-d/-D options, and more
5003 instructive isatool mkdir; users should basically be able to get
5004 started with "isatool mkdir HOL Test && isatool make"; alternatively,
5005 users may run a separate document processing stage manually like this:
5006 "isatool usedir -D output HOL Test && isatool document Test/output";
5008 * theory dependency graph may now be incorporated into documents;
5009 isatool usedir -g true will produce session_graph.eps/.pdf for use
5010 with \includegraphics of LaTeX;
5012 * proper spacing of consecutive markup elements, especially text
5013 blocks after section headings;
5015 * support bold style (for single symbols only), input syntax is like
5016 this: "\<^bold>\<alpha>" or "\<^bold>A";
5018 * \<bullet> is now output as bold \cdot by default, which looks much
5019 better in printed text;
5021 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
5022 note that these symbols are currently unavailable in Proof General /
5023 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
5025 * isatool latex no longer depends on changed TEXINPUTS, instead
5026 isatool document copies the Isabelle style files to the target
5032 * Pure/Provers: improved proof by cases and induction;
5033 - 'case' command admits impromptu naming of parameters (such as
5035 - 'induct' method divinates rule instantiation from the inductive
5036 claim; no longer requires excessive ?P bindings for proper
5037 instantiation of cases;
5038 - 'induct' method properly enumerates all possibilities of set/type
5039 rules; as a consequence facts may be also passed through *type*
5040 rules without further ado;
5041 - 'induct' method now derives symbolic cases from the *rulified*
5042 rule (before it used to rulify cases stemming from the internal
5043 atomized version); this means that the context of a non-atomic
5044 statement becomes is included in the hypothesis, avoiding the
5045 slightly cumbersome show "PROP ?case" form;
5046 - 'induct' may now use elim-style induction rules without chaining
5047 facts, using ``missing'' premises from the goal state; this allows
5048 rules stemming from inductive sets to be applied in unstructured
5049 scripts, while still benefitting from proper handling of non-atomic
5050 statements; NB: major inductive premises need to be put first, all
5051 the rest of the goal is passed through the induction;
5052 - 'induct' proper support for mutual induction involving non-atomic
5053 rule statements (uses the new concept of simultaneous goals, see
5055 - append all possible rule selections, but only use the first
5056 success (no backtracking);
5057 - removed obsolete "(simplified)" and "(stripped)" options of methods;
5058 - undeclared rule case names default to numbers 1, 2, 3, ...;
5059 - added 'print_induct_rules' (covered by help item in recent Proof
5061 - moved induct/cases attributes to Pure, methods to Provers;
5062 - generic method setup instantiated for FOL and HOL;
5064 * Pure: support multiple simultaneous goal statements, for example
5065 "have a: A and b: B" (same for 'theorem' etc.); being a pure
5066 meta-level mechanism, this acts as if several individual goals had
5067 been stated separately; in particular common proof methods need to be
5068 repeated in order to cover all claims; note that a single elimination
5069 step is *not* sufficient to establish the two conjunctions, so this
5072 assume "A & B" then have A and B .. (*".." fails*)
5074 better use "obtain" in situations as above; alternative refer to
5075 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5077 * Pure: proper integration with ``locales''; unlike the original
5078 version by Florian Kammller, Isar locales package high-level proof
5079 contexts rather than raw logical ones (e.g. we admit to include
5080 attributes everywhere); operations on locales include merge and
5081 rename; support for implicit arguments (``structures''); simultaneous
5082 type-inference over imports and text; see also HOL/ex/Locales.thy for
5085 * Pure: the following commands have been ``localized'', supporting a
5086 target locale specification "(in name)": 'lemma', 'theorem',
5087 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5088 stored both within the locale and at the theory level (exported and
5089 qualified by the locale name);
5091 * Pure: theory goals may now be specified in ``long'' form, with
5092 ad-hoc contexts consisting of arbitrary locale elements. for example
5093 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5094 definitions may be given, too); the result is a meta-level rule with
5095 the context elements being discharged in the obvious way;
5097 * Pure: new proof command 'using' allows to augment currently used
5098 facts after a goal statement ('using' is syntactically analogous to
5099 'apply', but acts on the goal's facts only); this allows chained facts
5100 to be separated into parts given before and after a claim, as in
5101 ``from a and b have C using d and e <proof>'';
5103 * Pure: renamed "antecedent" case to "rule_context";
5105 * Pure: new 'judgment' command records explicit information about the
5106 object-logic embedding (used by several tools internally); no longer
5107 use hard-wired "Trueprop";
5109 * Pure: added 'corollary' command;
5111 * Pure: fixed 'token_translation' command;
5113 * Pure: removed obsolete 'exported' attribute;
5115 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5116 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5117 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5119 * Pure: method 'atomize' presents local goal premises as object-level
5120 statements (atomic meta-level propositions); setup controlled via
5121 rewrite rules declarations of 'atomize' attribute; example
5122 application: 'induct' method with proper rule statements in improper
5125 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5126 now consider the syntactic context of assumptions, giving a better
5127 chance to get type-inference of the arguments right (this is
5128 especially important for locales);
5130 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5133 * Pure/obtain: the formal conclusion "thesis", being marked as
5134 ``internal'', may no longer be reference directly in the text;
5135 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5138 * Pure: generic 'sym' attribute which declares a rule both as pure
5139 'elim?' and for the 'symmetric' operation;
5141 * Pure: marginal comments ``--'' may now occur just anywhere in the
5142 text; the fixed correlation with particular command syntax has been
5145 * Pure: new method 'rules' is particularly well-suited for proof
5146 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5147 but often produces more compact proof terms with less detours;
5149 * Pure/Provers/classical: simplified integration with pure rule
5150 attributes and methods; the classical "intro?/elim?/dest?"
5151 declarations coincide with the pure ones; the "rule" method no longer
5152 includes classically swapped intros; "intro" and "elim" methods no
5153 longer pick rules from the context; also got rid of ML declarations
5154 AddXIs/AddXEs/AddXDs; all of this has some potential for
5157 * Provers/classical: attribute 'swapped' produces classical inversions
5158 of introduction rules;
5160 * Provers/simplifier: 'simplified' attribute may refer to explicit
5161 rules instead of full simplifier context; 'iff' attribute handles
5164 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5166 * HOL: 'recdef' now fails on unfinished automated proofs, use
5167 "(permissive)" option to recover old behavior;
5169 * HOL: 'inductive' no longer features separate (collective) attributes
5170 for 'intros' (was found too confusing);
5172 * HOL: properly declared induction rules less_induct and
5178 * HOL: moved over to sane numeral syntax; the new policy is as
5181 - 0 and 1 are polymorphic constants, which are defined on any
5182 numeric type (nat, int, real etc.);
5184 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5185 binary representation internally;
5187 - type nat has special constructor Suc, and generally prefers Suc 0
5188 over 1::nat and Suc (Suc 0) over 2::nat;
5190 This change may cause significant problems of INCOMPATIBILITY; here
5191 are some hints on converting existing sources:
5193 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5194 entities, so expressions involving "-" (unary or binary minus) need
5195 to be spaced properly;
5197 - existing occurrences of "1" may need to be constraint "1::nat" or
5198 even replaced by Suc 0; similar for old "2";
5200 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5202 - remove all special provisions on numerals in proofs;
5204 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5205 representation (depends on bin_arith_simps in the default context);
5207 * HOL: symbolic syntax for x^2 (numeral 2);
5209 * HOL: the class of all HOL types is now called "type" rather than
5210 "term"; INCOMPATIBILITY, need to adapt references to this type class
5211 in axclass/classes, instance/arities, and (usually rare) occurrences
5212 in typings (of consts etc.); internally the class is called
5213 "HOL.type", ML programs should refer to HOLogic.typeS;
5215 * HOL/record package improvements:
5216 - new derived operations "fields" to build a partial record section,
5217 "extend" to promote a fixed record to a record scheme, and
5218 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5219 declared as simp by default;
5220 - shared operations ("more", "fields", etc.) now need to be always
5221 qualified) --- potential INCOMPATIBILITY;
5222 - removed "make_scheme" operations (use "make" with "extend") --
5224 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5225 - provides cases/induct rules for use with corresponding Isar
5226 methods (for concrete records, record schemes, concrete more
5227 parts, and schematic more parts -- in that order);
5228 - internal definitions directly based on a light-weight abstract
5229 theory of product types over typedef rather than datatype;
5231 * HOL: generic code generator for generating executable ML code from
5232 specifications; specific support for HOL constructs such as inductive
5233 datatypes and sets, as well as recursive functions; can be invoked
5234 via 'generate_code' theory section;
5236 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5238 * HOL: consolidated and renamed several theories. In particular:
5239 Ord.thy has been absorbed into HOL.thy
5240 String.thy has been absorbed into List.thy
5242 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5243 (beware of argument permutation!);
5245 * HOL: linorder_less_split superseded by linorder_cases;
5247 * HOL/List: "nodups" renamed to "distinct";
5249 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5250 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5251 - Ex_def has changed, now need to use some_eq_ex
5253 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5254 in this (rare) case use:
5256 delSWrapper "split_all_tac"
5257 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5259 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5262 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5263 Isabelle's type classes, ^ on functions and relations has too general
5264 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5265 necessary to attach explicit type constraints;
5267 * HOL/Relation: the prefix name of the infix "O" has been changed from
5268 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5269 renamed accordingly (eg "compI" -> "rel_compI").
5271 * HOL: syntax translations now work properly with numerals and records
5274 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5275 of "lam" -- INCOMPATIBILITY;
5277 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5278 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5279 renamed "Product_Type.unit";
5281 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5283 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5284 the "cases" method);
5286 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5289 * HOL/IMP: updated and converted to new-style theory format; several
5290 parts turned into readable document, with proper Isar proof texts and
5291 some explanations (by Gerwin Klein);
5293 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5295 * HOL-Hyperreal is now a logic image;
5300 * Isar: consts/constdefs supports mixfix syntax for continuous
5303 * Isar: domain package adapted to new-style theory format, e.g. see
5306 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5307 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5308 lift.induct_tac, always use UU instead of Undef;
5310 * HOLCF/IMP: updated and converted to new-style theory;
5315 * Isar: proper integration of logic-specific tools and packages,
5316 including theory commands '(co)inductive', '(co)datatype',
5317 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5318 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5320 * theory Main no longer includes AC; for the Axiom of Choice, base
5321 your theory on Main_ZFC;
5323 * the integer library now covers quotients and remainders, with many
5324 laws relating division to addition, multiplication, etc.;
5326 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5327 typeless version of the formalism;
5329 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5332 * ZF/Induct: new directory for examples of inductive definitions,
5333 including theory Multiset for multiset orderings; converted to
5334 new-style theory format;
5336 * ZF: many new theorems about lists, ordinals, etc.;
5341 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5342 variable proof controls level of detail: 0 = no proofs (only oracle
5343 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5344 also ref manual for further ML interfaces;
5346 * Pure/axclass: removed obsolete ML interface
5347 goal_subclass/goal_arity;
5349 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5350 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5351 separate tokens, so expressions involving minus need to be spaced
5354 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5355 rather than "infixl" or "infixr";
5357 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5358 sort constraint specifications in type inference; e.g. "x::_::foo"
5359 ensures that the type of "x" is of sort "foo" (but not necessarily a
5362 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5363 control output of nested => (types); the default behavior is
5366 * Pure/syntax: builtin parse translation for "_constify" turns valued
5367 tokens into AST constants;
5369 * Pure/syntax: prefer later declarations of translations and print
5370 translation functions; potential INCOMPATIBILITY: need to reverse
5371 multiple declarations for same syntax element constant;
5373 * Pure/show_hyps reset by default (in accordance to existing Isar
5376 * Provers/classical: renamed addaltern to addafter, addSaltern to
5379 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5382 * system: tested support for MacOS X; should be able to get Isabelle +
5383 Proof General to work in a plain Terminal after installing Poly/ML
5384 (e.g. from the Isabelle distribution area) and GNU bash alone
5385 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5386 support requires further installations, e.g. from
5387 http://fink.sourceforge.net/);
5389 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5391 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5392 of 40 MB), cf. ML_OPTIONS;
5394 * system: Proof General keywords specification is now part of the
5395 Isabelle distribution (see etc/isar-keywords.el);
5397 * system: support for persistent Proof General sessions (refrain from
5398 outdating all loaded theories on startup); user may create writable
5399 logic images like this: ``isabelle -q HOL Test'';
5401 * system: smart selection of Isabelle process versus Isabelle
5402 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5403 run both "isabelle" and "Isabelle" even if file names are badly
5404 damaged (executable inspects the case of the first letter of its own
5405 name); added separate "isabelle-process" and "isabelle-interface";
5407 * system: refrain from any attempt at filtering input streams; no
5408 longer support ``8bit'' encoding of old isabelle font, instead proper
5409 iso-latin characters may now be used; the related isatools
5410 "symbolinput" and "nonascii" have disappeared as well;
5412 * system: removed old "xterm" interface (the print modes "xterm" and
5413 "xterm_color" are still available for direct use in a suitable
5418 New in Isabelle99-2 (February 2001)
5419 -----------------------------------
5421 *** Overview of INCOMPATIBILITIES ***
5423 * HOL: please note that theories in the Library and elsewhere often use the
5424 new-style (Isar) format; to refer to their theorems in an ML script you must
5425 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5427 * HOL: inductive package no longer splits induction rule aggressively,
5428 but only as far as specified by the introductions given; the old
5429 format may be recovered via ML function complete_split_rule or attribute
5430 'split_rule (complete)';
5432 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5433 gfp_Tarski to gfp_unfold;
5435 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5437 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5438 relation); infix "^^" has been renamed "``"; infix "``" has been
5439 renamed "`"; "univalent" has been renamed "single_valued";
5441 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5444 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5446 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5448 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5449 consequence, it is no longer monotonic wrt. the local goal context
5450 (which is now passed through the inductive cases);
5452 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5453 \<gg> to \<ggreater>;
5456 *** Document preparation ***
5458 * \isabellestyle{NAME} selects version of Isabelle output (currently
5459 available: are "it" for near math-mode best-style output, "sl" for
5460 slanted text style, and "tt" for plain type-writer; if no
5461 \isabellestyle command is given, output is according to slanted
5464 * support sub/super scripts (for single symbols only), input syntax is
5465 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5467 * some more standard symbols; see Appendix A of the system manual for
5468 the complete list of symbols defined in isabellesym.sty;
5470 * improved isabelle style files; more abstract symbol implementation
5471 (should now use \isamath{...} and \isatext{...} in custom symbol
5474 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5475 state; Note that presentation of goal states does not conform to
5476 actual human-readable proof documents. Please do not include goal
5477 states into document output unless you really know what you are doing!
5479 * proper indentation of antiquoted output with proportional LaTeX
5482 * no_document ML operator temporarily disables LaTeX document
5485 * isatool unsymbolize tunes sources for plain ASCII communication;
5490 * Pure: Isar now suffers initial goal statements to contain unbound
5491 schematic variables (this does not conform to actual readable proof
5492 documents, due to unpredictable outcome and non-compositional proof
5493 checking); users who know what they are doing may use schematic goals
5494 for Prolog-style synthesis of proven results;
5496 * Pure: assumption method (an implicit finishing) now handles actual
5499 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5500 initial goal, declare "that" only as Pure intro (only for single
5501 steps); the "that" rule assumption may now be involved in implicit
5502 finishing, thus ".." becomes a feasible for trivial obtains;
5504 * Pure: default proof step now includes 'intro_classes'; thus trivial
5505 instance proofs may be performed by "..";
5507 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5510 * Pure: more robust selection of calculational rules;
5512 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5513 rule (as well as the assumption rule);
5515 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5516 lemmas, using the graph browser tool;
5518 * Pure: predict failure of "show" in interactive mode;
5520 * Pure: 'thms_containing' now takes actual terms as arguments;
5522 * HOL: improved method 'induct' --- now handles non-atomic goals
5523 (potential INCOMPATIBILITY); tuned error handling;
5525 * HOL: cases and induct rules now provide explicit hints about the
5526 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5527 any remaining facts are inserted into the goal verbatim;
5529 * HOL: local contexts (aka cases) may now contain term bindings as
5530 well; the 'cases' and 'induct' methods new provide a ?case binding for
5531 the result to be shown in each case;
5533 * HOL: added 'recdef_tc' command;
5535 * isatool convert assists in eliminating legacy ML scripts;
5540 * HOL/Library: a collection of generic theories to be used together
5541 with main HOL; the theory loader path already includes this directory
5542 by default; the following existing theories have been moved here:
5543 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5544 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5546 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5547 modelling and verification task performed in Isabelle/HOL +
5548 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5550 * HOL/Algebra: special summation operator SUM no longer exists, it has
5551 been replaced by setsum; infix 'assoc' now has priority 50 (like
5552 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5553 'domain', this makes the theory consistent with mathematical
5556 * HOL basics: added overloaded operations "inverse" and "divide"
5557 (infix "/"), syntax for generic "abs" operation, generic summation
5560 * HOL/typedef: simplified package, provide more useful rules (see also
5563 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5564 now expressed as a proper nested rule (old-style tactic scripts may
5565 require atomize_strip_tac to cope with non-atomic premises);
5567 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5568 to "split_conv" (old name still available for compatibility);
5570 * HOL: improved concrete syntax for strings (e.g. allows translation
5571 rules with string literals);
5573 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5574 and Fleuriot's mechanization of analysis, including the transcendental
5575 functions for the reals;
5577 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5582 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5583 "lam" is displayed as TWO lambda-symbols
5585 * CTT: theory Main now available, containing everything (that is, Bool
5591 * Pure: the Simplifier has been implemented properly as a derived rule
5592 outside of the actual kernel (at last!); the overall performance
5593 penalty in practical applications is about 50%, while reliability of
5594 the Isabelle inference kernel has been greatly improved;
5596 * print modes "brackets" and "no_brackets" control output of nested =>
5597 (types) and ==> (props); the default behaviour is "brackets";
5599 * Provers: fast_tac (and friends) now handle actual object-logic rules
5600 as assumptions as well;
5602 * system: support Poly/ML 4.0;
5604 * system: isatool install handles KDE version 1 or 2;
5608 New in Isabelle99-1 (October 2000)
5609 ----------------------------------
5611 *** Overview of INCOMPATIBILITIES ***
5613 * HOL: simplification of natural numbers is much changed; to partly
5614 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5615 issue the following ML commands:
5617 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5618 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5620 * HOL: simplification no longer dives into case-expressions; this is
5621 controlled by "t.weak_case_cong" for each datatype t;
5623 * HOL: nat_less_induct renamed to less_induct;
5625 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5626 fixsome to patch .thy and .ML sources automatically;
5628 select_equality -> some_equality
5629 select_eq_Ex -> some_eq_ex
5630 selectI2EX -> someI2_ex
5633 select1_equality -> some1_equality
5634 Eps_sym_eq -> some_sym_eq_trivial
5635 Eps_eq -> some_eq_trivial
5637 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5639 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5642 * HOL: the recursion equations generated by 'recdef' are now called
5643 f.simps instead of f.rules;
5645 * HOL: qed_spec_mp now also handles bounded ALL as well;
5647 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5648 sometimes be needed;
5650 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5652 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5654 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5655 product is now "<*>" instead of "Times"; the lexicographic product is
5656 now "<*lex*>" instead of "**";
5658 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5659 of main HOL, but was unused); better use HOL's datatype package;
5661 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5662 the old syntax may be recovered as follows:
5665 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5666 (infixl "\\<oplus>" 100)
5668 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5670 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5671 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5674 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5675 changed from A/r to A//r;
5677 * ZF: new treatment of arithmetic (nat & int) may break some old
5680 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5681 rulify -> rule_format, elimify -> elim_format, ...);
5683 * Isar/Provers: intro/elim/dest attributes changed; renamed
5684 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5685 should have to change intro!! to intro? only); replaced "delrule" by
5688 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5690 * Provers: strengthened force_tac by using new first_best_tac;
5692 * LaTeX document preparation: several changes of isabelle.sty (see
5696 *** Document preparation ***
5698 * formal comments (text blocks etc.) in new-style theories may now
5699 contain antiquotations of thm/prop/term/typ/text to be presented
5700 according to latex print mode; concrete syntax is like this:
5701 @{term[show_types] "f(x) = a + x"};
5703 * isatool mkdir provides easy setup of Isabelle session directories,
5704 including proper document sources;
5706 * generated LaTeX sources are now deleted after successful run
5707 (isatool document -c); may retain a copy somewhere else via -D option
5710 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5711 style files, achieving self-contained LaTeX sources and simplifying
5714 * old-style theories now produce (crude) LaTeX output as well;
5716 * browser info session directories are now self-contained (may be put
5717 on WWW server seperately); improved graphs of nested sessions; removed
5718 graph for 'all sessions';
5720 * several improvements in isabelle style files; \isabellestyle{it}
5721 produces fake math mode output; \isamarkupheader is now \section by
5722 default; see lib/texinputs/isabelle.sty etc.;
5727 * Isar/Pure: local results and corresponding term bindings are now
5728 subject to Hindley-Milner polymorphism (similar to ML); this
5729 accommodates incremental type-inference very nicely;
5731 * Isar/Pure: new derived language element 'obtain' supports
5732 generalized existence reasoning;
5734 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5735 support accumulation of results, without applying any rules yet;
5736 useful to collect intermediate results without explicit name
5737 references, and for use with transitivity rules with more than 2
5740 * Isar/Pure: scalable support for case-analysis type proofs: new
5741 'case' language element refers to local contexts symbolically, as
5742 produced by certain proof methods; internally, case names are attached
5743 to theorems as "tags";
5745 * Isar/Pure: theory command 'hide' removes declarations from
5746 class/type/const name spaces;
5748 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5749 indicate potential overloading;
5751 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5753 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5754 "{a,b,c}" instead of {a,b,c};
5756 * Isar/Pure now provides its own version of intro/elim/dest
5757 attributes; useful for building new logics, but beware of confusion
5758 with the version in Provers/classical;
5760 * Isar/Pure: the local context of (non-atomic) goals is provided via
5761 case name 'antecedent';
5763 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5764 to the current context is now done automatically);
5766 * Isar/Pure: theory command 'method_setup' provides a simple interface
5767 for definining proof methods in ML;
5769 * Isar/Provers: intro/elim/dest attributes changed; renamed
5770 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5771 most cases, one should have to change intro!! to intro? only);
5772 replaced "delrule" by "rule del";
5774 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5775 'symmetric' attribute (the latter supercedes [RS sym]);
5777 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5778 method modifier); 'simp' method: 'only:' modifier removes loopers as
5779 well (including splits);
5781 * Isar/Provers: Simplifier and Classical methods now support all kind
5782 of modifiers used in the past, including 'cong', 'iff', etc.
5784 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5785 of Simplifier and Classical reasoner);
5787 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5788 now support named cases; major packages (inductive, datatype, primrec,
5789 recdef) support case names and properly name parameters;
5791 * Isar/HOL: new transitivity rules for substitution in inequalities --
5792 monotonicity conditions are extracted to be proven at end of
5795 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5798 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5799 split_if split_if_asm; datatype package provides theorems foo.splits =
5800 foo.split foo.split_asm for each datatype;
5802 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5803 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5804 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5805 use "(cases (simplified))" method in proper proof texts);
5807 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5809 * Isar: names of theorems etc. may be natural numbers as well;
5811 * Isar: 'pr' command: optional arguments for goals_limit and
5812 ProofContext.prems_limit; no longer prints theory contexts, but only
5815 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5816 additional print modes to be specified; e.g. "pr(latex)" will print
5817 proof state according to the Isabelle LaTeX style;
5819 * Isar: improved support for emulating tactic scripts, including proof
5820 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5821 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5822 (for HOL datatypes);
5824 * Isar: simplified (more robust) goal selection of proof methods: 1st
5825 goal, all goals, or explicit goal specifier (tactic emulation); thus
5826 'proof method scripts' have to be in depth-first order;
5828 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5830 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5831 should instead use individual commands for printing items
5832 (print_commands, print_methods etc.);
5834 * Isar: added 'nothing' --- the empty list of theorems;
5839 * HOL/MicroJava: formalization of a fragment of Java, together with a
5840 corresponding virtual machine and a specification of its bytecode
5841 verifier and a lightweight bytecode verifier, including proofs of
5842 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5843 Cornelia Pusch (see also the homepage of project Bali at
5844 http://isabelle.in.tum.de/Bali/);
5846 * HOL/Algebra: new theory of rings and univariate polynomials, by
5849 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5850 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5853 * HOL/Lattice: fundamental concepts of lattice theory and order
5854 structures, including duals, properties of bounds versus algebraic
5855 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5856 Theorem for complete lattices etc.; may also serve as a demonstration
5857 for abstract algebraic reasoning using axiomatic type classes, and
5858 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5860 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5863 * HOL/IMPP: extension of IMP with local variables and mutually
5864 recursive procedures, by David von Oheimb;
5866 * HOL/Lambda: converted into new-style theory and document;
5868 * HOL/ex/Multiquote: example of multiple nested quotations and
5869 anti-quotations -- basically a generalized version of de-Bruijn
5870 representation; very useful in avoiding lifting of operations;
5872 * HOL/record: added general record equality rule to simpset; fixed
5873 select-update simplification procedure to handle extended records as
5874 well; admit "r" as field name;
5876 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5877 other numeric types and also as the identity of groups, rings, etc.;
5879 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5880 Types nat and int belong to this axclass;
5882 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5883 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5884 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5885 two terms #m*u and #n*u are replaced by #(m+n)*u
5886 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5887 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5888 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5890 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5891 powerful prover for predicate logic but knows nothing of clasets; see
5892 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5894 * HOL: new version of "case_tac" subsumes both boolean case split and
5895 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5896 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5898 * HOL: simplification no longer dives into case-expressions: only the
5899 selector expression is simplified, but not the remaining arms; to
5900 enable full simplification of case-expressions for datatype t, you may
5901 remove t.weak_case_cong from the simpset, either globally (Delcongs
5902 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5904 * HOL/recdef: the recursion equations generated by 'recdef' for
5905 function 'f' are now called f.simps instead of f.rules; if all
5906 termination conditions are proved automatically, these simplification
5907 rules are added to the simpset, as in primrec; rules may be named
5908 individually as well, resulting in a separate list of theorems for
5911 * HOL/While is a new theory that provides a while-combinator. It
5912 permits the definition of tail-recursive functions without the
5913 provision of a termination measure. The latter is necessary once the
5914 invariant proof rule for while is applied.
5916 * HOL: new (overloaded) notation for the set of elements below/above
5917 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5919 * HOL: theorems impI, allI, ballI bound as "strip";
5921 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5922 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5923 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5925 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5927 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5928 main HOL, but was unused);
5930 * HOL: fewer consts declared as global (e.g. have to refer to
5931 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5933 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5934 in case of overlap with user translations (e.g. judgements over
5935 tuples); (note that the underlying logical represenation is still
5941 * ZF: simplification automatically cancels common terms in arithmetic
5942 expressions over nat and int;
5944 * ZF: new treatment of nat to minimize type-checking: all operators
5945 coerce their operands to a natural number using the function natify,
5946 making the algebraic laws unconditional;
5948 * ZF: as above, for int: operators coerce their operands to an integer
5949 using the function intify;
5951 * ZF: the integer library now contains many of the usual laws for the
5952 orderings, including $<=, and monotonicity laws for $+ and $*;
5954 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5957 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5958 to the simplifier and classical reasoner simultaneously;
5963 * Provers: blast_tac now handles actual object-logic rules as
5964 assumptions; note that auto_tac uses blast_tac internally as well;
5966 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5967 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5969 * Provers: delrules now handles destruct rules as well (no longer need
5970 explicit make_elim);
5972 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5973 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5974 use instead the strong form,
5975 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5976 in HOL, FOL and ZF the function cla_make_elim will create such rules
5977 from destruct-rules;
5979 * Provers: Simplifier.easy_setup provides a fast path to basic
5980 Simplifier setup for new object-logics;
5982 * Pure: AST translation rules no longer require constant head on LHS;
5984 * Pure: improved name spaces: ambiguous output is qualified; support
5985 for hiding of names;
5987 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5988 XSYMBOL_HOME; no longer need to do manual configuration in most
5991 * system: compression of ML heaps images may now be controlled via -c
5992 option of isabelle and isatool usedir (currently only observed by
5995 * system: isatool installfonts may handle X-Symbol fonts as well (very
5996 useful for remote X11);
5998 * system: provide TAGS file for Isabelle sources;
6000 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
6003 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
6004 timing flag supersedes proof_timing and Toplevel.trace;
6006 * ML: new combinators |>> and |>>> for incremental transformations
6007 with secondary results (e.g. certain theory extensions):
6009 * ML: PureThy.add_defs gets additional argument to indicate potential
6010 overloading (usually false);
6012 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
6017 New in Isabelle99 (October 1999)
6018 --------------------------------
6020 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6022 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
6023 are no longer simplified. (This allows the simplifier to unfold recursive
6024 functional programs.) To restore the old behaviour, declare
6026 Delcongs [if_weak_cong];
6028 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
6031 * HOL: the predicate "inj" is now defined by translation to "inj_on";
6033 * HOL/datatype: mutual_induct_tac no longer exists --
6034 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
6036 * HOL/typedef: fixed type inference for representing set; type
6037 arguments now have to occur explicitly on the rhs as type constraints;
6039 * ZF: The con_defs part of an inductive definition may no longer refer
6040 to constants declared in the same theory;
6042 * HOL, ZF: the function mk_cases, generated by the inductive
6043 definition package, has lost an argument. To simplify its result, it
6044 uses the default simpset instead of a supplied list of theorems.
6046 * HOL/List: the constructors of type list are now Nil and Cons;
6048 * Simplifier: the type of the infix ML functions
6049 setSSolver addSSolver setSolver addSolver
6050 is now simpset * solver -> simpset where `solver' is a new abstract type
6051 for packaging solvers. A solver is created via
6052 mk_solver: string -> (thm list -> int -> tactic) -> solver
6053 where the string argument is only a comment.
6058 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
6059 decision procedure for linear arithmetic. Currently it is used for
6060 types `nat', `int', and `real' in HOL (see below); it can, should and
6061 will be instantiated for other types and logics as well.
6063 * The simplifier now accepts rewrite rules with flexible heads, eg
6064 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
6065 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6071 * New Isabelle/Isar subsystem provides an alternative to traditional
6072 tactical theorem proving; together with the ProofGeneral/isar user
6073 interface it offers an interactive environment for developing human
6074 readable proof documents (Isar == Intelligible semi-automated
6075 reasoning); for further information see isatool doc isar-ref,
6076 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6078 * improved and simplified presentation of theories: better HTML markup
6079 (including colors), graph views in several sizes; isatool usedir now
6080 provides a proper interface for user theories (via -P option); actual
6081 document preparation based on (PDF)LaTeX is available as well (for
6082 new-style theories only); see isatool doc system for more information;
6084 * native support for Proof General, both for classic Isabelle and
6087 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6088 using the graph browser tool;
6090 * Isabelle manuals now also available as PDF;
6092 * theory loader rewritten from scratch (may not be fully
6093 bug-compatible); old loadpath variable has been replaced by show_path,
6094 add_path, del_path, reset_path functions; new operations such as
6095 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6098 * improved isatool install: option -k creates KDE application icon,
6099 option -p DIR installs standalone binaries;
6101 * added ML_PLATFORM setting (useful for cross-platform installations);
6102 more robust handling of platform specific ML images for SML/NJ;
6104 * the settings environment is now statically scoped, i.e. it is never
6105 created again in sub-processes invoked from isabelle, isatool, or
6108 * path element specification '~~' refers to '$ISABELLE_HOME';
6110 * in locales, the "assumes" and "defines" parts may be omitted if
6113 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6116 * new print_mode "HTML";
6118 * new flag show_tags controls display of tags of theorems (which are
6119 basically just comments that may be attached by some tools);
6121 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6122 mode and goal output format:
6124 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6126 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6128 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6129 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6131 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6133 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6135 * function bind_thms stores lists of theorems (cf. bind_thm);
6137 * new shorthand tactics ftac, eatac, datac, fatac;
6139 * qed (and friends) now accept "" as result name; in that case the
6140 theorem is not stored, but proper checks and presentation of the
6143 * theorem database now also indexes constants "Trueprop", "all",
6144 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6149 ** HOL arithmetic **
6151 * There are now decision procedures for linear arithmetic over nat and
6154 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6155 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6156 are treated as atomic; subformulae not involving type `nat' or `int'
6157 are ignored; quantified subformulae are ignored unless they are
6158 positive universal or negative existential. The tactic has to be
6159 invoked by hand and can be a little bit slow. In particular, the
6160 running time is exponential in the number of occurrences of `min' and
6161 `max', and `-' on `nat'.
6163 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6164 (negated) (in)equalities among the premises and the conclusion into
6165 account (i.e. no compound formulae) and does not know about `min' and
6166 `max', and `-' on `nat'. It is fast and is used automatically by the
6169 NB: At the moment, these decision procedures do not cope with mixed
6170 nat/int formulae where the two parts interact, such as `m < n ==>
6173 * HOL/Numeral provides a generic theory of numerals (encoded
6174 efficiently as bit strings); setup for types nat/int/real is in place;
6175 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6176 int, existing theories and proof scripts may require a few additional
6179 * integer division and remainder can now be performed on constant
6182 * many properties of integer multiplication, division and remainder
6185 * An interface to the Stanford Validity Checker (SVC) is available through the
6186 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6187 are proved automatically. SVC must be installed separately, and its results
6188 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6189 invocation of the underlying oracle). For SVC see
6190 http://verify.stanford.edu/SVC
6192 * IsaMakefile: the HOL-Real target now builds an actual image;
6197 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6198 (in Isabelle/Isar) -- by Gertrud Bauer;
6200 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6201 analysis for assembly languages with subtypes;
6203 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6204 -- avoids syntactic ambiguities and treats state, transition, and
6205 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6206 changed syntax and (many) tactics;
6208 * HOL/inductive: Now also handles more general introduction rules such
6209 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6210 theorems are now maintained within the theory (maintained via the
6213 * HOL/datatype: Now also handles arbitrarily branching datatypes
6214 (using function types) such as
6216 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6218 * HOL/record: record_simproc (part of the default simpset) takes care
6219 of selectors applied to updated records; record_split_tac is no longer
6220 part of the default claset; update_defs may now be removed from the
6221 simpset in many cases; COMPATIBILITY: old behavior achieved by
6223 claset_ref () := claset() addSWrapper record_split_wrapper;
6224 Delsimprocs [record_simproc]
6226 * HOL/typedef: fixed type inference for representing set; type
6227 arguments now have to occur explicitly on the rhs as type constraints;
6229 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6230 names rather than an ML expression;
6232 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6233 supplied later. Program schemes can be defined, such as
6234 "While B C s = (if B s then While B C (C s) else s)"
6235 where the well-founded relation can be chosen after B and C have been given.
6237 * HOL/List: the constructors of type list are now Nil and Cons;
6238 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6239 course, ML tools referring to List.list.op # etc. have to be adapted;
6241 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6242 disabled by default; run isabelle with option -m HOL to get back to
6243 the original Gordon/HOL-style output;
6245 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6246 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6248 * HOL basic syntax simplified (more orthogonal): all variants of
6249 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6250 Eps operator is provided as well: "SOME x. P[x]";
6252 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6254 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6255 thus available for user theories;
6257 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6258 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6261 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6262 several times and then mp;
6267 * the notation <<...>> is now available as a notation for sequences of
6270 * the simplifier is now installed
6272 * the axiom system has been generalized (thanks to Soren Heilmann)
6274 * the classical reasoner now has a default rule database
6279 * new primrec section allows primitive recursive functions to be given
6280 directly (as in HOL) over datatypes and the natural numbers;
6282 * new tactics induct_tac and exhaust_tac for induction (or case
6283 analysis) over datatypes and the natural numbers;
6285 * the datatype declaration of type T now defines the recursor T_rec;
6287 * simplification automatically does freeness reasoning for datatype
6290 * automatic type-inference, with AddTCs command to insert new
6291 type-checking rules;
6293 * datatype introduction rules are now added as Safe Introduction rules
6296 * the syntax "if P then x else y" is now available in addition to
6300 *** Internal programming interfaces ***
6302 * tuned simplifier trace output; new flag debug_simp;
6304 * structures Vartab / Termtab (instances of TableFun) offer efficient
6305 tables indexed by indexname_ord / term_ord (compatible with aconv);
6307 * AxClass.axclass_tac lost the theory argument;
6309 * tuned current_goals_markers semantics: begin / end goal avoids
6310 printing empty lines;
6312 * removed prs and prs_fn hook, which was broken because it did not
6313 include \n in its semantics, forcing writeln to add one
6314 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6315 string -> unit if you really want to output text without newline;
6317 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6318 plain output, interface builders may have to enable 'isabelle_font'
6319 mode to get Isabelle font glyphs as before;
6321 * refined token_translation interface; INCOMPATIBILITY: output length
6322 now of type real instead of int;
6324 * theory loader actions may be traced via new ThyInfo.add_hook
6325 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6326 your own database of information attached to *whole* theories -- as
6327 opposed to intra-theory data slots offered via TheoryDataFun;
6329 * proper handling of dangling sort hypotheses (at last!);
6330 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6331 extra sort hypotheses that can be witnessed from the type signature;
6332 the force_strip_shyps flag is gone, any remaining shyps are simply
6333 left in the theorem (with a warning issued by strip_shyps_warning);
6337 New in Isabelle98-1 (October 1998)
6338 ----------------------------------
6340 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6342 * several changes of automated proof tools;
6344 * HOL: major changes to the inductive and datatype packages, including
6345 some minor incompatibilities of theory syntax;
6347 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6350 * HOL: removed duplicate thms in Arith:
6351 less_imp_add_less should be replaced by trans_less_add1
6352 le_imp_add_le should be replaced by trans_le_add1
6354 * HOL: unary minus is now overloaded (new type constraints may be
6357 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6358 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6359 now taken as an integer constant.
6361 * Pure: ML function 'theory_of' renamed to 'theory';
6367 1. Asm_full_simp_tac is now more aggressive.
6368 1. It will sometimes reorient premises if that increases their power to
6370 2. It does no longer proceed strictly from left to right but may also
6371 rotate premises to achieve further simplification.
6372 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6373 old Asm_full_simp_tac in that it does not rotate premises.
6374 2. The simplifier now knows a little bit about nat-arithmetic.
6376 * Classical reasoner: wrapper mechanism for the classical reasoner now
6377 allows for selected deletion of wrappers, by introduction of names for
6378 wrapper functionals. This implies that addbefore, addSbefore,
6379 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6380 and that adding two tactics with the same name overwrites the first
6381 one (emitting a warning).
6382 type wrapper = (int -> tactic) -> (int -> tactic)
6383 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6384 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6385 delWrapper, delSWrapper: claset * string -> claset
6386 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6388 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6389 semantics; addbefore now affects only the unsafe part of step_tac
6390 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6391 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6394 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6395 compWrapper; added safe wrapper (and access functions for it);
6397 * HOL/split_all_tac is now much faster and fails if there is nothing
6398 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6399 and the names of the automatically generated variables have changed.
6400 split_all_tac has moved within claset() from unsafe wrappers to safe
6401 wrappers, which means that !!-bound variables are split much more
6402 aggressively, and safe_tac and clarify_tac now split such variables.
6403 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6404 Note: the same holds for record_split_tac, which does the job of
6405 split_all_tac for record fields.
6407 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6408 permanently to the default simpset using Addsplits just like
6409 Addsimps. They can be removed via Delsplits just like
6410 Delsimps. Lower-case versions are also available.
6412 * HOL/Simplifier: The rule split_if is now part of the default
6413 simpset. This means that the simplifier will eliminate all occurrences
6414 of if-then-else in the conclusion of a goal. To prevent this, you can
6415 either remove split_if completely from the default simpset by
6416 `Delsplits [split_if]' or remove it in a specific call of the
6417 simplifier using `... delsplits [split_if]'. You can also add/delete
6418 other case splitting rules to/from the default simpset: every datatype
6419 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6420 t is the name of the datatype).
6422 * Classical reasoner / Simplifier combination: new force_tac (and
6423 derivatives Force_tac, force) combines rewriting and classical
6424 reasoning (and whatever other tools) similarly to auto_tac, but is
6425 aimed to solve the given subgoal completely.
6430 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6431 and `goalw': the theory is no longer needed as an explicit argument -
6432 the current theory context is used; assumptions are no longer returned
6433 at the ML-level unless one of them starts with ==> or !!; it is
6434 recommended to convert to these new commands using isatool fixgoal
6435 (backup your sources first!);
6437 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6438 the current theory context, and 'theory' to lookup stored theories;
6440 * new theory section 'locale' for declaring constants, assumptions and
6441 definitions that have local scope;
6443 * new theory section 'nonterminals' for purely syntactic types;
6445 * new theory section 'setup' for generic ML setup functions
6446 (e.g. package initialization);
6448 * the distribution now includes Isabelle icons: see
6449 lib/logo/isabelle-{small,tiny}.xpm;
6451 * isatool install - install binaries with absolute references to
6454 * isatool logo -- create instances of the Isabelle logo (as EPS);
6456 * print mode 'emacs' reserved for Isamode;
6458 * support multiple print (ast) translations per constant name;
6460 * theorems involving oracles are now printed with a suffixed [!];
6465 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6467 * HOL/inductive package reorganized and improved: now supports mutual
6473 oddI "n : EVEN ==> Suc n : ODD"
6474 evenI "n : ODD ==> Suc n : EVEN"
6476 new theorem list "elims" contains an elimination rule for each of the
6477 recursive sets; inductive definitions now handle disjunctive premises
6478 correctly (also ZF);
6480 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6481 "mutual_induct" no longer exists - the induction rule is always
6482 contained in "induct";
6485 * HOL/datatype package re-implemented and greatly improved: now
6486 supports mutually recursive datatypes such as
6489 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6490 | SUM ('a aexp) ('a aexp)
6491 | DIFF ('a aexp) ('a aexp)
6494 'a bexp = LESS ('a aexp) ('a aexp)
6495 | AND ('a bexp) ('a bexp)
6496 | OR ('a bexp) ('a bexp)
6498 as well as indirectly recursive datatypes such as
6501 ('a, 'b) term = Var 'a
6502 | App 'b ((('a, 'b) term) list)
6504 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6505 induction on mutually / indirectly recursive datatypes.
6507 Primrec equations are now stored in theory and can be accessed via
6508 <function_name>.simps.
6512 - Theories using datatypes must now have theory Datatype as an
6514 - The specific <typename>.induct_tac no longer exists - use the
6515 generic induct_tac instead.
6516 - natE has been renamed to nat.exhaust - use exhaust_tac
6517 instead of res_inst_tac ... natE. Note that the variable
6518 names in nat.exhaust differ from the names in natE, this
6519 may cause some "fragile" proofs to fail.
6520 - The theorems split_<typename>_case and split_<typename>_case_asm
6521 have been renamed to <typename>.split and <typename>.split_asm.
6522 - Since default sorts of type variables are now handled correctly,
6523 some datatype definitions may have to be annotated with explicit
6525 - Primrec definitions no longer require function name and type
6526 of recursive argument.
6528 Consider using isatool fixdatatype to adapt your theories and proof
6529 scripts to the new package (backup your sources first!).
6532 * HOL/record package: considerably improved implementation; now
6533 includes concrete syntax for record types, terms, updates; theorems
6534 for surjective pairing and splitting !!-bound record variables; proof
6535 support is as follows:
6537 1) standard conversions (selectors or updates applied to record
6538 constructor terms) are part of the standard simpset;
6540 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6541 made part of standard simpset and claset via addIffs;
6543 3) a tactic for record field splitting (record_split_tac) is part of
6544 the standard claset (addSWrapper);
6546 To get a better idea about these rules you may retrieve them via
6547 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6548 the name of your record type.
6550 The split tactic 3) conceptually simplifies by the following rule:
6552 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6554 Thus any record variable that is bound by meta-all will automatically
6555 blow up into some record constructor term, consequently the
6556 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6557 solve record problems automatically.
6560 * reorganized the main HOL image: HOL/Integ and String loaded by
6561 default; theory Main includes everything;
6563 * automatic simplification of integer sums and comparisons, using cancellation;
6565 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6567 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6569 * many new identities for unions, intersections, set difference, etc.;
6571 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6572 called split_if, split_split, split_sum_case and split_nat_case (to go
6573 with add/delsplits);
6575 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6576 (?x::unit) = (); this is made part of the default simpset, which COULD
6577 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6578 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6579 unit_abs_eta_conv is added in order to counter the effect of
6580 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6583 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6586 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6587 It and 'sym RS equals0D' are now in the default claset, giving automatic
6588 disjointness reasoning but breaking a few old proofs.
6590 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6591 to 'converse' from 'inverse' (for compatibility with ZF and some
6594 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6595 the well-founded relation;
6597 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6598 Compl A. The "Compl" syntax remains available as input syntax for this
6601 * HOL/Update: new theory of function updates:
6602 f(a:=b) == %x. if x=a then b else f x
6603 may also be iterated as in f(a:=b,c:=d,...);
6605 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6608 - new function list_update written xs[i:=v] that updates the i-th
6609 list position. May also be iterated as in xs[i:=a,j:=b,...].
6610 - new function `upt' written [i..j(] which generates the list
6611 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6612 bound write [i..j], which is a shorthand for [i..j+1(].
6613 - new lexicographic orderings and corresponding wellfoundedness theorems.
6616 - removed 'pred' (predecessor) function;
6617 - generalized some theorems about n-1;
6618 - many new laws about "div" and "mod";
6619 - new laws about greatest common divisors (see theory ex/Primes);
6621 * HOL/Relation: renamed the relational operator r^-1 "converse"
6622 instead of "inverse";
6624 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6625 of the multiset ordering;
6627 * directory HOL/Real: a construction of the reals using Dedekind cuts
6628 (not included by default);
6630 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6632 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6633 programs, i.e. different program variables may have different types.
6635 * calling (stac rew i) now fails if "rew" has no effect on the goal
6636 [previously, this check worked only if the rewrite rule was unconditional]
6637 Now rew can involve either definitions or equalities (either == or =).
6642 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6643 only the theorems proved on ZF.ML;
6645 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6646 It and 'sym RS equals0D' are now in the default claset, giving automatic
6647 disjointness reasoning but breaking a few old proofs.
6649 * ZF/Update: new theory of function updates
6650 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6651 may also be iterated as in f(a:=b,c:=d,...);
6653 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6655 * calling (stac rew i) now fails if "rew" has no effect on the goal
6656 [previously, this check worked only if the rewrite rule was unconditional]
6657 Now rew can involve either definitions or equalities (either == or =).
6659 * case_tac provided for compatibility with HOL
6660 (like the old excluded_middle_tac, but with subgoals swapped)
6663 *** Internal programming interfaces ***
6665 * Pure: several new basic modules made available for general use, see
6666 also src/Pure/README;
6668 * improved the theory data mechanism to support encapsulation (data
6669 kind name replaced by private Object.kind, acting as authorization
6670 key); new type-safe user interface via functor TheoryDataFun; generic
6671 print_data function becomes basically useless;
6673 * removed global_names compatibility flag -- all theory declarations
6674 are qualified by default;
6676 * module Pure/Syntax now offers quote / antiquote translation
6677 functions (useful for Hoare logic etc. with implicit dependencies);
6678 see HOL/ex/Antiquote for an example use;
6680 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6683 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6686 * Display.print_goals function moved to Locale.print_goals;
6688 * standard print function for goals supports current_goals_markers
6689 variable for marking begin of proof, end of proof, start of goal; the
6690 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6691 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6696 New in Isabelle98 (January 1998)
6697 --------------------------------
6699 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6701 * changed lexical syntax of terms / types: dots made part of long
6702 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6704 * simpset (and claset) reference variable replaced by functions
6705 simpset / simpset_ref;
6707 * no longer supports theory aliases (via merge) and non-trivial
6708 implicit merge of thms' signatures;
6710 * most internal names of constants changed due to qualified names;
6712 * changed Pure/Sequence interface (see Pure/seq.ML);
6715 *** General Changes ***
6717 * hierachically structured name spaces (for consts, types, axms, thms
6718 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6719 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6720 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6721 long_names for fully qualified output names; NOTE: ML programs
6722 (special tactics, packages etc.) referring to internal names may have
6723 to be adapted to cope with fully qualified names; in case of severe
6724 backward campatibility problems try setting 'global_names' at compile
6725 time to have enrything declared within a flat name space; one may also
6726 fine tune name declarations in theories via the 'global' and 'local'
6729 * reimplemented the implicit simpset and claset using the new anytype
6730 data filed in signatures; references simpset:simpset ref etc. are
6731 replaced by functions simpset:unit->simpset and
6732 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6733 to patch your ML files accordingly;
6735 * HTML output now includes theory graph data for display with Java
6736 applet or isatool browser; data generated automatically via isatool
6737 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6739 * defs may now be conditional; improved rewrite_goals_tac to handle
6740 conditional equations;
6742 * defs now admits additional type arguments, using TYPE('a) syntax;
6744 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6745 creates a new theory node; implicit merge of thms' signatures is
6746 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6747 transfer:theory->thm->thm in (rare) cases;
6749 * improved handling of draft signatures / theories; draft thms (and
6750 ctyps, cterms) are automatically promoted to real ones;
6752 * slightly changed interfaces for oracles: admit many per theory, named
6753 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6755 * print_goals: optional output of const types (set show_consts and
6758 * improved output of warnings (###) and errors (***);
6760 * subgoal_tac displays a warning if the new subgoal has type variables;
6762 * removed old README and Makefiles;
6764 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6766 * removed obsolete init_pps and init_database;
6768 * deleted the obsolete tactical STATE, which was declared by
6769 fun STATE tacfun st = tacfun st st;
6771 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6772 (which abbreviates $HOME);
6774 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6775 use isatool fixseq to adapt your ML programs (this works for fully
6776 qualified references to the Sequence structure only!);
6778 * use_thy no longer requires writable current directory; it always
6779 reloads .ML *and* .thy file, if either one is out of date;
6782 *** Classical Reasoner ***
6784 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6785 tactics that use classical reasoning to simplify a subgoal without
6786 splitting it into several subgoals;
6788 * Safe_tac: like safe_tac but uses the default claset;
6793 * added simplification meta rules:
6794 (asm_)(full_)simplify: simpset -> thm -> thm;
6796 * simplifier.ML no longer part of Pure -- has to be loaded by object
6799 * added prems argument to simplification procedures;
6801 * HOL, FOL, ZF: added infix function `addsplits':
6802 instead of `<simpset> setloop (split_tac <thms>)'
6803 you can simply write `<simpset> addsplits <thms>'
6808 * TYPE('a) syntax for type reflection terms;
6810 * no longer handles consts with name "" -- declare as 'syntax' instead;
6812 * pretty printer: changed order of mixfix annotation preference (again!);
6814 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6819 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6820 with `addloop' of the simplifier to faciliate case splitting in premises.
6822 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6824 * HOL/Auth: new protocol proofs including some for the Internet
6827 * HOL/Map: new theory of `maps' a la VDM;
6829 * HOL/simplifier: simplification procedures nat_cancel_sums for
6830 cancelling out common nat summands from =, <, <= (in)equalities, or
6831 differences; simplification procedures nat_cancel_factor for
6832 cancelling common factor from =, <, <= (in)equalities over natural
6833 sums; nat_cancel contains both kinds of procedures, it is installed by
6834 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6836 * HOL/simplifier: terms of the form
6837 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6839 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6840 and those of the form
6841 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6843 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6846 Each datatype `t' now comes with a theorem `split_t_case' of the form
6848 P(t_case f1 ... fn x) =
6849 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6851 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6854 and a theorem `split_t_case_asm' of the form
6856 P(t_case f1 ... fn x) =
6857 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6859 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6861 which can be added to a simpset via `addsplits'. The existing theorems
6862 expand_list_case and expand_option_case have been renamed to
6863 split_list_case and split_option_case.
6866 - `pred n' is automatically converted to `n-1'.
6867 Users are strongly encouraged not to use `pred' any longer,
6868 because it will disappear altogether at some point.
6869 - Users are strongly encouraged to write "0 < n" rather than
6870 "n ~= 0". Theorems and proof tools have been modified towards this
6874 the function "set_of_list" has been renamed "set" (and its theorems too);
6875 the function "nth" now takes its arguments in the reverse order and
6876 has acquired the infix notation "!" as in "xs!n".
6878 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6880 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6881 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6883 * HOL/record: extensible records with schematic structural subtyping
6884 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6885 still lacks various theorems and concrete record syntax;
6890 * removed "axioms" and "generated by" sections;
6892 * replaced "ops" section by extended "consts" section, which is capable of
6893 handling the continuous function space "->" directly;
6896 . proves theorems immediately and stores them in the theory,
6897 . creates hierachical name space,
6898 . now uses normal mixfix annotations (instead of cinfix...),
6899 . minor changes to some names and values (for consistency),
6900 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6901 . separator between mutual domain defs: changed "," to "and",
6902 . improved handling of sort constraints; now they have to
6903 appear on the left-hand side of the equations only;
6905 * fixed LAM <x,y,zs>.b syntax;
6907 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6908 adm (%x. P (t x)), where P is chainfinite and t continuous;
6913 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6914 with `addloop' of the simplifier to faciliate case splitting in premises.
6916 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6917 in HOL, they strip ALL and --> from proved theorems;
6921 New in Isabelle94-8 (May 1997)
6922 ------------------------------
6924 *** General Changes ***
6926 * new utilities to build / run / maintain Isabelle etc. (in parts
6927 still somewhat experimental); old Makefiles etc. still functional;
6929 * new 'Isabelle System Manual';
6931 * INSTALL text, together with ./configure and ./build scripts;
6933 * reimplemented type inference for greater efficiency, better error
6934 messages and clean internal interface;
6936 * prlim command for dealing with lots of subgoals (an easier way of
6937 setting goals_limit);
6942 * supports alternative (named) syntax tables (parser and pretty
6943 printer); internal interface is provided by add_modesyntax(_i);
6945 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6946 be used in conjunction with the Isabelle symbol font; uses the
6947 "symbols" syntax table;
6949 * added token_translation interface (may translate name tokens in
6950 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6951 the current print_mode); IMPORTANT: user print translation functions
6952 are responsible for marking newly introduced bounds
6953 (Syntax.mark_boundT);
6955 * token translations for modes "xterm" and "xterm_color" that display
6956 names in bold, underline etc. or colors (which requires a color
6959 * infixes may now be declared with names independent of their syntax;
6961 * added typed_print_translation (like print_translation, but may
6962 access type of constant);
6965 *** Classical Reasoner ***
6967 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6968 some limitations. Blast_tac...
6969 + ignores addss, addbefore, addafter; this restriction is intrinsic
6970 + ignores elimination rules that don't have the correct format
6971 (the conclusion MUST be a formula variable)
6972 + ignores types, which can make HOL proofs fail
6973 + rules must not require higher-order unification, e.g. apply_type in ZF
6974 [message "Function Var's argument not a bound variable" relates to this]
6975 + its proof strategy is more general but can actually be slower
6977 * substitution with equality assumptions no longer permutes other
6980 * minor changes in semantics of addafter (now called addaltern); renamed
6981 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6982 (and access functions for it);
6984 * improved combination of classical reasoner and simplifier:
6985 + functions for handling clasimpsets
6986 + improvement of addss: now the simplifier is called _after_ the
6988 + safe variant of addss called addSss: uses safe simplifications
6989 _during_ the safe steps. It is more complete as it allows multiple
6990 instantiations of unknowns (e.g. with slow_tac).
6994 * added interface for simplification procedures (functions that
6995 produce *proven* rewrite rules on the fly, depending on current
6998 * ordering on terms as parameter (used for ordered rewriting);
7000 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
7002 * the solver is now split into a safe and an unsafe part.
7003 This should be invisible for the normal user, except that the
7004 functions setsolver and addsolver have been renamed to setSolver and
7005 addSolver; added safe_asm_full_simp_tac;
7010 * a generic induction tactic `induct_tac' which works for all datatypes and
7011 also for type `nat';
7013 * a generic case distinction tactic `exhaust_tac' which works for all
7014 datatypes and also for type `nat';
7016 * each datatype comes with a function `size';
7018 * patterns in case expressions allow tuple patterns as arguments to
7019 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
7021 * primrec now also works with type nat;
7023 * recdef: a new declaration form, allows general recursive functions to be
7024 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
7026 * the constant for negation has been renamed from "not" to "Not" to
7027 harmonize with FOL, ZF, LK, etc.;
7029 * HOL/ex/LFilter theory of a corecursive "filter" functional for
7032 * HOL/Modelcheck demonstrates invocation of model checker oracle;
7034 * HOL/ex/Ring.thy declares cring_simp, which solves equational
7035 problems in commutative rings, using axiomatic type classes for + and *;
7037 * more examples in HOL/MiniML and HOL/Auth;
7039 * more default rewrite rules for quantifiers, union/intersection;
7041 * a new constant `arbitrary == @x.False';
7043 * HOLCF/IOA replaces old HOL/IOA;
7045 * HOLCF changes: derived all rules and arities
7046 + axiomatic type classes instead of classes
7047 + typedef instead of faking type definitions
7048 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
7049 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
7050 + eliminated the types void, one, tr
7051 + use unit lift and bool lift (with translations) instead of one and tr
7052 + eliminated blift from Lift3.thy (use Def instead of blift)
7053 all eliminated rules are derived as theorems --> no visible changes ;
7058 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
7059 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
7060 as ZF_cs addSIs [equalityI];
7064 New in Isabelle94-7 (November 96)
7065 ---------------------------------
7067 * allowing negative levels (as offsets) in prlev and choplev;
7069 * super-linear speedup for large simplifications;
7071 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7072 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7073 FAIL); can suppress it using the command Delsimps (ex_simps @
7074 all_simps); De Morgan laws are also now included, by default;
7076 * improved printing of ==> : ~:
7078 * new object-logic "Sequents" adds linear logic, while replacing LK
7079 and Modal (thanks to Sara Kalvala);
7081 * HOL/Auth: correctness proofs for authentication protocols;
7083 * HOL: new auto_tac combines rewriting and classical reasoning (many
7084 examples on HOL/Auth);
7086 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7087 the rewriter and classical reasoner simultaneously;
7089 * function uresult no longer returns theorems in "standard" format;
7090 regain previous version by: val uresult = standard o uresult;
7097 * oracles -- these establish an interface between Isabelle and trusted
7098 external reasoners, which may deliver results as theorems;
7100 * proof objects (in particular record all uses of oracles);
7102 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7104 * "constdefs" section in theory files;
7106 * "primrec" section (HOL) no longer requires names;
7108 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7115 * reduced space requirements;
7117 * automatic HTML generation from theories;
7119 * theory files no longer require "..." (quotes) around most types;
7121 * new examples, including two proofs of the Church-Rosser theorem;
7123 * non-curried (1994) version of HOL is no longer distributed;
7130 * greatly reduced space requirements;
7132 * theory files (.thy) no longer require \...\ escapes at line breaks;
7134 * searchable theorem database (see the section "Retrieving theorems" on
7135 page 8 of the Reference Manual);
7137 * new examples, including Grabczewski's monumental case study of the
7140 * The previous version of HOL renamed to Old_HOL;
7142 * The new version of HOL (previously called CHOL) uses a curried syntax
7143 for functions. Application looks like f a b instead of f(a,b);
7145 * Mutually recursive inductive definitions finally work in HOL;
7147 * In ZF, pattern-matching on tuples is now available in all abstractions and
7148 translates to the operator "split";
7155 * new infix operator, addss, allowing the classical reasoner to
7156 perform simplification at each step of its search. Example:
7157 fast_tac (cs addss ss)
7159 * a new logic, CHOL, the same as HOL, but with a curried syntax
7160 for functions. Application looks like f a b instead of f(a,b). Also pairs
7161 look like (a,b) instead of <a,b>;
7163 * PLEASE NOTE: CHOL will eventually replace HOL!
7165 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7166 It translates to the operator "split". A new theory of integers is available;
7168 * In ZF, integer numerals now denote two's-complement binary integers.
7169 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7171 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7172 of the Axiom of Choice;
7179 * Significantly faster resolution;
7181 * the different sections in a .thy file can now be mixed and repeated
7184 * Database of theorems for FOL, HOL and ZF. New
7185 commands including qed, qed_goal and bind_thm store theorems in the database.
7187 * Simple database queries: return a named theorem (get_thm) or all theorems of
7188 a given theory (thms_of), or find out what theory a theorem was proved in
7191 * Bugs fixed in the inductive definition and datatype packages;
7193 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7194 and HOL_dup_cs obsolete;
7196 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7199 * Simpler definition of function space in ZF;
7201 * new results about cardinal and ordinal arithmetic in ZF;
7203 * 'subtype' facility in HOL for introducing new types as subsets of existing
7206 :mode=text:wrap=hard:maxLineLen=72: