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 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is no
147 longer shadowed. INCOMPATIBILITY.
149 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
152 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
155 * Dropped normalizing_semiring etc; use the facts in semiring classes
156 instead. INCOMPATIBILITY.
158 * Theory 'Finite_Set': various folding_XXX locales facilitate the
159 application of the various fold combinators on finite sets.
161 * Library theory "RBT" renamed to "RBT_Impl"; new library theory "RBT"
162 provides abstract red-black tree type which is backed by "RBT_Impl" as
163 implementation. INCOMPATIBILTY.
165 * Command 'typedef' now works within a local theory context -- without
166 introducing dependencies on parameters or assumptions, which is not
167 possible in Isabelle/Pure/HOL. Note that the logical environment may
168 contain multiple interpretations of local typedefs (with different
169 non-emptiness proofs), even in a global theory context.
171 * Theory Library/Coinductive_List has been removed -- superseded by
172 AFP/thys/Coinductive.
174 * Theory PReal, including the type "preal" and related operations, has
175 been removed. INCOMPATIBILITY.
177 * Split off theory Big_Operators containing setsum, setprod, Inf_fin,
178 Sup_fin, Min, Max from theory Finite_Set. INCOMPATIBILITY.
180 * Theory "Rational" renamed to "Rat", for consistency with "Nat",
181 "Int" etc. INCOMPATIBILITY.
183 * New set of rules "ac_simps" provides combined assoc / commute
184 rewrites for all interpretations of the appropriate generic locales.
186 * Renamed theory "OrderedGroup" to "Groups" and split theory
187 "Ring_and_Field" into theories "Rings" and "Fields"; for more
188 appropriate and more consistent names suitable for name prefixes
189 within the HOL theories. INCOMPATIBILITY.
191 * Some generic constants have been put to appropriate theories:
192 - less_eq, less: Orderings
193 - zero, one, plus, minus, uminus, times, abs, sgn: Groups
194 - inverse, divide: Rings
197 * More consistent naming of type classes involving orderings (and
200 lower_semilattice ~> semilattice_inf
201 upper_semilattice ~> semilattice_sup
203 dense_linear_order ~> dense_linorder
205 pordered_ab_group_add ~> ordered_ab_group_add
206 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
207 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
208 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
209 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
210 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
211 pordered_cancel_semiring ~> ordered_cancel_semiring
212 pordered_comm_monoid_add ~> ordered_comm_monoid_add
213 pordered_comm_ring ~> ordered_comm_ring
214 pordered_comm_semiring ~> ordered_comm_semiring
215 pordered_ring ~> ordered_ring
216 pordered_ring_abs ~> ordered_ring_abs
217 pordered_semiring ~> ordered_semiring
219 ordered_ab_group_add ~> linordered_ab_group_add
220 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
221 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
222 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
223 ordered_field ~> linordered_field
224 ordered_field_no_lb ~> linordered_field_no_lb
225 ordered_field_no_ub ~> linordered_field_no_ub
226 ordered_field_dense_linear_order ~> dense_linordered_field
227 ordered_idom ~> linordered_idom
228 ordered_ring ~> linordered_ring
229 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
230 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
231 ordered_ring_strict ~> linordered_ring_strict
232 ordered_semidom ~> linordered_semidom
233 ordered_semiring ~> linordered_semiring
234 ordered_semiring_1 ~> linordered_semiring_1
235 ordered_semiring_1_strict ~> linordered_semiring_1_strict
236 ordered_semiring_strict ~> linordered_semiring_strict
238 The following slightly odd type classes have been moved to a
239 separate theory Library/Lattice_Algebras.thy:
241 lordered_ab_group_add ~> lattice_ab_group_add
242 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
243 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
244 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
245 lordered_ring ~> lattice_ring
249 * Refined field classes:
250 - classes division_ring_inverse_zero, field_inverse_zero,
251 linordered_field_inverse_zero include rule inverse 0 = 0 --
252 subsumes former division_by_zero class;
253 - numerous lemmas have been ported from field to division_ring.
256 * Refined algebra theorem collections:
257 - dropped theorem group group_simps, use algebra_simps instead;
258 - dropped theorem group ring_simps, use field_simps instead;
259 - proper theorem collection field_simps subsumes former theorem
260 groups field_eq_simps and field_simps;
261 - dropped lemma eq_minus_self_iff which is a duplicate for
265 * Theory Finite_Set and List: some lemmas have been generalized from
268 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
269 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
270 inter_Inter_fold_inter ~> inf_Inf_fold_inf
271 union_Union_fold_union ~> sup_Sup_fold_sup
272 Inter_fold_inter ~> Inf_fold_inf
273 Union_fold_union ~> Sup_fold_sup
274 inter_INTER_fold_inter ~> inf_INFI_fold_inf
275 union_UNION_fold_union ~> sup_SUPR_fold_sup
276 INTER_fold_inter ~> INFI_fold_inf
277 UNION_fold_union ~> SUPR_fold_sup
279 * Theory Complete_Lattice: lemmas top_def and bot_def have been
280 replaced by the more convenient lemmas Inf_empty and Sup_empty.
281 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
282 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
283 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
284 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
286 * HOLogic.strip_psplit: types are returned in syntactic order, similar
287 to other strip and tuple operations. INCOMPATIBILITY.
289 * Reorganized theory Multiset: swapped notation of pointwise and
291 - pointwise ordering is instance of class order with standard syntax
293 - multiset ordering has syntax <=# and <#; partial order properties
294 are provided by means of interpretation with prefix
296 - less duplication, less historical organization of sections,
297 conversion from associations lists to multisets, rudimentary code
299 - use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union,
302 multiset_eq_conv_count_eq -> multiset_ext_iff
303 multi_count_ext -> multiset_ext
304 diff_union_inverse2 -> diff_union_cancelR
307 * Theory Permutation: replaced local "remove" by List.remove1.
309 * Code generation: ML and OCaml code is decorated with signatures.
311 * Theory List: added transpose.
313 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
314 clash with new theory Quotient in Main HOL.
316 * Library/Nat_Bijection.thy is a collection of bijective functions
317 between nat and other types, which supersedes the older libraries
318 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
321 Nat_Int_Bij.nat2_to_nat ~> prod_encode
322 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
323 Nat_Int_Bij.int_to_nat_bij ~> int_encode
324 Nat_Int_Bij.nat_to_int_bij ~> int_decode
325 Countable.pair_encode ~> prod_encode
326 NatIso.prod2nat ~> prod_encode
327 NatIso.nat2prod ~> prod_decode
328 NatIso.sum2nat ~> sum_encode
329 NatIso.nat2sum ~> sum_decode
330 NatIso.list2nat ~> list_encode
331 NatIso.nat2list ~> list_decode
332 NatIso.set2nat ~> set_encode
333 NatIso.nat2set ~> set_decode
336 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
337 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
338 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
339 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
340 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
341 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
342 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
343 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
344 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
345 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
346 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
347 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
348 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
351 - Added and implemented "binary_ints" and "bits" options.
352 - Added "std" option and implemented support for nonstandard models.
353 - Added and implemented "finitize" option to improve the precision
354 of infinite datatypes based on a monotonicity analysis.
355 - Added support for quotient types.
356 - Added support for "specification" and "ax_specification"
358 - Added support for local definitions (for "function" and
359 "termination" proofs).
360 - Added support for term postprocessors.
361 - Optimized "Multiset.multiset" and "FinFun.finfun".
362 - Improved efficiency of "destroy_constrs" optimization.
363 - Fixed soundness bugs related to "destroy_constrs" optimization and
365 - Fixed soundness bug related to higher-order constructors
366 - Improved precision of set constructs.
367 - Added cache to speed up repeated Kodkod invocations on the same
369 - Renamed "MiniSatJNI", "zChaffJNI", "BerkMinAlloy", and
370 "SAT4JLight" to "MiniSat_JNI", "zChaff_JNI", "BerkMin_Alloy", and
371 "SAT4J_Light". INCOMPATIBILITY.
372 - Removed "skolemize", "uncurry", "sym_break", "flatten_prop",
373 "sharing_depth", and "show_skolems" options. INCOMPATIBILITY.
378 * Variable names in lemmas generated by the domain package have
379 changed; the naming scheme is now consistent with the HOL datatype
380 package. Some proof scripts may be affected, INCOMPATIBILITY.
382 * The domain package no longer defines the function "foo_copy" for
383 recursive domain "foo". The reach lemma is now stated directly in
384 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
385 be reformulated in terms of "foo_take", INCOMPATIBILITY.
387 * Most definedness lemmas generated by the domain package (previously
388 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
389 like "foo$x = UU <-> x = UU", which works better as a simp rule.
390 Proof scripts that used definedness lemmas as intro rules may break,
391 potential INCOMPATIBILITY.
393 * Induction and casedist rules generated by the domain package now
394 declare proper case_names (one called "bottom", and one named for each
395 constructor). INCOMPATIBILITY.
397 * For mutually-recursive domains, separate "reach" and "take_lemma"
398 rules are generated for each domain, INCOMPATIBILITY.
400 foo_bar.reach ~> foo.reach bar.reach
401 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
403 * Some lemmas generated by the domain package have been renamed for
404 consistency with the datatype package, INCOMPATIBILITY.
406 foo.ind ~> foo.induct
407 foo.finite_ind ~> foo.finite_induct
408 foo.coind ~> foo.coinduct
409 foo.casedist ~> foo.exhaust
410 foo.exhaust ~> foo.nchotomy
412 * For consistency with other definition packages, the fixrec package
413 now generates qualified theorem names, INCOMPATIBILITY.
415 foo_simps ~> foo.simps
416 foo_unfold ~> foo.unfold
417 foo_induct ~> foo.induct
419 * The "contlub" predicate has been removed. Proof scripts should use
420 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
422 * The "admw" predicate has been removed, INCOMPATIBILITY.
424 * The constants cpair, cfst, and csnd have been removed in favor of
425 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
430 * Sorts.certify_sort and derived "cert" operations for types and terms
431 no longer minimize sorts. Thus certification at the boundary of the
432 inference kernel becomes invariant under addition of class relations,
433 which is an important monotonicity principle. Sorts are now minimized
434 in the syntax layer only, at the boundary between the end-user and the
435 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
436 explicitly in rare situations.
438 * Antiquotations for basic formal entities:
440 @{class NAME} -- type class
441 @{class_syntax NAME} -- syntax representation of the above
443 @{type_name NAME} -- logical type
444 @{type_abbrev NAME} -- type abbreviation
445 @{nonterminal NAME} -- type of concrete syntactic category
446 @{type_syntax NAME} -- syntax representation of any of the above
448 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
449 @{const_abbrev NAME} -- abbreviated constant
450 @{const_syntax NAME} -- syntax representation of any of the above
452 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
453 syntax constant (cf. 'syntax' command).
455 * Antiquotation @{make_string} inlines a function to print arbitrary
456 values similar to the ML toplevel. The result is compiler dependent
457 and may fall back on "?" in certain situations.
459 * Renamed old-style Drule.standard to Drule.export_without_context, to
460 emphasize that this is in no way a standard operation.
463 * Curried take and drop in library.ML; negative length is interpreted
464 as infinity (as in chop). INCOMPATIBILITY.
466 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
467 usual for resolution. Rare INCOMPATIBILITY.
469 * Discontinued old TheoryDataFun with its copy/init operation -- data
470 needs to be pure. Functor Theory_Data_PP retains the traditional
471 Pretty.pp argument to merge, which is absent in the standard
474 * Renamed varify/unvarify operations to varify_global/unvarify_global
475 to emphasize that these only work in a global situation (which is
478 * Configuration options now admit dynamic default values, depending on
479 the context or even global references.
481 * Most operations that refer to a global context are named
482 accordingly, e.g. Simplifier.global_context or
483 ProofContext.init_global. There are some situations where a global
484 context actually works, but under normal circumstances one needs to
485 pass the proper local context through the code!
490 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
491 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
492 proof terms are enabled unconditionally in the new HOL-Proofs image.
494 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
495 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
498 * Old lib/scripts/polyml-platform is superseded by the
499 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
500 variant, even on a 64 bit machine. The following example setting
501 prefers 64 bit if available:
503 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
507 New in Isabelle2009-1 (December 2009)
508 -------------------------------------
512 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
513 one backslash should be used, even in ML sources.
518 * Locale interpretation propagates mixins along the locale hierarchy.
519 The currently only available mixins are the equations used to map
520 local definitions to terms of the target domain of an interpretation.
522 * Reactivated diagnostic command 'print_interps'. Use "print_interps
523 loc" to print all interpretations of locale "loc" in the theory.
524 Interpretations in proofs are not shown.
526 * Thoroughly revised locales tutorial. New section on conditional
529 * On instantiation of classes, remaining undefined class parameters
530 are formally declared. INCOMPATIBILITY.
533 *** Document preparation ***
535 * New generalized style concept for printing terms: @{foo (style) ...}
536 instead of @{foo_style style ...} (old form is still retained for
537 backward compatibility). Styles can be also applied for
538 antiquotations prop, term_type and typeof.
543 * New proof method "smt" for a combination of first-order logic with
544 equality, linear and nonlinear (natural/integer/real) arithmetic, and
545 fixed-size bitvectors; there is also basic support for higher-order
546 features (esp. lambda abstractions). It is an incomplete decision
547 procedure based on external SMT solvers using the oracle mechanism;
548 for the SMT solver Z3, this method is proof-producing. Certificates
549 are provided to avoid calling the external solvers solely for
550 re-checking proofs. Due to a remote SMT service there is no need for
551 installing SMT solvers locally. See src/HOL/SMT.
553 * New commands to load and prove verification conditions generated by
554 the Boogie program verifier or derived systems (e.g. the Verifying C
555 Compiler (VCC) or Spec#). See src/HOL/Boogie.
557 * New counterexample generator tool 'nitpick' based on the Kodkod
558 relational model finder. See src/HOL/Tools/Nitpick and
559 src/HOL/Nitpick_Examples.
561 * New commands 'code_pred' and 'values' to invoke the predicate
562 compiler and to enumerate values of inductive predicates.
564 * A tabled implementation of the reflexive transitive closure.
566 * New implementation of quickcheck uses generic code generator;
567 default generators are provided for all suitable HOL types, records
568 and datatypes. Old quickcheck can be re-activated importing theory
569 Library/SML_Quickcheck.
571 * New testing tool Mirabelle for automated proof tools. Applies
572 several tools and tactics like sledgehammer, metis, or quickcheck, to
573 every proof step in a theory. To be used in batch mode via the
576 * New proof method "sos" (sum of squares) for nonlinear real
577 arithmetic (originally due to John Harison). It requires theory
578 Library/Sum_Of_Squares. It is not a complete decision procedure but
579 works well in practice on quantifier-free real arithmetic with +, -,
580 *, ^, =, <= and <, i.e. boolean combinations of equalities and
581 inequalities between polynomials. It makes use of external
582 semidefinite programming solvers. Method "sos" generates a
583 certificate that can be pasted into the proof thus avoiding the need
584 to call an external tool every time the proof is checked. See
585 src/HOL/Library/Sum_Of_Squares.
587 * New method "linarith" invokes existing linear arithmetic decision
590 * New command 'atp_minimal' reduces result produced by Sledgehammer.
592 * New Sledgehammer option "Full Types" in Proof General settings menu.
593 Causes full type information to be output to the ATPs. This slows
594 ATPs down considerably but eliminates a source of unsound "proofs"
597 * New method "metisFT": A version of metis that uses full type
598 information in order to avoid failures of proof reconstruction.
600 * New evaluator "approximate" approximates an real valued term using
601 the same method as the approximation method.
603 * Method "approximate" now supports arithmetic expressions as
604 boundaries of intervals and implements interval splitting and Taylor
607 * ML antiquotation @{code_datatype} inserts definition of a datatype
608 generated by the code generator; e.g. see src/HOL/Predicate.thy.
610 * New theory SupInf of the supremum and infimum operators for sets of
613 * New theory Probability, which contains a development of measure
614 theory, eventually leading to Lebesgue integration and probability.
616 * Extended Multivariate Analysis to include derivation and Brouwer's
619 * Reorganization of number theory, INCOMPATIBILITY:
620 - new number theory development for nat and int, in theories Divides
621 and GCD as well as in new session Number_Theory
622 - some constants and facts now suffixed with _nat and _int
624 - former session NumberTheory now named Old_Number_Theory, including
625 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
626 - moved theory Pocklington from src/HOL/Library to
627 src/HOL/Old_Number_Theory
629 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
630 lcm of finite and infinite sets. It is shown that they form a complete
633 * Class semiring_div requires superclass no_zero_divisors and proof of
634 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
635 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
636 generalized to class semiring_div, subsuming former theorems
637 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
638 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
641 * Refinements to lattice classes and sets:
642 - less default intro/elim rules in locale variant, more default
643 intro/elim rules in class variant: more uniformity
644 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
646 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
648 - renamed ACI to inf_sup_aci
649 - new class "boolean_algebra"
650 - class "complete_lattice" moved to separate theory
651 "Complete_Lattice"; corresponding constants (and abbreviations)
652 renamed and with authentic syntax:
653 Set.Inf ~> Complete_Lattice.Inf
654 Set.Sup ~> Complete_Lattice.Sup
655 Set.INFI ~> Complete_Lattice.INFI
656 Set.SUPR ~> Complete_Lattice.SUPR
657 Set.Inter ~> Complete_Lattice.Inter
658 Set.Union ~> Complete_Lattice.Union
659 Set.INTER ~> Complete_Lattice.INTER
660 Set.UNION ~> Complete_Lattice.UNION
661 - authentic syntax for
664 - mere abbreviations:
667 Set.inter (for inf, formerly Set.Int)
668 Set.union (for sup, formerly Set.Un)
669 Complete_Lattice.Inter (for Inf)
670 Complete_Lattice.Union (for Sup)
671 Complete_Lattice.INTER (for INFI)
672 Complete_Lattice.UNION (for SUPR)
673 - object-logic definitions as far as appropriate
675 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
676 Un_subset_iff are explicitly deleted as default simp rules; then also
677 their lattice counterparts le_inf_iff and le_sup_iff have to be
678 deleted to achieve the desired effect.
680 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
681 rules by default any longer; the same applies to min_max.inf_absorb1
682 etc. INCOMPATIBILITY.
684 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
685 pred_set_conv by default. INCOMPATIBILITY.
687 * Power operations on relations and functions are now one dedicated
688 constant "compow" with infix syntax "^^". Power operation on
689 multiplicative monoids retains syntax "^" and is now defined generic
690 in class power. INCOMPATIBILITY.
692 * Relation composition "R O S" now has a more standard argument order:
693 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
694 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
695 break, since the O_assoc rule was not rewritten like this. Fix using
696 O_assoc[symmetric]. The same applies to the curried version "R OO S".
698 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
699 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
702 * Most rules produced by inductive and datatype package have mandatory
703 prefixes. INCOMPATIBILITY.
705 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
706 the attribute of the same name. Each of the theorems in the list
707 DERIV_intros assumes composition with an additional function and
708 matches a variable to the derivative, which has to be solved by the
709 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
710 of most elementary terms. Former Maclauren.DERIV_tac and
711 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
714 * Code generator attributes follow the usual underscore convention:
715 code_unfold replaces code unfold
716 code_post replaces code post
721 sizechange -> size_change
722 induct_scheme -> induction_schema
725 * Discontinued abbreviation "arbitrary" of constant "undefined".
726 INCOMPATIBILITY, use "undefined" directly.
729 Suc_eq_add_numeral_1 -> Suc_eq_plus1
730 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
731 Suc_plus1 -> Suc_eq_plus1
732 *anti_sym -> *antisym*
733 vector_less_eq_def -> vector_le_def
736 * Added theorem List.map_map as [simp]. Removed List.map_compose.
739 * Removed predicate "M hassize n" (<--> card M = n & finite M).
745 * Theory Representable defines a class "rep" of domains that are
746 representable (via an ep-pair) in the universal domain type "udom".
747 Instances are provided for all type constructors defined in HOLCF.
749 * The 'new_domain' command is a purely definitional version of the
750 domain package, for representable domains. Syntax is identical to the
751 old domain package. The 'new_domain' package also supports indirect
752 recursion using previously-defined type constructors. See
753 src/HOLCF/ex/New_Domain.thy for examples.
755 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
756 on the left-hand side of an equation, and then performs
757 simplification. Rewriting is done using rules declared with the
758 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
759 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
761 * The pattern-match compiler in 'fixrec' can now handle constructors
762 with HOL function types. Pattern-match combinators for the Pair
763 constructor are pre-configured.
765 * The 'fixrec' package now produces better fixed-point induction rules
766 for mutually-recursive definitions: Induction rules have conclusions
767 of the form "P foo bar" instead of "P <foo, bar>".
769 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
770 been renamed to "below". The name "below" now replaces "less" in many
771 theorem names. (Legacy theorem names using "less" are still supported
774 * The 'fixrec' package now supports "bottom patterns". Bottom
775 patterns can be used to generate strictness rules, or to make
776 functions more strict (much like the bang-patterns supported by the
777 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
783 * Support for Poly/ML 5.3.0, with improved reporting of compiler
784 errors and run-time exceptions, including detailed source positions.
786 * Structure Name_Space (formerly NameSpace) now manages uniquely
787 identified entries, with some additional information such as source
788 position, logical grouping etc.
790 * Theory and context data is now introduced by the simplified and
791 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
792 to be pure, but the old TheoryDataFun for mutable data (with explicit
793 copy operation) is still available for some time.
795 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
796 provides a high-level programming interface to synchronized state
797 variables with atomic update. This works via pure function
798 application within a critical section -- its runtime should be as
799 short as possible; beware of deadlocks if critical code is nested,
800 either directly or indirectly via other synchronized variables!
802 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
803 wraps raw ML references, explicitly indicating their non-thread-safe
804 behaviour. The Isar toplevel keeps this structure open, to
805 accommodate Proof General as well as quick and dirty interactive
806 experiments with references.
808 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
809 parallel tactical reasoning.
811 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
812 are similar to SUBPROOF, but are slightly more flexible: only the
813 specified parts of the subgoal are imported into the context, and the
814 body tactic may introduce new subgoals and schematic variables.
816 * Old tactical METAHYPS, which does not observe the proof context, has
817 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
818 or Subgoal.FOCUS etc.
820 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
821 functors have their own ML name space there is no point to mark them
822 separately.) Minor INCOMPATIBILITY.
824 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
826 * Renamed several structures FooBar to Foo_Bar. Occasional,
829 * Operations of structure Skip_Proof no longer require quick_and_dirty
830 mode, which avoids critical setmp.
832 * Eliminated old Attrib.add_attributes, Method.add_methods and related
833 combinators for "args". INCOMPATIBILITY, need to use simplified
834 Attrib/Method.setup introduced in Isabelle2009.
836 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
837 back on global_simpset_of, global_claset_of, global_clasimpset_of as
838 last resort. INCOMPATIBILITY.
840 * Display.pretty_thm now requires a proper context (cf. former
841 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
842 or even Display.pretty_thm_without_context as last resort.
845 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
846 Syntax.pretty_typ/term directly, preferably with proper context
847 instead of global theory.
852 * Further fine tuning of parallel proof checking, scales up to 8 cores
853 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
856 * Support for additional "Isabelle components" via etc/components, see
857 also the system manual.
859 * The isabelle makeall tool now operates on all components with
860 IsaMakefile, not just hardwired "logics".
862 * Removed "compress" option from isabelle-process and isabelle usedir;
863 this is always enabled.
865 * Discontinued support for Poly/ML 4.x versions.
867 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
868 on a given logic image. This requires the lighttpd webserver and is
869 currently supported on Linux only.
873 New in Isabelle2009 (April 2009)
874 --------------------------------
878 * Simplified main Isabelle executables, with less surprises on
879 case-insensitive file-systems (such as Mac OS).
881 - The main Isabelle tool wrapper is now called "isabelle" instead of
884 - The former "isabelle" alias for "isabelle-process" has been
885 removed (should rarely occur to regular users).
887 - The former "isabelle-interface" and its alias "Isabelle" have been
888 removed (interfaces are now regular Isabelle tools).
890 Within scripts and make files, the Isabelle environment variables
891 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
892 respectively. (The latter are still available as legacy feature.)
894 The old isabelle-interface wrapper could react in confusing ways if
895 the interface was uninstalled or changed otherwise. Individual
896 interface tool configuration is now more explicit, see also the
897 Isabelle system manual. In particular, Proof General is now available
898 via "isabelle emacs".
900 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
901 purge installed copies of Isabelle executables and re-run "isabelle
902 install -p ...", or use symlinks.
904 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
905 old ~/isabelle, which was slightly non-standard and apt to cause
906 surprises on case-insensitive file-systems (such as Mac OS).
908 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
909 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
910 care is required when using older releases of Isabelle. Note that
911 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
912 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
914 * Proofs of fully specified statements are run in parallel on
915 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
916 a regular 4-core machine, if the initial heap space is made reasonably
917 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
919 * The main reference manuals ("isar-ref", "implementation", and
920 "system") have been updated and extended. Formally checked references
921 as hyperlinks are now available uniformly.
926 * Complete re-implementation of locales. INCOMPATIBILITY in several
927 respects. The most important changes are listed below. See the
928 Tutorial on Locales ("locales" manual) for details.
930 - In locale expressions, instantiation replaces renaming. Parameters
931 must be declared in a for clause. To aid compatibility with previous
932 parameter inheritance, in locale declarations, parameters that are not
933 'touched' (instantiation position "_" or omitted) are implicitly added
934 with their syntax at the beginning of the for clause.
936 - Syntax from abbreviations and definitions in locales is available in
937 locale expressions and context elements. The latter is particularly
938 useful in locale declarations.
940 - More flexible mechanisms to qualify names generated by locale
941 expressions. Qualifiers (prefixes) may be specified in locale
942 expressions, and can be marked as mandatory (syntax: "name!:") or
943 optional (syntax "name?:"). The default depends for plain "name:"
944 depends on the situation where a locale expression is used: in
945 commands 'locale' and 'sublocale' prefixes are optional, in
946 'interpretation' and 'interpret' prefixes are mandatory. The old
947 implicit qualifiers derived from the parameter names of a locale are
950 - Command "sublocale l < e" replaces "interpretation l < e". The
951 instantiation clause in "interpretation" and "interpret" (square
952 brackets) is no longer available. Use locale expressions.
954 - When converting proof scripts, mandatory qualifiers in
955 'interpretation' and 'interpret' should be retained by default, even
956 if this is an INCOMPATIBILITY compared to former behavior. In the
957 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
958 in locale expressions range over a single locale instance only.
960 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
961 In existing theorem specifications replace the includes element by the
962 respective context elements of the included locale, omitting those
963 that are already present in the theorem specification. Multiple
964 assume elements of a locale should be replaced by a single one
965 involving the locale predicate. In the proof body, declarations (most
966 notably theorems) may be regained by interpreting the respective
967 locales in the proof context as required (command "interpret").
969 If using "includes" in replacement of a target solely because the
970 parameter types in the theorem are not as general as in the target,
971 consider declaring a new locale with additional type constraints on
972 the parameters (context element "constrains").
974 - Discontinued "locale (open)". INCOMPATIBILITY.
976 - Locale interpretation commands no longer attempt to simplify goal.
977 INCOMPATIBILITY: in rare situations the generated goal differs. Use
978 methods intro_locales and unfold_locales to clarify.
980 - Locale interpretation commands no longer accept interpretation
981 attributes. INCOMPATIBILITY.
983 * Class declaration: so-called "base sort" must not be given in import
984 list any longer, but is inferred from the specification. Particularly
991 class foo = type + ...
993 * Class target: global versions of theorems stemming do not carry a
994 parameter prefix any longer. INCOMPATIBILITY.
996 * Class 'instance' command no longer accepts attached definitions.
997 INCOMPATIBILITY, use proper 'instantiation' target instead.
999 * Recovered hiding of consts, which was accidentally broken in
1000 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
1001 makes c inaccessible; consider using ``hide (open) const c'' instead.
1003 * Slightly more coherent Pure syntax, with updated documentation in
1004 isar-ref manual. Removed locales meta_term_syntax and
1005 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
1006 INCOMPATIBILITY in rare situations. Note that &&& should not be used
1007 directly in regular applications.
1009 * There is a new syntactic category "float_const" for signed decimal
1010 fractions (e.g. 123.45 or -123.45).
1012 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
1013 interface with 'setup' command instead.
1015 * Command 'local_setup' is similar to 'setup', but operates on a local
1018 * The 'axiomatization' command now only works within a global theory
1019 context. INCOMPATIBILITY.
1021 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
1022 hypotheses. Sorts required in the course of reasoning need to be
1023 covered by the constraints in the initial statement, completed by the
1024 type instance information of the background theory. Non-trivial sort
1025 hypotheses, which rarely occur in practice, may be specified via
1026 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
1028 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
1030 The result contains an implicit sort hypotheses as before --
1031 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
1034 * Generalized Isar history, with support for linear undo, direct state
1037 * Changed defaults for unify configuration options:
1039 unify_trace_bound = 50 (formerly 25)
1040 unify_search_bound = 60 (formerly 30)
1042 * Different bookkeeping for code equations (INCOMPATIBILITY):
1044 a) On theory merge, the last set of code equations for a particular
1045 constant is taken (in accordance with the policy applied by other
1046 parts of the code generator framework).
1048 b) Code equations stemming from explicit declarations (e.g. code
1049 attribute) gain priority over default code equations stemming
1050 from definition, primrec, fun etc.
1052 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1054 * Unified theorem tables for both code generators. Thus [code
1055 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1057 * Command 'find_consts' searches for constants based on type and name
1060 find_consts "_ => bool"
1062 By default, matching is against subtypes, but it may be restricted to
1063 the whole type. Searching by name is possible. Multiple queries are
1064 conjunctive and queries may be negated by prefixing them with a
1067 find_consts strict: "_ => bool" name: "Int" -"int => int"
1069 * New 'find_theorems' criterion "solves" matches theorems that
1070 directly solve the current goal (modulo higher-order unification).
1072 * Auto solve feature for main theorem statements: whenever a new goal
1073 is stated, "find_theorems solves" is called; any theorems that could
1074 solve the lemma directly are listed as part of the goal state.
1075 Cf. associated options in Proof General Isabelle settings menu,
1076 enabled by default, with reasonable timeout for pathological cases of
1077 higher-order unification.
1080 *** Document preparation ***
1082 * Antiquotation @{lemma} now imitates a regular terminal proof,
1083 demanding keyword 'by' and supporting the full method expression
1084 syntax just like the Isar command 'by'.
1089 * Integrated main parts of former image HOL-Complex with HOL. Entry
1090 points Main and Complex_Main remain as before.
1092 * Logic image HOL-Plain provides a minimal HOL with the most important
1093 tools available (inductive, datatype, primrec, ...). This facilitates
1094 experimentation and tool development. Note that user applications
1095 (and library theories) should never refer to anything below theory
1098 * Logic image HOL-Main stops at theory Main, and thus facilitates
1099 experimentation due to shorter build times.
1101 * Logic image HOL-NSA contains theories of nonstandard analysis which
1102 were previously part of former HOL-Complex. Entry point Hyperreal
1103 remains valid, but theories formerly using Complex_Main should now use
1104 new entry point Hypercomplex.
1106 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1107 Posix processes. Avoids potentially expensive forking of the ML
1108 process. New thread-based implementation also works on non-Unix
1109 platforms (Cygwin). Provers are no longer hardwired, but defined
1110 within the theory via plain ML wrapper functions. Basic Sledgehammer
1111 commands are covered in the isar-ref manual.
1113 * Wrapper scripts for remote SystemOnTPTP service allows to use
1114 sledgehammer without local ATP installation (Vampire etc.). Other
1115 provers may be included via suitable ML wrappers, see also
1116 src/HOL/ATP_Linkup.thy.
1118 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1121 * The metis method no longer fails because the theorem is too trivial
1122 (contains the empty clause).
1124 * The metis method now fails in the usual manner, rather than raising
1125 an exception, if it determines that it cannot prove the theorem.
1127 * Method "coherent" implements a prover for coherent logic (see also
1128 src/Tools/coherent.ML).
1130 * Constants "undefined" and "default" replace "arbitrary". Usually
1131 "undefined" is the right choice to replace "arbitrary", though
1132 logically there is no difference. INCOMPATIBILITY.
1134 * Command "value" now integrates different evaluation mechanisms. The
1135 result of the first successful evaluation mechanism is printed. In
1136 square brackets a particular named evaluation mechanisms may be
1137 specified (currently, [SML], [code] or [nbe]). See further
1138 src/HOL/ex/Eval_Examples.thy.
1140 * Normalization by evaluation now allows non-leftlinear equations.
1141 Declare with attribute [code nbe].
1143 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1144 as the structured Isar versions "cases" and "induct", cf. the
1145 corresponding "cases" and "induct" attributes. Mutual induction rules
1146 are now presented as a list of individual projections
1147 (e.g. foo_bar.inducts for types foo and bar); the old format with
1148 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1149 rare situations a different rule is selected --- notably nested tuple
1150 elimination instead of former prod.exhaust: use explicit (case_tac t
1151 rule: prod.exhaust) here.
1153 * Attributes "cases", "induct", "coinduct" support "del" option.
1155 * Removed fact "case_split_thm", which duplicates "case_split".
1157 * The option datatype has been moved to a new theory Option. Renamed
1158 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1160 * New predicate "strict_mono" classifies strict functions on partial
1161 orders. With strict functions on linear orders, reasoning about
1162 (in)equalities is facilitated by theorems "strict_mono_eq",
1163 "strict_mono_less_eq" and "strict_mono_less".
1165 * Some set operations are now proper qualified constants with
1166 authentic syntax. INCOMPATIBILITY:
1177 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1180 * Auxiliary class "itself" has disappeared -- classes without any
1181 parameter are treated as expected by the 'class' command.
1183 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1185 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1186 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1188 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1189 method "approximation". It proves formulas on real values by using
1190 interval arithmetic. In the formulas are also the transcendental
1191 functions sin, cos, tan, atan, ln, exp and the constant pi are
1192 allowed. For examples see
1193 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1195 * Theory "Reflection" now resides in HOL/Library.
1197 * Entry point to Word library now simply named "Word".
1200 * Made source layout more coherent with logical distribution
1203 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1204 src/HOL/Library/Code_Message.thy ~> src/HOL/
1205 src/HOL/Library/GCD.thy ~> src/HOL/
1206 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1207 src/HOL/Library/Parity.thy ~> src/HOL/
1208 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1209 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1210 src/HOL/Real/Lubs.thy ~> src/HOL/
1211 src/HOL/Real/PReal.thy ~> src/HOL/
1212 src/HOL/Real/Rational.thy ~> src/HOL/
1213 src/HOL/Real/RComplete.thy ~> src/HOL/
1214 src/HOL/Real/RealDef.thy ~> src/HOL/
1215 src/HOL/Real/RealPow.thy ~> src/HOL/
1216 src/HOL/Real/Real.thy ~> src/HOL/
1217 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1218 src/HOL/Complex/Complex.thy ~> src/HOL/
1219 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1220 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1221 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1222 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1223 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1224 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1225 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1226 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1227 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1228 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1229 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1230 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1231 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1232 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1233 src/HOL/Real/Float ~> src/HOL/Library/
1234 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1235 src/HOL/Real/RealVector.thy ~> src/HOL/
1237 src/HOL/arith_data.ML ~> src/HOL/Tools
1238 src/HOL/hologic.ML ~> src/HOL/Tools
1239 src/HOL/simpdata.ML ~> src/HOL/Tools
1240 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1241 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1242 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1243 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1244 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1245 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1246 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1248 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1249 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1250 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1251 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1252 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1253 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1255 * If methods "eval" and "evaluation" encounter a structured proof
1256 state with !!/==>, only the conclusion is evaluated to True (if
1257 possible), avoiding strange error messages.
1259 * Method "sizechange" automates termination proofs using (a
1260 modification of) the size-change principle. Requires SAT solver. See
1261 src/HOL/ex/Termination.thy for examples.
1263 * Simplifier: simproc for let expressions now unfolds if bound
1264 variable occurs at most once in let expression body. INCOMPATIBILITY.
1266 * Method "arith": Linear arithmetic now ignores all inequalities when
1267 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1269 * New attribute "arith" for facts that should always be used
1270 automatically by arithmetic. It is intended to be used locally in
1273 assumes [arith]: "x > 0"
1275 Global usage is discouraged because of possible performance impact.
1277 * New classes "top" and "bot" with corresponding operations "top" and
1278 "bot" in theory Orderings; instantiation of class "complete_lattice"
1279 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1281 * Changed definition lemma "less_fun_def" in order to provide an
1282 instance for preorders on functions; use lemma "less_le" instead.
1285 * Theory Orderings: class "wellorder" moved here, with explicit
1286 induction rule "less_induct" as assumption. For instantiation of
1287 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1290 * Theory Orderings: added class "preorder" as superclass of "order".
1291 INCOMPATIBILITY: Instantiation proofs for order, linorder
1292 etc. slightly changed. Some theorems named order_class.* now named
1295 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1298 * Theory Finite_Set: added a new fold combinator of type
1300 ('a => 'b => 'b) => 'b => 'a set => 'b
1302 Occasionally this is more convenient than the old fold combinator
1303 which is now defined in terms of the new one and renamed to
1306 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1307 and "ring_simps" have been replaced by "algebra_simps" (which can be
1308 extended with further lemmas!). At the moment both still exist but
1309 the former will disappear at some point.
1311 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1312 class recpower. Type-specific simp rules for various recpower types
1313 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1315 rat_power_0 -> power_0
1316 rat_power_Suc -> power_Suc
1317 realpow_0 -> power_0
1318 realpow_Suc -> power_Suc
1319 complexpow_0 -> power_0
1320 complexpow_Suc -> power_Suc
1321 power_poly_0 -> power_0
1322 power_poly_Suc -> power_Suc
1324 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1325 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1326 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1327 of lemmas from Divides has been generalized from nat to class
1328 semiring_div. INCOMPATIBILITY. This involves the following theorem
1329 renames resulting from duplicate elimination:
1331 dvd_def_mod ~> dvd_eq_mod_eq_0
1332 zero_dvd_iff ~> dvd_0_left_iff
1333 dvd_0 ~> dvd_0_right
1334 DIVISION_BY_ZERO_DIV ~> div_by_0
1335 DIVISION_BY_ZERO_MOD ~> mod_by_0
1336 mult_div ~> div_mult_self2_is_id
1337 mult_mod ~> mod_mult_self2_is_0
1339 * Theory IntDiv: removed many lemmas that are instances of class-based
1340 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1341 rename old lemmas as follows:
1343 dvd_diff -> nat_dvd_diff
1344 dvd_zminus_iff -> dvd_minus_iff
1345 mod_add1_eq -> mod_add_eq
1346 mod_mult1_eq -> mod_mult_right_eq
1347 mod_mult1_eq' -> mod_mult_left_eq
1348 mod_mult_distrib_mod -> mod_mult_eq
1349 nat_mod_add_left_eq -> mod_add_left_eq
1350 nat_mod_add_right_eq -> mod_add_right_eq
1351 nat_mod_div_trivial -> mod_div_trivial
1352 nat_mod_mod_trivial -> mod_mod_trivial
1353 zdiv_zadd_self1 -> div_add_self1
1354 zdiv_zadd_self2 -> div_add_self2
1355 zdiv_zmult_self1 -> div_mult_self2_is_id
1356 zdiv_zmult_self2 -> div_mult_self1_is_id
1357 zdvd_triv_left -> dvd_triv_left
1358 zdvd_triv_right -> dvd_triv_right
1359 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1360 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1361 zmod_zadd_left_eq -> mod_add_left_eq
1362 zmod_zadd_right_eq -> mod_add_right_eq
1363 zmod_zadd_self1 -> mod_add_self1
1364 zmod_zadd_self2 -> mod_add_self2
1365 zmod_zadd1_eq -> mod_add_eq
1366 zmod_zdiff1_eq -> mod_diff_eq
1367 zmod_zdvd_zmod -> mod_mod_cancel
1368 zmod_zmod_cancel -> mod_mod_cancel
1369 zmod_zmult_self1 -> mod_mult_self2_is_0
1370 zmod_zmult_self2 -> mod_mult_self1_is_0
1373 zdvd_abs1 -> abs_dvd_iff
1374 zdvd_abs2 -> dvd_abs_iff
1375 zdvd_refl -> dvd_refl
1376 zdvd_trans -> dvd_trans
1377 zdvd_zadd -> dvd_add
1378 zdvd_zdiff -> dvd_diff
1379 zdvd_zminus_iff -> dvd_minus_iff
1380 zdvd_zminus2_iff -> minus_dvd_iff
1381 zdvd_zmultD -> dvd_mult_right
1382 zdvd_zmultD2 -> dvd_mult_left
1383 zdvd_zmult_mono -> mult_dvd_mono
1384 zdvd_0_right -> dvd_0_right
1385 zdvd_0_left -> dvd_0_left_iff
1386 zdvd_1_left -> one_dvd
1387 zminus_dvd_iff -> minus_dvd_iff
1389 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1391 * The real numbers offer decimal input syntax: 12.34 is translated
1392 into 1234/10^2. This translation is not reversed upon output.
1394 * Theory Library/Polynomial defines an abstract type 'a poly of
1395 univariate polynomials with coefficients of type 'a. In addition to
1396 the standard ring operations, it also supports div and mod. Code
1397 generation is also supported, using list-style constructors.
1399 * Theory Library/Inner_Product defines a class of real_inner for real
1400 inner product spaces, with an overloaded operation inner :: 'a => 'a
1401 => real. Class real_inner is a subclass of real_normed_vector from
1404 * Theory Library/Product_Vector provides instances for the product
1405 type 'a * 'b of several classes from RealVector and Inner_Product.
1406 Definitions of addition, subtraction, scalar multiplication, norms,
1407 and inner products are included.
1409 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1410 addition to the field operations, numerals and case syntax are also
1413 * Theory Library/Diagonalize provides constructive version of Cantor's
1414 first diagonalization argument.
1416 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1417 zlcm (for int); carried together from various gcd/lcm developements in
1418 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1419 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1420 may recover tupled syntax as follows:
1422 hide (open) const gcd
1423 abbreviation gcd where
1424 "gcd == (%(a, b). GCD.gcd a b)"
1426 GCD.gcd ("gcd '(_, _')")
1428 The same works for lcm, zgcd, zlcm.
1430 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1431 instantiations for algebraic structures. Removed some duplicate
1432 theorems. Changes in simp rules. INCOMPATIBILITY.
1434 * ML antiquotation @{code} takes a constant as argument and generates
1435 corresponding code in background and inserts name of the corresponding
1436 resulting ML value/function/datatype constructor binding in place.
1437 All occurrences of @{code} with a single ML block are generated
1438 simultaneously. Provides a generic and safe interface for
1439 instrumentalizing code generation. See
1440 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1441 In future you ought to refrain from ad-hoc compiling generated SML
1442 code on the ML toplevel. Note that (for technical reasons) @{code}
1443 cannot refer to constants for which user-defined serializations are
1444 set. Refer to the corresponding ML counterpart directly in that
1447 * Command 'rep_datatype': instead of theorem names the command now
1448 takes a list of terms denoting the constructors of the type to be
1449 represented as datatype. The characteristic theorems have to be
1450 proven. INCOMPATIBILITY. Also observe that the following theorems
1451 have disappeared in favour of existing ones:
1453 unit_induct ~> unit.induct
1454 prod_induct ~> prod.induct
1455 sum_induct ~> sum.induct
1456 Suc_Suc_eq ~> nat.inject
1457 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1462 * New locales for orders and lattices where the equivalence relation
1463 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1464 locales use a record structure with field eq for the equivalence.
1466 * New theory of factorial domains.
1468 * Units_l_inv and Units_r_inv are now simp rules by default.
1469 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1470 and/or r_inv will now also require deletion of these lemmas.
1472 * Renamed the following theorems, INCOMPATIBILITY:
1474 UpperD ~> Upper_memD
1475 LowerD ~> Lower_memD
1476 least_carrier ~> least_closed
1477 greatest_carrier ~> greatest_closed
1478 greatest_Lower_above ~> greatest_Lower_below
1479 one_zero ~> carrier_one_zero
1480 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1485 * Nominal datatypes can now contain type-variables.
1487 * Commands 'nominal_inductive' and 'equivariance' work with local
1490 * Nominal primrec can now works with local theory targets and its
1491 specification syntax now conforms to the general format as seen in
1494 * Method "perm_simp" honours the standard simplifier attributes
1495 (no_asm), (no_asm_use) etc.
1497 * The new predicate #* is defined like freshness, except that on the
1498 left hand side can be a set or list of atoms.
1500 * Experimental command 'nominal_inductive2' derives strong induction
1501 principles for inductive definitions. In contrast to
1502 'nominal_inductive', which can only deal with a fixed number of
1503 binders, it can deal with arbitrary expressions standing for sets of
1504 atoms to be avoided. The only inductive definition we have at the
1505 moment that needs this generalisation is the typing rule for Lets in
1508 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1509 -----------------------------------------------------------------
1510 Gamma |- Let x be t1 in t2 : T2
1512 In this rule one wants to avoid all the binders that are introduced by
1513 "close Gamma T1". We are looking for other examples where this
1514 feature might be useful. Please let us know.
1519 * Reimplemented the simplification procedure for proving continuity
1520 subgoals. The new simproc is extensible; users can declare additional
1521 continuity introduction rules with the attribute [cont2cont].
1523 * The continuity simproc now uses a different introduction rule for
1524 solving continuity subgoals on terms with lambda abstractions. In
1525 some rare cases the new simproc may fail to solve subgoals that the
1526 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1527 Potential INCOMPATIBILITY.
1529 * Command 'fixrec': specification syntax now conforms to the general
1530 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1531 examples. INCOMPATIBILITY.
1536 * Proof of Zorn's Lemma for partial orders.
1541 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1542 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1543 depends on multithreading, so timouts will not work before Poly/ML
1546 * High-level support for concurrent ML programming, see
1547 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1548 particularly convenient to organize independent functional
1549 computations. The concept of "synchronized variables" provides a
1550 higher-order interface for components with shared state, avoiding the
1551 delicate details of mutexes and condition variables. (Requires
1552 Poly/ML 5.2.1 or later.)
1554 * ML bindings produced via Isar commands are stored within the Isar
1555 context (theory or proof). Consequently, commands like 'use' and 'ML'
1556 become thread-safe and work with undo as expected (concerning
1557 top-level bindings, not side-effects on global references).
1558 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1559 compiler at runtime; really global bindings need to be given outside a
1560 theory. (Requires Poly/ML 5.2 or later.)
1562 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1563 context. Top-level ML bindings are stored within the proof context in
1564 a purely sequential fashion, disregarding the nested proof structure.
1565 ML bindings introduced by 'ML_prf' are discarded at the end of the
1566 proof. (Requires Poly/ML 5.2 or later.)
1568 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1569 and Method.setup, as well as Isar commands 'attribute_setup' and
1570 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1571 existing code accordingly, or use plain 'setup' together with old
1574 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1575 to 'a -> thm, while results are always tagged with an authentic oracle
1576 name. The Isar command 'oracle' is now polymorphic, no argument type
1577 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1578 accordingly. Note that extra performance may be gained by producing
1579 the cterm carefully, avoiding slow Thm.cterm_of.
1581 * Simplified interface for defining document antiquotations via
1582 ThyOutput.antiquotation, ThyOutput.output, and optionally
1583 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1584 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1587 * More systematic treatment of long names, abstract name bindings, and
1588 name space operations. Basic operations on qualified names have been
1589 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1590 Long_Name.append. Old type bstring has been mostly replaced by
1591 abstract type binding (see structure Binding), which supports precise
1592 qualification by packages and local theory targets, as well as proper
1593 tracking of source positions. INCOMPATIBILITY, need to wrap old
1594 bstring values into Binding.name, or better pass through abstract
1595 bindings everywhere. See further src/Pure/General/long_name.ML,
1596 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1598 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1599 LocalTheory.note etc.) now refer to the *full* internal name, not the
1600 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1602 * Disposed old type and term read functions (Sign.read_def_typ,
1603 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1604 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1605 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1606 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1607 resort for legacy applications.
1609 * Disposed old declarations, tactics, tactic combinators that refer to
1610 the simpset or claset of an implicit theory (such as Addsimps,
1611 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1612 embedded ML text, or local_simpset_of with a proper context passed as
1613 explicit runtime argument.
1615 * Rules and tactics that read instantiations (read_instantiate,
1616 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1617 context, which is required for parsing and type-checking. Moreover,
1618 the variables are specified as plain indexnames, not string encodings
1619 thereof. INCOMPATIBILITY.
1621 * Generic Toplevel.add_hook interface allows to analyze the result of
1622 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1623 for theorem dependency output of transactions resulting in a new
1626 * ML antiquotations: block-structured compilation context indicated by
1627 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1629 @{binding name} - basic name binding
1630 @{let ?pat = term} - term abbreviation (HO matching)
1631 @{note name = fact} - fact abbreviation
1632 @{thm fact} - singleton fact (with attributes)
1633 @{thms fact} - general fact (with attributes)
1634 @{lemma prop by method} - singleton goal
1635 @{lemma prop by meth1 meth2} - singleton goal
1636 @{lemma prop1 ... propN by method} - general goal
1637 @{lemma prop1 ... propN by meth1 meth2} - general goal
1638 @{lemma (open) ...} - open derivation
1643 * The Isabelle "emacs" tool provides a specific interface to invoke
1644 Proof General / Emacs, with more explicit failure if that is not
1645 installed (the old isabelle-interface script silently falls back on
1646 isabelle-process). The PROOFGENERAL_HOME setting determines the
1647 installation location of the Proof General distribution.
1649 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1650 the Isabelle process into a JVM/Scala application. See
1651 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1652 process wrapper has been discontinued.)
1654 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1656 * Various status messages (with exact source position information) are
1657 emitted, if proper markup print mode is enabled. This allows
1658 user-interface components to provide detailed feedback on internal
1663 New in Isabelle2008 (June 2008)
1664 -------------------------------
1668 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1669 and updated, with formally checked references as hyperlinks.
1671 * Theory loader: use_thy (and similar operations) no longer set the
1672 implicit ML context, which was occasionally hard to predict and in
1673 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1674 provides a proper context already.
1676 * Theory loader: old-style ML proof scripts being *attached* to a thy
1677 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1678 'use' within a theory file will do the job.
1680 * Name space merge now observes canonical order, i.e. the second space
1681 is inserted into the first one, while existing entries in the first
1682 space take precedence. INCOMPATIBILITY in rare situations, may try to
1683 swap theory imports.
1685 * Syntax: symbol \<chi> is now considered a letter. Potential
1686 INCOMPATIBILITY in identifier syntax etc.
1688 * Outer syntax: string tokens no longer admit escaped white space,
1689 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1690 white space without escapes.
1692 * Outer syntax: string tokens may contain arbitrary character codes
1693 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1699 * Context-dependent token translations. Default setup reverts locally
1700 fixed variables, and adds hilite markup for undeclared frees.
1702 * Unused theorems can be found using the new command 'unused_thms'.
1703 There are three ways of invoking it:
1706 Only finds unused theorems in the current theory.
1708 (2) unused_thms thy_1 ... thy_n -
1709 Finds unused theorems in the current theory and all of its ancestors,
1710 excluding the theories thy_1 ... thy_n and all of their ancestors.
1712 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1713 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1714 their ancestors, excluding the theories thy_1 ... thy_n and all of
1717 In order to increase the readability of the list produced by
1718 unused_thms, theorems that have been created by a particular instance
1719 of a theory command such as 'inductive' or 'function' are considered
1720 to belong to the same "group", meaning that if at least one theorem in
1721 this group is used, the other theorems in the same group are no longer
1722 reported as unused. Moreover, if all theorems in the group are
1723 unused, only one theorem in the group is displayed.
1725 Note that proof objects have to be switched on in order for
1726 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1727 usually the case when using Proof General with the default settings).
1729 * Authentic naming of facts disallows ad-hoc overwriting of previous
1730 theorems within the same name space. INCOMPATIBILITY, need to remove
1731 duplicate fact bindings, or even accidental fact duplications. Note
1732 that tools may maintain dynamically scoped facts systematically, using
1733 PureThy.add_thms_dynamic.
1735 * Command 'hide' now allows to hide from "fact" name space as well.
1737 * Eliminated destructive theorem database, simpset, claset, and
1738 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1739 update of theories within ML code.
1741 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1742 INCOMPATIBILITY, object-logics depending on former Pure require
1743 additional setup PureThy.old_appl_syntax_setup; object-logics
1744 depending on former CPure need to refer to Pure.
1746 * Commands 'use' and 'ML' are now purely functional, operating on
1747 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1748 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1751 * Command 'setup': discontinued implicit version with ML reference.
1753 * Instantiation target allows for simultaneous specification of class
1754 instance operations together with an instantiation proof.
1755 Type-checking phase allows to refer to class operations uniformly.
1756 See src/HOL/Complex/Complex.thy for an Isar example and
1757 src/HOL/Library/Eval.thy for an ML example.
1759 * Indexing of literal facts: be more serious about including only
1760 facts from the visible specification/proof context, but not the
1761 background context (locale etc.). Affects `prop` notation and method
1762 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1765 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1766 "(open)" option, which used to expose internal bound variables to the
1769 * Isar statements: removed obsolete case "rule_context".
1770 INCOMPATIBILITY, better use explicit fixes/assumes.
1772 * Locale proofs: default proof step now includes 'unfold_locales';
1773 hence 'proof' without argument may be used to unfold locale
1777 *** Document preparation ***
1779 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1780 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1781 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1782 spot); renamed link color from "darkblue" to "linkcolor" (default
1783 value unchanged, can be redefined via \definecolor); no longer sets
1784 "a4paper" option (unnecessary or even intrusive).
1786 * Antiquotation @{lemma A method} proves proposition A by the given
1787 method (either a method name or a method name plus (optional) method
1788 arguments in parentheses) and prints A just like @{prop A}.
1793 * New primrec package. Specification syntax conforms in style to
1794 definition/function/.... No separate induction rule is provided. The
1795 "primrec" command distinguishes old-style and new-style specifications
1796 by syntax. The former primrec package is now named OldPrimrecPackage.
1797 When adjusting theories, beware: constants stemming from new-style
1798 primrec specifications have authentic syntax.
1800 * Metis prover is now an order of magnitude faster, and also works
1801 with multithreading.
1803 * Metis: the maximum number of clauses that can be produced from a
1804 theorem is now given by the attribute max_clauses. Theorems that
1805 exceed this number are ignored, with a warning printed.
1807 * Sledgehammer no longer produces structured proofs by default. To
1808 enable, declare [[sledgehammer_full = true]]. Attributes
1809 reconstruction_modulus, reconstruction_sorts renamed
1810 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1812 * Method "induct_scheme" derives user-specified induction rules
1813 from well-founded induction and completeness of patterns. This factors
1814 out some operations that are done internally by the function package
1815 and makes them available separately. See
1816 src/HOL/ex/Induction_Scheme.thy for examples.
1818 * More flexible generation of measure functions for termination
1819 proofs: Measure functions can be declared by proving a rule of the
1820 form "is_measure f" and giving it the [measure_function] attribute.
1821 The "is_measure" predicate is logically meaningless (always true), and
1822 just guides the heuristic. To find suitable measure functions, the
1823 termination prover sets up the goal "is_measure ?f" of the appropriate
1824 type and generates all solutions by prolog-style backwards proof using
1827 This setup also deals with rules like
1829 "is_measure f ==> is_measure (list_size f)"
1831 which accommodates nested datatypes that recurse through lists.
1832 Similar rules are predeclared for products and option types.
1834 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1838 - Definitions of overloaded constants on sets have to be replaced by
1839 definitions on => and bool.
1841 - Some definitions of overloaded operators on sets can now be proved
1842 using the definitions of the operators on => and bool. Therefore,
1843 the following theorems have been renamed:
1845 subset_def -> subset_eq
1846 psubset_def -> psubset_eq
1847 set_diff_def -> set_diff_eq
1848 Compl_def -> Compl_eq
1849 Sup_set_def -> Sup_set_eq
1850 Inf_set_def -> Inf_set_eq
1851 sup_set_def -> sup_set_eq
1852 inf_set_def -> inf_set_eq
1854 - Due to the incompleteness of the HO unification algorithm, some
1855 rules such as subst may require manual instantiation, if some of
1856 the unknowns in the rule is a set.
1858 - Higher order unification and forward proofs:
1861 have "P (S::'a set)" <...>
1862 then have "EX S. P S" ..
1864 no longer works (due to the incompleteness of the HO unification
1865 algorithm) and must be replaced by the pattern
1872 - Calculational reasoning with subst (or similar rules):
1875 have "P (S::'a set)" <...>
1876 also have "S = T" <...>
1877 finally have "P T" .
1879 no longer works (for similar reasons as the previous example) and
1880 must be replaced by something like
1882 have "P (S::'a set)" <...>
1883 moreover have "S = T" <...>
1884 ultimately have "P T" by simp
1886 - Tactics or packages written in ML code:
1887 Code performing pattern matching on types via
1889 Type ("set", [T]) => ...
1891 must be rewritten. Moreover, functions like strip_type or
1892 binder_types no longer return the right value when applied to a
1895 T1 => ... => Tn => U => bool
1899 T1 => ... => Tn => U set
1901 * Merged theories Wellfounded_Recursion, Accessible_Part and
1902 Wellfounded_Relations to theory Wellfounded.
1904 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1906 * Class finite no longer treats UNIV as class parameter. Use class
1907 enum from theory Library/Enum instead to achieve a similar effect.
1910 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1911 and "Cons". INCOMPATIBILITY.
1913 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1914 Potential INCOMPATIBILITY.
1916 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1917 injective_fst_snd removed, use split_eta and prod_eqI instead.
1918 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1920 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1921 the same name in theory Orderings:
1931 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1932 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1933 and different variable names.
1935 * Library/Option_ord.thy: Canonical order on option type.
1937 * Library/RBT.thy: Red-black trees, an efficient implementation of
1940 * Library/Countable.thy: Type class for countable types.
1942 * Theory Int: The representation of numerals has changed. The infix
1943 operator BIT and the bit datatype with constructors B0 and B1 have
1944 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1945 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1946 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1949 * Theory Nat: definition of <= and < on natural numbers no longer
1950 depend on well-founded relations. INCOMPATIBILITY. Definitions
1951 le_def and less_def have disappeared. Consider lemmas not_less
1952 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1954 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1955 (whose purpose mainly is for various fold_set functionals) have been
1956 abandoned in favor of the existing algebraic classes
1957 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1958 lower_semilattice (resp. upper_semilattice) and linorder.
1961 * Theory Transitive_Closure: induct and cases rules now declare proper
1962 case_names ("base" and "step"). INCOMPATIBILITY.
1964 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1965 lattices. The form set-specific version is available as
1966 Inductive.lfp_ordinal_induct_set.
1968 * Renamed theorems "power.simps" to "power_int.simps".
1971 * Class semiring_div provides basic abstract properties of semirings
1972 with division and modulo operations. Subsumes former class dvd_mod.
1974 * Merged theories IntDef, Numeral and IntArith into unified theory
1975 Int. INCOMPATIBILITY.
1977 * Theory Library/Code_Index: type "index" now represents natural
1978 numbers rather than integers. INCOMPATIBILITY.
1980 * New class "uminus" with operation "uminus" (split of from class
1981 "minus" which now only has operation "minus", binary).
1984 * Constants "card", "internal_split", "option_map" now with authentic
1985 syntax. INCOMPATIBILITY.
1987 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1988 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1989 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1990 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1991 Sup_set_def, le_def, less_def, option_map_def now with object
1992 equality. INCOMPATIBILITY.
1994 * Records. Removed K_record, and replaced it by pure lambda term
1995 %x. c. The simplifier setup is now more robust against eta expansion.
1996 INCOMPATIBILITY: in cases explicitly referring to K_record.
1998 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
2000 * Library/ListVector: new theory of arithmetic vector operations.
2002 * Library/Order_Relation: new theory of various orderings as sets of
2003 pairs. Defines preorders, partial orders, linear orders and
2004 well-orders on sets and on types.
2009 * Renamed some theories to allow to loading both ZF and HOL in the
2012 Datatype -> Datatype_ZF
2013 Inductive -> Inductive_ZF
2020 INCOMPATIBILITY: ZF theories that import individual theories below
2021 Main might need to be adapted. Regular theory Main is still
2022 available, as trivial extension of Main_ZF.
2027 * ML within Isar: antiquotation @{const name} or @{const
2028 name(typargs)} produces statically-checked Const term.
2030 * Functor NamedThmsFun: data is available to the user as dynamic fact
2031 (of the same name). Removed obsolete print command.
2033 * Removed obsolete "use_legacy_bindings" function.
2035 * The ``print mode'' is now a thread-local value derived from a global
2036 template (the former print_mode reference), thus access becomes
2037 non-critical. The global print_mode reference is for session
2038 management only; user-code should use print_mode_value,
2039 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
2041 * Functions system/system_out provide a robust way to invoke external
2042 shell commands, with propagation of interrupts (requires Poly/ML
2043 5.2.1). Do not use OS.Process.system etc. from the basis library!
2048 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2049 in accordance with Proof General 3.7, which prefers GNU emacs.
2051 * isatool tty runs Isabelle process with plain tty interaction;
2052 optional line editor may be specified via ISABELLE_LINE_EDITOR
2053 setting, the default settings attempt to locate "ledit" and "rlwrap".
2055 * isatool browser now works with Cygwin as well, using general
2056 "javapath" function defined in Isabelle process environment.
2058 * YXML notation provides a simple and efficient alternative to
2059 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2060 isatool yxml as described in the Isabelle system manual.
2062 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2063 provides general wrapper for managing an Isabelle process in a robust
2064 fashion, with ``cooked'' output from stdin/stderr.
2066 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2067 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2069 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2070 way of changing the user's settings is via
2071 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2074 * Multithreading.max_threads := 0 refers to the number of actual CPU
2075 cores of the underlying machine, which is a good starting point for
2076 optimal performance tuning. The corresponding usedir option -M allows
2077 "max" as an alias for "0". WARNING: does not work on certain versions
2078 of Mac OS (with Poly/ML 5.1).
2080 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2081 adverse effect of Isabelle flooding interactive front-ends (notably
2082 ProofGeneral / XEmacs).
2086 New in Isabelle2007 (November 2007)
2087 -----------------------------------
2091 * More uniform information about legacy features, notably a
2092 warning/error of "Legacy feature: ...", depending on the state of the
2093 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2094 legacy features will disappear eventually.
2096 * Theory syntax: the header format ``theory A = B + C:'' has been
2097 discontinued in favour of ``theory A imports B C begin''. Use isatool
2098 fixheaders to convert existing theory files. INCOMPATIBILITY.
2100 * Theory syntax: the old non-Isar theory file format has been
2101 discontinued altogether. Note that ML proof scripts may still be used
2102 with Isar theories; migration is usually quite simple with the ML
2103 function use_legacy_bindings. INCOMPATIBILITY.
2105 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2106 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2109 * Theory loader: be more serious about observing the static theory
2110 header specifications (including optional directories), but not the
2111 accidental file locations of previously successful loads. The strict
2112 update policy of former update_thy is now already performed by
2113 use_thy, so the former has been removed; use_thys updates several
2114 theories simultaneously, just as 'imports' within a theory header
2115 specification, but without merging the results. Potential
2116 INCOMPATIBILITY: may need to refine theory headers and commands
2117 ROOT.ML which depend on load order.
2119 * Theory loader: optional support for content-based file
2120 identification, instead of the traditional scheme of full physical
2121 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2122 (cf. the system manual). The new scheme allows to work with
2123 non-finished theories in persistent session images, such that source
2124 files may be moved later on without requiring reloads.
2126 * Theory loader: old-style ML proof scripts being *attached* to a thy
2127 file (with the same base name as the theory) are considered a legacy
2128 feature, which will disappear eventually. Even now, the theory loader
2129 no longer maintains dependencies on such files.
2131 * Syntax: the scope for resolving ambiguities via type-inference is
2132 now limited to individual terms, instead of whole simultaneous
2133 specifications as before. This greatly reduces the complexity of the
2134 syntax module and improves flexibility by separating parsing and
2135 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2136 'fixes' etc.) are required in rare situations.
2138 * Syntax: constants introduced by new-style packages ('definition',
2139 'abbreviation' etc.) are passed through the syntax module in
2140 ``authentic mode''. This means that associated mixfix annotations
2141 really stick to such constants, independently of potential name space
2142 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2143 trees are represented slightly differently, may need to adapt syntax
2144 translations accordingly. Use CONST marker in 'translations' and
2145 @{const_syntax} antiquotation in 'parse_translation' etc.
2147 * Legacy goal package: reduced interface to the bare minimum required
2148 to keep existing proof scripts running. Most other user-level
2149 functions are now part of the OldGoals structure, which is *not* open
2150 by default (consider isatool expandshort before open OldGoals).
2151 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2152 these tend to cause confusion about the actual goal (!) context being
2153 used here, which is not necessarily the same as the_context().
2155 * Command 'find_theorems': supports "*" wild-card in "name:"
2156 criterion; "with_dups" option. Certain ProofGeneral versions might
2157 support a specific search form (see ProofGeneral/CHANGES).
2159 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2160 by default, which means that "prems" (and also "fixed variables") are
2161 suppressed from proof state output. Note that the ProofGeneral
2162 settings mechanism allows to change and save options persistently, but
2163 older versions of Isabelle will fail to start up if a negative prems
2166 * Local theory targets may be specified by non-nested blocks of
2167 ``context/locale/class ... begin'' followed by ``end''. The body may
2168 contain definitions, theorems etc., including any derived mechanism
2169 that has been implemented on top of these primitives. This concept
2170 generalizes the existing ``theorem (in ...)'' towards more versatility
2173 * Proof General interface: proper undo of final 'end' command;
2174 discontinued Isabelle/classic mode (ML proof scripts).
2177 *** Document preparation ***
2179 * Added antiquotation @{theory name} which prints the given name,
2180 after checking that it refers to a valid ancestor theory in the
2183 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2184 check the given source text as ML type/structure, printing verbatim.
2186 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2187 "c args == rhs" given in the current context. (Any number of
2188 arguments may be given on the LHS.)
2193 * The 'class' package offers a combination of axclass and locale to
2194 achieve Haskell-like type classes in Isabelle. Definitions and
2195 theorems within a class context produce both relative results (with
2196 implicit parameters according to the locale context), and polymorphic
2197 constants with qualified polymorphism (according to the class
2198 context). Within the body context of a 'class' target, a separate
2199 syntax layer ("user space type system") takes care of converting
2200 between global polymorphic consts and internal locale representation.
2201 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2202 "isatool doc classes" provides a tutorial.
2204 * Generic code generator framework allows to generate executable
2205 code for ML and Haskell (including Isabelle classes). A short usage
2208 internal compilation:
2209 export_code <list of constants (term syntax)> in SML
2210 writing SML code to a file:
2211 export_code <list of constants (term syntax)> in SML <filename>
2212 writing OCaml code to a file:
2213 export_code <list of constants (term syntax)> in OCaml <filename>
2214 writing Haskell code to a bunch of files:
2215 export_code <list of constants (term syntax)> in Haskell <filename>
2217 evaluating closed propositions to True/False using code generation:
2220 Reasonable default setup of framework in HOL.
2222 Theorem attributs for selecting and transforming function equations theorems:
2224 [code fun]: select a theorem as function equation for a specific constant
2225 [code fun del]: deselect a theorem as function equation for a specific constant
2226 [code inline]: select an equation theorem for unfolding (inlining) in place
2227 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2229 User-defined serializations (target in {SML, OCaml, Haskell}):
2231 code_const <and-list of constants (term syntax)>
2232 {(target) <and-list of const target syntax>}+
2234 code_type <and-list of type constructors>
2235 {(target) <and-list of type target syntax>}+
2237 code_instance <and-list of instances>
2239 where instance ::= <type constructor> :: <class>
2241 code_class <and_list of classes>
2242 {(target) <and-list of class target syntax>}+
2243 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2245 code_instance and code_class only are effective to target Haskell.
2247 For example usage see src/HOL/ex/Codegenerator.thy and
2248 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2249 generation from Isabelle/HOL theories is available via "isatool doc
2252 * Code generator: consts in 'consts_code' Isar commands are now
2253 referred to by usual term syntax (including optional type
2256 * Command 'no_translations' removes translation rules from theory
2259 * Overloaded definitions are now actually checked for acyclic
2260 dependencies. The overloading scheme is slightly more general than
2261 that of Haskell98, although Isabelle does not demand an exact
2262 correspondence to type class and instance declarations.
2263 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2264 exotic versions of overloading -- at the discretion of the user!
2266 Polymorphic constants are represented via type arguments, i.e. the
2267 instantiation that matches an instance against the most general
2268 declaration given in the signature. For example, with the declaration
2269 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2270 as c(nat). Overloading is essentially simultaneous structural
2271 recursion over such type arguments. Incomplete specification patterns
2272 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2273 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2274 Command 'print_theory' outputs the normalized system of recursive
2275 equations, see section "definitions".
2277 * Configuration options are maintained within the theory or proof
2278 context (with name and type bool/int/string), providing a very simple
2279 interface to a poor-man's version of general context data. Tools may
2280 declare options in ML (e.g. using Attrib.config_int) and then refer to
2281 these values using Config.get etc. Users may change options via an
2282 associated attribute of the same name. This form of context
2283 declaration works particularly well with commands 'declare' or
2284 'using', for example ``declare [[foo = 42]]''. Thus it has become
2285 very easy to avoid global references, which would not observe Isar
2286 toplevel undo/redo and fail to work with multithreading.
2288 Various global ML references of Pure and HOL have been turned into
2289 configuration options:
2291 Unify.search_bound unify_search_bound
2292 Unify.trace_bound unify_trace_bound
2293 Unify.trace_simp unify_trace_simp
2294 Unify.trace_types unify_trace_types
2295 Simplifier.simp_depth_limit simp_depth_limit
2296 Blast.depth_limit blast_depth_limit
2297 DatatypeProp.dtK datatype_distinctness_limit
2298 fast_arith_neq_limit fast_arith_neq_limit
2299 fast_arith_split_limit fast_arith_split_limit
2301 * Named collections of theorems may be easily installed as context
2302 data using the functor NamedThmsFun (see also
2303 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2304 attributes; there is also a toplevel print command. This facility is
2305 just a common case of general context data, which is the preferred way
2306 for anything more complex than just a list of facts in canonical
2309 * Isar: command 'declaration' augments a local theory by generic
2310 declaration functions written in ML. This enables arbitrary content
2311 being added to the context, depending on a morphism that tells the
2312 difference of the original declaration context wrt. the application
2313 context encountered later on.
2315 * Isar: proper interfaces for simplification procedures. Command
2316 'simproc_setup' declares named simprocs (with match patterns, and body
2317 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2318 context. ML antiquotation @{simproc name} retrieves named simprocs.
2320 * Isar: an extra pair of brackets around attribute declarations
2321 abbreviates a theorem reference involving an internal dummy fact,
2322 which will be ignored later --- only the effect of the attribute on
2323 the background context will persist. This form of in-place
2324 declarations is particularly useful with commands like 'declare' and
2325 'using', for example ``have A using [[simproc a]] by simp''.
2327 * Isar: method "assumption" (and implicit closing of subproofs) now
2328 takes simple non-atomic goal assumptions into account: after applying
2329 an assumption as a rule the resulting subgoals are solved by atomic
2330 assumption steps. This is particularly useful to finish 'obtain'
2331 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2332 without referring to the original premise "!!x. P x ==> thesis" in the
2333 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2336 * Isar: implicit use of prems from the Isar proof context is
2337 considered a legacy feature. Common applications like ``have A .''
2338 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2339 referencing facts explicitly here improves readability and
2340 maintainability of proof texts.
2342 * Isar: improper proof element 'guess' is like 'obtain', but derives
2343 the obtained context from the course of reasoning! For example:
2345 assume "EX x y. A x & B y" -- "any previous fact"
2346 then guess x and y by clarify
2348 This technique is potentially adventurous, depending on the facts and
2349 proof tools being involved here.
2351 * Isar: known facts from the proof context may be specified as literal
2352 propositions, using ASCII back-quote syntax. This works wherever
2353 named facts used to be allowed so far, in proof commands, proof
2354 methods, attributes etc. Literal facts are retrieved from the context
2355 according to unification of type and term parameters. For example,
2356 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2357 theorems in the current context, then these are valid literal facts:
2358 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2360 There is also a proof method "fact" which does the same composition
2361 for explicit goal states, e.g. the following proof texts coincide with
2362 certain special cases of literal facts:
2364 have "A" by fact == note `A`
2365 have "A ==> B" by fact == note `A ==> B`
2366 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2367 have "P a ==> Q a" by fact == note `P a ==> Q a`
2369 * Isar: ":" (colon) is no longer a symbolic identifier character in
2370 outer syntax. Thus symbolic identifiers may be used without
2371 additional white space in declarations like this: ``assume *: A''.
2373 * Isar: 'print_facts' prints all local facts of the current context,
2374 both named and unnamed ones.
2376 * Isar: 'def' now admits simultaneous definitions, e.g.:
2378 def x == "t" and y == "u"
2380 * Isar: added command 'unfolding', which is structurally similar to
2381 'using', but affects both the goal state and facts by unfolding given
2382 rewrite rules. Thus many occurrences of the 'unfold' method or
2383 'unfolded' attribute may be replaced by first-class proof text.
2385 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2386 and command 'unfolding' now all support object-level equalities
2387 (potentially conditional). The underlying notion of rewrite rule is
2388 analogous to the 'rule_format' attribute, but *not* that of the
2389 Simplifier (which is usually more generous).
2391 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2392 premises of a theorem by n. Useful in conjunction with drule.
2394 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2395 method expression within a sandbox consisting of the first N
2396 sub-goals, which need to exist. For example, ``simp_all [3]''
2397 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2398 simplifies all new goals that emerge from applying rule foo to the
2399 originally first one.
2401 * Isar: schematic goals are no longer restricted to higher-order
2402 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2405 * Isar: the conclusion of a long theorem statement is now either
2406 'shows' (a simultaneous conjunction, as before), or 'obtains'
2407 (essentially a disjunction of cases with local parameters and
2408 assumptions). The latter allows to express general elimination rules
2409 adequately; in this notation common elimination rules look like this:
2411 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2413 obtains x where "P x"
2415 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2419 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2425 The subsequent classical rules even refer to the formal "thesis"
2428 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2431 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2432 obtains "thesis ==> something"
2434 The actual proof of an 'obtains' statement is analogous to that of the
2435 Isar proof element 'obtain', only that there may be several cases.
2436 Optional case names may be specified in parentheses; these will be
2437 available both in the present proof and as annotations in the
2438 resulting rule, for later use with the 'cases' method (cf. attribute
2441 * Isar: the assumptions of a long theorem statement are available as
2442 "assms" fact in the proof context. This is more appropriate than the
2443 (historical) "prems", which refers to all assumptions of the current
2444 context, including those from the target locale, proof body etc.
2446 * Isar: 'print_statement' prints theorems from the current theory or
2447 proof context in long statement form, according to the syntax of a
2450 * Isar: 'obtain' takes an optional case name for the local context
2451 introduction rule (default "that").
2453 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2454 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2457 * Pure: syntax "CONST name" produces a fully internalized constant
2458 according to the current context. This is particularly useful for
2459 syntax translations that should refer to internal constant
2460 representations independently of name spaces.
2462 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2463 instead of "FOO ". This allows multiple binder declarations to coexist
2464 in the same context. INCOMPATIBILITY.
2466 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2467 primitive that also works in a locale context (both for constants and
2468 fixed variables). Type declaration and internal syntactic representation
2469 of given constants retrieved from the context. Likewise, the
2470 'no_notation' command allows to remove given syntax annotations from the
2473 * Isar/locales: new derived specification elements 'axiomatization',
2474 'definition', 'abbreviation', which support type-inference, admit
2475 object-level specifications (equality, equivalence). See also the
2476 isar-ref manual. Examples:
2479 eq (infix "===" 50) where
2480 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2482 definition "f x y = x + y + 1"
2483 definition g where "g x = f x x"
2486 neq (infix "=!=" 50) where
2487 "x =!= y == ~ (x === y)"
2489 These specifications may be also used in a locale context. Then the
2490 constants being introduced depend on certain fixed parameters, and the
2491 constant name is qualified by the locale base name. An internal
2492 abbreviation takes care for convenient input and output, making the
2493 parameters implicit and using the original short name. See also
2494 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2495 entities from a monomorphic theory.
2497 Presently, abbreviations are only available 'in' a target locale, but
2498 not inherited by general import expressions. Also note that
2499 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2500 'translations' in common applications. The "no_abbrevs" print mode
2501 prevents folding of abbreviations in term output.
2503 Concrete syntax is attached to specified constants in internal form,
2504 independently of name spaces. The parse tree representation is
2505 slightly different -- use 'notation' instead of raw 'syntax', and
2506 'translations' with explicit "CONST" markup to accommodate this.
2508 * Pure/Isar: unified syntax for new-style specification mechanisms
2509 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2510 full type inference and dummy patterns ("_"). For example:
2512 definition "K x _ = x"
2514 inductive conj for A B
2515 where "A ==> B ==> conj A B"
2517 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2518 the current context. Print mode "no_abbrevs" prevents inversion of
2519 abbreviations on output.
2521 * Isar/locales: improved parameter handling: use of locales "var" and
2522 "struct" no longer necessary; - parameter renamings are no longer
2523 required to be injective. For example, this allows to define
2524 endomorphisms as locale endom = homom mult mult h.
2526 * Isar/locales: changed the way locales with predicates are defined.
2527 Instead of accumulating the specification, the imported expression is
2528 now an interpretation. INCOMPATIBILITY: different normal form of
2529 locale expressions. In particular, in interpretations of locales with
2530 predicates, goals repesenting already interpreted fragments are not
2531 removed automatically. Use methods `intro_locales' and
2532 `unfold_locales'; see below.
2534 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2535 provide backward reasoning on locales predicates. The methods are
2536 aware of interpretations and discharge corresponding goals.
2537 `intro_locales' is less aggressive then `unfold_locales' and does not
2538 unfold predicates to assumptions.
2540 * Isar/locales: the order in which locale fragments are accumulated
2541 has changed. This enables to override declarations from fragments due
2542 to interpretations -- for example, unwanted simp rules.
2544 * Isar/locales: interpretation in theories and proof contexts has been
2545 extended. One may now specify (and prove) equations, which are
2546 unfolded in interpreted theorems. This is useful for replacing
2547 defined concepts (constants depending on locale parameters) by
2548 concepts already existing in the target context. Example:
2550 interpretation partial_order ["op <= :: [int, int] => bool"]
2551 where "partial_order.less (op <=) (x::int) y = (x < y)"
2553 Typically, the constant `partial_order.less' is created by a
2554 definition specification element in the context of locale
2557 * Method "induct": improved internal context management to support
2558 local fixes and defines on-the-fly. Thus explicit meta-level
2559 connectives !! and ==> are rarely required anymore in inductive goals
2560 (using object-logic connectives for this purpose has been long
2561 obsolete anyway). Common proof patterns are explained in
2562 src/HOL/Induct/Common_Patterns.thy, see also
2563 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2566 * Method "induct": improved handling of simultaneous goals. Instead of
2567 introducing object-level conjunction, the statement is now split into
2568 several conclusions, while the corresponding symbolic cases are nested
2569 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2570 see src/HOL/Induct/Common_Patterns.thy, for example.
2572 * Method "induct": mutual induction rules are now specified as a list
2573 of rule sharing the same induction cases. HOL packages usually provide
2574 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2575 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2576 mutual induction rules differently, i.e. like this:
2578 (induct rule: foo_bar.inducts)
2579 (induct set: foo bar)
2580 (induct pred: foo bar)
2581 (induct type: foo bar)
2583 The ML function ProjectRule.projections turns old-style rules into the
2586 * Method "coinduct": dual of induction, see
2587 src/HOL/Library/Coinductive_List.thy for various examples.
2589 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2590 considered a legacy feature.
2592 * Attribute "symmetric" produces result with standardized schematic
2593 variables (index 0). Potential INCOMPATIBILITY.
2595 * Simplifier: by default the simplifier trace only shows top level
2596 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2597 default. Thus there is less danger of being flooded by the trace. The
2598 trace indicates where parts have been suppressed.
2600 * Provers/classical: removed obsolete classical version of elim_format
2601 attribute; classical elim/dest rules are now treated uniformly when
2602 manipulating the claset.
2604 * Provers/classical: stricter checks to ensure that supplied intro,
2605 dest and elim rules are well-formed; dest and elim rules must have at
2608 * Provers/classical: attributes dest/elim/intro take an optional
2609 weight argument for the rule (just as the Pure versions). Weights are
2610 ignored by automated tools, but determine the search order of single
2613 * Syntax: input syntax now supports dummy variable binding "%_. b",
2614 where the body does not mention the bound variable. Note that dummy
2615 patterns implicitly depend on their context of bounds, which makes
2616 "{_. _}" match any set comprehension as expected. Potential
2617 INCOMPATIBILITY -- parse translations need to cope with syntactic
2618 constant "_idtdummy" in the binding position.
2620 * Syntax: removed obsolete syntactic constant "_K" and its associated
2621 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2622 for example "A -> B" => "Pi A (%_. B)".
2624 * Pure: 'class_deps' command visualizes the subclass relation, using
2625 the graph browser tool.
2627 * Pure: 'print_theory' now suppresses certain internal declarations by
2628 default; use '!' option for full details.
2633 * Method "metis" proves goals by applying the Metis general-purpose
2634 resolution prover (see also http://gilith.com/software/metis/).
2635 Examples are in the directory MetisExamples. WARNING: the
2636 Isabelle/HOL-Metis integration does not yet work properly with
2639 * Command 'sledgehammer' invokes external automatic theorem provers as
2640 background processes. It generates calls to the "metis" method if
2641 successful. These can be pasted into the proof. Users do not have to
2642 wait for the automatic provers to return. WARNING: does not really
2643 work with multi-threading.
2645 * New "auto_quickcheck" feature tests outermost goal statements for
2646 potential counter-examples. Controlled by ML references
2647 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2648 5000 milliseconds). Fails silently if statements is outside of
2649 executable fragment, or any other codgenerator problem occurs.
2651 * New constant "undefined" with axiom "undefined x = undefined".
2653 * Added class "HOL.eq", allowing for code generation with polymorphic
2656 * Some renaming of class constants due to canonical name prefixing in
2657 the new 'class' package:
2659 HOL.abs ~> HOL.abs_class.abs
2660 HOL.divide ~> HOL.divide_class.divide
2661 0 ~> HOL.zero_class.zero
2662 1 ~> HOL.one_class.one
2663 op + ~> HOL.plus_class.plus
2664 op - ~> HOL.minus_class.minus
2665 uminus ~> HOL.minus_class.uminus
2666 op * ~> HOL.times_class.times
2667 op < ~> HOL.ord_class.less
2668 op <= > HOL.ord_class.less_eq
2669 Nat.power ~> Power.power_class.power
2670 Nat.size ~> Nat.size_class.size
2671 Numeral.number_of ~> Numeral.number_class.number_of
2672 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2673 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2674 Orderings.min ~> Orderings.ord_class.min
2675 Orderings.max ~> Orderings.ord_class.max
2676 Divides.op div ~> Divides.div_class.div
2677 Divides.op mod ~> Divides.div_class.mod
2678 Divides.op dvd ~> Divides.div_class.dvd
2680 INCOMPATIBILITY. Adaptions may be required in the following cases:
2682 a) User-defined constants using any of the names "plus", "minus",
2683 "times", "less" or "less_eq". The standard syntax translations for
2684 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2687 b) Variables named "plus", "minus", "times", "less", "less_eq"
2688 INCOMPATIBILITY: use more specific names.
2690 c) Permutative equations (e.g. "a + b = b + a")
2691 Since the change of names also changes the order of terms, permutative
2692 rewrite rules may get applied in a different order. Experience shows
2693 that this is rarely the case (only two adaptions in the whole Isabelle
2694 distribution). INCOMPATIBILITY: rewrite proofs
2696 d) ML code directly refering to constant names
2697 This in general only affects hand-written proof tactics, simprocs and
2698 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2699 Consider using @{const_name} antiquotation.
2701 * New class "default" with associated constant "default".
2703 * Function "sgn" is now overloaded and available on int, real, complex
2704 (and other numeric types), using class "sgn". Two possible defs of
2705 sgn are given as equational assumptions in the classes sgn_if and
2706 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2709 * Locale "partial_order" now unified with class "order" (cf. theory
2710 Orderings), added parameter "less". INCOMPATIBILITY.
2712 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2713 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2714 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2716 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2717 changed order of proof goals in instance proofs.
2719 * The transitivity reasoner for partial and linear orders is set up
2720 for classes "order" and "linorder". Instances of the reasoner are available
2721 in all contexts importing or interpreting the corresponding locales.
2722 Method "order" invokes the reasoner separately; the reasoner
2723 is also integrated with the Simplifier as a solver. Diagnostic
2724 command 'print_orders' shows the available instances of the reasoner
2725 in the current context.
2727 * Localized monotonicity predicate in theory "Orderings"; integrated
2728 lemmas max_of_mono and min_of_mono with this predicate.
2731 * Formulation of theorem "dense" changed slightly due to integration
2732 with new class dense_linear_order.
2734 * Uniform lattice theory development in HOL.
2736 constants "meet" and "join" now named "inf" and "sup"
2737 constant "Meet" now named "Inf"
2739 classes "meet_semilorder" and "join_semilorder" now named
2740 "lower_semilattice" and "upper_semilattice"
2741 class "lorder" now named "lattice"
2742 class "comp_lat" now named "complete_lattice"
2744 Instantiation of lattice classes allows explicit definitions
2745 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2747 INCOMPATIBILITY. Theorem renames:
2749 meet_left_le ~> inf_le1
2750 meet_right_le ~> inf_le2
2751 join_left_le ~> sup_ge1
2752 join_right_le ~> sup_ge2
2753 meet_join_le ~> inf_sup_ord
2756 le_meet ~> le_inf_iff
2757 le_join ~> ge_sup_conv
2758 meet_idempotent ~> inf_idem
2759 join_idempotent ~> sup_idem
2760 meet_comm ~> inf_commute
2761 join_comm ~> sup_commute
2762 meet_leI1 ~> le_infI1
2763 meet_leI2 ~> le_infI2
2764 le_joinI1 ~> le_supI1
2765 le_joinI2 ~> le_supI2
2766 meet_assoc ~> inf_assoc
2767 join_assoc ~> sup_assoc
2768 meet_left_comm ~> inf_left_commute
2769 meet_left_idempotent ~> inf_left_idem
2770 join_left_comm ~> sup_left_commute
2771 join_left_idempotent ~> sup_left_idem
2774 le_def_meet ~> le_iff_inf
2775 le_def_join ~> le_iff_sup
2776 join_absorp2 ~> sup_absorb2
2777 join_absorp1 ~> sup_absorb1
2778 meet_absorp1 ~> inf_absorb1
2779 meet_absorp2 ~> inf_absorb2
2780 meet_join_absorp ~> inf_sup_absorb
2781 join_meet_absorp ~> sup_inf_absorb
2782 distrib_join_le ~> distrib_sup_le
2783 distrib_meet_le ~> distrib_inf_le
2785 add_meet_distrib_left ~> add_inf_distrib_left
2786 add_join_distrib_left ~> add_sup_distrib_left
2787 is_join_neg_meet ~> is_join_neg_inf
2788 is_meet_neg_join ~> is_meet_neg_sup
2789 add_meet_distrib_right ~> add_inf_distrib_right
2790 add_join_distrib_right ~> add_sup_distrib_right
2791 add_meet_join_distribs ~> add_sup_inf_distribs
2792 join_eq_neg_meet ~> sup_eq_neg_inf
2793 meet_eq_neg_join ~> inf_eq_neg_sup
2794 add_eq_meet_join ~> add_eq_inf_sup
2795 meet_0_imp_0 ~> inf_0_imp_0
2796 join_0_imp_0 ~> sup_0_imp_0
2797 meet_0_eq_0 ~> inf_0_eq_0
2798 join_0_eq_0 ~> sup_0_eq_0
2799 neg_meet_eq_join ~> neg_inf_eq_sup
2800 neg_join_eq_meet ~> neg_sup_eq_inf
2801 join_eq_if ~> sup_eq_if
2803 mono_meet ~> mono_inf
2804 mono_join ~> mono_sup
2805 meet_bool_eq ~> inf_bool_eq
2806 join_bool_eq ~> sup_bool_eq
2807 meet_fun_eq ~> inf_fun_eq
2808 join_fun_eq ~> sup_fun_eq
2809 meet_set_eq ~> inf_set_eq
2810 join_set_eq ~> sup_set_eq
2811 meet1_iff ~> inf1_iff
2812 meet2_iff ~> inf2_iff
2821 join1_iff ~> sup1_iff
2822 join2_iff ~> sup2_iff
2832 is_meet_Meet ~> is_meet_Inf
2833 Meet_bool_def ~> Inf_bool_def
2834 Meet_fun_def ~> Inf_fun_def
2835 Meet_greatest ~> Inf_greatest
2836 Meet_lower ~> Inf_lower
2837 Meet_set_def ~> Inf_set_def
2840 Sup_bool_eq ~> Sup_bool_def
2841 Sup_fun_eq ~> Sup_fun_def
2842 Sup_set_eq ~> Sup_set_def
2844 listsp_meetI ~> listsp_infI
2845 listsp_meet_eq ~> listsp_inf_eq
2850 * Added syntactic class "size"; overloaded constant "size" now has
2851 type "'a::size ==> bool"
2853 * Internal reorganisation of `size' of datatypes: size theorems
2854 "foo.size" are no longer subsumed by "foo.simps" (but are still
2855 simplification rules by default!); theorems "prod.size" now named
2858 * Class "div" now inherits from class "times" rather than "type".
2861 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2862 Linorder etc. have disappeared; operations defined in terms of
2863 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2865 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2867 * HOL-Word: New extensive library and type for generic, fixed size
2868 machine words, with arithemtic, bit-wise, shifting and rotating
2869 operations, reflection into int, nat, and bool lists, automation for
2870 linear arithmetic (by automatic reflection into nat or int), including
2871 lemmas on overflow and monotonicity. Instantiated to all appropriate
2872 arithmetic type classes, supporting automatic simplification of
2873 numerals on all operations.
2875 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2877 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2879 * Code generator library theories:
2880 - Code_Integer represents HOL integers by big integer literals in target
2882 - Code_Char represents HOL characters by character literals in target
2884 - Code_Char_chr like Code_Char, but also offers treatment of character
2885 codes; includes Code_Integer.
2886 - Executable_Set allows to generate code for finite sets using lists.
2887 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2889 - Executable_Real implements a subset of real numbers, namly those
2890 representable by rational numbers.
2891 - Efficient_Nat implements natural numbers by integers, which in general will
2892 result in higher efficency; pattern matching with 0/Suc is eliminated;
2893 includes Code_Integer.
2894 - Code_Index provides an additional datatype index which is mapped to
2895 target-language built-in integers.
2896 - Code_Message provides an additional datatype message_string which is isomorphic to
2897 strings; messages are mapped to target-language strings.
2899 * New package for inductive predicates
2901 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2904 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2905 for z_1 :: U_1 and ... and z_n :: U_m
2907 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2910 with full support for type-inference, rather than
2912 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2914 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2915 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2917 inductive "s z_1 ... z_m"
2919 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2922 For backward compatibility, there is a wrapper allowing inductive
2923 sets to be defined with the new package via
2926 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2927 for z_1 :: U_1 and ... and z_n :: U_m
2929 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2935 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2936 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2937 for z_1 :: U_1 and ... and z_n :: U_m
2939 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2940 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2943 if the additional syntax "p ..." is required.
2945 Numerous examples can be found in the subdirectories src/HOL/Auth,
2946 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2950 - Since declaration and definition of inductive sets or predicates
2951 is no longer separated, abbreviations involving the newly
2952 introduced sets or predicates must be specified together with the
2953 introduction rules after the 'where' keyword (see above), rather
2954 than before the actual inductive definition.
2956 - The variables in induction and elimination rules are now
2957 quantified in the order of their occurrence in the introduction
2958 rules, rather than in alphabetical order. Since this may break
2959 some proofs, these proofs either have to be repaired, e.g. by
2960 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2961 statements of the form
2963 case (rule_i a_i_1 ... a_i_{k_i})
2965 or the old order of quantification has to be restored by explicitly adding
2966 meta-level quantifiers in the introduction rules, i.e.
2968 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2970 - The format of the elimination rules is now
2972 p z_1 ... z_m x_1 ... x_n ==>
2973 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2978 (x_1, ..., x_n) : s z_1 ... z_m ==>
2979 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2982 for sets rather than
2984 x : s z_1 ... z_m ==>
2985 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2988 This may require terms in goals to be expanded to n-tuples
2989 (e.g. using case_tac or simplification with the split_paired_all
2990 rule) before the above elimination rule is applicable.
2992 - The elimination or case analysis rules for (mutually) inductive
2993 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2994 list of rules "p_1_..._p_k.elims" is no longer available.
2996 * New package "function"/"fun" for general recursive functions,
2997 supporting mutual and nested recursion, definitions in local contexts,
2998 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2999 for small examples, and the separate tutorial on the function
3000 package. The old recdef "package" is still available as before, but
3001 users are encouraged to use the new package.
3003 * Method "lexicographic_order" automatically synthesizes termination
3004 relations as lexicographic combinations of size measures.
3006 * Case-expressions allow arbitrary constructor-patterns (including
3007 "_") and take their order into account, like in functional
3008 programming. Internally, this is translated into nested
3009 case-expressions; missing cases are added and mapped to the predefined
3010 constant "undefined". In complicated cases printing may no longer show
3011 the original input but the internal form. Lambda-abstractions allow
3012 the same form of pattern matching: "% pat1 => e1 | ..." is an
3013 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
3016 * IntDef: The constant "int :: nat => int" has been removed; now "int"
3017 is an abbreviation for "of_nat :: nat => int". The simplification
3018 rules for "of_nat" have been changed to work like "int" did
3019 previously. Potential INCOMPATIBILITY:
3020 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
3021 - of_nat_diff and of_nat_mult are no longer default simp rules
3023 * Method "algebra" solves polynomial equations over (semi)rings using
3024 Groebner bases. The (semi)ring structure is defined by locales and the
3025 tool setup depends on that generic context. Installing the method for
3026 a specific type involves instantiating the locale and possibly adding
3027 declarations for computation on the coefficients. The method is
3028 already instantiated for natural numbers and for the axiomatic class
3029 of idoms with numerals. See also the paper by Chaieb and Wenzel at
3030 CALCULEMUS 2007 for the general principles underlying this
3031 architecture of context-aware proof-tools.
3033 * Method "ferrack" implements quantifier elimination over
3034 special-purpose dense linear orders using locales (analogous to
3035 "algebra"). The method is already installed for class
3036 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
3039 * Former constant "List.op @" now named "List.append". Use ML
3040 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
3041 circumvent possible incompatibilities when working on ML level.
3043 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3045 * New function listsum :: 'a list => 'a for arbitrary monoids.
3046 Special syntax: "SUM x <- xs. f x" (and latex variants)
3048 * New syntax for Haskell-like list comprehension (input only), eg.
3049 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3051 * The special syntax for function "filter" has changed from [x :
3052 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3053 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3055 * [a..b] is now defined for arbitrary linear orders. It used to be
3056 defined on nat only, as an abbreviation for [a..<Suc b]
3059 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3061 * New functions "sorted" and "sort" in src/HOL/List.thy.
3063 * New lemma collection field_simps (an extension of ring_simps) for
3064 manipulating (in)equations involving division. Multiplies with all
3065 denominators that can be proved to be non-zero (in equations) or
3066 positive/negative (in inequations).
3068 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3069 have been improved and renamed to ring_simps, group_simps and
3070 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3071 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3073 * Theory Library/Commutative_Ring: switched from recdef to function
3074 package; constants add, mul, pow now curried. Infix syntax for
3075 algebraic operations.
3077 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3080 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3083 * HOL/records: generalised field-update to take a function on the
3084 field rather than the new value: r(|A := x|) is translated to A_update
3085 (K x) r The K-combinator that is internally used is called K_record.
3086 INCOMPATIBILITY: Usage of the plain update functions has to be
3089 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3090 * x = 0, which are required for a semiring. Richer structures do not
3091 inherit from semiring_0 anymore, because this property is a theorem
3092 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3093 there is more to prove, but this is mostly trivial.
3095 * Class "recpower" is generalized to arbitrary monoids, not just
3096 commutative semirings. INCOMPATIBILITY: may need to incorporate
3097 commutativity or semiring properties additionally.
3099 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3100 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3101 better use 'abbreviation'.
3103 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3105 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3106 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3107 significant changes for setting up numeral syntax for types:
3108 - New constants Numeral.pred and Numeral.succ instead
3109 of former Numeral.bin_pred and Numeral.bin_succ.
3110 - Use integer operations instead of bin_add, bin_mult and so on.
3111 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3112 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3114 See src/HOL/Integ/IntArith.thy for an example setup.
3116 * Command 'normal_form' computes the normal form of a term that may
3117 contain free variables. For example ``normal_form "rev [a, b, c]"''
3118 produces ``[b, c, a]'' (without proof). This command is suitable for
3119 heavy-duty computations because the functions are compiled to ML
3120 first. Correspondingly, a method "normalization" is provided. See
3121 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3123 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3124 25 like -->); output depends on the "iff" print_mode, the default is
3125 "A = B" (with priority 50).
3127 * Relations less (<) and less_eq (<=) are also available on type bool.
3128 Modified syntax to disallow nesting without explicit parentheses,
3129 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3132 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3134 * Relation composition operator "op O" now has precedence 75 and binds
3135 stronger than union and intersection. INCOMPATIBILITY.
3137 * The old set interval syntax "{m..n(}" (and relatives) has been
3138 removed. Use "{m..<n}" (and relatives) instead.
3140 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3141 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3142 ``declare [[simproc del: neq]]''.
3144 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3147 * Theorem Cons_eq_map_conv no longer declared as "simp".
3149 * Theorem setsum_mult renamed to setsum_right_distrib.
3151 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3154 * Reimplemented methods "sat" and "satx", with several improvements:
3155 goals no longer need to be stated as "<prems> ==> False", equivalences
3156 (i.e. "=" on type bool) are handled, variable names of the form
3157 "lit_<n>" are no longer reserved, significant speedup.
3159 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3160 zChaff is still supported as well.
3162 * 'inductive' and 'datatype': provide projections of mutual rules,
3163 bundled as foo_bar.inducts;
3165 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3168 * Library: moved theory Accessible_Part to main HOL.
3170 * Library: added theory Coinductive_List of potentially infinite lists
3171 as greatest fixed-point.
3173 * Library: added theory AssocList which implements (finite) maps as
3176 * Method "evaluation" solves goals (i.e. a boolean expression)
3177 efficiently by compiling it to ML. The goal is "proved" (via an
3178 oracle) if it evaluates to True.
3180 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3181 also when invoked by the simplifier. This results in the Simplifier
3182 being more powerful on arithmetic goals. INCOMPATIBILITY.
3183 Configuration option fast_arith_split_limit=0 recovers the old
3186 * Support for hex (0x20) and binary (0b1001) numerals.
3188 * New method: reify eqs (t), where eqs are equations for an
3189 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3190 parameter, computes a term s::'b and a list xs::'a list and proves the
3191 theorem I xs s = t. This is also known as reification or quoting. The
3192 resulting theorem is applied to the subgoal to substitute t with I xs
3193 s. If t is omitted, the subgoal itself is reified.
3195 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3196 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3197 where f is supposed to be a computable function (in the sense of code
3198 generattion). The method uses reify to compute s and xs as above then
3199 applies corr_thm and uses normalization by evaluation to "prove" f s =
3200 r and finally gets the theorem t = r, which is again applied to the
3201 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3203 * Reflection: Automatic reification now handels binding, an example is
3204 available in src/HOL/ex/ReflectionEx.thy
3206 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3207 command 'statespace' that is similar to 'record', but introduces an
3208 abstract specification based on the locale infrastructure instead of
3209 HOL types. This leads to extra flexibility in composing state spaces,
3210 in particular multiple inheritance and renaming of components.
3215 * Hyperreal: Functions root and sqrt are now defined on negative real
3216 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3217 Nonnegativity side conditions have been removed from many lemmas, so
3218 that more subgoals may now be solved by simplification; potential
3221 * Real: new type classes formalize real normed vector spaces and
3222 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3223 and norm :: 'a => real.
3225 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3226 reals into other types. The overloaded constant Reals :: 'a set is now
3227 defined as range of_real; potential INCOMPATIBILITY.
3229 * Real: proper support for ML code generation, including 'quickcheck'.
3230 Reals are implemented as arbitrary precision rationals.
3232 * Hyperreal: Several constants that previously worked only for the
3233 reals have been generalized, so they now work over arbitrary vector
3234 spaces. Type annotations may need to be added in some cases; potential
3237 Infinitesimal :: ('a::real_normed_vector) star set
3238 HFinite :: ('a::real_normed_vector) star set
3239 HInfinite :: ('a::real_normed_vector) star set
3240 approx :: ('a::real_normed_vector) star => 'a star => bool
3241 monad :: ('a::real_normed_vector) star => 'a star set
3242 galaxy :: ('a::real_normed_vector) star => 'a star set
3243 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3244 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3245 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3246 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3247 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3248 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3249 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3250 sgn :: 'a::real_normed_vector => 'a
3251 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3253 * Complex: Some complex-specific constants are now abbreviations for
3254 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3255 hnorm. Other constants have been entirely removed in favor of the
3256 polymorphic versions (INCOMPATIBILITY):
3260 HInfinite <-- CInfinite
3261 Infinitesimal <-- CInfinitesimal
3264 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3265 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3266 (ns)deriv <-- (ns)cderiv
3271 * Formalisation of ideals and the quotient construction over rings.
3273 * Order and lattice theory no longer based on records.
3276 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3277 greatest_closed. INCOMPATIBILITY.
3279 * Method algebra is now set up via an attribute. For examples see
3280 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3281 of algebraic structures.
3283 * Renamed theory CRing to Ring.
3288 * Substantial, yet incomplete support for nominal datatypes (binding
3289 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3290 src/HOL/Nominal/Examples. Prospective users should consult
3291 http://isabelle.in.tum.de/nominal/
3296 * ML basics: just one true type int, which coincides with IntInf.int
3299 * ML within Isar: antiquotations allow to embed statically-checked
3300 formal entities in the source, referring to the context available at
3301 compile-time. For example:
3303 ML {* @{sort "{zero,one}"} *}
3304 ML {* @{typ "'a => 'b"} *}
3305 ML {* @{term "%x. x"} *}
3306 ML {* @{prop "x == y"} *}
3307 ML {* @{ctyp "'a => 'b"} *}
3308 ML {* @{cterm "%x. x"} *}
3309 ML {* @{cprop "x == y"} *}
3310 ML {* @{thm asm_rl} *}
3311 ML {* @{thms asm_rl} *}
3312 ML {* @{type_name c} *}
3313 ML {* @{type_syntax c} *}
3314 ML {* @{const_name c} *}
3315 ML {* @{const_syntax c} *}
3318 ML {* @{theory Pure} *}
3319 ML {* @{theory_ref} *}
3320 ML {* @{theory_ref Pure} *}
3323 ML {* @{clasimpset} *}
3325 The same works for sources being ``used'' within an Isar context.
3327 * ML in Isar: improved error reporting; extra verbosity with
3328 ML_Context.trace enabled.
3330 * Pure/General/table.ML: the join operations now works via exceptions
3331 DUP/SAME instead of type option. This is simpler in simple cases, and
3332 admits slightly more efficient complex applications.
3334 * Pure: 'advanced' translation functions (parse_translation etc.) now
3335 use Context.generic instead of just theory.
3337 * Pure: datatype Context.generic joins theory/Proof.context and
3338 provides some facilities for code that works in either kind of
3339 context, notably GenericDataFun for uniform theory and proof data.
3341 * Pure: simplified internal attribute type, which is now always
3342 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3343 local (Proof.context) attributes have been discontinued, while
3344 minimizing code duplication. Thm.rule_attribute and
3345 Thm.declaration_attribute build canonical attributes; see also structure
3346 Context for further operations on Context.generic, notably
3347 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3348 declarations and definitions.
3350 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3351 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3352 init only required for impure data. INCOMPATIBILITY: empty really need
3353 to be empty (no dependencies on theory content!)
3355 * Pure/kernel: consts certification ignores sort constraints given in
3356 signature declarations. (This information is not relevant to the
3357 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3358 potential INCOMPATIBILITY.
3360 * Pure: axiomatic type classes are now purely definitional, with
3361 explicit proofs of class axioms and super class relations performed
3362 internally. See Pure/axclass.ML for the main internal interfaces --
3363 notably AxClass.define_class supercedes AxClass.add_axclass, and
3364 AxClass.axiomatize_class/classrel/arity supersede
3365 Sign.add_classes/classrel/arities.
3367 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3368 global/local versions on theory vs. Proof.context have been
3369 discontinued; Attrib.syntax and Method.syntax have been adapted
3370 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3371 attributes, methods, etc.
3373 * Pure: several functions of signature "... -> theory -> theory * ..."
3374 have been reoriented to "... -> theory -> ... * theory" in order to
3375 allow natural usage in combination with the ||>, ||>>, |-> and
3376 fold_map combinators.
3378 * Pure: official theorem names (closed derivations) and additional
3379 comments (tags) are now strictly separate. Name hints -- which are
3380 maintained as tags -- may be attached any time without affecting the
3383 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3384 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3385 achieve the old behaviour.
3387 * Pure: the "Goal" constant is now called "prop", supporting a
3388 slightly more general idea of ``protecting'' meta-level rule
3391 * Pure: Logic.(un)varify only works in a global context, which is now
3392 enforced instead of silently assumed. INCOMPATIBILITY, may use
3393 Logic.legacy_(un)varify as temporary workaround.
3395 * Pure: structure Name provides scalable operations for generating
3396 internal variable names, notably Name.variants etc. This replaces
3397 some popular functions from term.ML:
3399 Term.variant -> Name.variant
3400 Term.variantlist -> Name.variant_list
3401 Term.invent_names -> Name.invent_list
3403 Note that low-level renaming rarely occurs in new code -- operations
3404 from structure Variable are used instead (see below).
3406 * Pure: structure Variable provides fundamental operations for proper
3407 treatment of fixed/schematic variables in a context. For example,
3408 Variable.import introduces fixes for schematics of given facts and
3409 Variable.export reverses the effect (up to renaming) -- this replaces
3410 various freeze_thaw operations.
3412 * Pure: structure Goal provides simple interfaces for
3413 init/conclude/finish and tactical prove operations (replacing former
3414 Tactic.prove). Goal.prove is the canonical way to prove results
3415 within a given context; Goal.prove_global is a degraded version for
3416 theory level goals, including a global Drule.standard. Note that
3417 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3418 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3419 in a locale context).
3421 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3422 and type checking (Syntax.check_term etc.), with common combinations
3423 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3424 which are considered legacy and await removal.
3426 * Pure/Syntax: generic interfaces for type unchecking
3427 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3428 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3429 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3430 available for convenience, but refer to the very same operations using
3431 a mere theory instead of a full context.
3433 * Isar: simplified treatment of user-level errors, using exception
3434 ERROR of string uniformly. Function error now merely raises ERROR,
3435 without any side effect on output channels. The Isar toplevel takes
3436 care of proper display of ERROR exceptions. ML code may use plain
3437 handle/can/try; cat_error may be used to concatenate errors like this:
3439 ... handle ERROR msg => cat_error msg "..."
3441 Toplevel ML code (run directly or through the Isar toplevel) may be
3442 embedded into the Isar toplevel with exception display/debug like
3445 Isar.toplevel (fn () => ...)
3447 INCOMPATIBILITY, removed special transform_error facilities, removed
3448 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3449 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3450 -- use plain ERROR instead.
3452 * Isar: theory setup now has type (theory -> theory), instead of a
3453 list. INCOMPATIBILITY, may use #> to compose setup functions.
3455 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3456 ProofContext.debug/verbose flags.
3458 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3459 theory before entering a proof state. Transactions now always see a
3460 quasi-functional intermediate checkpoint, both in interactive and
3463 * Isar: simplified interfaces for outer syntax. Renamed
3464 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3465 OuterSyntax.add_parsers -- this functionality is now included in
3466 OuterSyntax.command etc. INCOMPATIBILITY.
3468 * Simplifier: the simpset of a running simplification process now
3469 contains a proof context (cf. Simplifier.the_context), which is the
3470 very context that the initial simpset has been retrieved from (by
3471 simpset_of/local_simpset_of). Consequently, all plug-in components
3472 (solver, looper etc.) may depend on arbitrary proof data.
3474 * Simplifier.inherit_context inherits the proof context (plus the
3475 local bounds) of the current simplification process; any simproc
3476 etc. that calls the Simplifier recursively should do this! Removed
3477 former Simplifier.inherit_bounds, which is already included here --
3478 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3479 specify an explicit context using Simplifier.context/theory_context.
3481 * Simplifier/Classical Reasoner: more abstract interfaces
3482 change_simpset/claset for modifying the simpset/claset reference of a
3483 theory; raw versions simpset/claset_ref etc. have been discontinued --
3486 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3492 * settings: the default heap location within ISABELLE_HOME_USER now
3493 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3494 Isabelle installations.
3496 * isabelle-process: option -S (secure mode) disables some critical
3497 operations, notably runtime compilation and evaluation of ML source
3500 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3502 * Support for parallel execution, using native multicore support of
3503 Poly/ML 5.1. The theory loader exploits parallelism when processing
3504 independent theories, according to the given theory header
3505 specifications. The maximum number of worker threads is specified via
3506 usedir option -M or the "max-threads" setting in Proof General. A
3507 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3508 to 6 on a 8-core machine. User-code needs to observe certain
3509 guidelines for thread-safe programming, see appendix A in the Isar
3510 Implementation manual.
3514 New in Isabelle2005 (October 2005)
3515 ----------------------------------
3519 * Theory headers: the new header syntax for Isar theories is
3522 imports <theory1> ... <theoryN>
3523 uses <file1> ... <fileM>
3526 where the 'uses' part is optional. The previous syntax
3528 theory <name> = <theory1> + ... + <theoryN>:
3530 will disappear in the next release. Use isatool fixheaders to convert
3531 existing theory files. Note that there is no change in ancient
3532 non-Isar theories now, but these will disappear soon.
3534 * Theory loader: parent theories can now also be referred to via
3535 relative and absolute paths.
3537 * Command 'find_theorems' searches for a list of criteria instead of a
3538 list of constants. Known criteria are: intro, elim, dest, name:string,
3539 simp:term, and any term. Criteria can be preceded by '-' to select
3540 theorems that do not match. Intro, elim, dest select theorems that
3541 match the current goal, name:s selects theorems whose fully qualified
3542 name contain s, and simp:term selects all simplification rules whose
3543 lhs match term. Any other term is interpreted as pattern and selects
3544 all theorems matching the pattern. Available in ProofGeneral under
3545 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3547 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3549 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3550 matching the current goal as introduction rule and not having "HOL."
3551 in their name (i.e. not being defined in theory HOL).
3553 * Command 'thms_containing' has been discontinued in favour of
3554 'find_theorems'; INCOMPATIBILITY.
3556 * Communication with Proof General is now 8bit clean, which means that
3557 Unicode text in UTF-8 encoding may be used within theory texts (both
3558 formal and informal parts). Cf. option -U of the Isabelle Proof
3559 General interface. Here are some simple examples (cf. src/HOL/ex):
3561 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3562 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3564 * Improved efficiency of the Simplifier and, to a lesser degree, the
3565 Classical Reasoner. Typical big applications run around 2 times
3569 *** Document preparation ***
3571 * Commands 'display_drafts' and 'print_drafts' perform simple output
3572 of raw sources. Only those symbols that do not require additional
3573 LaTeX packages (depending on comments in isabellesym.sty) are
3574 displayed properly, everything else is left verbatim. isatool display
3575 and isatool print are used as front ends (these are subject to the
3576 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3578 * Command tags control specific markup of certain regions of text,
3579 notably folding and hiding. Predefined tags include "theory" (for
3580 theory begin and end), "proof" for proof commands, and "ML" for
3581 commands involving ML code; the additional tags "visible" and
3582 "invisible" are unused by default. Users may give explicit tag
3583 specifications in the text, e.g. ''by %invisible (auto)''. The
3584 interpretation of tags is determined by the LaTeX job during document
3585 preparation: see option -V of isatool usedir, or options -n and -t of
3586 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3589 Several document versions may be produced at the same time via isatool
3590 usedir (the generated index.html will link all of them). Typical
3591 specifications include ''-V document=theory,proof,ML'' to present
3592 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3593 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3594 these parts without any formal replacement text. The Isabelle site
3595 default settings produce ''document'' and ''outline'' versions as
3598 * Several new antiquotations:
3600 @{term_type term} prints a term with its type annotated;
3602 @{typeof term} prints the type of a term;
3604 @{const const} is the same as @{term const}, but checks that the
3605 argument is a known logical constant;
3607 @{term_style style term} and @{thm_style style thm} print a term or
3608 theorem applying a "style" to it
3612 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3613 definitions, equations, inequations etc., 'concl' printing only the
3614 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3615 to print the specified premise. TermStyle.add_style provides an ML
3616 interface for introducing further styles. See also the "LaTeX Sugar"
3617 document practical applications. The ML antiquotation prints
3618 type-checked ML expressions verbatim.
3620 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3621 and 'text' support optional locale specification '(in loc)', which
3622 specifies the default context for interpreting antiquotations. For
3623 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3625 * Option 'locale=NAME' of antiquotations specifies an alternative
3626 context interpreting the subsequent argument. For example: @{thm
3627 [locale=lattice] inf_assoc}.
3629 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3632 * Proper output of antiquotations for theory commands involving a
3633 proof context (such as 'locale' or 'theorem (in loc) ...').
3635 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3636 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3638 * isatool usedir: new option -C (default true) controls whether option
3639 -D should include a copy of the original document directory; -C false
3640 prevents unwanted effects such as copying of administrative CVS data.
3645 * Considerably improved version of 'constdefs' command. Now performs
3646 automatic type-inference of declared constants; additional support for
3647 local structure declarations (cf. locales and HOL records), see also
3648 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3649 sequential dependencies of definitions within a single 'constdefs'
3650 section; moreover, the declared name needs to be an identifier. If
3651 all fails, consider to fall back on 'consts' and 'defs' separately.
3653 * Improved indexed syntax and implicit structures. First of all,
3654 indexed syntax provides a notational device for subscripted
3655 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3656 expressions. Secondly, in a local context with structure
3657 declarations, number indexes \<^sub>n or the empty index (default
3658 number 1) refer to a certain fixed variable implicitly; option
3659 show_structs controls printing of implicit structures. Typical
3660 applications of these concepts involve record types and locales.
3662 * New command 'no_syntax' removes grammar declarations (and
3663 translations) resulting from the given syntax specification, which is
3664 interpreted in the same manner as for the 'syntax' command.
3666 * 'Advanced' translation functions (parse_translation etc.) may depend
3667 on the signature of the theory context being presently used for
3668 parsing/printing, see also isar-ref manual.
3670 * Improved 'oracle' command provides a type-safe interface to turn an
3671 ML expression of type theory -> T -> term into a primitive rule of
3672 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3673 is already included here); see also FOL/ex/IffExample.thy;
3676 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3677 before); "cI" is no longer bound, use "c.intro" instead.
3678 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3679 axclasses vs. locales.
3681 * Improved internal renaming of symbolic identifiers -- attach primes
3682 instead of base 26 numbers.
3684 * New flag show_question_marks controls printing of leading question
3685 marks in schematic variable names.
3687 * In schematic variable names, *any* symbol following \<^isub> or
3688 \<^isup> is now treated as part of the base name. For example, the
3689 following works without printing of awkward ".0" indexes:
3691 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3694 * Inner syntax includes (*(*nested*) comments*).
3696 * Pretty printer now supports unbreakable blocks, specified in mixfix
3697 annotations as "(00...)".
3699 * Clear separation of logical types and nonterminals, where the latter
3700 may only occur in 'syntax' specifications or type abbreviations.
3701 Before that distinction was only partially implemented via type class
3702 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3703 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3704 exotic syntax specifications may require further adaption
3705 (e.g. Cube/Cube.thy).
3707 * Removed obsolete type class "logic", use the top sort {} instead.
3708 Note that non-logical types should be declared as 'nonterminals'
3709 rather than 'types'. INCOMPATIBILITY for new object-logic
3712 * Attributes 'induct' and 'cases': type or set names may now be
3713 locally fixed variables as well.
3715 * Simplifier: can now control the depth to which conditional rewriting
3716 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3719 * Simplifier: simplification procedures may now take the current
3720 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3721 interface), which is very useful for calling the Simplifier
3722 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3723 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3724 low-level mk_simproc no longer applies Logic.varify internally, to
3725 allow for use in a context of fixed variables.
3727 * thin_tac now works even if the assumption being deleted contains !!
3728 or ==>. More generally, erule now works even if the major premise of
3729 the elimination rule contains !! or ==>.
3731 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3733 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3734 from Pure, which contains all common declarations already. Both
3735 theories are defined via plain Isabelle/Isar .thy files.
3736 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3737 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3738 use isatool fixcpure to adapt your theory and ML sources.
3740 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3741 selections of theorems in named facts via index ranges.
3743 * 'print_theorems': in theory mode, really print the difference
3744 wrt. the last state (works for interactive theory development only),
3745 in proof mode print all local facts (cf. 'print_facts');
3747 * 'hide': option '(open)' hides only base names.
3749 * More efficient treatment of intermediate checkpoints in interactive
3752 * Code generator is now invoked via code_module (incremental code
3753 generation) and code_library (modular code generation, ML structures
3754 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3755 must be quoted when used as identifiers.
3757 * New 'value' command for reading, evaluating and printing terms using
3758 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3759 quoted when used as identifier.
3764 * New commands for the interpretation of locale expressions in
3765 theories (1), locales (2) and proof contexts (3). These generate
3766 proof obligations from the expression specification. After the
3767 obligations have been discharged, theorems of the expression are added
3768 to the theory, target locale or proof context. The synopsis of the
3769 commands is a follows:
3771 (1) interpretation expr inst
3772 (2) interpretation target < expr
3773 (3) interpret expr inst
3775 Interpretation in theories and proof contexts require a parameter
3776 instantiation of terms from the current context. This is applied to
3777 specifications and theorems of the interpreted expression.
3778 Interpretation in locales only permits parameter renaming through the
3779 locale expression. Interpretation is smart in that interpretations
3780 that are active already do not occur in proof obligations, neither are
3781 instantiated theorems stored in duplicate. Use 'print_interps' to
3782 inspect active interpretations of a particular locale. For details,
3783 see the Isar Reference manual. Examples can be found in
3784 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3786 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3787 'interpret' instead.
3789 * New context element 'constrains' for adding type constraints to
3792 * Context expressions: renaming of parameters with syntax
3795 * Locale declaration: 'includes' disallowed.
3797 * Proper static binding of attribute syntax -- i.e. types / terms /
3798 facts mentioned as arguments are always those of the locale definition
3799 context, independently of the context of later invocations. Moreover,
3800 locale operations (renaming and type / term instantiation) are applied
3801 to attribute arguments as expected.
3803 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3804 actual attributes; rare situations may require Attrib.attribute to
3805 embed those attributes into Attrib.src that lack concrete syntax.
3806 Attribute implementations need to cooperate properly with the static
3807 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3808 Attrib.XXX_thm etc. already do the right thing without further
3809 intervention. Only unusual applications -- such as "where" or "of"
3810 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3811 on the context and the facts involved -- may have to assign parsed
3812 values to argument tokens explicitly.
3814 * Changed parameter management in theorem generation for long goal
3815 statements with 'includes'. INCOMPATIBILITY: produces a different
3816 theorem statement in rare situations.
3818 * Locale inspection command 'print_locale' omits notes elements. Use
3819 'print_locale!' to have them included in the output.
3824 * Provers/hypsubst.ML: improved version of the subst method, for
3825 single-step rewriting: it now works in bound variable contexts. New is
3826 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3827 rewrite a different subterm than the original subst method, which is
3828 still available as 'simplesubst'.
3830 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3833 * Provers/trancl.ML: new transitivity reasoner for transitive and
3834 reflexive-transitive closure of relations.
3836 * Provers/blast.ML: new reference depth_limit to make blast's depth
3837 limit (previously hard-coded with a value of 20) user-definable.
3839 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3840 is peformed already. Object-logics merely need to finish their
3841 initial simpset configuration as before. INCOMPATIBILITY.
3846 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3849 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3851 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3852 and x-symbol; use option '-m epsilon' to get it actually printed.
3853 Moreover, the mathematically important symbolic identifier \<epsilon>
3854 becomes available as variable, constant etc. INCOMPATIBILITY,
3856 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3857 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3858 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3859 support corresponding Isar calculations.
3861 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3864 * theory SetInterval: changed the syntax for open intervals:
3873 The old syntax is still supported but will disappear in the next
3874 release. For conversion use the following Emacs search and replace
3875 patterns (these are not perfect but work quite well):
3877 {)\([^\.]*\)\.\. -> {\1<\.\.}
3878 \.\.\([^(}]*\)(} -> \.\.<\1}
3880 * Theory Commutative_Ring (in Library): method comm_ring for proving
3881 equalities in commutative rings; method 'algebra' provides a generic
3884 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3885 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3886 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3889 Some new syntax forms are available:
3891 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3892 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3893 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3894 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3896 The latter form "\<Sum>x < k. e" used to be based on a separate
3897 function "Summation", which has been discontinued.
3899 * theory Finite_Set: in structured induction proofs, the insert case
3900 is now 'case (insert x F)' instead of the old counterintuitive 'case
3903 * The 'refute' command has been extended to support a much larger
3904 fragment of HOL, including axiomatic type classes, constdefs and
3905 typedefs, inductive datatypes and recursion.
3907 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3908 Requires zChaff with proof generation to be installed. See
3909 HOL/ex/SAT_Examples.thy for examples.
3911 * Datatype induction via method 'induct' now preserves the name of the
3912 induction variable. For example, when proving P(xs::'a list) by
3913 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3914 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3915 in unstructured proof scripts.
3917 * Reworked implementation of records. Improved scalability for
3918 records with many fields, avoiding performance problems for type
3919 inference. Records are no longer composed of nested field types, but
3920 of nested extension types. Therefore the record type only grows linear
3921 in the number of extensions and not in the number of fields. The
3922 top-level (users) view on records is preserved. Potential
3923 INCOMPATIBILITY only in strange cases, where the theory depends on the
3924 old record representation. The type generated for a record is called
3925 <record_name>_ext_type.
3927 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3928 proofs triggered by a record definition or a simproc (if
3929 quick_and_dirty is enabled). Definitions of large records can take
3932 New simproc record_upd_simproc for simplification of multiple record
3933 updates enabled by default. Moreover, trivial updates are also
3934 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3935 occasionally, since simplification is more powerful by default.
3937 * typedef: proper support for polymorphic sets, which contain extra
3938 type-variables in the term.
3940 * Simplifier: automatically reasons about transitivity chains
3941 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3942 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3943 old proofs break occasionally as simplification may now solve more
3944 goals than previously.
3946 * Simplifier: converts x <= y into x = y if assumption y <= x is
3947 present. Works for all partial orders (class "order"), in particular
3948 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3951 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3952 bound variable or a constant then the let is unfolded. Otherwise
3953 first a is simplified to b, and then f b is simplified to g. If
3954 possible we abstract b from g arriving at "let x = b in h x",
3955 otherwise we unfold the let and arrive at g. The simproc can be
3956 enabled/disabled by the reference use_let_simproc. Potential
3957 INCOMPATIBILITY since simplification is more powerful by default.
3959 * Classical reasoning: the meson method now accepts theorems as arguments.
3961 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3962 jobs to provide advice on the provability of subgoals.
3964 * Theory OrderedGroup and Ring_and_Field: various additions and
3965 improvements to faciliate calculations involving equalities and
3968 The following theorems have been eliminated or modified
3971 abs_eq now named abs_of_nonneg
3972 abs_of_ge_0 now named abs_of_nonneg
3973 abs_minus_eq now named abs_of_nonpos
3974 imp_abs_id now named abs_of_nonneg
3975 imp_abs_neg_id now named abs_of_nonpos
3976 mult_pos now named mult_pos_pos
3977 mult_pos_le now named mult_nonneg_nonneg
3978 mult_pos_neg_le now named mult_nonneg_nonpos
3979 mult_pos_neg2_le now named mult_nonneg_nonpos2
3980 mult_neg now named mult_neg_neg
3981 mult_neg_le now named mult_nonpos_nonpos
3983 * The following lemmas in Ring_and_Field have been added to the simplifier:
3986 not_square_less_zero
3988 The following lemmas have been deleted from Real/RealPow:
3998 * Theory Parity: added rules for simplifying exponents.
4002 The following theorems have been eliminated or modified
4005 list_all_Nil now named list_all.simps(1)
4006 list_all_Cons now named list_all.simps(2)
4007 list_all_conv now named list_all_iff
4008 set_mem_eq now named mem_iff
4010 * Theories SetsAndFunctions and BigO (see HOL/Library) support
4011 asymptotic "big O" calculations. See the notes in BigO.thy.
4016 * Theory RealDef: better support for embedding natural numbers and
4017 integers in the reals.
4019 The following theorems have been eliminated or modified
4022 exp_ge_add_one_self now requires no hypotheses
4023 real_of_int_add reversed direction of equality (use [symmetric])
4024 real_of_int_minus reversed direction of equality (use [symmetric])
4025 real_of_int_diff reversed direction of equality (use [symmetric])
4026 real_of_int_mult reversed direction of equality (use [symmetric])
4028 * Theory RComplete: expanded support for floor and ceiling functions.
4030 * Theory Ln is new, with properties of the natural logarithm
4032 * Hyperreal: There is a new type constructor "star" for making
4033 nonstandard types. The old type names are now type synonyms:
4037 hcomplex = complex star
4039 * Hyperreal: Many groups of similarly-defined constants have been
4040 replaced by polymorphic versions (INCOMPATIBILITY):
4042 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4044 starset <-- starsetNat, starsetC
4045 *s* <-- *sNat*, *sc*
4046 starset_n <-- starsetNat_n, starsetC_n
4047 *sn* <-- *sNatn*, *scn*
4048 InternalSets <-- InternalNatSets, InternalCSets
4050 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4051 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4052 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4053 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4054 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4056 * Hyperreal: Many type-specific theorems have been removed in favor of
4057 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4059 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4060 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4061 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4062 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4063 right_minus <-- hypreal_add_minus
4064 left_minus <-- {hypreal,hcomplex}_add_minus_left
4065 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4066 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4067 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4068 mult_1_right <-- hcomplex_mult_one_right
4069 mult_zero_left <-- hcomplex_mult_zero_left
4070 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4071 right_distrib <-- hypnat_add_mult_distrib2
4072 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4073 right_inverse <-- hypreal_mult_inverse
4074 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4075 order_refl <-- {hypreal,hypnat}_le_refl
4076 order_trans <-- {hypreal,hypnat}_le_trans
4077 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4078 order_less_le <-- {hypreal,hypnat}_less_le
4079 linorder_linear <-- {hypreal,hypnat}_le_linear
4080 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4081 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4082 add_nonneg_nonneg <-- hypreal_le_add_order
4084 * Hyperreal: Separate theorems having to do with type-specific
4085 versions of constants have been merged into theorems that apply to the
4086 new polymorphic constants (INCOMPATIBILITY):
4088 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4089 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4090 STAR_Un <-- {STAR,NatStar,STARC}_Un
4091 STAR_Int <-- {STAR,NatStar,STARC}_Int
4092 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4093 STAR_subset <-- {STAR,NatStar,STARC}_subset
4094 STAR_mem <-- {STAR,NatStar,STARC}_mem
4095 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4096 STAR_diff <-- {STAR,STARC}_diff
4097 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4098 STARC_hcomplex_of_complex}_image_subset
4099 starset_n_Un <-- starset{Nat,C}_n_Un
4100 starset_n_Int <-- starset{Nat,C}_n_Int
4101 starset_n_Compl <-- starset{Nat,C}_n_Compl
4102 starset_n_diff <-- starset{Nat,C}_n_diff
4103 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4104 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4105 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4106 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4107 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4108 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4109 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4110 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4111 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4112 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4113 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4114 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4115 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4116 starfun_diff <-- starfun{C,RC,CR}_diff
4117 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4118 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4119 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4120 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4121 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4122 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4123 starfun_Id <-- starfunC_Id
4124 starfun_approx <-- starfun{Nat,CR}_approx
4125 starfun_capprox <-- starfun{C,RC}_capprox
4126 starfun_abs <-- starfunNat_rabs
4127 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4128 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4129 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4130 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4131 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4132 starfun_add_approx <-- starfunCR_add_approx
4133 starfun_inverse_inverse <-- starfunC_inverse_inverse
4134 starfun_divide <-- starfun{C,CR,RC}_divide
4135 starfun_n <-- starfun{Nat,C}_n
4136 starfun_n_mult <-- starfun{Nat,C}_n_mult
4137 starfun_n_add <-- starfun{Nat,C}_n_add
4138 starfun_n_add_minus <-- starfunNat_n_add_minus
4139 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4140 starfun_n_minus <-- starfun{Nat,C}_n_minus
4141 starfun_n_eq <-- starfun{Nat,C}_n_eq
4143 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4144 star_n_minus <-- {hypreal,hcomplex}_minus
4145 star_n_diff <-- {hypreal,hcomplex}_diff
4146 star_n_mult <-- {hypreal,hcomplex}_mult
4147 star_n_inverse <-- {hypreal,hcomplex}_inverse
4148 star_n_le <-- {hypreal,hypnat}_le
4149 star_n_less <-- {hypreal,hypnat}_less
4150 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4151 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4152 star_n_abs <-- hypreal_hrabs
4153 star_n_divide <-- hcomplex_divide
4155 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4156 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4157 star_of_diff <-- hypreal_of_real_diff
4158 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4159 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4160 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4161 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4162 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4163 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4164 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4165 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4166 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4167 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4168 star_of_number_of <-- {hypreal,hcomplex}_number_of
4169 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4170 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4171 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4172 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4173 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4174 star_of_power <-- hypreal_of_real_power
4175 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4177 * Hyperreal: new method "transfer" that implements the transfer
4178 principle of nonstandard analysis. With a subgoal that mentions
4179 nonstandard types like "'a star", the command "apply transfer"
4180 replaces it with an equivalent one that mentions only standard types.
4181 To be successful, all free variables must have standard types; non-
4182 standard variables must have explicit universal quantifiers.
4184 * Hyperreal: A theory of Taylor series.
4189 * Discontinued special version of 'constdefs' (which used to support
4190 continuous functions) in favor of the general Pure one with full
4193 * New simplification procedure for solving continuity conditions; it
4194 is much faster on terms with many nested lambda abstractions (cubic
4195 instead of exponential time).
4197 * New syntax for domain package: selector names are now optional.
4198 Parentheses should be omitted unless argument is lazy, for example:
4200 domain 'a stream = cons "'a" (lazy "'a stream")
4202 * New command 'fixrec' for defining recursive functions with pattern
4203 matching; defining multiple functions with mutual recursion is also
4204 supported. Patterns may include the constants cpair, spair, up, sinl,
4205 sinr, or any data constructor defined by the domain package. The given
4206 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4207 syntax and examples.
4209 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4210 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4211 but the proof obligation additionally includes an admissibility
4212 requirement. The packages generate instances of class cpo or pcpo,
4213 with continuity and strictness theorems for Rep and Abs.
4215 * HOLCF: Many theorems have been renamed according to a more standard naming
4216 scheme (INCOMPATIBILITY):
4218 foo_inject: "foo$x = foo$y ==> x = y"
4219 foo_eq: "(foo$x = foo$y) = (x = y)"
4220 foo_less: "(foo$x << foo$y) = (x << y)"
4221 foo_strict: "foo$UU = UU"
4222 foo_defined: "... ==> foo$x ~= UU"
4223 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4228 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4229 including the First Isomorphism Theorem (on quotienting by the kernel
4232 * ZF/Simplifier: install second copy of type solver that actually
4233 makes use of TC rules declared to Isar proof contexts (or locales);
4234 the old version is still required for ML proof scripts.
4239 * Converted to Isar theory format; use locales instead of axiomatic
4245 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4248 * Pure/library.ML no longer defines its own option datatype, but uses
4249 that of the SML basis, which has constructors NONE and SOME instead of
4250 None and Some, as well as exception Option.Option instead of OPTION.
4251 The functions the, if_none, is_some, is_none have been adapted
4252 accordingly, while Option.map replaces apsome.
4254 * Pure/library.ML: the exception LIST has been given up in favour of
4255 the standard exceptions Empty and Subscript, as well as
4256 Library.UnequalLengths. Function like Library.hd and Library.tl are
4257 superceded by the standard hd and tl functions etc.
4259 A number of basic list functions are no longer exported to the ML
4260 toplevel, as they are variants of predefined functions. The following
4261 suggests how one can translate existing code:
4263 rev_append xs ys = List.revAppend (xs, ys)
4264 nth_elem (i, xs) = List.nth (xs, i)
4265 last_elem xs = List.last xs
4266 flat xss = List.concat xss
4267 seq fs = List.app fs
4268 partition P xs = List.partition P xs
4269 mapfilter f xs = List.mapPartial f xs
4271 * Pure/library.ML: several combinators for linear functional
4272 transformations, notably reverse application and composition:
4275 (x, y) |-> f f #-> g
4277 * Pure/library.ML: introduced/changed precedence of infix operators:
4279 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4281 infix 3 o oo ooo oooo;
4282 infix 4 ~~ upto downto;
4284 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4287 * Pure/library.ML: natural list combinators fold, fold_rev, and
4288 fold_map support linear functional transformations and nesting. For
4291 fold f [x1, ..., xN] y =
4292 y |> f x1 |> ... |> f xN
4294 (fold o fold) f [xs1, ..., xsN] y =
4295 y |> fold f xs1 |> ... |> fold f xsN
4297 fold f [x1, ..., xN] =
4300 (fold o fold) f [xs1, ..., xsN] =
4301 fold f xs1 #> ... #> fold f xsN
4303 * Pure/library.ML: the following selectors on type 'a option are
4306 the: 'a option -> 'a (*partial*)
4307 these: 'a option -> 'a where 'a = 'b list
4308 the_default: 'a -> 'a option -> 'a
4309 the_list: 'a option -> 'a list
4311 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4312 basic operations for association lists, following natural argument
4313 order; moreover the explicit equality predicate passed here avoids
4314 potentially expensive polymorphic runtime equality checks.
4315 The old functions may be expressed as follows:
4317 assoc = uncurry (AList.lookup (op =))
4318 assocs = these oo AList.lookup (op =)
4319 overwrite = uncurry (AList.update (op =)) o swap
4321 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4323 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4324 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4326 replacing make_keylist and keyfilter (occassionally used)
4329 make_keylist = AList.make
4330 keyfilter = AList.find (op =)
4332 * eq_fst and eq_snd now take explicit equality parameter, thus
4333 avoiding eqtypes. Naive rewrites:
4335 eq_fst = eq_fst (op =)
4336 eq_snd = eq_snd (op =)
4338 * Removed deprecated apl and apr (rarely used).
4341 apl (n, op) =>>= curry op n
4342 apr (op, m) =>>= fn n => op (n, m)
4344 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4345 provides a reasonably efficient light-weight implementation of sets as
4348 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4349 few new operations; existing lookup and update are now curried to
4350 follow natural argument order (for use with fold etc.);
4351 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4353 * Pure/General: output via the Isabelle channels of
4354 writeln/warning/error etc. is now passed through Output.output, with a
4355 hook for arbitrary transformations depending on the print_mode
4356 (cf. Output.add_mode -- the first active mode that provides a output
4357 function wins). Already formatted output may be embedded into further
4358 text via Output.raw; the result of Pretty.string_of/str_of and derived
4359 functions (string_of_term/cterm/thm etc.) is already marked raw to
4360 accommodate easy composition of diagnostic messages etc. Programmers
4361 rarely need to care about Output.output or Output.raw at all, with
4362 some notable exceptions: Output.output is required when bypassing the
4363 standard channels (writeln etc.), or in token translations to produce
4364 properly formatted results; Output.raw is required when capturing
4365 already output material that will eventually be presented to the user
4366 a second time. For the default print mode, both Output.output and
4367 Output.raw have no effect.
4369 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4370 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4371 cumulative results are displayed at the end of a batch session.
4373 * Pure/General: File.sysify_path and File.quote_sysify path have been
4374 replaced by File.platform_path and File.shell_path (with appropriate
4375 hooks). This provides a clean interface for unusual systems where the
4376 internal and external process view of file names are different.
4378 * Pure: more efficient orders for basic syntactic entities: added
4379 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4380 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4381 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4382 orders now -- potential INCOMPATIBILITY for code that depends on a
4383 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4384 Library.sort_strings on result).
4386 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4387 fold_types traverse types/terms from left to right, observing natural
4388 argument order. Supercedes previous foldl_XXX versions, add_frees,
4389 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4391 * Pure: name spaces have been refined, with significant changes of the
4392 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4393 to extern(_table). The plain name entry path is superceded by a
4394 general 'naming' context, which also includes the 'policy' to produce
4395 a fully qualified name and external accesses of a fully qualified
4396 name; NameSpace.extend is superceded by context dependent
4397 Sign.declare_name. Several theory and proof context operations modify
4398 the naming context. Especially note Theory.restore_naming and
4399 ProofContext.restore_naming to get back to a sane state; note that
4400 Theory.add_path is no longer sufficient to recover from
4401 Theory.absolute_path in particular.
4403 * Pure: new flags short_names (default false) and unique_names
4404 (default true) for controlling output of qualified names. If
4405 short_names is set, names are printed unqualified. If unique_names is
4406 reset, the name prefix is reduced to the minimum required to achieve
4407 the original result when interning again, even if there is an overlap
4408 with earlier declarations.
4410 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4411 now 'extend', and 'merge' gets an additional Pretty.pp argument
4412 (useful for printing error messages). INCOMPATIBILITY.
4414 * Pure: major reorganization of the theory context. Type Sign.sg and
4415 Theory.theory are now identified, referring to the universal
4416 Context.theory (see Pure/context.ML). Actual signature and theory
4417 content is managed as theory data. The old code and interfaces were
4418 spread over many files and structures; the new arrangement introduces
4419 considerable INCOMPATIBILITY to gain more clarity:
4421 Context -- theory management operations (name, identity, inclusion,
4422 parents, ancestors, merge, etc.), plus generic theory data;
4424 Sign -- logical signature and syntax operations (declaring consts,
4425 types, etc.), plus certify/read for common entities;
4427 Theory -- logical theory operations (stating axioms, definitions,
4428 oracles), plus a copy of logical signature operations (consts,
4429 types, etc.); also a few basic management operations (Theory.copy,
4432 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4433 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4434 for convenience -- they merely return the theory.
4436 * Pure: type Type.tsig is superceded by theory in most interfaces.
4438 * Pure: the Isar proof context type is already defined early in Pure
4439 as Context.proof (note that ProofContext.context and Proof.context are
4440 aliases, where the latter is the preferred name). This enables other
4441 Isabelle components to refer to that type even before Isar is present.
4443 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4444 typeK, constK, axiomK, oracleK), but provide explicit operations for
4445 any of these kinds. For example, Sign.intern typeK is now
4446 Sign.intern_type, Theory.hide_space Sign.typeK is now
4447 Theory.hide_types. Also note that former
4448 Theory.hide_classes/types/consts are now
4449 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4450 internalize their arguments! INCOMPATIBILITY.
4452 * Pure: get_thm interface (of PureThy and ProofContext) expects
4453 datatype thmref (with constructors Name and NameSelection) instead of
4454 plain string -- INCOMPATIBILITY;
4456 * Pure: cases produced by proof methods specify options, where NONE
4457 means to remove case bindings -- INCOMPATIBILITY in
4460 * Pure: the following operations retrieve axioms or theorems from a
4461 theory node or theory hierarchy, respectively:
4463 Theory.axioms_of: theory -> (string * term) list
4464 Theory.all_axioms_of: theory -> (string * term) list
4465 PureThy.thms_of: theory -> (string * thm) list
4466 PureThy.all_thms_of: theory -> (string * thm) list
4468 * Pure: print_tac now outputs the goal through the trace channel.
4470 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4471 Reference Toplevel.debug (default false) controls detailed printing
4472 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4473 controls execution profiling -- set to 1 for time and 2 for space
4474 (both increase the runtime).
4476 * Isar session: The initial use of ROOT.ML is now always timed,
4477 i.e. the log will show the actual process times, in contrast to the
4478 elapsed wall-clock time that the outer shell wrapper produces.
4480 * Simplifier: improved handling of bound variables (nameless
4481 representation, avoid allocating new strings). Simprocs that invoke
4482 the Simplifier recursively should use Simplifier.inherit_bounds to
4483 avoid local name clashes. Failure to do so produces warnings
4484 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4485 for further details.
4487 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4488 bindings for all theorems stored within a given theory; this may help
4489 in porting non-Isar theories to Isar ones, while keeping ML proof
4490 scripts for the time being.
4492 * ML operator HTML.with_charset specifies the charset begin used for
4493 generated HTML files. For example:
4495 HTML.with_charset "utf-8" use_thy "Hebrew";
4496 HTML.with_charset "utf-8" use_thy "Chinese";
4501 * Allow symlinks to all proper Isabelle executables (Isabelle,
4502 isabelle, isatool etc.).
4504 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4505 isatool doc, isatool mkdir, display_drafts etc.).
4507 * isatool usedir: option -f allows specification of the ML file to be
4508 used by Isabelle; default is ROOT.ML.
4510 * New isatool version outputs the version identifier of the Isabelle
4511 distribution being used.
4513 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4514 (containing Boolean satisfiability problems) into Isabelle/HOL
4519 New in Isabelle2004 (April 2004)
4520 --------------------------------
4524 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4525 Replaces linorder.ML.
4527 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4528 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4529 (\<a>...\<z>), are now considered normal letters, and can therefore
4530 be used anywhere where an ASCII letter (a...zA...Z) has until
4531 now. COMPATIBILITY: This obviously changes the parsing of some
4532 terms, especially where a symbol has been used as a binder, say
4533 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4534 as an identifier. Fix it by inserting a space around former
4535 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4536 existing theory and ML files.
4538 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4540 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4541 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4542 a normal (but invisible) letter. For multiple letter subscripts repeat
4543 \<^isub> like this: x\<^isub>1\<^isub>2.
4545 * Pure: There are now sub-/superscripts that can span more than one
4546 character. Text between \<^bsub> and \<^esub> is set in subscript in
4547 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4548 superscript. The new control characters are not identifier parts.
4550 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4551 content of "..." to the latex file instead of \isacntrl... . The "..."
4552 may consist of any printable characters excluding the end bracket >.
4554 * Pure: Using new Isar command "finalconsts" (or the ML functions
4555 Theory.add_finals or Theory.add_finals_i) it is now possible to
4556 declare constants "final", which prevents their being given a definition
4557 later. It is useful for constants whose behaviour is fixed axiomatically
4558 rather than definitionally, such as the meta-logic connectives.
4560 * Pure: 'instance' now handles general arities with general sorts
4561 (i.e. intersections of classes),
4563 * Presentation: generated HTML now uses a CSS style sheet to make layout
4564 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4565 It can be changed to alter the colors/layout of generated pages.
4570 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4571 cut_tac, subgoal_tac and thin_tac:
4572 - Now understand static (Isar) contexts. As a consequence, users of Isar
4573 locales are no longer forced to write Isar proof scripts.
4574 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4576 - INCOMPATIBILITY: names of variables to be instantiated may no
4577 longer be enclosed in quotes. Instead, precede variable name with `?'.
4578 This is consistent with the instantiation attribute "where".
4580 * Attributes "where" and "of":
4581 - Now take type variables of instantiated theorem into account when reading
4582 the instantiation string. This fixes a bug that caused instantiated
4583 theorems to have too special types in some circumstances.
4584 - "where" permits explicit instantiations of type variables.
4586 * Calculation commands "moreover" and "also" no longer interfere with
4587 current facts ("this"), admitting arbitrary combinations with "then"
4591 - Goal statements involving the context element "includes" no longer
4592 generate theorems with internal delta predicates (those ending on
4593 "_axioms") in the premise.
4594 Resolve particular premise with <locale>.intro to obtain old form.
4595 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4596 specification and "includes" elements in goal statement.
4597 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4598 [intro?] and [elim?] (respectively) by default.
4599 - Experimental command for instantiation of locales in proof contexts:
4600 instantiate <label>[<attrs>]: <loc>
4601 Instantiates locale <loc> and adds all its theorems to the current context
4602 taking into account their attributes. Label and attrs are optional
4603 modifiers, like in theorem declarations. If present, names of
4604 instantiated theorems are qualified with <label>, and the attributes
4605 <attrs> are applied after any attributes these theorems might have already.
4606 If the locale has assumptions, a chained fact of the form
4607 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4608 are derived. The command does not support old-style locales declared
4609 with "locale (open)".
4610 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4612 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4618 * Proof import: new image HOL4 contains the imported library from
4619 the HOL4 system with about 2500 theorems. It is imported by
4620 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4621 can be used like any other Isabelle image. See
4622 HOL/Import/HOL/README for more information.
4625 - Much improved handling of linear and partial orders.
4626 Reasoners for linear and partial orders are set up for type classes
4627 "linorder" and "order" respectively, and are added to the default simpset
4628 as solvers. This means that the simplifier can build transitivity chains
4629 to solve goals from the assumptions.
4630 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4631 of blast or auto after simplification become unnecessary because the goal
4632 is solved by simplification already.
4634 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4635 all proved in axiomatic type classes for semirings, rings and fields.
4638 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4639 now formalized using the Ring_and_Field theory mentioned above.
4640 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4641 than before, because now they are set up once in a generic manner.
4642 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4643 Look for the general versions in Ring_and_Field (and Power if they concern
4646 * Type "rat" of the rational numbers is now available in HOL-Complex.
4649 - Record types are now by default printed with their type abbreviation
4650 instead of the list of all field types. This can be configured via
4651 the reference "print_record_type_abbr".
4652 - Simproc "record_upd_simproc" for simplification of multiple updates added
4653 (not enabled by default).
4654 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4655 EX x. x = sel r to True (not enabled by default).
4656 - Tactic "record_split_simp_tac" to split and simplify records added.
4658 * 'specification' command added, allowing for definition by
4659 specification. There is also an 'ax_specification' command that
4660 introduces the new constants axiomatically.
4662 * arith(_tac) is now able to generate counterexamples for reals as well.
4664 * HOL-Algebra: new locale "ring" for non-commutative rings.
4666 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4667 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4669 * HOL-Matrix: a first theory for matrices in HOL with an application of
4670 matrix theory to linear programming.
4672 * Unions and Intersections:
4673 The latex output syntax of UN and INT has been changed
4674 from "\Union x \in A. B" to "\Union_{x \in A} B"
4675 i.e. the index formulae has become a subscript.
4676 Similarly for "\Union x. B", and for \Inter instead of \Union.
4678 * Unions and Intersections over Intervals:
4679 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4680 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4681 like in normal math, and corresponding versions for < and for intersection.
4683 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4684 lexicographic dictonary ordering has been added as "lexord".
4686 * ML: the legacy theory structures Int and List have been removed. They had
4687 conflicted with ML Basis Library structures having the same names.
4689 * 'refute' command added to search for (finite) countermodels. Only works
4690 for a fragment of HOL. The installation of an external SAT solver is
4691 highly recommended. See "HOL/Refute.thy" for details.
4693 * 'quickcheck' command: Allows to find counterexamples by evaluating
4694 formulae under an assignment of free variables to random values.
4695 In contrast to 'refute', it can deal with inductive datatypes,
4696 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4702 * Streams now come with concatenation and are part of the HOLCF image
4706 New in Isabelle2003 (May 2003)
4707 ------------------------------
4711 * Provers/simplifier:
4713 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4714 Assumptions are now subject to complete mutual simplification,
4715 not just from left to right. The simplifier now preserves
4716 the order of assumptions.
4718 Potential INCOMPATIBILITY:
4720 -- simp sometimes diverges where the old version did
4721 not, e.g. invoking simp on the goal
4723 [| P (f x); y = x; f x = f y |] ==> Q
4725 now gives rise to the infinite reduction sequence
4727 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4729 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4732 -- Tactics combining classical reasoner and simplification (such as auto)
4733 are also affected by this change, because many of them rely on
4734 simp. They may sometimes diverge as well or yield a different numbers
4735 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4736 in case of problems. Sometimes subsequent calls to the classical
4737 reasoner will fail because a preceeding call to the simplifier too
4738 eagerly simplified the goal, e.g. deleted redundant premises.
4740 - The simplifier trace now shows the names of the applied rewrite rules
4742 - You can limit the number of recursive invocations of the simplifier
4743 during conditional rewriting (where the simplifie tries to solve the
4744 conditions before applying the rewrite rule):
4745 ML "simp_depth_limit := n"
4746 where n is an integer. Thus you can force termination where previously
4747 the simplifier would diverge.
4749 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4751 - No longer aborts on failed congruence proof. Instead, the
4752 congruence is ignored.
4754 * Pure: New generic framework for extracting programs from constructive
4755 proofs. See HOL/Extraction.thy for an example instantiation, as well
4756 as HOL/Extraction for some case studies.
4758 * Pure: The main goal of the proof state is no longer shown by default, only
4759 the subgoals. This behaviour is controlled by a new flag.
4760 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4761 (ML: Proof.show_main_goal).
4763 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4764 rules whose conclusion matches subgoal 1:
4765 PG menu: Isabelle/Isar -> Show me -> matching rules
4766 The rules are ordered by how closely they match the subgoal.
4767 In particular, rules that solve a subgoal outright are displayed first
4768 (or rather last, the way they are printed).
4769 (ML: ProofGeneral.print_intros())
4771 * Pure: New flag trace_unify_fail causes unification to print
4772 diagnostic information (PG: in trace buffer) when it fails. This is
4773 useful for figuring out why single step proofs like rule, erule or
4776 * Pure: Locale specifications now produce predicate definitions
4777 according to the body of text (covering assumptions modulo local
4778 definitions); predicate "loc_axioms" covers newly introduced text,
4779 while "loc" is cumulative wrt. all included locale expressions; the
4780 latter view is presented only on export into the global theory
4781 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4782 on the old view without predicates;
4784 * Pure: predefined locales "var" and "struct" are useful for sharing
4785 parameters (as in CASL, for example); just specify something like
4786 ``var x + var y + struct M'' as import;
4788 * Pure: improved thms_containing: proper indexing of facts instead of
4789 raw theorems; check validity of results wrt. current name space;
4790 include local facts of proof configuration (also covers active
4791 locales), cover fixed variables in index; may use "_" in term
4792 specification; an optional limit for the number of printed facts may
4793 be given (the default is 40);
4795 * Pure: disallow duplicate fact bindings within new-style theory files
4798 * Provers: improved induct method: assumptions introduced by case
4799 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4800 the goal statement); "foo" still refers to all facts collectively;
4802 * Provers: the function blast.overloaded has been removed: all constants
4803 are regarded as potentially overloaded, which improves robustness in exchange
4804 for slight decrease in efficiency;
4806 * Provers/linorder: New generic prover for transitivity reasoning over
4807 linear orders. Note: this prover is not efficient!
4809 * Isar: preview of problems to finish 'show' now produce an error
4810 rather than just a warning (in interactive mode);
4817 - Produces a counter example if it cannot prove a goal.
4818 Note that the counter example may be spurious if the goal is not a formula
4819 of quantifier-free linear arithmetic.
4820 In ProofGeneral the counter example appears in the trace buffer.
4822 - Knows about div k and mod k where k is a numeral of type nat or int.
4824 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4825 linear arithmetic fails. This takes account of quantifiers and divisibility.
4826 Presburger arithmetic can also be called explicitly via presburger(_tac).
4828 * simp's arithmetic capabilities have been enhanced a bit: it now
4829 takes ~= in premises into account (by performing a case split);
4831 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4832 are distributed over a sum of terms;
4834 * New tactic "trans_tac" and method "trans" instantiate
4835 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4838 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4839 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4841 * 'typedef' command has new option "open" to suppress the set
4844 * functions Min and Max on finite sets have been introduced (theory
4847 * attribute [symmetric] now works for relations as well; it turns
4848 (x,y) : R^-1 into (y,x) : R, and vice versa;
4850 * induct over a !!-quantified statement (say !!x1..xn):
4851 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4853 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4854 %x. None. Warning: empty_def now refers to the previously hidden definition
4857 * Algebra: formalization of classical algebra. Intended as base for
4858 any algebraic development in Isabelle. Currently covers group theory
4859 (up to Sylow's theorem) and ring theory (Universal Property of
4860 Univariate Polynomials). Contributions welcome;
4862 * GroupTheory: deleted, since its material has been moved to Algebra;
4864 * Complex: new directory of the complex numbers with numeric constants,
4865 nonstandard complex numbers, and some complex analysis, standard and
4866 nonstandard (Jacques Fleuriot);
4868 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4870 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4873 * Real/HahnBanach: updated and adapted to locales;
4875 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4878 * UNITY: added the Meier-Sanders theory of progress sets;
4880 * MicroJava: bytecode verifier and lightweight bytecode verifier
4881 as abstract algorithms, instantiated to the JVM;
4883 * Bali: Java source language formalization. Type system, operational
4884 semantics, axiomatic semantics. Supported language features:
4885 classes, interfaces, objects,virtual methods, static methods,
4886 static/instance fields, arrays, access modifiers, definite
4887 assignment, exceptions.
4892 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4895 * Main ZF: virtually all theories converted to new-style format;
4900 * Pure: Tactic.prove provides sane interface for internal proofs;
4901 omits the infamous "standard" operation, so this is more appropriate
4902 than prove_goalw_cterm in many situations (e.g. in simprocs);
4904 * Pure: improved error reporting of simprocs;
4906 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4910 *** Document preparation ***
4912 * uses \par instead of \\ for line breaks in theory text. This may
4913 shift some page breaks in large documents. To get the old behaviour
4914 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4916 * minimized dependencies of isabelle.sty and isabellesym.sty on
4919 * \<euro> now needs package babel/greek instead of marvosym (which
4922 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4927 New in Isabelle2002 (March 2002)
4928 --------------------------------
4930 *** Document preparation ***
4932 * greatly simplified document preparation setup, including more
4933 graceful interpretation of isatool usedir -i/-d/-D options, and more
4934 instructive isatool mkdir; users should basically be able to get
4935 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4936 users may run a separate document processing stage manually like this:
4937 "isatool usedir -D output HOL Test && isatool document Test/output";
4939 * theory dependency graph may now be incorporated into documents;
4940 isatool usedir -g true will produce session_graph.eps/.pdf for use
4941 with \includegraphics of LaTeX;
4943 * proper spacing of consecutive markup elements, especially text
4944 blocks after section headings;
4946 * support bold style (for single symbols only), input syntax is like
4947 this: "\<^bold>\<alpha>" or "\<^bold>A";
4949 * \<bullet> is now output as bold \cdot by default, which looks much
4950 better in printed text;
4952 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4953 note that these symbols are currently unavailable in Proof General /
4954 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4956 * isatool latex no longer depends on changed TEXINPUTS, instead
4957 isatool document copies the Isabelle style files to the target
4963 * Pure/Provers: improved proof by cases and induction;
4964 - 'case' command admits impromptu naming of parameters (such as
4966 - 'induct' method divinates rule instantiation from the inductive
4967 claim; no longer requires excessive ?P bindings for proper
4968 instantiation of cases;
4969 - 'induct' method properly enumerates all possibilities of set/type
4970 rules; as a consequence facts may be also passed through *type*
4971 rules without further ado;
4972 - 'induct' method now derives symbolic cases from the *rulified*
4973 rule (before it used to rulify cases stemming from the internal
4974 atomized version); this means that the context of a non-atomic
4975 statement becomes is included in the hypothesis, avoiding the
4976 slightly cumbersome show "PROP ?case" form;
4977 - 'induct' may now use elim-style induction rules without chaining
4978 facts, using ``missing'' premises from the goal state; this allows
4979 rules stemming from inductive sets to be applied in unstructured
4980 scripts, while still benefitting from proper handling of non-atomic
4981 statements; NB: major inductive premises need to be put first, all
4982 the rest of the goal is passed through the induction;
4983 - 'induct' proper support for mutual induction involving non-atomic
4984 rule statements (uses the new concept of simultaneous goals, see
4986 - append all possible rule selections, but only use the first
4987 success (no backtracking);
4988 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4989 - undeclared rule case names default to numbers 1, 2, 3, ...;
4990 - added 'print_induct_rules' (covered by help item in recent Proof
4992 - moved induct/cases attributes to Pure, methods to Provers;
4993 - generic method setup instantiated for FOL and HOL;
4995 * Pure: support multiple simultaneous goal statements, for example
4996 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4997 meta-level mechanism, this acts as if several individual goals had
4998 been stated separately; in particular common proof methods need to be
4999 repeated in order to cover all claims; note that a single elimination
5000 step is *not* sufficient to establish the two conjunctions, so this
5003 assume "A & B" then have A and B .. (*".." fails*)
5005 better use "obtain" in situations as above; alternative refer to
5006 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
5008 * Pure: proper integration with ``locales''; unlike the original
5009 version by Florian Kammller, Isar locales package high-level proof
5010 contexts rather than raw logical ones (e.g. we admit to include
5011 attributes everywhere); operations on locales include merge and
5012 rename; support for implicit arguments (``structures''); simultaneous
5013 type-inference over imports and text; see also HOL/ex/Locales.thy for
5016 * Pure: the following commands have been ``localized'', supporting a
5017 target locale specification "(in name)": 'lemma', 'theorem',
5018 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
5019 stored both within the locale and at the theory level (exported and
5020 qualified by the locale name);
5022 * Pure: theory goals may now be specified in ``long'' form, with
5023 ad-hoc contexts consisting of arbitrary locale elements. for example
5024 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
5025 definitions may be given, too); the result is a meta-level rule with
5026 the context elements being discharged in the obvious way;
5028 * Pure: new proof command 'using' allows to augment currently used
5029 facts after a goal statement ('using' is syntactically analogous to
5030 'apply', but acts on the goal's facts only); this allows chained facts
5031 to be separated into parts given before and after a claim, as in
5032 ``from a and b have C using d and e <proof>'';
5034 * Pure: renamed "antecedent" case to "rule_context";
5036 * Pure: new 'judgment' command records explicit information about the
5037 object-logic embedding (used by several tools internally); no longer
5038 use hard-wired "Trueprop";
5040 * Pure: added 'corollary' command;
5042 * Pure: fixed 'token_translation' command;
5044 * Pure: removed obsolete 'exported' attribute;
5046 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5047 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5048 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5050 * Pure: method 'atomize' presents local goal premises as object-level
5051 statements (atomic meta-level propositions); setup controlled via
5052 rewrite rules declarations of 'atomize' attribute; example
5053 application: 'induct' method with proper rule statements in improper
5056 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5057 now consider the syntactic context of assumptions, giving a better
5058 chance to get type-inference of the arguments right (this is
5059 especially important for locales);
5061 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5064 * Pure/obtain: the formal conclusion "thesis", being marked as
5065 ``internal'', may no longer be reference directly in the text;
5066 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5069 * Pure: generic 'sym' attribute which declares a rule both as pure
5070 'elim?' and for the 'symmetric' operation;
5072 * Pure: marginal comments ``--'' may now occur just anywhere in the
5073 text; the fixed correlation with particular command syntax has been
5076 * Pure: new method 'rules' is particularly well-suited for proof
5077 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5078 but often produces more compact proof terms with less detours;
5080 * Pure/Provers/classical: simplified integration with pure rule
5081 attributes and methods; the classical "intro?/elim?/dest?"
5082 declarations coincide with the pure ones; the "rule" method no longer
5083 includes classically swapped intros; "intro" and "elim" methods no
5084 longer pick rules from the context; also got rid of ML declarations
5085 AddXIs/AddXEs/AddXDs; all of this has some potential for
5088 * Provers/classical: attribute 'swapped' produces classical inversions
5089 of introduction rules;
5091 * Provers/simplifier: 'simplified' attribute may refer to explicit
5092 rules instead of full simplifier context; 'iff' attribute handles
5095 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5097 * HOL: 'recdef' now fails on unfinished automated proofs, use
5098 "(permissive)" option to recover old behavior;
5100 * HOL: 'inductive' no longer features separate (collective) attributes
5101 for 'intros' (was found too confusing);
5103 * HOL: properly declared induction rules less_induct and
5109 * HOL: moved over to sane numeral syntax; the new policy is as
5112 - 0 and 1 are polymorphic constants, which are defined on any
5113 numeric type (nat, int, real etc.);
5115 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5116 binary representation internally;
5118 - type nat has special constructor Suc, and generally prefers Suc 0
5119 over 1::nat and Suc (Suc 0) over 2::nat;
5121 This change may cause significant problems of INCOMPATIBILITY; here
5122 are some hints on converting existing sources:
5124 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5125 entities, so expressions involving "-" (unary or binary minus) need
5126 to be spaced properly;
5128 - existing occurrences of "1" may need to be constraint "1::nat" or
5129 even replaced by Suc 0; similar for old "2";
5131 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5133 - remove all special provisions on numerals in proofs;
5135 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5136 representation (depends on bin_arith_simps in the default context);
5138 * HOL: symbolic syntax for x^2 (numeral 2);
5140 * HOL: the class of all HOL types is now called "type" rather than
5141 "term"; INCOMPATIBILITY, need to adapt references to this type class
5142 in axclass/classes, instance/arities, and (usually rare) occurrences
5143 in typings (of consts etc.); internally the class is called
5144 "HOL.type", ML programs should refer to HOLogic.typeS;
5146 * HOL/record package improvements:
5147 - new derived operations "fields" to build a partial record section,
5148 "extend" to promote a fixed record to a record scheme, and
5149 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5150 declared as simp by default;
5151 - shared operations ("more", "fields", etc.) now need to be always
5152 qualified) --- potential INCOMPATIBILITY;
5153 - removed "make_scheme" operations (use "make" with "extend") --
5155 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5156 - provides cases/induct rules for use with corresponding Isar
5157 methods (for concrete records, record schemes, concrete more
5158 parts, and schematic more parts -- in that order);
5159 - internal definitions directly based on a light-weight abstract
5160 theory of product types over typedef rather than datatype;
5162 * HOL: generic code generator for generating executable ML code from
5163 specifications; specific support for HOL constructs such as inductive
5164 datatypes and sets, as well as recursive functions; can be invoked
5165 via 'generate_code' theory section;
5167 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5169 * HOL: consolidated and renamed several theories. In particular:
5170 Ord.thy has been absorbed into HOL.thy
5171 String.thy has been absorbed into List.thy
5173 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5174 (beware of argument permutation!);
5176 * HOL: linorder_less_split superseded by linorder_cases;
5178 * HOL/List: "nodups" renamed to "distinct";
5180 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5181 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5182 - Ex_def has changed, now need to use some_eq_ex
5184 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5185 in this (rare) case use:
5187 delSWrapper "split_all_tac"
5188 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5190 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5193 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5194 Isabelle's type classes, ^ on functions and relations has too general
5195 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5196 necessary to attach explicit type constraints;
5198 * HOL/Relation: the prefix name of the infix "O" has been changed from
5199 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5200 renamed accordingly (eg "compI" -> "rel_compI").
5202 * HOL: syntax translations now work properly with numerals and records
5205 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5206 of "lam" -- INCOMPATIBILITY;
5208 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5209 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5210 renamed "Product_Type.unit";
5212 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5214 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5215 the "cases" method);
5217 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5220 * HOL/IMP: updated and converted to new-style theory format; several
5221 parts turned into readable document, with proper Isar proof texts and
5222 some explanations (by Gerwin Klein);
5224 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5226 * HOL-Hyperreal is now a logic image;
5231 * Isar: consts/constdefs supports mixfix syntax for continuous
5234 * Isar: domain package adapted to new-style theory format, e.g. see
5237 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5238 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5239 lift.induct_tac, always use UU instead of Undef;
5241 * HOLCF/IMP: updated and converted to new-style theory;
5246 * Isar: proper integration of logic-specific tools and packages,
5247 including theory commands '(co)inductive', '(co)datatype',
5248 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5249 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5251 * theory Main no longer includes AC; for the Axiom of Choice, base
5252 your theory on Main_ZFC;
5254 * the integer library now covers quotients and remainders, with many
5255 laws relating division to addition, multiplication, etc.;
5257 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5258 typeless version of the formalism;
5260 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5263 * ZF/Induct: new directory for examples of inductive definitions,
5264 including theory Multiset for multiset orderings; converted to
5265 new-style theory format;
5267 * ZF: many new theorems about lists, ordinals, etc.;
5272 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5273 variable proof controls level of detail: 0 = no proofs (only oracle
5274 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5275 also ref manual for further ML interfaces;
5277 * Pure/axclass: removed obsolete ML interface
5278 goal_subclass/goal_arity;
5280 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5281 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5282 separate tokens, so expressions involving minus need to be spaced
5285 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5286 rather than "infixl" or "infixr";
5288 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5289 sort constraint specifications in type inference; e.g. "x::_::foo"
5290 ensures that the type of "x" is of sort "foo" (but not necessarily a
5293 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5294 control output of nested => (types); the default behavior is
5297 * Pure/syntax: builtin parse translation for "_constify" turns valued
5298 tokens into AST constants;
5300 * Pure/syntax: prefer later declarations of translations and print
5301 translation functions; potential INCOMPATIBILITY: need to reverse
5302 multiple declarations for same syntax element constant;
5304 * Pure/show_hyps reset by default (in accordance to existing Isar
5307 * Provers/classical: renamed addaltern to addafter, addSaltern to
5310 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5313 * system: tested support for MacOS X; should be able to get Isabelle +
5314 Proof General to work in a plain Terminal after installing Poly/ML
5315 (e.g. from the Isabelle distribution area) and GNU bash alone
5316 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5317 support requires further installations, e.g. from
5318 http://fink.sourceforge.net/);
5320 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5322 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5323 of 40 MB), cf. ML_OPTIONS;
5325 * system: Proof General keywords specification is now part of the
5326 Isabelle distribution (see etc/isar-keywords.el);
5328 * system: support for persistent Proof General sessions (refrain from
5329 outdating all loaded theories on startup); user may create writable
5330 logic images like this: ``isabelle -q HOL Test'';
5332 * system: smart selection of Isabelle process versus Isabelle
5333 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5334 run both "isabelle" and "Isabelle" even if file names are badly
5335 damaged (executable inspects the case of the first letter of its own
5336 name); added separate "isabelle-process" and "isabelle-interface";
5338 * system: refrain from any attempt at filtering input streams; no
5339 longer support ``8bit'' encoding of old isabelle font, instead proper
5340 iso-latin characters may now be used; the related isatools
5341 "symbolinput" and "nonascii" have disappeared as well;
5343 * system: removed old "xterm" interface (the print modes "xterm" and
5344 "xterm_color" are still available for direct use in a suitable
5349 New in Isabelle99-2 (February 2001)
5350 -----------------------------------
5352 *** Overview of INCOMPATIBILITIES ***
5354 * HOL: please note that theories in the Library and elsewhere often use the
5355 new-style (Isar) format; to refer to their theorems in an ML script you must
5356 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5358 * HOL: inductive package no longer splits induction rule aggressively,
5359 but only as far as specified by the introductions given; the old
5360 format may be recovered via ML function complete_split_rule or attribute
5361 'split_rule (complete)';
5363 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5364 gfp_Tarski to gfp_unfold;
5366 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5368 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5369 relation); infix "^^" has been renamed "``"; infix "``" has been
5370 renamed "`"; "univalent" has been renamed "single_valued";
5372 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5375 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5377 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5379 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5380 consequence, it is no longer monotonic wrt. the local goal context
5381 (which is now passed through the inductive cases);
5383 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5384 \<gg> to \<ggreater>;
5387 *** Document preparation ***
5389 * \isabellestyle{NAME} selects version of Isabelle output (currently
5390 available: are "it" for near math-mode best-style output, "sl" for
5391 slanted text style, and "tt" for plain type-writer; if no
5392 \isabellestyle command is given, output is according to slanted
5395 * support sub/super scripts (for single symbols only), input syntax is
5396 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5398 * some more standard symbols; see Appendix A of the system manual for
5399 the complete list of symbols defined in isabellesym.sty;
5401 * improved isabelle style files; more abstract symbol implementation
5402 (should now use \isamath{...} and \isatext{...} in custom symbol
5405 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5406 state; Note that presentation of goal states does not conform to
5407 actual human-readable proof documents. Please do not include goal
5408 states into document output unless you really know what you are doing!
5410 * proper indentation of antiquoted output with proportional LaTeX
5413 * no_document ML operator temporarily disables LaTeX document
5416 * isatool unsymbolize tunes sources for plain ASCII communication;
5421 * Pure: Isar now suffers initial goal statements to contain unbound
5422 schematic variables (this does not conform to actual readable proof
5423 documents, due to unpredictable outcome and non-compositional proof
5424 checking); users who know what they are doing may use schematic goals
5425 for Prolog-style synthesis of proven results;
5427 * Pure: assumption method (an implicit finishing) now handles actual
5430 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5431 initial goal, declare "that" only as Pure intro (only for single
5432 steps); the "that" rule assumption may now be involved in implicit
5433 finishing, thus ".." becomes a feasible for trivial obtains;
5435 * Pure: default proof step now includes 'intro_classes'; thus trivial
5436 instance proofs may be performed by "..";
5438 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5441 * Pure: more robust selection of calculational rules;
5443 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5444 rule (as well as the assumption rule);
5446 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5447 lemmas, using the graph browser tool;
5449 * Pure: predict failure of "show" in interactive mode;
5451 * Pure: 'thms_containing' now takes actual terms as arguments;
5453 * HOL: improved method 'induct' --- now handles non-atomic goals
5454 (potential INCOMPATIBILITY); tuned error handling;
5456 * HOL: cases and induct rules now provide explicit hints about the
5457 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5458 any remaining facts are inserted into the goal verbatim;
5460 * HOL: local contexts (aka cases) may now contain term bindings as
5461 well; the 'cases' and 'induct' methods new provide a ?case binding for
5462 the result to be shown in each case;
5464 * HOL: added 'recdef_tc' command;
5466 * isatool convert assists in eliminating legacy ML scripts;
5471 * HOL/Library: a collection of generic theories to be used together
5472 with main HOL; the theory loader path already includes this directory
5473 by default; the following existing theories have been moved here:
5474 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5475 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5477 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5478 modelling and verification task performed in Isabelle/HOL +
5479 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5481 * HOL/Algebra: special summation operator SUM no longer exists, it has
5482 been replaced by setsum; infix 'assoc' now has priority 50 (like
5483 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5484 'domain', this makes the theory consistent with mathematical
5487 * HOL basics: added overloaded operations "inverse" and "divide"
5488 (infix "/"), syntax for generic "abs" operation, generic summation
5491 * HOL/typedef: simplified package, provide more useful rules (see also
5494 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5495 now expressed as a proper nested rule (old-style tactic scripts may
5496 require atomize_strip_tac to cope with non-atomic premises);
5498 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5499 to "split_conv" (old name still available for compatibility);
5501 * HOL: improved concrete syntax for strings (e.g. allows translation
5502 rules with string literals);
5504 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5505 and Fleuriot's mechanization of analysis, including the transcendental
5506 functions for the reals;
5508 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5513 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5514 "lam" is displayed as TWO lambda-symbols
5516 * CTT: theory Main now available, containing everything (that is, Bool
5522 * Pure: the Simplifier has been implemented properly as a derived rule
5523 outside of the actual kernel (at last!); the overall performance
5524 penalty in practical applications is about 50%, while reliability of
5525 the Isabelle inference kernel has been greatly improved;
5527 * print modes "brackets" and "no_brackets" control output of nested =>
5528 (types) and ==> (props); the default behaviour is "brackets";
5530 * Provers: fast_tac (and friends) now handle actual object-logic rules
5531 as assumptions as well;
5533 * system: support Poly/ML 4.0;
5535 * system: isatool install handles KDE version 1 or 2;
5539 New in Isabelle99-1 (October 2000)
5540 ----------------------------------
5542 *** Overview of INCOMPATIBILITIES ***
5544 * HOL: simplification of natural numbers is much changed; to partly
5545 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5546 issue the following ML commands:
5548 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5549 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5551 * HOL: simplification no longer dives into case-expressions; this is
5552 controlled by "t.weak_case_cong" for each datatype t;
5554 * HOL: nat_less_induct renamed to less_induct;
5556 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5557 fixsome to patch .thy and .ML sources automatically;
5559 select_equality -> some_equality
5560 select_eq_Ex -> some_eq_ex
5561 selectI2EX -> someI2_ex
5564 select1_equality -> some1_equality
5565 Eps_sym_eq -> some_sym_eq_trivial
5566 Eps_eq -> some_eq_trivial
5568 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5570 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5573 * HOL: the recursion equations generated by 'recdef' are now called
5574 f.simps instead of f.rules;
5576 * HOL: qed_spec_mp now also handles bounded ALL as well;
5578 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5579 sometimes be needed;
5581 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5583 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5585 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5586 product is now "<*>" instead of "Times"; the lexicographic product is
5587 now "<*lex*>" instead of "**";
5589 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5590 of main HOL, but was unused); better use HOL's datatype package;
5592 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5593 the old syntax may be recovered as follows:
5596 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5597 (infixl "\\<oplus>" 100)
5599 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5601 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5602 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5605 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5606 changed from A/r to A//r;
5608 * ZF: new treatment of arithmetic (nat & int) may break some old
5611 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5612 rulify -> rule_format, elimify -> elim_format, ...);
5614 * Isar/Provers: intro/elim/dest attributes changed; renamed
5615 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5616 should have to change intro!! to intro? only); replaced "delrule" by
5619 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5621 * Provers: strengthened force_tac by using new first_best_tac;
5623 * LaTeX document preparation: several changes of isabelle.sty (see
5627 *** Document preparation ***
5629 * formal comments (text blocks etc.) in new-style theories may now
5630 contain antiquotations of thm/prop/term/typ/text to be presented
5631 according to latex print mode; concrete syntax is like this:
5632 @{term[show_types] "f(x) = a + x"};
5634 * isatool mkdir provides easy setup of Isabelle session directories,
5635 including proper document sources;
5637 * generated LaTeX sources are now deleted after successful run
5638 (isatool document -c); may retain a copy somewhere else via -D option
5641 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5642 style files, achieving self-contained LaTeX sources and simplifying
5645 * old-style theories now produce (crude) LaTeX output as well;
5647 * browser info session directories are now self-contained (may be put
5648 on WWW server seperately); improved graphs of nested sessions; removed
5649 graph for 'all sessions';
5651 * several improvements in isabelle style files; \isabellestyle{it}
5652 produces fake math mode output; \isamarkupheader is now \section by
5653 default; see lib/texinputs/isabelle.sty etc.;
5658 * Isar/Pure: local results and corresponding term bindings are now
5659 subject to Hindley-Milner polymorphism (similar to ML); this
5660 accommodates incremental type-inference very nicely;
5662 * Isar/Pure: new derived language element 'obtain' supports
5663 generalized existence reasoning;
5665 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5666 support accumulation of results, without applying any rules yet;
5667 useful to collect intermediate results without explicit name
5668 references, and for use with transitivity rules with more than 2
5671 * Isar/Pure: scalable support for case-analysis type proofs: new
5672 'case' language element refers to local contexts symbolically, as
5673 produced by certain proof methods; internally, case names are attached
5674 to theorems as "tags";
5676 * Isar/Pure: theory command 'hide' removes declarations from
5677 class/type/const name spaces;
5679 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5680 indicate potential overloading;
5682 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5684 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5685 "{a,b,c}" instead of {a,b,c};
5687 * Isar/Pure now provides its own version of intro/elim/dest
5688 attributes; useful for building new logics, but beware of confusion
5689 with the version in Provers/classical;
5691 * Isar/Pure: the local context of (non-atomic) goals is provided via
5692 case name 'antecedent';
5694 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5695 to the current context is now done automatically);
5697 * Isar/Pure: theory command 'method_setup' provides a simple interface
5698 for definining proof methods in ML;
5700 * Isar/Provers: intro/elim/dest attributes changed; renamed
5701 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5702 most cases, one should have to change intro!! to intro? only);
5703 replaced "delrule" by "rule del";
5705 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5706 'symmetric' attribute (the latter supercedes [RS sym]);
5708 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5709 method modifier); 'simp' method: 'only:' modifier removes loopers as
5710 well (including splits);
5712 * Isar/Provers: Simplifier and Classical methods now support all kind
5713 of modifiers used in the past, including 'cong', 'iff', etc.
5715 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5716 of Simplifier and Classical reasoner);
5718 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5719 now support named cases; major packages (inductive, datatype, primrec,
5720 recdef) support case names and properly name parameters;
5722 * Isar/HOL: new transitivity rules for substitution in inequalities --
5723 monotonicity conditions are extracted to be proven at end of
5726 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5729 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5730 split_if split_if_asm; datatype package provides theorems foo.splits =
5731 foo.split foo.split_asm for each datatype;
5733 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5734 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5735 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5736 use "(cases (simplified))" method in proper proof texts);
5738 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5740 * Isar: names of theorems etc. may be natural numbers as well;
5742 * Isar: 'pr' command: optional arguments for goals_limit and
5743 ProofContext.prems_limit; no longer prints theory contexts, but only
5746 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5747 additional print modes to be specified; e.g. "pr(latex)" will print
5748 proof state according to the Isabelle LaTeX style;
5750 * Isar: improved support for emulating tactic scripts, including proof
5751 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5752 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5753 (for HOL datatypes);
5755 * Isar: simplified (more robust) goal selection of proof methods: 1st
5756 goal, all goals, or explicit goal specifier (tactic emulation); thus
5757 'proof method scripts' have to be in depth-first order;
5759 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5761 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5762 should instead use individual commands for printing items
5763 (print_commands, print_methods etc.);
5765 * Isar: added 'nothing' --- the empty list of theorems;
5770 * HOL/MicroJava: formalization of a fragment of Java, together with a
5771 corresponding virtual machine and a specification of its bytecode
5772 verifier and a lightweight bytecode verifier, including proofs of
5773 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5774 Cornelia Pusch (see also the homepage of project Bali at
5775 http://isabelle.in.tum.de/Bali/);
5777 * HOL/Algebra: new theory of rings and univariate polynomials, by
5780 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5781 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5784 * HOL/Lattice: fundamental concepts of lattice theory and order
5785 structures, including duals, properties of bounds versus algebraic
5786 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5787 Theorem for complete lattices etc.; may also serve as a demonstration
5788 for abstract algebraic reasoning using axiomatic type classes, and
5789 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5791 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5794 * HOL/IMPP: extension of IMP with local variables and mutually
5795 recursive procedures, by David von Oheimb;
5797 * HOL/Lambda: converted into new-style theory and document;
5799 * HOL/ex/Multiquote: example of multiple nested quotations and
5800 anti-quotations -- basically a generalized version of de-Bruijn
5801 representation; very useful in avoiding lifting of operations;
5803 * HOL/record: added general record equality rule to simpset; fixed
5804 select-update simplification procedure to handle extended records as
5805 well; admit "r" as field name;
5807 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5808 other numeric types and also as the identity of groups, rings, etc.;
5810 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5811 Types nat and int belong to this axclass;
5813 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5814 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5815 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5816 two terms #m*u and #n*u are replaced by #(m+n)*u
5817 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5818 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5819 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5821 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5822 powerful prover for predicate logic but knows nothing of clasets; see
5823 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5825 * HOL: new version of "case_tac" subsumes both boolean case split and
5826 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5827 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5829 * HOL: simplification no longer dives into case-expressions: only the
5830 selector expression is simplified, but not the remaining arms; to
5831 enable full simplification of case-expressions for datatype t, you may
5832 remove t.weak_case_cong from the simpset, either globally (Delcongs
5833 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5835 * HOL/recdef: the recursion equations generated by 'recdef' for
5836 function 'f' are now called f.simps instead of f.rules; if all
5837 termination conditions are proved automatically, these simplification
5838 rules are added to the simpset, as in primrec; rules may be named
5839 individually as well, resulting in a separate list of theorems for
5842 * HOL/While is a new theory that provides a while-combinator. It
5843 permits the definition of tail-recursive functions without the
5844 provision of a termination measure. The latter is necessary once the
5845 invariant proof rule for while is applied.
5847 * HOL: new (overloaded) notation for the set of elements below/above
5848 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5850 * HOL: theorems impI, allI, ballI bound as "strip";
5852 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5853 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5854 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5856 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5858 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5859 main HOL, but was unused);
5861 * HOL: fewer consts declared as global (e.g. have to refer to
5862 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5864 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5865 in case of overlap with user translations (e.g. judgements over
5866 tuples); (note that the underlying logical represenation is still
5872 * ZF: simplification automatically cancels common terms in arithmetic
5873 expressions over nat and int;
5875 * ZF: new treatment of nat to minimize type-checking: all operators
5876 coerce their operands to a natural number using the function natify,
5877 making the algebraic laws unconditional;
5879 * ZF: as above, for int: operators coerce their operands to an integer
5880 using the function intify;
5882 * ZF: the integer library now contains many of the usual laws for the
5883 orderings, including $<=, and monotonicity laws for $+ and $*;
5885 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5888 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5889 to the simplifier and classical reasoner simultaneously;
5894 * Provers: blast_tac now handles actual object-logic rules as
5895 assumptions; note that auto_tac uses blast_tac internally as well;
5897 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5898 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5900 * Provers: delrules now handles destruct rules as well (no longer need
5901 explicit make_elim);
5903 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5904 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5905 use instead the strong form,
5906 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5907 in HOL, FOL and ZF the function cla_make_elim will create such rules
5908 from destruct-rules;
5910 * Provers: Simplifier.easy_setup provides a fast path to basic
5911 Simplifier setup for new object-logics;
5913 * Pure: AST translation rules no longer require constant head on LHS;
5915 * Pure: improved name spaces: ambiguous output is qualified; support
5916 for hiding of names;
5918 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5919 XSYMBOL_HOME; no longer need to do manual configuration in most
5922 * system: compression of ML heaps images may now be controlled via -c
5923 option of isabelle and isatool usedir (currently only observed by
5926 * system: isatool installfonts may handle X-Symbol fonts as well (very
5927 useful for remote X11);
5929 * system: provide TAGS file for Isabelle sources;
5931 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5934 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5935 timing flag supersedes proof_timing and Toplevel.trace;
5937 * ML: new combinators |>> and |>>> for incremental transformations
5938 with secondary results (e.g. certain theory extensions):
5940 * ML: PureThy.add_defs gets additional argument to indicate potential
5941 overloading (usually false);
5943 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5948 New in Isabelle99 (October 1999)
5949 --------------------------------
5951 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5953 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5954 are no longer simplified. (This allows the simplifier to unfold recursive
5955 functional programs.) To restore the old behaviour, declare
5957 Delcongs [if_weak_cong];
5959 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5962 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5964 * HOL/datatype: mutual_induct_tac no longer exists --
5965 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5967 * HOL/typedef: fixed type inference for representing set; type
5968 arguments now have to occur explicitly on the rhs as type constraints;
5970 * ZF: The con_defs part of an inductive definition may no longer refer
5971 to constants declared in the same theory;
5973 * HOL, ZF: the function mk_cases, generated by the inductive
5974 definition package, has lost an argument. To simplify its result, it
5975 uses the default simpset instead of a supplied list of theorems.
5977 * HOL/List: the constructors of type list are now Nil and Cons;
5979 * Simplifier: the type of the infix ML functions
5980 setSSolver addSSolver setSolver addSolver
5981 is now simpset * solver -> simpset where `solver' is a new abstract type
5982 for packaging solvers. A solver is created via
5983 mk_solver: string -> (thm list -> int -> tactic) -> solver
5984 where the string argument is only a comment.
5989 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5990 decision procedure for linear arithmetic. Currently it is used for
5991 types `nat', `int', and `real' in HOL (see below); it can, should and
5992 will be instantiated for other types and logics as well.
5994 * The simplifier now accepts rewrite rules with flexible heads, eg
5995 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5996 They are applied like any rule with a non-pattern lhs, i.e. by first-order
6002 * New Isabelle/Isar subsystem provides an alternative to traditional
6003 tactical theorem proving; together with the ProofGeneral/isar user
6004 interface it offers an interactive environment for developing human
6005 readable proof documents (Isar == Intelligible semi-automated
6006 reasoning); for further information see isatool doc isar-ref,
6007 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
6009 * improved and simplified presentation of theories: better HTML markup
6010 (including colors), graph views in several sizes; isatool usedir now
6011 provides a proper interface for user theories (via -P option); actual
6012 document preparation based on (PDF)LaTeX is available as well (for
6013 new-style theories only); see isatool doc system for more information;
6015 * native support for Proof General, both for classic Isabelle and
6018 * ML function thm_deps visualizes dependencies of theorems and lemmas,
6019 using the graph browser tool;
6021 * Isabelle manuals now also available as PDF;
6023 * theory loader rewritten from scratch (may not be fully
6024 bug-compatible); old loadpath variable has been replaced by show_path,
6025 add_path, del_path, reset_path functions; new operations such as
6026 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
6029 * improved isatool install: option -k creates KDE application icon,
6030 option -p DIR installs standalone binaries;
6032 * added ML_PLATFORM setting (useful for cross-platform installations);
6033 more robust handling of platform specific ML images for SML/NJ;
6035 * the settings environment is now statically scoped, i.e. it is never
6036 created again in sub-processes invoked from isabelle, isatool, or
6039 * path element specification '~~' refers to '$ISABELLE_HOME';
6041 * in locales, the "assumes" and "defines" parts may be omitted if
6044 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6047 * new print_mode "HTML";
6049 * new flag show_tags controls display of tags of theorems (which are
6050 basically just comments that may be attached by some tools);
6052 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6053 mode and goal output format:
6055 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6057 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6059 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6060 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6062 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6064 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6066 * function bind_thms stores lists of theorems (cf. bind_thm);
6068 * new shorthand tactics ftac, eatac, datac, fatac;
6070 * qed (and friends) now accept "" as result name; in that case the
6071 theorem is not stored, but proper checks and presentation of the
6074 * theorem database now also indexes constants "Trueprop", "all",
6075 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6080 ** HOL arithmetic **
6082 * There are now decision procedures for linear arithmetic over nat and
6085 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6086 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6087 are treated as atomic; subformulae not involving type `nat' or `int'
6088 are ignored; quantified subformulae are ignored unless they are
6089 positive universal or negative existential. The tactic has to be
6090 invoked by hand and can be a little bit slow. In particular, the
6091 running time is exponential in the number of occurrences of `min' and
6092 `max', and `-' on `nat'.
6094 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6095 (negated) (in)equalities among the premises and the conclusion into
6096 account (i.e. no compound formulae) and does not know about `min' and
6097 `max', and `-' on `nat'. It is fast and is used automatically by the
6100 NB: At the moment, these decision procedures do not cope with mixed
6101 nat/int formulae where the two parts interact, such as `m < n ==>
6104 * HOL/Numeral provides a generic theory of numerals (encoded
6105 efficiently as bit strings); setup for types nat/int/real is in place;
6106 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6107 int, existing theories and proof scripts may require a few additional
6110 * integer division and remainder can now be performed on constant
6113 * many properties of integer multiplication, division and remainder
6116 * An interface to the Stanford Validity Checker (SVC) is available through the
6117 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6118 are proved automatically. SVC must be installed separately, and its results
6119 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6120 invocation of the underlying oracle). For SVC see
6121 http://verify.stanford.edu/SVC
6123 * IsaMakefile: the HOL-Real target now builds an actual image;
6128 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6129 (in Isabelle/Isar) -- by Gertrud Bauer;
6131 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6132 analysis for assembly languages with subtypes;
6134 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6135 -- avoids syntactic ambiguities and treats state, transition, and
6136 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6137 changed syntax and (many) tactics;
6139 * HOL/inductive: Now also handles more general introduction rules such
6140 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6141 theorems are now maintained within the theory (maintained via the
6144 * HOL/datatype: Now also handles arbitrarily branching datatypes
6145 (using function types) such as
6147 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6149 * HOL/record: record_simproc (part of the default simpset) takes care
6150 of selectors applied to updated records; record_split_tac is no longer
6151 part of the default claset; update_defs may now be removed from the
6152 simpset in many cases; COMPATIBILITY: old behavior achieved by
6154 claset_ref () := claset() addSWrapper record_split_wrapper;
6155 Delsimprocs [record_simproc]
6157 * HOL/typedef: fixed type inference for representing set; type
6158 arguments now have to occur explicitly on the rhs as type constraints;
6160 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6161 names rather than an ML expression;
6163 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6164 supplied later. Program schemes can be defined, such as
6165 "While B C s = (if B s then While B C (C s) else s)"
6166 where the well-founded relation can be chosen after B and C have been given.
6168 * HOL/List: the constructors of type list are now Nil and Cons;
6169 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6170 course, ML tools referring to List.list.op # etc. have to be adapted;
6172 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6173 disabled by default; run isabelle with option -m HOL to get back to
6174 the original Gordon/HOL-style output;
6176 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6177 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6179 * HOL basic syntax simplified (more orthogonal): all variants of
6180 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6181 Eps operator is provided as well: "SOME x. P[x]";
6183 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6185 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6186 thus available for user theories;
6188 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6189 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6192 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6193 several times and then mp;
6198 * the notation <<...>> is now available as a notation for sequences of
6201 * the simplifier is now installed
6203 * the axiom system has been generalized (thanks to Soren Heilmann)
6205 * the classical reasoner now has a default rule database
6210 * new primrec section allows primitive recursive functions to be given
6211 directly (as in HOL) over datatypes and the natural numbers;
6213 * new tactics induct_tac and exhaust_tac for induction (or case
6214 analysis) over datatypes and the natural numbers;
6216 * the datatype declaration of type T now defines the recursor T_rec;
6218 * simplification automatically does freeness reasoning for datatype
6221 * automatic type-inference, with AddTCs command to insert new
6222 type-checking rules;
6224 * datatype introduction rules are now added as Safe Introduction rules
6227 * the syntax "if P then x else y" is now available in addition to
6231 *** Internal programming interfaces ***
6233 * tuned simplifier trace output; new flag debug_simp;
6235 * structures Vartab / Termtab (instances of TableFun) offer efficient
6236 tables indexed by indexname_ord / term_ord (compatible with aconv);
6238 * AxClass.axclass_tac lost the theory argument;
6240 * tuned current_goals_markers semantics: begin / end goal avoids
6241 printing empty lines;
6243 * removed prs and prs_fn hook, which was broken because it did not
6244 include \n in its semantics, forcing writeln to add one
6245 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6246 string -> unit if you really want to output text without newline;
6248 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6249 plain output, interface builders may have to enable 'isabelle_font'
6250 mode to get Isabelle font glyphs as before;
6252 * refined token_translation interface; INCOMPATIBILITY: output length
6253 now of type real instead of int;
6255 * theory loader actions may be traced via new ThyInfo.add_hook
6256 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6257 your own database of information attached to *whole* theories -- as
6258 opposed to intra-theory data slots offered via TheoryDataFun;
6260 * proper handling of dangling sort hypotheses (at last!);
6261 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6262 extra sort hypotheses that can be witnessed from the type signature;
6263 the force_strip_shyps flag is gone, any remaining shyps are simply
6264 left in the theorem (with a warning issued by strip_shyps_warning);
6268 New in Isabelle98-1 (October 1998)
6269 ----------------------------------
6271 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6273 * several changes of automated proof tools;
6275 * HOL: major changes to the inductive and datatype packages, including
6276 some minor incompatibilities of theory syntax;
6278 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6281 * HOL: removed duplicate thms in Arith:
6282 less_imp_add_less should be replaced by trans_less_add1
6283 le_imp_add_le should be replaced by trans_le_add1
6285 * HOL: unary minus is now overloaded (new type constraints may be
6288 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6289 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6290 now taken as an integer constant.
6292 * Pure: ML function 'theory_of' renamed to 'theory';
6298 1. Asm_full_simp_tac is now more aggressive.
6299 1. It will sometimes reorient premises if that increases their power to
6301 2. It does no longer proceed strictly from left to right but may also
6302 rotate premises to achieve further simplification.
6303 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6304 old Asm_full_simp_tac in that it does not rotate premises.
6305 2. The simplifier now knows a little bit about nat-arithmetic.
6307 * Classical reasoner: wrapper mechanism for the classical reasoner now
6308 allows for selected deletion of wrappers, by introduction of names for
6309 wrapper functionals. This implies that addbefore, addSbefore,
6310 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6311 and that adding two tactics with the same name overwrites the first
6312 one (emitting a warning).
6313 type wrapper = (int -> tactic) -> (int -> tactic)
6314 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6315 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6316 delWrapper, delSWrapper: claset * string -> claset
6317 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6319 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6320 semantics; addbefore now affects only the unsafe part of step_tac
6321 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6322 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6325 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6326 compWrapper; added safe wrapper (and access functions for it);
6328 * HOL/split_all_tac is now much faster and fails if there is nothing
6329 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6330 and the names of the automatically generated variables have changed.
6331 split_all_tac has moved within claset() from unsafe wrappers to safe
6332 wrappers, which means that !!-bound variables are split much more
6333 aggressively, and safe_tac and clarify_tac now split such variables.
6334 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6335 Note: the same holds for record_split_tac, which does the job of
6336 split_all_tac for record fields.
6338 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6339 permanently to the default simpset using Addsplits just like
6340 Addsimps. They can be removed via Delsplits just like
6341 Delsimps. Lower-case versions are also available.
6343 * HOL/Simplifier: The rule split_if is now part of the default
6344 simpset. This means that the simplifier will eliminate all occurrences
6345 of if-then-else in the conclusion of a goal. To prevent this, you can
6346 either remove split_if completely from the default simpset by
6347 `Delsplits [split_if]' or remove it in a specific call of the
6348 simplifier using `... delsplits [split_if]'. You can also add/delete
6349 other case splitting rules to/from the default simpset: every datatype
6350 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6351 t is the name of the datatype).
6353 * Classical reasoner / Simplifier combination: new force_tac (and
6354 derivatives Force_tac, force) combines rewriting and classical
6355 reasoning (and whatever other tools) similarly to auto_tac, but is
6356 aimed to solve the given subgoal completely.
6361 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6362 and `goalw': the theory is no longer needed as an explicit argument -
6363 the current theory context is used; assumptions are no longer returned
6364 at the ML-level unless one of them starts with ==> or !!; it is
6365 recommended to convert to these new commands using isatool fixgoal
6366 (backup your sources first!);
6368 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6369 the current theory context, and 'theory' to lookup stored theories;
6371 * new theory section 'locale' for declaring constants, assumptions and
6372 definitions that have local scope;
6374 * new theory section 'nonterminals' for purely syntactic types;
6376 * new theory section 'setup' for generic ML setup functions
6377 (e.g. package initialization);
6379 * the distribution now includes Isabelle icons: see
6380 lib/logo/isabelle-{small,tiny}.xpm;
6382 * isatool install - install binaries with absolute references to
6385 * isatool logo -- create instances of the Isabelle logo (as EPS);
6387 * print mode 'emacs' reserved for Isamode;
6389 * support multiple print (ast) translations per constant name;
6391 * theorems involving oracles are now printed with a suffixed [!];
6396 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6398 * HOL/inductive package reorganized and improved: now supports mutual
6404 oddI "n : EVEN ==> Suc n : ODD"
6405 evenI "n : ODD ==> Suc n : EVEN"
6407 new theorem list "elims" contains an elimination rule for each of the
6408 recursive sets; inductive definitions now handle disjunctive premises
6409 correctly (also ZF);
6411 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6412 "mutual_induct" no longer exists - the induction rule is always
6413 contained in "induct";
6416 * HOL/datatype package re-implemented and greatly improved: now
6417 supports mutually recursive datatypes such as
6420 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6421 | SUM ('a aexp) ('a aexp)
6422 | DIFF ('a aexp) ('a aexp)
6425 'a bexp = LESS ('a aexp) ('a aexp)
6426 | AND ('a bexp) ('a bexp)
6427 | OR ('a bexp) ('a bexp)
6429 as well as indirectly recursive datatypes such as
6432 ('a, 'b) term = Var 'a
6433 | App 'b ((('a, 'b) term) list)
6435 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6436 induction on mutually / indirectly recursive datatypes.
6438 Primrec equations are now stored in theory and can be accessed via
6439 <function_name>.simps.
6443 - Theories using datatypes must now have theory Datatype as an
6445 - The specific <typename>.induct_tac no longer exists - use the
6446 generic induct_tac instead.
6447 - natE has been renamed to nat.exhaust - use exhaust_tac
6448 instead of res_inst_tac ... natE. Note that the variable
6449 names in nat.exhaust differ from the names in natE, this
6450 may cause some "fragile" proofs to fail.
6451 - The theorems split_<typename>_case and split_<typename>_case_asm
6452 have been renamed to <typename>.split and <typename>.split_asm.
6453 - Since default sorts of type variables are now handled correctly,
6454 some datatype definitions may have to be annotated with explicit
6456 - Primrec definitions no longer require function name and type
6457 of recursive argument.
6459 Consider using isatool fixdatatype to adapt your theories and proof
6460 scripts to the new package (backup your sources first!).
6463 * HOL/record package: considerably improved implementation; now
6464 includes concrete syntax for record types, terms, updates; theorems
6465 for surjective pairing and splitting !!-bound record variables; proof
6466 support is as follows:
6468 1) standard conversions (selectors or updates applied to record
6469 constructor terms) are part of the standard simpset;
6471 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6472 made part of standard simpset and claset via addIffs;
6474 3) a tactic for record field splitting (record_split_tac) is part of
6475 the standard claset (addSWrapper);
6477 To get a better idea about these rules you may retrieve them via
6478 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6479 the name of your record type.
6481 The split tactic 3) conceptually simplifies by the following rule:
6483 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6485 Thus any record variable that is bound by meta-all will automatically
6486 blow up into some record constructor term, consequently the
6487 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6488 solve record problems automatically.
6491 * reorganized the main HOL image: HOL/Integ and String loaded by
6492 default; theory Main includes everything;
6494 * automatic simplification of integer sums and comparisons, using cancellation;
6496 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6498 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6500 * many new identities for unions, intersections, set difference, etc.;
6502 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6503 called split_if, split_split, split_sum_case and split_nat_case (to go
6504 with add/delsplits);
6506 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6507 (?x::unit) = (); this is made part of the default simpset, which COULD
6508 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6509 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6510 unit_abs_eta_conv is added in order to counter the effect of
6511 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6514 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6517 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6518 It and 'sym RS equals0D' are now in the default claset, giving automatic
6519 disjointness reasoning but breaking a few old proofs.
6521 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6522 to 'converse' from 'inverse' (for compatibility with ZF and some
6525 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6526 the well-founded relation;
6528 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6529 Compl A. The "Compl" syntax remains available as input syntax for this
6532 * HOL/Update: new theory of function updates:
6533 f(a:=b) == %x. if x=a then b else f x
6534 may also be iterated as in f(a:=b,c:=d,...);
6536 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6539 - new function list_update written xs[i:=v] that updates the i-th
6540 list position. May also be iterated as in xs[i:=a,j:=b,...].
6541 - new function `upt' written [i..j(] which generates the list
6542 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6543 bound write [i..j], which is a shorthand for [i..j+1(].
6544 - new lexicographic orderings and corresponding wellfoundedness theorems.
6547 - removed 'pred' (predecessor) function;
6548 - generalized some theorems about n-1;
6549 - many new laws about "div" and "mod";
6550 - new laws about greatest common divisors (see theory ex/Primes);
6552 * HOL/Relation: renamed the relational operator r^-1 "converse"
6553 instead of "inverse";
6555 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6556 of the multiset ordering;
6558 * directory HOL/Real: a construction of the reals using Dedekind cuts
6559 (not included by default);
6561 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6563 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6564 programs, i.e. different program variables may have different types.
6566 * calling (stac rew i) now fails if "rew" has no effect on the goal
6567 [previously, this check worked only if the rewrite rule was unconditional]
6568 Now rew can involve either definitions or equalities (either == or =).
6573 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6574 only the theorems proved on ZF.ML;
6576 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6577 It and 'sym RS equals0D' are now in the default claset, giving automatic
6578 disjointness reasoning but breaking a few old proofs.
6580 * ZF/Update: new theory of function updates
6581 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6582 may also be iterated as in f(a:=b,c:=d,...);
6584 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6586 * calling (stac rew i) now fails if "rew" has no effect on the goal
6587 [previously, this check worked only if the rewrite rule was unconditional]
6588 Now rew can involve either definitions or equalities (either == or =).
6590 * case_tac provided for compatibility with HOL
6591 (like the old excluded_middle_tac, but with subgoals swapped)
6594 *** Internal programming interfaces ***
6596 * Pure: several new basic modules made available for general use, see
6597 also src/Pure/README;
6599 * improved the theory data mechanism to support encapsulation (data
6600 kind name replaced by private Object.kind, acting as authorization
6601 key); new type-safe user interface via functor TheoryDataFun; generic
6602 print_data function becomes basically useless;
6604 * removed global_names compatibility flag -- all theory declarations
6605 are qualified by default;
6607 * module Pure/Syntax now offers quote / antiquote translation
6608 functions (useful for Hoare logic etc. with implicit dependencies);
6609 see HOL/ex/Antiquote for an example use;
6611 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6614 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6617 * Display.print_goals function moved to Locale.print_goals;
6619 * standard print function for goals supports current_goals_markers
6620 variable for marking begin of proof, end of proof, start of goal; the
6621 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6622 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6627 New in Isabelle98 (January 1998)
6628 --------------------------------
6630 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6632 * changed lexical syntax of terms / types: dots made part of long
6633 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6635 * simpset (and claset) reference variable replaced by functions
6636 simpset / simpset_ref;
6638 * no longer supports theory aliases (via merge) and non-trivial
6639 implicit merge of thms' signatures;
6641 * most internal names of constants changed due to qualified names;
6643 * changed Pure/Sequence interface (see Pure/seq.ML);
6646 *** General Changes ***
6648 * hierachically structured name spaces (for consts, types, axms, thms
6649 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6650 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6651 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6652 long_names for fully qualified output names; NOTE: ML programs
6653 (special tactics, packages etc.) referring to internal names may have
6654 to be adapted to cope with fully qualified names; in case of severe
6655 backward campatibility problems try setting 'global_names' at compile
6656 time to have enrything declared within a flat name space; one may also
6657 fine tune name declarations in theories via the 'global' and 'local'
6660 * reimplemented the implicit simpset and claset using the new anytype
6661 data filed in signatures; references simpset:simpset ref etc. are
6662 replaced by functions simpset:unit->simpset and
6663 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6664 to patch your ML files accordingly;
6666 * HTML output now includes theory graph data for display with Java
6667 applet or isatool browser; data generated automatically via isatool
6668 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6670 * defs may now be conditional; improved rewrite_goals_tac to handle
6671 conditional equations;
6673 * defs now admits additional type arguments, using TYPE('a) syntax;
6675 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6676 creates a new theory node; implicit merge of thms' signatures is
6677 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6678 transfer:theory->thm->thm in (rare) cases;
6680 * improved handling of draft signatures / theories; draft thms (and
6681 ctyps, cterms) are automatically promoted to real ones;
6683 * slightly changed interfaces for oracles: admit many per theory, named
6684 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6686 * print_goals: optional output of const types (set show_consts and
6689 * improved output of warnings (###) and errors (***);
6691 * subgoal_tac displays a warning if the new subgoal has type variables;
6693 * removed old README and Makefiles;
6695 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6697 * removed obsolete init_pps and init_database;
6699 * deleted the obsolete tactical STATE, which was declared by
6700 fun STATE tacfun st = tacfun st st;
6702 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6703 (which abbreviates $HOME);
6705 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6706 use isatool fixseq to adapt your ML programs (this works for fully
6707 qualified references to the Sequence structure only!);
6709 * use_thy no longer requires writable current directory; it always
6710 reloads .ML *and* .thy file, if either one is out of date;
6713 *** Classical Reasoner ***
6715 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6716 tactics that use classical reasoning to simplify a subgoal without
6717 splitting it into several subgoals;
6719 * Safe_tac: like safe_tac but uses the default claset;
6724 * added simplification meta rules:
6725 (asm_)(full_)simplify: simpset -> thm -> thm;
6727 * simplifier.ML no longer part of Pure -- has to be loaded by object
6730 * added prems argument to simplification procedures;
6732 * HOL, FOL, ZF: added infix function `addsplits':
6733 instead of `<simpset> setloop (split_tac <thms>)'
6734 you can simply write `<simpset> addsplits <thms>'
6739 * TYPE('a) syntax for type reflection terms;
6741 * no longer handles consts with name "" -- declare as 'syntax' instead;
6743 * pretty printer: changed order of mixfix annotation preference (again!);
6745 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6750 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6751 with `addloop' of the simplifier to faciliate case splitting in premises.
6753 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6755 * HOL/Auth: new protocol proofs including some for the Internet
6758 * HOL/Map: new theory of `maps' a la VDM;
6760 * HOL/simplifier: simplification procedures nat_cancel_sums for
6761 cancelling out common nat summands from =, <, <= (in)equalities, or
6762 differences; simplification procedures nat_cancel_factor for
6763 cancelling common factor from =, <, <= (in)equalities over natural
6764 sums; nat_cancel contains both kinds of procedures, it is installed by
6765 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6767 * HOL/simplifier: terms of the form
6768 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6770 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6771 and those of the form
6772 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6774 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6777 Each datatype `t' now comes with a theorem `split_t_case' of the form
6779 P(t_case f1 ... fn x) =
6780 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6782 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6785 and a theorem `split_t_case_asm' of the form
6787 P(t_case f1 ... fn x) =
6788 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6790 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6792 which can be added to a simpset via `addsplits'. The existing theorems
6793 expand_list_case and expand_option_case have been renamed to
6794 split_list_case and split_option_case.
6797 - `pred n' is automatically converted to `n-1'.
6798 Users are strongly encouraged not to use `pred' any longer,
6799 because it will disappear altogether at some point.
6800 - Users are strongly encouraged to write "0 < n" rather than
6801 "n ~= 0". Theorems and proof tools have been modified towards this
6805 the function "set_of_list" has been renamed "set" (and its theorems too);
6806 the function "nth" now takes its arguments in the reverse order and
6807 has acquired the infix notation "!" as in "xs!n".
6809 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6811 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6812 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6814 * HOL/record: extensible records with schematic structural subtyping
6815 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6816 still lacks various theorems and concrete record syntax;
6821 * removed "axioms" and "generated by" sections;
6823 * replaced "ops" section by extended "consts" section, which is capable of
6824 handling the continuous function space "->" directly;
6827 . proves theorems immediately and stores them in the theory,
6828 . creates hierachical name space,
6829 . now uses normal mixfix annotations (instead of cinfix...),
6830 . minor changes to some names and values (for consistency),
6831 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6832 . separator between mutual domain defs: changed "," to "and",
6833 . improved handling of sort constraints; now they have to
6834 appear on the left-hand side of the equations only;
6836 * fixed LAM <x,y,zs>.b syntax;
6838 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6839 adm (%x. P (t x)), where P is chainfinite and t continuous;
6844 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6845 with `addloop' of the simplifier to faciliate case splitting in premises.
6847 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6848 in HOL, they strip ALL and --> from proved theorems;
6852 New in Isabelle94-8 (May 1997)
6853 ------------------------------
6855 *** General Changes ***
6857 * new utilities to build / run / maintain Isabelle etc. (in parts
6858 still somewhat experimental); old Makefiles etc. still functional;
6860 * new 'Isabelle System Manual';
6862 * INSTALL text, together with ./configure and ./build scripts;
6864 * reimplemented type inference for greater efficiency, better error
6865 messages and clean internal interface;
6867 * prlim command for dealing with lots of subgoals (an easier way of
6868 setting goals_limit);
6873 * supports alternative (named) syntax tables (parser and pretty
6874 printer); internal interface is provided by add_modesyntax(_i);
6876 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6877 be used in conjunction with the Isabelle symbol font; uses the
6878 "symbols" syntax table;
6880 * added token_translation interface (may translate name tokens in
6881 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6882 the current print_mode); IMPORTANT: user print translation functions
6883 are responsible for marking newly introduced bounds
6884 (Syntax.mark_boundT);
6886 * token translations for modes "xterm" and "xterm_color" that display
6887 names in bold, underline etc. or colors (which requires a color
6890 * infixes may now be declared with names independent of their syntax;
6892 * added typed_print_translation (like print_translation, but may
6893 access type of constant);
6896 *** Classical Reasoner ***
6898 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6899 some limitations. Blast_tac...
6900 + ignores addss, addbefore, addafter; this restriction is intrinsic
6901 + ignores elimination rules that don't have the correct format
6902 (the conclusion MUST be a formula variable)
6903 + ignores types, which can make HOL proofs fail
6904 + rules must not require higher-order unification, e.g. apply_type in ZF
6905 [message "Function Var's argument not a bound variable" relates to this]
6906 + its proof strategy is more general but can actually be slower
6908 * substitution with equality assumptions no longer permutes other
6911 * minor changes in semantics of addafter (now called addaltern); renamed
6912 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6913 (and access functions for it);
6915 * improved combination of classical reasoner and simplifier:
6916 + functions for handling clasimpsets
6917 + improvement of addss: now the simplifier is called _after_ the
6919 + safe variant of addss called addSss: uses safe simplifications
6920 _during_ the safe steps. It is more complete as it allows multiple
6921 instantiations of unknowns (e.g. with slow_tac).
6925 * added interface for simplification procedures (functions that
6926 produce *proven* rewrite rules on the fly, depending on current
6929 * ordering on terms as parameter (used for ordered rewriting);
6931 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6933 * the solver is now split into a safe and an unsafe part.
6934 This should be invisible for the normal user, except that the
6935 functions setsolver and addsolver have been renamed to setSolver and
6936 addSolver; added safe_asm_full_simp_tac;
6941 * a generic induction tactic `induct_tac' which works for all datatypes and
6942 also for type `nat';
6944 * a generic case distinction tactic `exhaust_tac' which works for all
6945 datatypes and also for type `nat';
6947 * each datatype comes with a function `size';
6949 * patterns in case expressions allow tuple patterns as arguments to
6950 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6952 * primrec now also works with type nat;
6954 * recdef: a new declaration form, allows general recursive functions to be
6955 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6957 * the constant for negation has been renamed from "not" to "Not" to
6958 harmonize with FOL, ZF, LK, etc.;
6960 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6963 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6965 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6966 problems in commutative rings, using axiomatic type classes for + and *;
6968 * more examples in HOL/MiniML and HOL/Auth;
6970 * more default rewrite rules for quantifiers, union/intersection;
6972 * a new constant `arbitrary == @x.False';
6974 * HOLCF/IOA replaces old HOL/IOA;
6976 * HOLCF changes: derived all rules and arities
6977 + axiomatic type classes instead of classes
6978 + typedef instead of faking type definitions
6979 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6980 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6981 + eliminated the types void, one, tr
6982 + use unit lift and bool lift (with translations) instead of one and tr
6983 + eliminated blift from Lift3.thy (use Def instead of blift)
6984 all eliminated rules are derived as theorems --> no visible changes ;
6989 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6990 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6991 as ZF_cs addSIs [equalityI];
6995 New in Isabelle94-7 (November 96)
6996 ---------------------------------
6998 * allowing negative levels (as offsets) in prlev and choplev;
7000 * super-linear speedup for large simplifications;
7002 * FOL, ZF and HOL now use miniscoping: rewriting pushes
7003 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
7004 FAIL); can suppress it using the command Delsimps (ex_simps @
7005 all_simps); De Morgan laws are also now included, by default;
7007 * improved printing of ==> : ~:
7009 * new object-logic "Sequents" adds linear logic, while replacing LK
7010 and Modal (thanks to Sara Kalvala);
7012 * HOL/Auth: correctness proofs for authentication protocols;
7014 * HOL: new auto_tac combines rewriting and classical reasoning (many
7015 examples on HOL/Auth);
7017 * HOL: new command AddIffs for declaring theorems of the form P=Q to
7018 the rewriter and classical reasoner simultaneously;
7020 * function uresult no longer returns theorems in "standard" format;
7021 regain previous version by: val uresult = standard o uresult;
7028 * oracles -- these establish an interface between Isabelle and trusted
7029 external reasoners, which may deliver results as theorems;
7031 * proof objects (in particular record all uses of oracles);
7033 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
7035 * "constdefs" section in theory files;
7037 * "primrec" section (HOL) no longer requires names;
7039 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7046 * reduced space requirements;
7048 * automatic HTML generation from theories;
7050 * theory files no longer require "..." (quotes) around most types;
7052 * new examples, including two proofs of the Church-Rosser theorem;
7054 * non-curried (1994) version of HOL is no longer distributed;
7061 * greatly reduced space requirements;
7063 * theory files (.thy) no longer require \...\ escapes at line breaks;
7065 * searchable theorem database (see the section "Retrieving theorems" on
7066 page 8 of the Reference Manual);
7068 * new examples, including Grabczewski's monumental case study of the
7071 * The previous version of HOL renamed to Old_HOL;
7073 * The new version of HOL (previously called CHOL) uses a curried syntax
7074 for functions. Application looks like f a b instead of f(a,b);
7076 * Mutually recursive inductive definitions finally work in HOL;
7078 * In ZF, pattern-matching on tuples is now available in all abstractions and
7079 translates to the operator "split";
7086 * new infix operator, addss, allowing the classical reasoner to
7087 perform simplification at each step of its search. Example:
7088 fast_tac (cs addss ss)
7090 * a new logic, CHOL, the same as HOL, but with a curried syntax
7091 for functions. Application looks like f a b instead of f(a,b). Also pairs
7092 look like (a,b) instead of <a,b>;
7094 * PLEASE NOTE: CHOL will eventually replace HOL!
7096 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7097 It translates to the operator "split". A new theory of integers is available;
7099 * In ZF, integer numerals now denote two's-complement binary integers.
7100 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7102 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7103 of the Axiom of Choice;
7110 * Significantly faster resolution;
7112 * the different sections in a .thy file can now be mixed and repeated
7115 * Database of theorems for FOL, HOL and ZF. New
7116 commands including qed, qed_goal and bind_thm store theorems in the database.
7118 * Simple database queries: return a named theorem (get_thm) or all theorems of
7119 a given theory (thms_of), or find out what theory a theorem was proved in
7122 * Bugs fixed in the inductive definition and datatype packages;
7124 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7125 and HOL_dup_cs obsolete;
7127 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7130 * Simpler definition of function space in ZF;
7132 * new results about cardinal and ordinal arithmetic in ZF;
7134 * 'subtype' facility in HOL for introducing new types as subsets of existing
7137 :mode=text:wrap=hard:maxLineLen=72: