renamed former Int.int_induct to Int.int_of_nat_induct, former Presburger.int_induct to Int.int_induct: is more conservative and more natural than the intermediate solution
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
77 (the 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
82 in subsequent goal refinement steps. Tracing may also still be
83 enabled or 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 "class"
93 prefix. INCOMPATIBILITY.
95 * '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' has been discontinued. Use 'class' instead. INCOMPATIBILITY.
103 * Code generator: simple concept for abstract datatypes obeying invariants.
105 * Local theory specifications may depend on extra type variables that
106 are not present in the result type -- arguments TYPE('a) :: 'a itself
107 are added internally. For example:
109 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
111 * Code generator: details of internal data cache have no impact on
112 the user space functionality any longer.
114 * Methods unfold_locales and intro_locales ignore non-locale subgoals. This
115 is more appropriate for interpretations with 'where'. INCOMPATIBILITY.
117 * Discontinued unnamed infix syntax (legacy feature for many years) --
118 need to specify constant name and syntax separately. Internal ML
119 datatype constructors have been renamed from InfixName to Infix etc.
120 Minor INCOMPATIBILITY.
122 * Command 'example_proof' opens an empty proof body. This allows to
123 experiment with Isar, without producing any persistent result.
125 * Commands 'type_notation' and 'no_type_notation' declare type syntax
126 within a local theory context, with explicit checking of the
127 constructors involved (in contrast to the raw 'syntax' versions).
129 * Commands 'types' and 'typedecl' now work within a local theory
130 context -- without introducing dependencies on parameters or
131 assumptions, which is not possible in Isabelle/Pure.
133 * Command 'defaultsort' is renamed to 'default_sort', it works within
134 a local theory context. Minor INCOMPATIBILITY.
136 * Proof terms: Type substitutions on proof constants now use canonical
137 order of type variables. INCOMPATIBILITY: Tools working with proof
138 terms may need to be adapted.
143 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is
144 no longer shadowed. INCOMPATIBILITY.
146 * Dropped theorem duplicate comp_arith; use semiring_norm instead. INCOMPATIBILITY.
148 * Theory 'Finite_Set': various folding_* locales facilitate the application
149 of the various fold combinators on finite sets.
151 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
152 provides abstract red-black tree type which is backed by RBT_Impl
153 as implementation. INCOMPATIBILTY.
155 * Command 'typedef' now works within a local theory context -- without
156 introducing dependencies on parameters or assumptions, which is not
157 possible in Isabelle/Pure/HOL. Note that the logical environment may
158 contain multiple interpretations of local typedefs (with different
159 non-emptiness proofs), even in a global theory context.
161 * Theory Library/Coinductive_List has been removed -- superceded by
162 AFP/thys/Coinductive.
164 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
165 Min, Max from theory Finite_Set. INCOMPATIBILITY.
167 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
170 * New set of rules "ac_simps" provides combined assoc / commute rewrites
171 for all interpretations of the appropriate generic locales.
173 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
174 into theories "Rings" and "Fields"; for more appropriate and more
175 consistent names suitable for name prefixes within the HOL theories.
178 * Some generic constants have been put to appropriate theories:
179 * less_eq, less: Orderings
180 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
181 * inverse, divide: Rings
184 * More consistent naming of type classes involving orderings (and lattices):
186 lower_semilattice ~> semilattice_inf
187 upper_semilattice ~> semilattice_sup
189 dense_linear_order ~> dense_linorder
191 pordered_ab_group_add ~> ordered_ab_group_add
192 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
193 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
194 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
195 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
196 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
197 pordered_cancel_semiring ~> ordered_cancel_semiring
198 pordered_comm_monoid_add ~> ordered_comm_monoid_add
199 pordered_comm_ring ~> ordered_comm_ring
200 pordered_comm_semiring ~> ordered_comm_semiring
201 pordered_ring ~> ordered_ring
202 pordered_ring_abs ~> ordered_ring_abs
203 pordered_semiring ~> ordered_semiring
205 ordered_ab_group_add ~> linordered_ab_group_add
206 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
207 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
208 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
209 ordered_field ~> linordered_field
210 ordered_field_no_lb ~> linordered_field_no_lb
211 ordered_field_no_ub ~> linordered_field_no_ub
212 ordered_field_dense_linear_order ~> dense_linordered_field
213 ordered_idom ~> linordered_idom
214 ordered_ring ~> linordered_ring
215 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
216 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
217 ordered_ring_strict ~> linordered_ring_strict
218 ordered_semidom ~> linordered_semidom
219 ordered_semiring ~> linordered_semiring
220 ordered_semiring_1 ~> linordered_semiring_1
221 ordered_semiring_1_strict ~> linordered_semiring_1_strict
222 ordered_semiring_strict ~> linordered_semiring_strict
224 The following slightly odd type classes have been moved to
225 a separate theory Library/Lattice_Algebras.thy:
227 lordered_ab_group_add ~> lattice_ab_group_add
228 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
229 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
230 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
231 lordered_ring ~> lattice_ring
235 * Refined field classes:
236 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
237 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
238 * numerous lemmas have been ported from field to division_ring;
241 * Refined algebra theorem collections:
242 * dropped theorem group group_simps, use algebra_simps instead;
243 * dropped theorem group ring_simps, use field_simps instead;
244 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
245 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
248 * Theory Finite_Set and List: some lemmas have been generalized from
251 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
252 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
253 inter_Inter_fold_inter ~> inf_Inf_fold_inf
254 union_Union_fold_union ~> sup_Sup_fold_sup
255 Inter_fold_inter ~> Inf_fold_inf
256 Union_fold_union ~> Sup_fold_sup
257 inter_INTER_fold_inter ~> inf_INFI_fold_inf
258 union_UNION_fold_union ~> sup_SUPR_fold_sup
259 INTER_fold_inter ~> INFI_fold_inf
260 UNION_fold_union ~> SUPR_fold_sup
262 * Theory Complete_Lattice: lemmas top_def and bot_def have been
263 replaced by the more convenient lemmas Inf_empty and Sup_empty.
264 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
265 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
266 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
267 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
269 * HOLogic.strip_psplit: types are returned in syntactic order, similar
270 to other strip and tuple operations. INCOMPATIBILITY.
272 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
273 * pointwise ordering is instance of class order with standard syntax <= and <;
274 * multiset ordering has syntax <=# and <#; partial order properties are provided
275 by means of interpretation with prefix multiset_order;
276 * less duplication, less historical organization of sections,
277 conversion from associations lists to multisets, rudimentary code generation;
278 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
281 * Code generation: ML and OCaml code is decorated with signatures.
283 * Theory List: added transpose.
285 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
286 clash with new theory Quotient in Main HOL.
288 * Library/Nat_Bijection.thy is a collection of bijective functions
289 between nat and other types, which supersedes the older libraries
290 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
293 Nat_Int_Bij.nat2_to_nat ~> prod_encode
294 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
295 Nat_Int_Bij.int_to_nat_bij ~> int_encode
296 Nat_Int_Bij.nat_to_int_bij ~> int_decode
297 Countable.pair_encode ~> prod_encode
298 NatIso.prod2nat ~> prod_encode
299 NatIso.nat2prod ~> prod_decode
300 NatIso.sum2nat ~> sum_encode
301 NatIso.nat2sum ~> sum_decode
302 NatIso.list2nat ~> list_encode
303 NatIso.nat2list ~> list_decode
304 NatIso.set2nat ~> set_encode
305 NatIso.nat2set ~> set_decode
308 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
309 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
310 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
311 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
312 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
313 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
314 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
315 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
316 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
317 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
318 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
319 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
320 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
325 * Sorts.certify_sort and derived "cert" operations for types and terms
326 no longer minimize sorts. Thus certification at the boundary of the
327 inference kernel becomes invariant under addition of class relations,
328 which is an important monotonicity principle. Sorts are now minimized
329 in the syntax layer only, at the boundary between the end-user and the
330 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
331 explicitly in rare situations.
333 * Antiquotations for basic formal entities:
335 @{class NAME} -- type class
336 @{class_syntax NAME} -- syntax representation of the above
338 @{type_name NAME} -- logical type
339 @{type_abbrev NAME} -- type abbreviation
340 @{nonterminal NAME} -- type of concrete syntactic category
341 @{type_syntax NAME} -- syntax representation of any of the above
343 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
344 @{const_abbrev NAME} -- abbreviated constant
345 @{const_syntax NAME} -- syntax representation of any of the above
347 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
348 syntax constant (cf. 'syntax' command).
350 * Antiquotation @{make_string} inlines a function to print arbitrary
351 values similar to the ML toplevel. The result is compiler dependent
352 and may fall back on "?" in certain situations.
354 * Renamed old-style Drule.standard to Drule.export_without_context, to
355 emphasize that this is in no way a standard operation.
358 * Curried take and drop in library.ML; negative length is interpreted
359 as infinity (as in chop). INCOMPATIBILITY.
361 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
362 usual for resolution. Rare INCOMPATIBILITY.
364 * Discontinued old TheoryDataFun with its copy/init operation -- data
365 needs to be pure. Functor Theory_Data_PP retains the traditional
366 Pretty.pp argument to merge, which is absent in the standard
369 * Renamed varify/unvarify operations to varify_global/unvarify_global
370 to emphasize that these only work in a global situation (which is
373 * Configuration options now admit dynamic default values, depending on
374 the context or even global references.
376 * Most operations that refer to a global context are named
377 accordingly, e.g. Simplifier.global_context or
378 ProofContext.init_global. There are some situations where a global
379 context actually works, but under normal circumstances one needs to
380 pass the proper local context through the code!
385 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
386 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
387 proof terms are enabled unconditionally in the new HOL-Proofs image.
389 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
390 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
393 * Old lib/scripts/polyml-platform is superseded by the
394 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
395 variant, even on a 64 bit machine. The following example setting
396 prefers 64 bit if available:
398 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
402 New in Isabelle2009-1 (December 2009)
403 -------------------------------------
407 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
408 one backslash should be used, even in ML sources.
413 * Locale interpretation propagates mixins along the locale hierarchy.
414 The currently only available mixins are the equations used to map
415 local definitions to terms of the target domain of an interpretation.
417 * Reactivated diagnostic command 'print_interps'. Use "print_interps
418 loc" to print all interpretations of locale "loc" in the theory.
419 Interpretations in proofs are not shown.
421 * Thoroughly revised locales tutorial. New section on conditional
424 * On instantiation of classes, remaining undefined class parameters
425 are formally declared. INCOMPATIBILITY.
428 *** Document preparation ***
430 * New generalized style concept for printing terms: @{foo (style) ...}
431 instead of @{foo_style style ...} (old form is still retained for
432 backward compatibility). Styles can be also applied for
433 antiquotations prop, term_type and typeof.
438 * New proof method "smt" for a combination of first-order logic with
439 equality, linear and nonlinear (natural/integer/real) arithmetic, and
440 fixed-size bitvectors; there is also basic support for higher-order
441 features (esp. lambda abstractions). It is an incomplete decision
442 procedure based on external SMT solvers using the oracle mechanism;
443 for the SMT solver Z3, this method is proof-producing. Certificates
444 are provided to avoid calling the external solvers solely for
445 re-checking proofs. Due to a remote SMT service there is no need for
446 installing SMT solvers locally. See src/HOL/SMT.
448 * New commands to load and prove verification conditions generated by
449 the Boogie program verifier or derived systems (e.g. the Verifying C
450 Compiler (VCC) or Spec#). See src/HOL/Boogie.
452 * New counterexample generator tool 'nitpick' based on the Kodkod
453 relational model finder. See src/HOL/Tools/Nitpick and
454 src/HOL/Nitpick_Examples.
456 * New commands 'code_pred' and 'values' to invoke the predicate
457 compiler and to enumerate values of inductive predicates.
459 * A tabled implementation of the reflexive transitive closure.
461 * New implementation of quickcheck uses generic code generator;
462 default generators are provided for all suitable HOL types, records
463 and datatypes. Old quickcheck can be re-activated importing theory
464 Library/SML_Quickcheck.
466 * New testing tool Mirabelle for automated proof tools. Applies
467 several tools and tactics like sledgehammer, metis, or quickcheck, to
468 every proof step in a theory. To be used in batch mode via the
471 * New proof method "sos" (sum of squares) for nonlinear real
472 arithmetic (originally due to John Harison). It requires theory
473 Library/Sum_Of_Squares. It is not a complete decision procedure but
474 works well in practice on quantifier-free real arithmetic with +, -,
475 *, ^, =, <= and <, i.e. boolean combinations of equalities and
476 inequalities between polynomials. It makes use of external
477 semidefinite programming solvers. Method "sos" generates a
478 certificate that can be pasted into the proof thus avoiding the need
479 to call an external tool every time the proof is checked. See
480 src/HOL/Library/Sum_Of_Squares.
482 * New method "linarith" invokes existing linear arithmetic decision
485 * New command 'atp_minimal' reduces result produced by Sledgehammer.
487 * New Sledgehammer option "Full Types" in Proof General settings menu.
488 Causes full type information to be output to the ATPs. This slows
489 ATPs down considerably but eliminates a source of unsound "proofs"
492 * New method "metisFT": A version of metis that uses full type
493 information in order to avoid failures of proof reconstruction.
495 * New evaluator "approximate" approximates an real valued term using
496 the same method as the approximation method.
498 * Method "approximate" now supports arithmetic expressions as
499 boundaries of intervals and implements interval splitting and Taylor
502 * ML antiquotation @{code_datatype} inserts definition of a datatype
503 generated by the code generator; e.g. see src/HOL/Predicate.thy.
505 * New theory SupInf of the supremum and infimum operators for sets of
508 * New theory Probability, which contains a development of measure
509 theory, eventually leading to Lebesgue integration and probability.
511 * Extended Multivariate Analysis to include derivation and Brouwer's
514 * Reorganization of number theory, INCOMPATIBILITY:
515 - new number theory development for nat and int, in theories Divides
516 and GCD as well as in new session Number_Theory
517 - some constants and facts now suffixed with _nat and _int
519 - former session NumberTheory now named Old_Number_Theory, including
520 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
521 - moved theory Pocklington from src/HOL/Library to
522 src/HOL/Old_Number_Theory
524 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
525 lcm of finite and infinite sets. It is shown that they form a complete
528 * Class semiring_div requires superclass no_zero_divisors and proof of
529 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
530 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
531 generalized to class semiring_div, subsuming former theorems
532 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
533 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
536 * Refinements to lattice classes and sets:
537 - less default intro/elim rules in locale variant, more default
538 intro/elim rules in class variant: more uniformity
539 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
541 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
543 - renamed ACI to inf_sup_aci
544 - new class "boolean_algebra"
545 - class "complete_lattice" moved to separate theory
546 "Complete_Lattice"; corresponding constants (and abbreviations)
547 renamed and with authentic syntax:
548 Set.Inf ~> Complete_Lattice.Inf
549 Set.Sup ~> Complete_Lattice.Sup
550 Set.INFI ~> Complete_Lattice.INFI
551 Set.SUPR ~> Complete_Lattice.SUPR
552 Set.Inter ~> Complete_Lattice.Inter
553 Set.Union ~> Complete_Lattice.Union
554 Set.INTER ~> Complete_Lattice.INTER
555 Set.UNION ~> Complete_Lattice.UNION
556 - authentic syntax for
559 - mere abbreviations:
562 Set.inter (for inf, formerly Set.Int)
563 Set.union (for sup, formerly Set.Un)
564 Complete_Lattice.Inter (for Inf)
565 Complete_Lattice.Union (for Sup)
566 Complete_Lattice.INTER (for INFI)
567 Complete_Lattice.UNION (for SUPR)
568 - object-logic definitions as far as appropriate
570 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
571 Un_subset_iff are explicitly deleted as default simp rules; then also
572 their lattice counterparts le_inf_iff and le_sup_iff have to be
573 deleted to achieve the desired effect.
575 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
576 rules by default any longer; the same applies to min_max.inf_absorb1
577 etc. INCOMPATIBILITY.
579 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
580 pred_set_conv by default. INCOMPATIBILITY.
582 * Power operations on relations and functions are now one dedicated
583 constant "compow" with infix syntax "^^". Power operation on
584 multiplicative monoids retains syntax "^" and is now defined generic
585 in class power. INCOMPATIBILITY.
587 * Relation composition "R O S" now has a more standard argument order:
588 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
589 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
590 break, since the O_assoc rule was not rewritten like this. Fix using
591 O_assoc[symmetric]. The same applies to the curried version "R OO S".
593 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
594 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
597 * Most rules produced by inductive and datatype package have mandatory
598 prefixes. INCOMPATIBILITY.
600 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
601 the attribute of the same name. Each of the theorems in the list
602 DERIV_intros assumes composition with an additional function and
603 matches a variable to the derivative, which has to be solved by the
604 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
605 of most elementary terms. Former Maclauren.DERIV_tac and
606 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
609 * Code generator attributes follow the usual underscore convention:
610 code_unfold replaces code unfold
611 code_post replaces code post
616 sizechange -> size_change
617 induct_scheme -> induction_schema
620 * Discontinued abbreviation "arbitrary" of constant "undefined".
621 INCOMPATIBILITY, use "undefined" directly.
624 Suc_eq_add_numeral_1 -> Suc_eq_plus1
625 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
626 Suc_plus1 -> Suc_eq_plus1
627 *anti_sym -> *antisym*
628 vector_less_eq_def -> vector_le_def
631 * Added theorem List.map_map as [simp]. Removed List.map_compose.
634 * Removed predicate "M hassize n" (<--> card M = n & finite M).
640 * Theory Representable defines a class "rep" of domains that are
641 representable (via an ep-pair) in the universal domain type "udom".
642 Instances are provided for all type constructors defined in HOLCF.
644 * The 'new_domain' command is a purely definitional version of the
645 domain package, for representable domains. Syntax is identical to the
646 old domain package. The 'new_domain' package also supports indirect
647 recursion using previously-defined type constructors. See
648 src/HOLCF/ex/New_Domain.thy for examples.
650 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
651 on the left-hand side of an equation, and then performs
652 simplification. Rewriting is done using rules declared with the
653 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
654 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
656 * The pattern-match compiler in 'fixrec' can now handle constructors
657 with HOL function types. Pattern-match combinators for the Pair
658 constructor are pre-configured.
660 * The 'fixrec' package now produces better fixed-point induction rules
661 for mutually-recursive definitions: Induction rules have conclusions
662 of the form "P foo bar" instead of "P <foo, bar>".
664 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
665 been renamed to "below". The name "below" now replaces "less" in many
666 theorem names. (Legacy theorem names using "less" are still supported
669 * The 'fixrec' package now supports "bottom patterns". Bottom
670 patterns can be used to generate strictness rules, or to make
671 functions more strict (much like the bang-patterns supported by the
672 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
678 * Support for Poly/ML 5.3.0, with improved reporting of compiler
679 errors and run-time exceptions, including detailed source positions.
681 * Structure Name_Space (formerly NameSpace) now manages uniquely
682 identified entries, with some additional information such as source
683 position, logical grouping etc.
685 * Theory and context data is now introduced by the simplified and
686 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
687 to be pure, but the old TheoryDataFun for mutable data (with explicit
688 copy operation) is still available for some time.
690 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
691 provides a high-level programming interface to synchronized state
692 variables with atomic update. This works via pure function
693 application within a critical section -- its runtime should be as
694 short as possible; beware of deadlocks if critical code is nested,
695 either directly or indirectly via other synchronized variables!
697 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
698 wraps raw ML references, explicitly indicating their non-thread-safe
699 behaviour. The Isar toplevel keeps this structure open, to
700 accommodate Proof General as well as quick and dirty interactive
701 experiments with references.
703 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
704 parallel tactical reasoning.
706 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
707 are similar to SUBPROOF, but are slightly more flexible: only the
708 specified parts of the subgoal are imported into the context, and the
709 body tactic may introduce new subgoals and schematic variables.
711 * Old tactical METAHYPS, which does not observe the proof context, has
712 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
713 or Subgoal.FOCUS etc.
715 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
716 functors have their own ML name space there is no point to mark them
717 separately.) Minor INCOMPATIBILITY.
719 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
721 * Renamed several structures FooBar to Foo_Bar. Occasional,
724 * Operations of structure Skip_Proof no longer require quick_and_dirty
725 mode, which avoids critical setmp.
727 * Eliminated old Attrib.add_attributes, Method.add_methods and related
728 combinators for "args". INCOMPATIBILITY, need to use simplified
729 Attrib/Method.setup introduced in Isabelle2009.
731 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
732 back on global_simpset_of, global_claset_of, global_clasimpset_of as
733 last resort. INCOMPATIBILITY.
735 * Display.pretty_thm now requires a proper context (cf. former
736 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
737 or even Display.pretty_thm_without_context as last resort.
740 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
741 Syntax.pretty_typ/term directly, preferably with proper context
742 instead of global theory.
747 * Further fine tuning of parallel proof checking, scales up to 8 cores
748 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
751 * Support for additional "Isabelle components" via etc/components, see
752 also the system manual.
754 * The isabelle makeall tool now operates on all components with
755 IsaMakefile, not just hardwired "logics".
757 * Removed "compress" option from isabelle-process and isabelle usedir;
758 this is always enabled.
760 * Discontinued support for Poly/ML 4.x versions.
762 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
763 on a given logic image. This requires the lighttpd webserver and is
764 currently supported on Linux only.
768 New in Isabelle2009 (April 2009)
769 --------------------------------
773 * Simplified main Isabelle executables, with less surprises on
774 case-insensitive file-systems (such as Mac OS).
776 - The main Isabelle tool wrapper is now called "isabelle" instead of
779 - The former "isabelle" alias for "isabelle-process" has been
780 removed (should rarely occur to regular users).
782 - The former "isabelle-interface" and its alias "Isabelle" have been
783 removed (interfaces are now regular Isabelle tools).
785 Within scripts and make files, the Isabelle environment variables
786 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
787 respectively. (The latter are still available as legacy feature.)
789 The old isabelle-interface wrapper could react in confusing ways if
790 the interface was uninstalled or changed otherwise. Individual
791 interface tool configuration is now more explicit, see also the
792 Isabelle system manual. In particular, Proof General is now available
793 via "isabelle emacs".
795 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
796 purge installed copies of Isabelle executables and re-run "isabelle
797 install -p ...", or use symlinks.
799 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
800 old ~/isabelle, which was slightly non-standard and apt to cause
801 surprises on case-insensitive file-systems (such as Mac OS).
803 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
804 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
805 care is required when using older releases of Isabelle. Note that
806 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
807 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
809 * Proofs of fully specified statements are run in parallel on
810 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
811 a regular 4-core machine, if the initial heap space is made reasonably
812 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
814 * The main reference manuals ("isar-ref", "implementation", and
815 "system") have been updated and extended. Formally checked references
816 as hyperlinks are now available uniformly.
821 * Complete re-implementation of locales. INCOMPATIBILITY in several
822 respects. The most important changes are listed below. See the
823 Tutorial on Locales ("locales" manual) for details.
825 - In locale expressions, instantiation replaces renaming. Parameters
826 must be declared in a for clause. To aid compatibility with previous
827 parameter inheritance, in locale declarations, parameters that are not
828 'touched' (instantiation position "_" or omitted) are implicitly added
829 with their syntax at the beginning of the for clause.
831 - Syntax from abbreviations and definitions in locales is available in
832 locale expressions and context elements. The latter is particularly
833 useful in locale declarations.
835 - More flexible mechanisms to qualify names generated by locale
836 expressions. Qualifiers (prefixes) may be specified in locale
837 expressions, and can be marked as mandatory (syntax: "name!:") or
838 optional (syntax "name?:"). The default depends for plain "name:"
839 depends on the situation where a locale expression is used: in
840 commands 'locale' and 'sublocale' prefixes are optional, in
841 'interpretation' and 'interpret' prefixes are mandatory. The old
842 implicit qualifiers derived from the parameter names of a locale are
845 - Command "sublocale l < e" replaces "interpretation l < e". The
846 instantiation clause in "interpretation" and "interpret" (square
847 brackets) is no longer available. Use locale expressions.
849 - When converting proof scripts, mandatory qualifiers in
850 'interpretation' and 'interpret' should be retained by default, even
851 if this is an INCOMPATIBILITY compared to former behavior. In the
852 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
853 in locale expressions range over a single locale instance only.
855 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
856 In existing theorem specifications replace the includes element by the
857 respective context elements of the included locale, omitting those
858 that are already present in the theorem specification. Multiple
859 assume elements of a locale should be replaced by a single one
860 involving the locale predicate. In the proof body, declarations (most
861 notably theorems) may be regained by interpreting the respective
862 locales in the proof context as required (command "interpret").
864 If using "includes" in replacement of a target solely because the
865 parameter types in the theorem are not as general as in the target,
866 consider declaring a new locale with additional type constraints on
867 the parameters (context element "constrains").
869 - Discontinued "locale (open)". INCOMPATIBILITY.
871 - Locale interpretation commands no longer attempt to simplify goal.
872 INCOMPATIBILITY: in rare situations the generated goal differs. Use
873 methods intro_locales and unfold_locales to clarify.
875 - Locale interpretation commands no longer accept interpretation
876 attributes. INCOMPATIBILITY.
878 * Class declaration: so-called "base sort" must not be given in import
879 list any longer, but is inferred from the specification. Particularly
886 class foo = type + ...
888 * Class target: global versions of theorems stemming do not carry a
889 parameter prefix any longer. INCOMPATIBILITY.
891 * Class 'instance' command no longer accepts attached definitions.
892 INCOMPATIBILITY, use proper 'instantiation' target instead.
894 * Recovered hiding of consts, which was accidentally broken in
895 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
896 makes c inaccessible; consider using ``hide (open) const c'' instead.
898 * Slightly more coherent Pure syntax, with updated documentation in
899 isar-ref manual. Removed locales meta_term_syntax and
900 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
901 INCOMPATIBILITY in rare situations. Note that &&& should not be used
902 directly in regular applications.
904 * There is a new syntactic category "float_const" for signed decimal
905 fractions (e.g. 123.45 or -123.45).
907 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
908 interface with 'setup' command instead.
910 * Command 'local_setup' is similar to 'setup', but operates on a local
913 * The 'axiomatization' command now only works within a global theory
914 context. INCOMPATIBILITY.
916 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
917 hypotheses. Sorts required in the course of reasoning need to be
918 covered by the constraints in the initial statement, completed by the
919 type instance information of the background theory. Non-trivial sort
920 hypotheses, which rarely occur in practice, may be specified via
921 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
923 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
925 The result contains an implicit sort hypotheses as before --
926 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
929 * Generalized Isar history, with support for linear undo, direct state
932 * Changed defaults for unify configuration options:
934 unify_trace_bound = 50 (formerly 25)
935 unify_search_bound = 60 (formerly 30)
937 * Different bookkeeping for code equations (INCOMPATIBILITY):
939 a) On theory merge, the last set of code equations for a particular
940 constant is taken (in accordance with the policy applied by other
941 parts of the code generator framework).
943 b) Code equations stemming from explicit declarations (e.g. code
944 attribute) gain priority over default code equations stemming
945 from definition, primrec, fun etc.
947 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
949 * Unified theorem tables for both code generators. Thus [code
950 func] has disappeared and only [code] remains. INCOMPATIBILITY.
952 * Command 'find_consts' searches for constants based on type and name
955 find_consts "_ => bool"
957 By default, matching is against subtypes, but it may be restricted to
958 the whole type. Searching by name is possible. Multiple queries are
959 conjunctive and queries may be negated by prefixing them with a
962 find_consts strict: "_ => bool" name: "Int" -"int => int"
964 * New 'find_theorems' criterion "solves" matches theorems that
965 directly solve the current goal (modulo higher-order unification).
967 * Auto solve feature for main theorem statements: whenever a new goal
968 is stated, "find_theorems solves" is called; any theorems that could
969 solve the lemma directly are listed as part of the goal state.
970 Cf. associated options in Proof General Isabelle settings menu,
971 enabled by default, with reasonable timeout for pathological cases of
972 higher-order unification.
975 *** Document preparation ***
977 * Antiquotation @{lemma} now imitates a regular terminal proof,
978 demanding keyword 'by' and supporting the full method expression
979 syntax just like the Isar command 'by'.
984 * Integrated main parts of former image HOL-Complex with HOL. Entry
985 points Main and Complex_Main remain as before.
987 * Logic image HOL-Plain provides a minimal HOL with the most important
988 tools available (inductive, datatype, primrec, ...). This facilitates
989 experimentation and tool development. Note that user applications
990 (and library theories) should never refer to anything below theory
993 * Logic image HOL-Main stops at theory Main, and thus facilitates
994 experimentation due to shorter build times.
996 * Logic image HOL-NSA contains theories of nonstandard analysis which
997 were previously part of former HOL-Complex. Entry point Hyperreal
998 remains valid, but theories formerly using Complex_Main should now use
999 new entry point Hypercomplex.
1001 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1002 Posix processes. Avoids potentially expensive forking of the ML
1003 process. New thread-based implementation also works on non-Unix
1004 platforms (Cygwin). Provers are no longer hardwired, but defined
1005 within the theory via plain ML wrapper functions. Basic Sledgehammer
1006 commands are covered in the isar-ref manual.
1008 * Wrapper scripts for remote SystemOnTPTP service allows to use
1009 sledgehammer without local ATP installation (Vampire etc.). Other
1010 provers may be included via suitable ML wrappers, see also
1011 src/HOL/ATP_Linkup.thy.
1013 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1016 * The metis method no longer fails because the theorem is too trivial
1017 (contains the empty clause).
1019 * The metis method now fails in the usual manner, rather than raising
1020 an exception, if it determines that it cannot prove the theorem.
1022 * Method "coherent" implements a prover for coherent logic (see also
1023 src/Tools/coherent.ML).
1025 * Constants "undefined" and "default" replace "arbitrary". Usually
1026 "undefined" is the right choice to replace "arbitrary", though
1027 logically there is no difference. INCOMPATIBILITY.
1029 * Command "value" now integrates different evaluation mechanisms. The
1030 result of the first successful evaluation mechanism is printed. In
1031 square brackets a particular named evaluation mechanisms may be
1032 specified (currently, [SML], [code] or [nbe]). See further
1033 src/HOL/ex/Eval_Examples.thy.
1035 * Normalization by evaluation now allows non-leftlinear equations.
1036 Declare with attribute [code nbe].
1038 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1039 as the structured Isar versions "cases" and "induct", cf. the
1040 corresponding "cases" and "induct" attributes. Mutual induction rules
1041 are now presented as a list of individual projections
1042 (e.g. foo_bar.inducts for types foo and bar); the old format with
1043 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1044 rare situations a different rule is selected --- notably nested tuple
1045 elimination instead of former prod.exhaust: use explicit (case_tac t
1046 rule: prod.exhaust) here.
1048 * Attributes "cases", "induct", "coinduct" support "del" option.
1050 * Removed fact "case_split_thm", which duplicates "case_split".
1052 * The option datatype has been moved to a new theory Option. Renamed
1053 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1055 * New predicate "strict_mono" classifies strict functions on partial
1056 orders. With strict functions on linear orders, reasoning about
1057 (in)equalities is facilitated by theorems "strict_mono_eq",
1058 "strict_mono_less_eq" and "strict_mono_less".
1060 * Some set operations are now proper qualified constants with
1061 authentic syntax. INCOMPATIBILITY:
1072 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1075 * Auxiliary class "itself" has disappeared -- classes without any
1076 parameter are treated as expected by the 'class' command.
1078 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1080 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1081 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1083 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1084 method "approximation". It proves formulas on real values by using
1085 interval arithmetic. In the formulas are also the transcendental
1086 functions sin, cos, tan, atan, ln, exp and the constant pi are
1087 allowed. For examples see
1088 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1090 * Theory "Reflection" now resides in HOL/Library.
1092 * Entry point to Word library now simply named "Word".
1095 * Made source layout more coherent with logical distribution
1098 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1099 src/HOL/Library/Code_Message.thy ~> src/HOL/
1100 src/HOL/Library/GCD.thy ~> src/HOL/
1101 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1102 src/HOL/Library/Parity.thy ~> src/HOL/
1103 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1104 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1105 src/HOL/Real/Lubs.thy ~> src/HOL/
1106 src/HOL/Real/PReal.thy ~> src/HOL/
1107 src/HOL/Real/Rational.thy ~> src/HOL/
1108 src/HOL/Real/RComplete.thy ~> src/HOL/
1109 src/HOL/Real/RealDef.thy ~> src/HOL/
1110 src/HOL/Real/RealPow.thy ~> src/HOL/
1111 src/HOL/Real/Real.thy ~> src/HOL/
1112 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1113 src/HOL/Complex/Complex.thy ~> src/HOL/
1114 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1115 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1116 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1117 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1118 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1119 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1120 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1121 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1122 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1123 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1124 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1125 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1126 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1127 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1128 src/HOL/Real/Float ~> src/HOL/Library/
1129 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1130 src/HOL/Real/RealVector.thy ~> src/HOL/
1132 src/HOL/arith_data.ML ~> src/HOL/Tools
1133 src/HOL/hologic.ML ~> src/HOL/Tools
1134 src/HOL/simpdata.ML ~> src/HOL/Tools
1135 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1136 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1137 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1138 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1139 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1140 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1141 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1143 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1144 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1145 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1146 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1147 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1148 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1150 * If methods "eval" and "evaluation" encounter a structured proof
1151 state with !!/==>, only the conclusion is evaluated to True (if
1152 possible), avoiding strange error messages.
1154 * Method "sizechange" automates termination proofs using (a
1155 modification of) the size-change principle. Requires SAT solver. See
1156 src/HOL/ex/Termination.thy for examples.
1158 * Simplifier: simproc for let expressions now unfolds if bound
1159 variable occurs at most once in let expression body. INCOMPATIBILITY.
1161 * Method "arith": Linear arithmetic now ignores all inequalities when
1162 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1164 * New attribute "arith" for facts that should always be used
1165 automatically by arithmetic. It is intended to be used locally in
1168 assumes [arith]: "x > 0"
1170 Global usage is discouraged because of possible performance impact.
1172 * New classes "top" and "bot" with corresponding operations "top" and
1173 "bot" in theory Orderings; instantiation of class "complete_lattice"
1174 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1176 * Changed definition lemma "less_fun_def" in order to provide an
1177 instance for preorders on functions; use lemma "less_le" instead.
1180 * Theory Orderings: class "wellorder" moved here, with explicit
1181 induction rule "less_induct" as assumption. For instantiation of
1182 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1185 * Theory Orderings: added class "preorder" as superclass of "order".
1186 INCOMPATIBILITY: Instantiation proofs for order, linorder
1187 etc. slightly changed. Some theorems named order_class.* now named
1190 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1193 * Theory Finite_Set: added a new fold combinator of type
1195 ('a => 'b => 'b) => 'b => 'a set => 'b
1197 Occasionally this is more convenient than the old fold combinator
1198 which is now defined in terms of the new one and renamed to
1201 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1202 and "ring_simps" have been replaced by "algebra_simps" (which can be
1203 extended with further lemmas!). At the moment both still exist but
1204 the former will disappear at some point.
1206 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1207 class recpower. Type-specific simp rules for various recpower types
1208 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1210 rat_power_0 -> power_0
1211 rat_power_Suc -> power_Suc
1212 realpow_0 -> power_0
1213 realpow_Suc -> power_Suc
1214 complexpow_0 -> power_0
1215 complexpow_Suc -> power_Suc
1216 power_poly_0 -> power_0
1217 power_poly_Suc -> power_Suc
1219 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1220 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1221 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1222 of lemmas from Divides has been generalized from nat to class
1223 semiring_div. INCOMPATIBILITY. This involves the following theorem
1224 renames resulting from duplicate elimination:
1226 dvd_def_mod ~> dvd_eq_mod_eq_0
1227 zero_dvd_iff ~> dvd_0_left_iff
1228 dvd_0 ~> dvd_0_right
1229 DIVISION_BY_ZERO_DIV ~> div_by_0
1230 DIVISION_BY_ZERO_MOD ~> mod_by_0
1231 mult_div ~> div_mult_self2_is_id
1232 mult_mod ~> mod_mult_self2_is_0
1234 * Theory IntDiv: removed many lemmas that are instances of class-based
1235 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1236 rename old lemmas as follows:
1238 dvd_diff -> nat_dvd_diff
1239 dvd_zminus_iff -> dvd_minus_iff
1240 mod_add1_eq -> mod_add_eq
1241 mod_mult1_eq -> mod_mult_right_eq
1242 mod_mult1_eq' -> mod_mult_left_eq
1243 mod_mult_distrib_mod -> mod_mult_eq
1244 nat_mod_add_left_eq -> mod_add_left_eq
1245 nat_mod_add_right_eq -> mod_add_right_eq
1246 nat_mod_div_trivial -> mod_div_trivial
1247 nat_mod_mod_trivial -> mod_mod_trivial
1248 zdiv_zadd_self1 -> div_add_self1
1249 zdiv_zadd_self2 -> div_add_self2
1250 zdiv_zmult_self1 -> div_mult_self2_is_id
1251 zdiv_zmult_self2 -> div_mult_self1_is_id
1252 zdvd_triv_left -> dvd_triv_left
1253 zdvd_triv_right -> dvd_triv_right
1254 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1255 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1256 zmod_zadd_left_eq -> mod_add_left_eq
1257 zmod_zadd_right_eq -> mod_add_right_eq
1258 zmod_zadd_self1 -> mod_add_self1
1259 zmod_zadd_self2 -> mod_add_self2
1260 zmod_zadd1_eq -> mod_add_eq
1261 zmod_zdiff1_eq -> mod_diff_eq
1262 zmod_zdvd_zmod -> mod_mod_cancel
1263 zmod_zmod_cancel -> mod_mod_cancel
1264 zmod_zmult_self1 -> mod_mult_self2_is_0
1265 zmod_zmult_self2 -> mod_mult_self1_is_0
1268 zdvd_abs1 -> abs_dvd_iff
1269 zdvd_abs2 -> dvd_abs_iff
1270 zdvd_refl -> dvd_refl
1271 zdvd_trans -> dvd_trans
1272 zdvd_zadd -> dvd_add
1273 zdvd_zdiff -> dvd_diff
1274 zdvd_zminus_iff -> dvd_minus_iff
1275 zdvd_zminus2_iff -> minus_dvd_iff
1276 zdvd_zmultD -> dvd_mult_right
1277 zdvd_zmultD2 -> dvd_mult_left
1278 zdvd_zmult_mono -> mult_dvd_mono
1279 zdvd_0_right -> dvd_0_right
1280 zdvd_0_left -> dvd_0_left_iff
1281 zdvd_1_left -> one_dvd
1282 zminus_dvd_iff -> minus_dvd_iff
1284 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1286 * The real numbers offer decimal input syntax: 12.34 is translated
1287 into 1234/10^2. This translation is not reversed upon output.
1289 * Theory Library/Polynomial defines an abstract type 'a poly of
1290 univariate polynomials with coefficients of type 'a. In addition to
1291 the standard ring operations, it also supports div and mod. Code
1292 generation is also supported, using list-style constructors.
1294 * Theory Library/Inner_Product defines a class of real_inner for real
1295 inner product spaces, with an overloaded operation inner :: 'a => 'a
1296 => real. Class real_inner is a subclass of real_normed_vector from
1299 * Theory Library/Product_Vector provides instances for the product
1300 type 'a * 'b of several classes from RealVector and Inner_Product.
1301 Definitions of addition, subtraction, scalar multiplication, norms,
1302 and inner products are included.
1304 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1305 addition to the field operations, numerals and case syntax are also
1308 * Theory Library/Diagonalize provides constructive version of Cantor's
1309 first diagonalization argument.
1311 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1312 zlcm (for int); carried together from various gcd/lcm developements in
1313 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1314 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1315 may recover tupled syntax as follows:
1317 hide (open) const gcd
1318 abbreviation gcd where
1319 "gcd == (%(a, b). GCD.gcd a b)"
1321 GCD.gcd ("gcd '(_, _')")
1323 The same works for lcm, zgcd, zlcm.
1325 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1326 instantiations for algebraic structures. Removed some duplicate
1327 theorems. Changes in simp rules. INCOMPATIBILITY.
1329 * ML antiquotation @{code} takes a constant as argument and generates
1330 corresponding code in background and inserts name of the corresponding
1331 resulting ML value/function/datatype constructor binding in place.
1332 All occurrences of @{code} with a single ML block are generated
1333 simultaneously. Provides a generic and safe interface for
1334 instrumentalizing code generation. See
1335 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1336 In future you ought to refrain from ad-hoc compiling generated SML
1337 code on the ML toplevel. Note that (for technical reasons) @{code}
1338 cannot refer to constants for which user-defined serializations are
1339 set. Refer to the corresponding ML counterpart directly in that
1342 * Command 'rep_datatype': instead of theorem names the command now
1343 takes a list of terms denoting the constructors of the type to be
1344 represented as datatype. The characteristic theorems have to be
1345 proven. INCOMPATIBILITY. Also observe that the following theorems
1346 have disappeared in favour of existing ones:
1348 unit_induct ~> unit.induct
1349 prod_induct ~> prod.induct
1350 sum_induct ~> sum.induct
1351 Suc_Suc_eq ~> nat.inject
1352 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1357 * New locales for orders and lattices where the equivalence relation
1358 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1359 locales use a record structure with field eq for the equivalence.
1361 * New theory of factorial domains.
1363 * Units_l_inv and Units_r_inv are now simp rules by default.
1364 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1365 and/or r_inv will now also require deletion of these lemmas.
1367 * Renamed the following theorems, INCOMPATIBILITY:
1369 UpperD ~> Upper_memD
1370 LowerD ~> Lower_memD
1371 least_carrier ~> least_closed
1372 greatest_carrier ~> greatest_closed
1373 greatest_Lower_above ~> greatest_Lower_below
1374 one_zero ~> carrier_one_zero
1375 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1380 * Nominal datatypes can now contain type-variables.
1382 * Commands 'nominal_inductive' and 'equivariance' work with local
1385 * Nominal primrec can now works with local theory targets and its
1386 specification syntax now conforms to the general format as seen in
1389 * Method "perm_simp" honours the standard simplifier attributes
1390 (no_asm), (no_asm_use) etc.
1392 * The new predicate #* is defined like freshness, except that on the
1393 left hand side can be a set or list of atoms.
1395 * Experimental command 'nominal_inductive2' derives strong induction
1396 principles for inductive definitions. In contrast to
1397 'nominal_inductive', which can only deal with a fixed number of
1398 binders, it can deal with arbitrary expressions standing for sets of
1399 atoms to be avoided. The only inductive definition we have at the
1400 moment that needs this generalisation is the typing rule for Lets in
1403 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1404 -----------------------------------------------------------------
1405 Gamma |- Let x be t1 in t2 : T2
1407 In this rule one wants to avoid all the binders that are introduced by
1408 "close Gamma T1". We are looking for other examples where this
1409 feature might be useful. Please let us know.
1414 * Reimplemented the simplification procedure for proving continuity
1415 subgoals. The new simproc is extensible; users can declare additional
1416 continuity introduction rules with the attribute [cont2cont].
1418 * The continuity simproc now uses a different introduction rule for
1419 solving continuity subgoals on terms with lambda abstractions. In
1420 some rare cases the new simproc may fail to solve subgoals that the
1421 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1422 Potential INCOMPATIBILITY.
1424 * Command 'fixrec': specification syntax now conforms to the general
1425 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1426 examples. INCOMPATIBILITY.
1431 * Proof of Zorn's Lemma for partial orders.
1436 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1437 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1438 depends on multithreading, so timouts will not work before Poly/ML
1441 * High-level support for concurrent ML programming, see
1442 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1443 particularly convenient to organize independent functional
1444 computations. The concept of "synchronized variables" provides a
1445 higher-order interface for components with shared state, avoiding the
1446 delicate details of mutexes and condition variables. (Requires
1447 Poly/ML 5.2.1 or later.)
1449 * ML bindings produced via Isar commands are stored within the Isar
1450 context (theory or proof). Consequently, commands like 'use' and 'ML'
1451 become thread-safe and work with undo as expected (concerning
1452 top-level bindings, not side-effects on global references).
1453 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1454 compiler at runtime; really global bindings need to be given outside a
1455 theory. (Requires Poly/ML 5.2 or later.)
1457 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1458 context. Top-level ML bindings are stored within the proof context in
1459 a purely sequential fashion, disregarding the nested proof structure.
1460 ML bindings introduced by 'ML_prf' are discarded at the end of the
1461 proof. (Requires Poly/ML 5.2 or later.)
1463 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1464 and Method.setup, as well as Isar commands 'attribute_setup' and
1465 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1466 existing code accordingly, or use plain 'setup' together with old
1469 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1470 to 'a -> thm, while results are always tagged with an authentic oracle
1471 name. The Isar command 'oracle' is now polymorphic, no argument type
1472 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1473 accordingly. Note that extra performance may be gained by producing
1474 the cterm carefully, avoiding slow Thm.cterm_of.
1476 * Simplified interface for defining document antiquotations via
1477 ThyOutput.antiquotation, ThyOutput.output, and optionally
1478 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1479 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1482 * More systematic treatment of long names, abstract name bindings, and
1483 name space operations. Basic operations on qualified names have been
1484 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1485 Long_Name.append. Old type bstring has been mostly replaced by
1486 abstract type binding (see structure Binding), which supports precise
1487 qualification by packages and local theory targets, as well as proper
1488 tracking of source positions. INCOMPATIBILITY, need to wrap old
1489 bstring values into Binding.name, or better pass through abstract
1490 bindings everywhere. See further src/Pure/General/long_name.ML,
1491 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1493 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1494 LocalTheory.note etc.) now refer to the *full* internal name, not the
1495 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1497 * Disposed old type and term read functions (Sign.read_def_typ,
1498 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1499 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1500 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1501 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1502 resort for legacy applications.
1504 * Disposed old declarations, tactics, tactic combinators that refer to
1505 the simpset or claset of an implicit theory (such as Addsimps,
1506 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1507 embedded ML text, or local_simpset_of with a proper context passed as
1508 explicit runtime argument.
1510 * Rules and tactics that read instantiations (read_instantiate,
1511 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1512 context, which is required for parsing and type-checking. Moreover,
1513 the variables are specified as plain indexnames, not string encodings
1514 thereof. INCOMPATIBILITY.
1516 * Generic Toplevel.add_hook interface allows to analyze the result of
1517 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1518 for theorem dependency output of transactions resulting in a new
1521 * ML antiquotations: block-structured compilation context indicated by
1522 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1524 @{binding name} - basic name binding
1525 @{let ?pat = term} - term abbreviation (HO matching)
1526 @{note name = fact} - fact abbreviation
1527 @{thm fact} - singleton fact (with attributes)
1528 @{thms fact} - general fact (with attributes)
1529 @{lemma prop by method} - singleton goal
1530 @{lemma prop by meth1 meth2} - singleton goal
1531 @{lemma prop1 ... propN by method} - general goal
1532 @{lemma prop1 ... propN by meth1 meth2} - general goal
1533 @{lemma (open) ...} - open derivation
1538 * The Isabelle "emacs" tool provides a specific interface to invoke
1539 Proof General / Emacs, with more explicit failure if that is not
1540 installed (the old isabelle-interface script silently falls back on
1541 isabelle-process). The PROOFGENERAL_HOME setting determines the
1542 installation location of the Proof General distribution.
1544 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1545 the Isabelle process into a JVM/Scala application. See
1546 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1547 process wrapper has been discontinued.)
1549 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1551 * Various status messages (with exact source position information) are
1552 emitted, if proper markup print mode is enabled. This allows
1553 user-interface components to provide detailed feedback on internal
1558 New in Isabelle2008 (June 2008)
1559 -------------------------------
1563 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1564 and updated, with formally checked references as hyperlinks.
1566 * Theory loader: use_thy (and similar operations) no longer set the
1567 implicit ML context, which was occasionally hard to predict and in
1568 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1569 provides a proper context already.
1571 * Theory loader: old-style ML proof scripts being *attached* to a thy
1572 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1573 'use' within a theory file will do the job.
1575 * Name space merge now observes canonical order, i.e. the second space
1576 is inserted into the first one, while existing entries in the first
1577 space take precedence. INCOMPATIBILITY in rare situations, may try to
1578 swap theory imports.
1580 * Syntax: symbol \<chi> is now considered a letter. Potential
1581 INCOMPATIBILITY in identifier syntax etc.
1583 * Outer syntax: string tokens no longer admit escaped white space,
1584 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1585 white space without escapes.
1587 * Outer syntax: string tokens may contain arbitrary character codes
1588 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1594 * Context-dependent token translations. Default setup reverts locally
1595 fixed variables, and adds hilite markup for undeclared frees.
1597 * Unused theorems can be found using the new command 'unused_thms'.
1598 There are three ways of invoking it:
1601 Only finds unused theorems in the current theory.
1603 (2) unused_thms thy_1 ... thy_n -
1604 Finds unused theorems in the current theory and all of its ancestors,
1605 excluding the theories thy_1 ... thy_n and all of their ancestors.
1607 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1608 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1609 their ancestors, excluding the theories thy_1 ... thy_n and all of
1612 In order to increase the readability of the list produced by
1613 unused_thms, theorems that have been created by a particular instance
1614 of a theory command such as 'inductive' or 'function' are considered
1615 to belong to the same "group", meaning that if at least one theorem in
1616 this group is used, the other theorems in the same group are no longer
1617 reported as unused. Moreover, if all theorems in the group are
1618 unused, only one theorem in the group is displayed.
1620 Note that proof objects have to be switched on in order for
1621 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1622 usually the case when using Proof General with the default settings).
1624 * Authentic naming of facts disallows ad-hoc overwriting of previous
1625 theorems within the same name space. INCOMPATIBILITY, need to remove
1626 duplicate fact bindings, or even accidental fact duplications. Note
1627 that tools may maintain dynamically scoped facts systematically, using
1628 PureThy.add_thms_dynamic.
1630 * Command 'hide' now allows to hide from "fact" name space as well.
1632 * Eliminated destructive theorem database, simpset, claset, and
1633 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1634 update of theories within ML code.
1636 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1637 INCOMPATIBILITY, object-logics depending on former Pure require
1638 additional setup PureThy.old_appl_syntax_setup; object-logics
1639 depending on former CPure need to refer to Pure.
1641 * Commands 'use' and 'ML' are now purely functional, operating on
1642 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1643 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1646 * Command 'setup': discontinued implicit version with ML reference.
1648 * Instantiation target allows for simultaneous specification of class
1649 instance operations together with an instantiation proof.
1650 Type-checking phase allows to refer to class operations uniformly.
1651 See src/HOL/Complex/Complex.thy for an Isar example and
1652 src/HOL/Library/Eval.thy for an ML example.
1654 * Indexing of literal facts: be more serious about including only
1655 facts from the visible specification/proof context, but not the
1656 background context (locale etc.). Affects `prop` notation and method
1657 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1660 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1661 "(open)" option, which used to expose internal bound variables to the
1664 * Isar statements: removed obsolete case "rule_context".
1665 INCOMPATIBILITY, better use explicit fixes/assumes.
1667 * Locale proofs: default proof step now includes 'unfold_locales';
1668 hence 'proof' without argument may be used to unfold locale
1672 *** Document preparation ***
1674 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1675 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1676 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1677 spot); renamed link color from "darkblue" to "linkcolor" (default
1678 value unchanged, can be redefined via \definecolor); no longer sets
1679 "a4paper" option (unnecessary or even intrusive).
1681 * Antiquotation @{lemma A method} proves proposition A by the given
1682 method (either a method name or a method name plus (optional) method
1683 arguments in parentheses) and prints A just like @{prop A}.
1688 * New primrec package. Specification syntax conforms in style to
1689 definition/function/.... No separate induction rule is provided. The
1690 "primrec" command distinguishes old-style and new-style specifications
1691 by syntax. The former primrec package is now named OldPrimrecPackage.
1692 When adjusting theories, beware: constants stemming from new-style
1693 primrec specifications have authentic syntax.
1695 * Metis prover is now an order of magnitude faster, and also works
1696 with multithreading.
1698 * Metis: the maximum number of clauses that can be produced from a
1699 theorem is now given by the attribute max_clauses. Theorems that
1700 exceed this number are ignored, with a warning printed.
1702 * Sledgehammer no longer produces structured proofs by default. To
1703 enable, declare [[sledgehammer_full = true]]. Attributes
1704 reconstruction_modulus, reconstruction_sorts renamed
1705 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1707 * Method "induct_scheme" derives user-specified induction rules
1708 from well-founded induction and completeness of patterns. This factors
1709 out some operations that are done internally by the function package
1710 and makes them available separately. See
1711 src/HOL/ex/Induction_Scheme.thy for examples.
1713 * More flexible generation of measure functions for termination
1714 proofs: Measure functions can be declared by proving a rule of the
1715 form "is_measure f" and giving it the [measure_function] attribute.
1716 The "is_measure" predicate is logically meaningless (always true), and
1717 just guides the heuristic. To find suitable measure functions, the
1718 termination prover sets up the goal "is_measure ?f" of the appropriate
1719 type and generates all solutions by prolog-style backwards proof using
1722 This setup also deals with rules like
1724 "is_measure f ==> is_measure (list_size f)"
1726 which accommodates nested datatypes that recurse through lists.
1727 Similar rules are predeclared for products and option types.
1729 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1733 - Definitions of overloaded constants on sets have to be replaced by
1734 definitions on => and bool.
1736 - Some definitions of overloaded operators on sets can now be proved
1737 using the definitions of the operators on => and bool. Therefore,
1738 the following theorems have been renamed:
1740 subset_def -> subset_eq
1741 psubset_def -> psubset_eq
1742 set_diff_def -> set_diff_eq
1743 Compl_def -> Compl_eq
1744 Sup_set_def -> Sup_set_eq
1745 Inf_set_def -> Inf_set_eq
1746 sup_set_def -> sup_set_eq
1747 inf_set_def -> inf_set_eq
1749 - Due to the incompleteness of the HO unification algorithm, some
1750 rules such as subst may require manual instantiation, if some of
1751 the unknowns in the rule is a set.
1753 - Higher order unification and forward proofs:
1756 have "P (S::'a set)" <...>
1757 then have "EX S. P S" ..
1759 no longer works (due to the incompleteness of the HO unification
1760 algorithm) and must be replaced by the pattern
1767 - Calculational reasoning with subst (or similar rules):
1770 have "P (S::'a set)" <...>
1771 also have "S = T" <...>
1772 finally have "P T" .
1774 no longer works (for similar reasons as the previous example) and
1775 must be replaced by something like
1777 have "P (S::'a set)" <...>
1778 moreover have "S = T" <...>
1779 ultimately have "P T" by simp
1781 - Tactics or packages written in ML code:
1782 Code performing pattern matching on types via
1784 Type ("set", [T]) => ...
1786 must be rewritten. Moreover, functions like strip_type or
1787 binder_types no longer return the right value when applied to a
1790 T1 => ... => Tn => U => bool
1794 T1 => ... => Tn => U set
1796 * Merged theories Wellfounded_Recursion, Accessible_Part and
1797 Wellfounded_Relations to theory Wellfounded.
1799 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1801 * Class finite no longer treats UNIV as class parameter. Use class
1802 enum from theory Library/Enum instead to achieve a similar effect.
1805 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1806 and "Cons". INCOMPATIBILITY.
1808 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1809 Potential INCOMPATIBILITY.
1811 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1812 injective_fst_snd removed, use split_eta and prod_eqI instead.
1813 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1815 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1816 the same name in theory Orderings:
1826 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1827 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1828 and different variable names.
1830 * Library/Option_ord.thy: Canonical order on option type.
1832 * Library/RBT.thy: Red-black trees, an efficient implementation of
1835 * Library/Countable.thy: Type class for countable types.
1837 * Theory Int: The representation of numerals has changed. The infix
1838 operator BIT and the bit datatype with constructors B0 and B1 have
1839 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1840 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1841 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1844 * Theory Nat: definition of <= and < on natural numbers no longer
1845 depend on well-founded relations. INCOMPATIBILITY. Definitions
1846 le_def and less_def have disappeared. Consider lemmas not_less
1847 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1849 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1850 (whose purpose mainly is for various fold_set functionals) have been
1851 abandoned in favor of the existing algebraic classes
1852 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1853 lower_semilattice (resp. upper_semilattice) and linorder.
1856 * Theory Transitive_Closure: induct and cases rules now declare proper
1857 case_names ("base" and "step"). INCOMPATIBILITY.
1859 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1860 lattices. The form set-specific version is available as
1861 Inductive.lfp_ordinal_induct_set.
1863 * Renamed theorems "power.simps" to "power_int.simps".
1866 * Class semiring_div provides basic abstract properties of semirings
1867 with division and modulo operations. Subsumes former class dvd_mod.
1869 * Merged theories IntDef, Numeral and IntArith into unified theory
1870 Int. INCOMPATIBILITY.
1872 * Theory Library/Code_Index: type "index" now represents natural
1873 numbers rather than integers. INCOMPATIBILITY.
1875 * New class "uminus" with operation "uminus" (split of from class
1876 "minus" which now only has operation "minus", binary).
1879 * Constants "card", "internal_split", "option_map" now with authentic
1880 syntax. INCOMPATIBILITY.
1882 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1883 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1884 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1885 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1886 Sup_set_def, le_def, less_def, option_map_def now with object
1887 equality. INCOMPATIBILITY.
1889 * Records. Removed K_record, and replaced it by pure lambda term
1890 %x. c. The simplifier setup is now more robust against eta expansion.
1891 INCOMPATIBILITY: in cases explicitly referring to K_record.
1893 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1895 * Library/ListVector: new theory of arithmetic vector operations.
1897 * Library/Order_Relation: new theory of various orderings as sets of
1898 pairs. Defines preorders, partial orders, linear orders and
1899 well-orders on sets and on types.
1904 * Renamed some theories to allow to loading both ZF and HOL in the
1907 Datatype -> Datatype_ZF
1908 Inductive -> Inductive_ZF
1915 INCOMPATIBILITY: ZF theories that import individual theories below
1916 Main might need to be adapted. Regular theory Main is still
1917 available, as trivial extension of Main_ZF.
1922 * ML within Isar: antiquotation @{const name} or @{const
1923 name(typargs)} produces statically-checked Const term.
1925 * Functor NamedThmsFun: data is available to the user as dynamic fact
1926 (of the same name). Removed obsolete print command.
1928 * Removed obsolete "use_legacy_bindings" function.
1930 * The ``print mode'' is now a thread-local value derived from a global
1931 template (the former print_mode reference), thus access becomes
1932 non-critical. The global print_mode reference is for session
1933 management only; user-code should use print_mode_value,
1934 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1936 * Functions system/system_out provide a robust way to invoke external
1937 shell commands, with propagation of interrupts (requires Poly/ML
1938 5.2.1). Do not use OS.Process.system etc. from the basis library!
1943 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1944 in accordance with Proof General 3.7, which prefers GNU emacs.
1946 * isatool tty runs Isabelle process with plain tty interaction;
1947 optional line editor may be specified via ISABELLE_LINE_EDITOR
1948 setting, the default settings attempt to locate "ledit" and "rlwrap".
1950 * isatool browser now works with Cygwin as well, using general
1951 "javapath" function defined in Isabelle process environment.
1953 * YXML notation provides a simple and efficient alternative to
1954 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1955 isatool yxml as described in the Isabelle system manual.
1957 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1958 provides general wrapper for managing an Isabelle process in a robust
1959 fashion, with ``cooked'' output from stdin/stderr.
1961 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1962 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1964 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1965 way of changing the user's settings is via
1966 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1969 * Multithreading.max_threads := 0 refers to the number of actual CPU
1970 cores of the underlying machine, which is a good starting point for
1971 optimal performance tuning. The corresponding usedir option -M allows
1972 "max" as an alias for "0". WARNING: does not work on certain versions
1973 of Mac OS (with Poly/ML 5.1).
1975 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1976 adverse effect of Isabelle flooding interactive front-ends (notably
1977 ProofGeneral / XEmacs).
1981 New in Isabelle2007 (November 2007)
1982 -----------------------------------
1986 * More uniform information about legacy features, notably a
1987 warning/error of "Legacy feature: ...", depending on the state of the
1988 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1989 legacy features will disappear eventually.
1991 * Theory syntax: the header format ``theory A = B + C:'' has been
1992 discontinued in favour of ``theory A imports B C begin''. Use isatool
1993 fixheaders to convert existing theory files. INCOMPATIBILITY.
1995 * Theory syntax: the old non-Isar theory file format has been
1996 discontinued altogether. Note that ML proof scripts may still be used
1997 with Isar theories; migration is usually quite simple with the ML
1998 function use_legacy_bindings. INCOMPATIBILITY.
2000 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2001 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2004 * Theory loader: be more serious about observing the static theory
2005 header specifications (including optional directories), but not the
2006 accidental file locations of previously successful loads. The strict
2007 update policy of former update_thy is now already performed by
2008 use_thy, so the former has been removed; use_thys updates several
2009 theories simultaneously, just as 'imports' within a theory header
2010 specification, but without merging the results. Potential
2011 INCOMPATIBILITY: may need to refine theory headers and commands
2012 ROOT.ML which depend on load order.
2014 * Theory loader: optional support for content-based file
2015 identification, instead of the traditional scheme of full physical
2016 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2017 (cf. the system manual). The new scheme allows to work with
2018 non-finished theories in persistent session images, such that source
2019 files may be moved later on without requiring reloads.
2021 * Theory loader: old-style ML proof scripts being *attached* to a thy
2022 file (with the same base name as the theory) are considered a legacy
2023 feature, which will disappear eventually. Even now, the theory loader
2024 no longer maintains dependencies on such files.
2026 * Syntax: the scope for resolving ambiguities via type-inference is
2027 now limited to individual terms, instead of whole simultaneous
2028 specifications as before. This greatly reduces the complexity of the
2029 syntax module and improves flexibility by separating parsing and
2030 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2031 'fixes' etc.) are required in rare situations.
2033 * Syntax: constants introduced by new-style packages ('definition',
2034 'abbreviation' etc.) are passed through the syntax module in
2035 ``authentic mode''. This means that associated mixfix annotations
2036 really stick to such constants, independently of potential name space
2037 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2038 trees are represented slightly differently, may need to adapt syntax
2039 translations accordingly. Use CONST marker in 'translations' and
2040 @{const_syntax} antiquotation in 'parse_translation' etc.
2042 * Legacy goal package: reduced interface to the bare minimum required
2043 to keep existing proof scripts running. Most other user-level
2044 functions are now part of the OldGoals structure, which is *not* open
2045 by default (consider isatool expandshort before open OldGoals).
2046 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2047 these tend to cause confusion about the actual goal (!) context being
2048 used here, which is not necessarily the same as the_context().
2050 * Command 'find_theorems': supports "*" wild-card in "name:"
2051 criterion; "with_dups" option. Certain ProofGeneral versions might
2052 support a specific search form (see ProofGeneral/CHANGES).
2054 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2055 by default, which means that "prems" (and also "fixed variables") are
2056 suppressed from proof state output. Note that the ProofGeneral
2057 settings mechanism allows to change and save options persistently, but
2058 older versions of Isabelle will fail to start up if a negative prems
2061 * Local theory targets may be specified by non-nested blocks of
2062 ``context/locale/class ... begin'' followed by ``end''. The body may
2063 contain definitions, theorems etc., including any derived mechanism
2064 that has been implemented on top of these primitives. This concept
2065 generalizes the existing ``theorem (in ...)'' towards more versatility
2068 * Proof General interface: proper undo of final 'end' command;
2069 discontinued Isabelle/classic mode (ML proof scripts).
2072 *** Document preparation ***
2074 * Added antiquotation @{theory name} which prints the given name,
2075 after checking that it refers to a valid ancestor theory in the
2078 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2079 check the given source text as ML type/structure, printing verbatim.
2081 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2082 "c args == rhs" given in the current context. (Any number of
2083 arguments may be given on the LHS.)
2088 * The 'class' package offers a combination of axclass and locale to
2089 achieve Haskell-like type classes in Isabelle. Definitions and
2090 theorems within a class context produce both relative results (with
2091 implicit parameters according to the locale context), and polymorphic
2092 constants with qualified polymorphism (according to the class
2093 context). Within the body context of a 'class' target, a separate
2094 syntax layer ("user space type system") takes care of converting
2095 between global polymorphic consts and internal locale representation.
2096 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2097 "isatool doc classes" provides a tutorial.
2099 * Generic code generator framework allows to generate executable
2100 code for ML and Haskell (including Isabelle classes). A short usage
2103 internal compilation:
2104 export_code <list of constants (term syntax)> in SML
2105 writing SML code to a file:
2106 export_code <list of constants (term syntax)> in SML <filename>
2107 writing OCaml code to a file:
2108 export_code <list of constants (term syntax)> in OCaml <filename>
2109 writing Haskell code to a bunch of files:
2110 export_code <list of constants (term syntax)> in Haskell <filename>
2112 evaluating closed propositions to True/False using code generation:
2115 Reasonable default setup of framework in HOL.
2117 Theorem attributs for selecting and transforming function equations theorems:
2119 [code fun]: select a theorem as function equation for a specific constant
2120 [code fun del]: deselect a theorem as function equation for a specific constant
2121 [code inline]: select an equation theorem for unfolding (inlining) in place
2122 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2124 User-defined serializations (target in {SML, OCaml, Haskell}):
2126 code_const <and-list of constants (term syntax)>
2127 {(target) <and-list of const target syntax>}+
2129 code_type <and-list of type constructors>
2130 {(target) <and-list of type target syntax>}+
2132 code_instance <and-list of instances>
2134 where instance ::= <type constructor> :: <class>
2136 code_class <and_list of classes>
2137 {(target) <and-list of class target syntax>}+
2138 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2140 code_instance and code_class only are effective to target Haskell.
2142 For example usage see src/HOL/ex/Codegenerator.thy and
2143 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2144 generation from Isabelle/HOL theories is available via "isatool doc
2147 * Code generator: consts in 'consts_code' Isar commands are now
2148 referred to by usual term syntax (including optional type
2151 * Command 'no_translations' removes translation rules from theory
2154 * Overloaded definitions are now actually checked for acyclic
2155 dependencies. The overloading scheme is slightly more general than
2156 that of Haskell98, although Isabelle does not demand an exact
2157 correspondence to type class and instance declarations.
2158 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2159 exotic versions of overloading -- at the discretion of the user!
2161 Polymorphic constants are represented via type arguments, i.e. the
2162 instantiation that matches an instance against the most general
2163 declaration given in the signature. For example, with the declaration
2164 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2165 as c(nat). Overloading is essentially simultaneous structural
2166 recursion over such type arguments. Incomplete specification patterns
2167 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2168 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2169 Command 'print_theory' outputs the normalized system of recursive
2170 equations, see section "definitions".
2172 * Configuration options are maintained within the theory or proof
2173 context (with name and type bool/int/string), providing a very simple
2174 interface to a poor-man's version of general context data. Tools may
2175 declare options in ML (e.g. using Attrib.config_int) and then refer to
2176 these values using Config.get etc. Users may change options via an
2177 associated attribute of the same name. This form of context
2178 declaration works particularly well with commands 'declare' or
2179 'using', for example ``declare [[foo = 42]]''. Thus it has become
2180 very easy to avoid global references, which would not observe Isar
2181 toplevel undo/redo and fail to work with multithreading.
2183 Various global ML references of Pure and HOL have been turned into
2184 configuration options:
2186 Unify.search_bound unify_search_bound
2187 Unify.trace_bound unify_trace_bound
2188 Unify.trace_simp unify_trace_simp
2189 Unify.trace_types unify_trace_types
2190 Simplifier.simp_depth_limit simp_depth_limit
2191 Blast.depth_limit blast_depth_limit
2192 DatatypeProp.dtK datatype_distinctness_limit
2193 fast_arith_neq_limit fast_arith_neq_limit
2194 fast_arith_split_limit fast_arith_split_limit
2196 * Named collections of theorems may be easily installed as context
2197 data using the functor NamedThmsFun (see also
2198 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2199 attributes; there is also a toplevel print command. This facility is
2200 just a common case of general context data, which is the preferred way
2201 for anything more complex than just a list of facts in canonical
2204 * Isar: command 'declaration' augments a local theory by generic
2205 declaration functions written in ML. This enables arbitrary content
2206 being added to the context, depending on a morphism that tells the
2207 difference of the original declaration context wrt. the application
2208 context encountered later on.
2210 * Isar: proper interfaces for simplification procedures. Command
2211 'simproc_setup' declares named simprocs (with match patterns, and body
2212 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2213 context. ML antiquotation @{simproc name} retrieves named simprocs.
2215 * Isar: an extra pair of brackets around attribute declarations
2216 abbreviates a theorem reference involving an internal dummy fact,
2217 which will be ignored later --- only the effect of the attribute on
2218 the background context will persist. This form of in-place
2219 declarations is particularly useful with commands like 'declare' and
2220 'using', for example ``have A using [[simproc a]] by simp''.
2222 * Isar: method "assumption" (and implicit closing of subproofs) now
2223 takes simple non-atomic goal assumptions into account: after applying
2224 an assumption as a rule the resulting subgoals are solved by atomic
2225 assumption steps. This is particularly useful to finish 'obtain'
2226 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2227 without referring to the original premise "!!x. P x ==> thesis" in the
2228 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2231 * Isar: implicit use of prems from the Isar proof context is
2232 considered a legacy feature. Common applications like ``have A .''
2233 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2234 referencing facts explicitly here improves readability and
2235 maintainability of proof texts.
2237 * Isar: improper proof element 'guess' is like 'obtain', but derives
2238 the obtained context from the course of reasoning! For example:
2240 assume "EX x y. A x & B y" -- "any previous fact"
2241 then guess x and y by clarify
2243 This technique is potentially adventurous, depending on the facts and
2244 proof tools being involved here.
2246 * Isar: known facts from the proof context may be specified as literal
2247 propositions, using ASCII back-quote syntax. This works wherever
2248 named facts used to be allowed so far, in proof commands, proof
2249 methods, attributes etc. Literal facts are retrieved from the context
2250 according to unification of type and term parameters. For example,
2251 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2252 theorems in the current context, then these are valid literal facts:
2253 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2255 There is also a proof method "fact" which does the same composition
2256 for explicit goal states, e.g. the following proof texts coincide with
2257 certain special cases of literal facts:
2259 have "A" by fact == note `A`
2260 have "A ==> B" by fact == note `A ==> B`
2261 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2262 have "P a ==> Q a" by fact == note `P a ==> Q a`
2264 * Isar: ":" (colon) is no longer a symbolic identifier character in
2265 outer syntax. Thus symbolic identifiers may be used without
2266 additional white space in declarations like this: ``assume *: A''.
2268 * Isar: 'print_facts' prints all local facts of the current context,
2269 both named and unnamed ones.
2271 * Isar: 'def' now admits simultaneous definitions, e.g.:
2273 def x == "t" and y == "u"
2275 * Isar: added command 'unfolding', which is structurally similar to
2276 'using', but affects both the goal state and facts by unfolding given
2277 rewrite rules. Thus many occurrences of the 'unfold' method or
2278 'unfolded' attribute may be replaced by first-class proof text.
2280 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2281 and command 'unfolding' now all support object-level equalities
2282 (potentially conditional). The underlying notion of rewrite rule is
2283 analogous to the 'rule_format' attribute, but *not* that of the
2284 Simplifier (which is usually more generous).
2286 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2287 premises of a theorem by n. Useful in conjunction with drule.
2289 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2290 method expression within a sandbox consisting of the first N
2291 sub-goals, which need to exist. For example, ``simp_all [3]''
2292 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2293 simplifies all new goals that emerge from applying rule foo to the
2294 originally first one.
2296 * Isar: schematic goals are no longer restricted to higher-order
2297 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2300 * Isar: the conclusion of a long theorem statement is now either
2301 'shows' (a simultaneous conjunction, as before), or 'obtains'
2302 (essentially a disjunction of cases with local parameters and
2303 assumptions). The latter allows to express general elimination rules
2304 adequately; in this notation common elimination rules look like this:
2306 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2308 obtains x where "P x"
2310 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2314 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2320 The subsequent classical rules even refer to the formal "thesis"
2323 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2326 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2327 obtains "thesis ==> something"
2329 The actual proof of an 'obtains' statement is analogous to that of the
2330 Isar proof element 'obtain', only that there may be several cases.
2331 Optional case names may be specified in parentheses; these will be
2332 available both in the present proof and as annotations in the
2333 resulting rule, for later use with the 'cases' method (cf. attribute
2336 * Isar: the assumptions of a long theorem statement are available as
2337 "assms" fact in the proof context. This is more appropriate than the
2338 (historical) "prems", which refers to all assumptions of the current
2339 context, including those from the target locale, proof body etc.
2341 * Isar: 'print_statement' prints theorems from the current theory or
2342 proof context in long statement form, according to the syntax of a
2345 * Isar: 'obtain' takes an optional case name for the local context
2346 introduction rule (default "that").
2348 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2349 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2352 * Pure: syntax "CONST name" produces a fully internalized constant
2353 according to the current context. This is particularly useful for
2354 syntax translations that should refer to internal constant
2355 representations independently of name spaces.
2357 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2358 instead of "FOO ". This allows multiple binder declarations to coexist
2359 in the same context. INCOMPATIBILITY.
2361 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2362 primitive that also works in a locale context (both for constants and
2363 fixed variables). Type declaration and internal syntactic representation
2364 of given constants retrieved from the context. Likewise, the
2365 'no_notation' command allows to remove given syntax annotations from the
2368 * Isar/locales: new derived specification elements 'axiomatization',
2369 'definition', 'abbreviation', which support type-inference, admit
2370 object-level specifications (equality, equivalence). See also the
2371 isar-ref manual. Examples:
2374 eq (infix "===" 50) where
2375 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2377 definition "f x y = x + y + 1"
2378 definition g where "g x = f x x"
2381 neq (infix "=!=" 50) where
2382 "x =!= y == ~ (x === y)"
2384 These specifications may be also used in a locale context. Then the
2385 constants being introduced depend on certain fixed parameters, and the
2386 constant name is qualified by the locale base name. An internal
2387 abbreviation takes care for convenient input and output, making the
2388 parameters implicit and using the original short name. See also
2389 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2390 entities from a monomorphic theory.
2392 Presently, abbreviations are only available 'in' a target locale, but
2393 not inherited by general import expressions. Also note that
2394 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2395 'translations' in common applications. The "no_abbrevs" print mode
2396 prevents folding of abbreviations in term output.
2398 Concrete syntax is attached to specified constants in internal form,
2399 independently of name spaces. The parse tree representation is
2400 slightly different -- use 'notation' instead of raw 'syntax', and
2401 'translations' with explicit "CONST" markup to accommodate this.
2403 * Pure/Isar: unified syntax for new-style specification mechanisms
2404 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2405 full type inference and dummy patterns ("_"). For example:
2407 definition "K x _ = x"
2409 inductive conj for A B
2410 where "A ==> B ==> conj A B"
2412 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2413 the current context. Print mode "no_abbrevs" prevents inversion of
2414 abbreviations on output.
2416 * Isar/locales: improved parameter handling: use of locales "var" and
2417 "struct" no longer necessary; - parameter renamings are no longer
2418 required to be injective. For example, this allows to define
2419 endomorphisms as locale endom = homom mult mult h.
2421 * Isar/locales: changed the way locales with predicates are defined.
2422 Instead of accumulating the specification, the imported expression is
2423 now an interpretation. INCOMPATIBILITY: different normal form of
2424 locale expressions. In particular, in interpretations of locales with
2425 predicates, goals repesenting already interpreted fragments are not
2426 removed automatically. Use methods `intro_locales' and
2427 `unfold_locales'; see below.
2429 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2430 provide backward reasoning on locales predicates. The methods are
2431 aware of interpretations and discharge corresponding goals.
2432 `intro_locales' is less aggressive then `unfold_locales' and does not
2433 unfold predicates to assumptions.
2435 * Isar/locales: the order in which locale fragments are accumulated
2436 has changed. This enables to override declarations from fragments due
2437 to interpretations -- for example, unwanted simp rules.
2439 * Isar/locales: interpretation in theories and proof contexts has been
2440 extended. One may now specify (and prove) equations, which are
2441 unfolded in interpreted theorems. This is useful for replacing
2442 defined concepts (constants depending on locale parameters) by
2443 concepts already existing in the target context. Example:
2445 interpretation partial_order ["op <= :: [int, int] => bool"]
2446 where "partial_order.less (op <=) (x::int) y = (x < y)"
2448 Typically, the constant `partial_order.less' is created by a
2449 definition specification element in the context of locale
2452 * Method "induct": improved internal context management to support
2453 local fixes and defines on-the-fly. Thus explicit meta-level
2454 connectives !! and ==> are rarely required anymore in inductive goals
2455 (using object-logic connectives for this purpose has been long
2456 obsolete anyway). Common proof patterns are explained in
2457 src/HOL/Induct/Common_Patterns.thy, see also
2458 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2461 * Method "induct": improved handling of simultaneous goals. Instead of
2462 introducing object-level conjunction, the statement is now split into
2463 several conclusions, while the corresponding symbolic cases are nested
2464 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2465 see src/HOL/Induct/Common_Patterns.thy, for example.
2467 * Method "induct": mutual induction rules are now specified as a list
2468 of rule sharing the same induction cases. HOL packages usually provide
2469 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2470 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2471 mutual induction rules differently, i.e. like this:
2473 (induct rule: foo_bar.inducts)
2474 (induct set: foo bar)
2475 (induct pred: foo bar)
2476 (induct type: foo bar)
2478 The ML function ProjectRule.projections turns old-style rules into the
2481 * Method "coinduct": dual of induction, see
2482 src/HOL/Library/Coinductive_List.thy for various examples.
2484 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2485 considered a legacy feature.
2487 * Attribute "symmetric" produces result with standardized schematic
2488 variables (index 0). Potential INCOMPATIBILITY.
2490 * Simplifier: by default the simplifier trace only shows top level
2491 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2492 default. Thus there is less danger of being flooded by the trace. The
2493 trace indicates where parts have been suppressed.
2495 * Provers/classical: removed obsolete classical version of elim_format
2496 attribute; classical elim/dest rules are now treated uniformly when
2497 manipulating the claset.
2499 * Provers/classical: stricter checks to ensure that supplied intro,
2500 dest and elim rules are well-formed; dest and elim rules must have at
2503 * Provers/classical: attributes dest/elim/intro take an optional
2504 weight argument for the rule (just as the Pure versions). Weights are
2505 ignored by automated tools, but determine the search order of single
2508 * Syntax: input syntax now supports dummy variable binding "%_. b",
2509 where the body does not mention the bound variable. Note that dummy
2510 patterns implicitly depend on their context of bounds, which makes
2511 "{_. _}" match any set comprehension as expected. Potential
2512 INCOMPATIBILITY -- parse translations need to cope with syntactic
2513 constant "_idtdummy" in the binding position.
2515 * Syntax: removed obsolete syntactic constant "_K" and its associated
2516 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2517 for example "A -> B" => "Pi A (%_. B)".
2519 * Pure: 'class_deps' command visualizes the subclass relation, using
2520 the graph browser tool.
2522 * Pure: 'print_theory' now suppresses certain internal declarations by
2523 default; use '!' option for full details.
2528 * Method "metis" proves goals by applying the Metis general-purpose
2529 resolution prover (see also http://gilith.com/software/metis/).
2530 Examples are in the directory MetisExamples. WARNING: the
2531 Isabelle/HOL-Metis integration does not yet work properly with
2534 * Command 'sledgehammer' invokes external automatic theorem provers as
2535 background processes. It generates calls to the "metis" method if
2536 successful. These can be pasted into the proof. Users do not have to
2537 wait for the automatic provers to return. WARNING: does not really
2538 work with multi-threading.
2540 * New "auto_quickcheck" feature tests outermost goal statements for
2541 potential counter-examples. Controlled by ML references
2542 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2543 5000 milliseconds). Fails silently if statements is outside of
2544 executable fragment, or any other codgenerator problem occurs.
2546 * New constant "undefined" with axiom "undefined x = undefined".
2548 * Added class "HOL.eq", allowing for code generation with polymorphic
2551 * Some renaming of class constants due to canonical name prefixing in
2552 the new 'class' package:
2554 HOL.abs ~> HOL.abs_class.abs
2555 HOL.divide ~> HOL.divide_class.divide
2556 0 ~> HOL.zero_class.zero
2557 1 ~> HOL.one_class.one
2558 op + ~> HOL.plus_class.plus
2559 op - ~> HOL.minus_class.minus
2560 uminus ~> HOL.minus_class.uminus
2561 op * ~> HOL.times_class.times
2562 op < ~> HOL.ord_class.less
2563 op <= > HOL.ord_class.less_eq
2564 Nat.power ~> Power.power_class.power
2565 Nat.size ~> Nat.size_class.size
2566 Numeral.number_of ~> Numeral.number_class.number_of
2567 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2568 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2569 Orderings.min ~> Orderings.ord_class.min
2570 Orderings.max ~> Orderings.ord_class.max
2571 Divides.op div ~> Divides.div_class.div
2572 Divides.op mod ~> Divides.div_class.mod
2573 Divides.op dvd ~> Divides.div_class.dvd
2575 INCOMPATIBILITY. Adaptions may be required in the following cases:
2577 a) User-defined constants using any of the names "plus", "minus",
2578 "times", "less" or "less_eq". The standard syntax translations for
2579 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2582 b) Variables named "plus", "minus", "times", "less", "less_eq"
2583 INCOMPATIBILITY: use more specific names.
2585 c) Permutative equations (e.g. "a + b = b + a")
2586 Since the change of names also changes the order of terms, permutative
2587 rewrite rules may get applied in a different order. Experience shows
2588 that this is rarely the case (only two adaptions in the whole Isabelle
2589 distribution). INCOMPATIBILITY: rewrite proofs
2591 d) ML code directly refering to constant names
2592 This in general only affects hand-written proof tactics, simprocs and
2593 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2594 Consider using @{const_name} antiquotation.
2596 * New class "default" with associated constant "default".
2598 * Function "sgn" is now overloaded and available on int, real, complex
2599 (and other numeric types), using class "sgn". Two possible defs of
2600 sgn are given as equational assumptions in the classes sgn_if and
2601 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2604 * Locale "partial_order" now unified with class "order" (cf. theory
2605 Orderings), added parameter "less". INCOMPATIBILITY.
2607 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2608 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2609 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2611 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2612 changed order of proof goals in instance proofs.
2614 * The transitivity reasoner for partial and linear orders is set up
2615 for classes "order" and "linorder". Instances of the reasoner are available
2616 in all contexts importing or interpreting the corresponding locales.
2617 Method "order" invokes the reasoner separately; the reasoner
2618 is also integrated with the Simplifier as a solver. Diagnostic
2619 command 'print_orders' shows the available instances of the reasoner
2620 in the current context.
2622 * Localized monotonicity predicate in theory "Orderings"; integrated
2623 lemmas max_of_mono and min_of_mono with this predicate.
2626 * Formulation of theorem "dense" changed slightly due to integration
2627 with new class dense_linear_order.
2629 * Uniform lattice theory development in HOL.
2631 constants "meet" and "join" now named "inf" and "sup"
2632 constant "Meet" now named "Inf"
2634 classes "meet_semilorder" and "join_semilorder" now named
2635 "lower_semilattice" and "upper_semilattice"
2636 class "lorder" now named "lattice"
2637 class "comp_lat" now named "complete_lattice"
2639 Instantiation of lattice classes allows explicit definitions
2640 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2642 INCOMPATIBILITY. Theorem renames:
2644 meet_left_le ~> inf_le1
2645 meet_right_le ~> inf_le2
2646 join_left_le ~> sup_ge1
2647 join_right_le ~> sup_ge2
2648 meet_join_le ~> inf_sup_ord
2651 le_meet ~> le_inf_iff
2652 le_join ~> ge_sup_conv
2653 meet_idempotent ~> inf_idem
2654 join_idempotent ~> sup_idem
2655 meet_comm ~> inf_commute
2656 join_comm ~> sup_commute
2657 meet_leI1 ~> le_infI1
2658 meet_leI2 ~> le_infI2
2659 le_joinI1 ~> le_supI1
2660 le_joinI2 ~> le_supI2
2661 meet_assoc ~> inf_assoc
2662 join_assoc ~> sup_assoc
2663 meet_left_comm ~> inf_left_commute
2664 meet_left_idempotent ~> inf_left_idem
2665 join_left_comm ~> sup_left_commute
2666 join_left_idempotent ~> sup_left_idem
2669 le_def_meet ~> le_iff_inf
2670 le_def_join ~> le_iff_sup
2671 join_absorp2 ~> sup_absorb2
2672 join_absorp1 ~> sup_absorb1
2673 meet_absorp1 ~> inf_absorb1
2674 meet_absorp2 ~> inf_absorb2
2675 meet_join_absorp ~> inf_sup_absorb
2676 join_meet_absorp ~> sup_inf_absorb
2677 distrib_join_le ~> distrib_sup_le
2678 distrib_meet_le ~> distrib_inf_le
2680 add_meet_distrib_left ~> add_inf_distrib_left
2681 add_join_distrib_left ~> add_sup_distrib_left
2682 is_join_neg_meet ~> is_join_neg_inf
2683 is_meet_neg_join ~> is_meet_neg_sup
2684 add_meet_distrib_right ~> add_inf_distrib_right
2685 add_join_distrib_right ~> add_sup_distrib_right
2686 add_meet_join_distribs ~> add_sup_inf_distribs
2687 join_eq_neg_meet ~> sup_eq_neg_inf
2688 meet_eq_neg_join ~> inf_eq_neg_sup
2689 add_eq_meet_join ~> add_eq_inf_sup
2690 meet_0_imp_0 ~> inf_0_imp_0
2691 join_0_imp_0 ~> sup_0_imp_0
2692 meet_0_eq_0 ~> inf_0_eq_0
2693 join_0_eq_0 ~> sup_0_eq_0
2694 neg_meet_eq_join ~> neg_inf_eq_sup
2695 neg_join_eq_meet ~> neg_sup_eq_inf
2696 join_eq_if ~> sup_eq_if
2698 mono_meet ~> mono_inf
2699 mono_join ~> mono_sup
2700 meet_bool_eq ~> inf_bool_eq
2701 join_bool_eq ~> sup_bool_eq
2702 meet_fun_eq ~> inf_fun_eq
2703 join_fun_eq ~> sup_fun_eq
2704 meet_set_eq ~> inf_set_eq
2705 join_set_eq ~> sup_set_eq
2706 meet1_iff ~> inf1_iff
2707 meet2_iff ~> inf2_iff
2716 join1_iff ~> sup1_iff
2717 join2_iff ~> sup2_iff
2727 is_meet_Meet ~> is_meet_Inf
2728 Meet_bool_def ~> Inf_bool_def
2729 Meet_fun_def ~> Inf_fun_def
2730 Meet_greatest ~> Inf_greatest
2731 Meet_lower ~> Inf_lower
2732 Meet_set_def ~> Inf_set_def
2735 Sup_bool_eq ~> Sup_bool_def
2736 Sup_fun_eq ~> Sup_fun_def
2737 Sup_set_eq ~> Sup_set_def
2739 listsp_meetI ~> listsp_infI
2740 listsp_meet_eq ~> listsp_inf_eq
2745 * Added syntactic class "size"; overloaded constant "size" now has
2746 type "'a::size ==> bool"
2748 * Internal reorganisation of `size' of datatypes: size theorems
2749 "foo.size" are no longer subsumed by "foo.simps" (but are still
2750 simplification rules by default!); theorems "prod.size" now named
2753 * Class "div" now inherits from class "times" rather than "type".
2756 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2757 Linorder etc. have disappeared; operations defined in terms of
2758 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2760 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2762 * HOL-Word: New extensive library and type for generic, fixed size
2763 machine words, with arithemtic, bit-wise, shifting and rotating
2764 operations, reflection into int, nat, and bool lists, automation for
2765 linear arithmetic (by automatic reflection into nat or int), including
2766 lemmas on overflow and monotonicity. Instantiated to all appropriate
2767 arithmetic type classes, supporting automatic simplification of
2768 numerals on all operations.
2770 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2772 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2774 * Code generator library theories:
2775 - Code_Integer represents HOL integers by big integer literals in target
2777 - Code_Char represents HOL characters by character literals in target
2779 - Code_Char_chr like Code_Char, but also offers treatment of character
2780 codes; includes Code_Integer.
2781 - Executable_Set allows to generate code for finite sets using lists.
2782 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2784 - Executable_Real implements a subset of real numbers, namly those
2785 representable by rational numbers.
2786 - Efficient_Nat implements natural numbers by integers, which in general will
2787 result in higher efficency; pattern matching with 0/Suc is eliminated;
2788 includes Code_Integer.
2789 - Code_Index provides an additional datatype index which is mapped to
2790 target-language built-in integers.
2791 - Code_Message provides an additional datatype message_string which is isomorphic to
2792 strings; messages are mapped to target-language strings.
2794 * New package for inductive predicates
2796 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2799 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2800 for z_1 :: U_1 and ... and z_n :: U_m
2802 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2805 with full support for type-inference, rather than
2807 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2809 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2810 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2812 inductive "s z_1 ... z_m"
2814 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2817 For backward compatibility, there is a wrapper allowing inductive
2818 sets to be defined with the new package via
2821 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2822 for z_1 :: U_1 and ... and z_n :: U_m
2824 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2830 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2831 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2832 for z_1 :: U_1 and ... and z_n :: U_m
2834 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2835 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2838 if the additional syntax "p ..." is required.
2840 Numerous examples can be found in the subdirectories src/HOL/Auth,
2841 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2845 - Since declaration and definition of inductive sets or predicates
2846 is no longer separated, abbreviations involving the newly
2847 introduced sets or predicates must be specified together with the
2848 introduction rules after the 'where' keyword (see above), rather
2849 than before the actual inductive definition.
2851 - The variables in induction and elimination rules are now
2852 quantified in the order of their occurrence in the introduction
2853 rules, rather than in alphabetical order. Since this may break
2854 some proofs, these proofs either have to be repaired, e.g. by
2855 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2856 statements of the form
2858 case (rule_i a_i_1 ... a_i_{k_i})
2860 or the old order of quantification has to be restored by explicitly adding
2861 meta-level quantifiers in the introduction rules, i.e.
2863 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2865 - The format of the elimination rules is now
2867 p z_1 ... z_m x_1 ... x_n ==>
2868 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2873 (x_1, ..., x_n) : s z_1 ... z_m ==>
2874 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2877 for sets rather than
2879 x : s z_1 ... z_m ==>
2880 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2883 This may require terms in goals to be expanded to n-tuples
2884 (e.g. using case_tac or simplification with the split_paired_all
2885 rule) before the above elimination rule is applicable.
2887 - The elimination or case analysis rules for (mutually) inductive
2888 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2889 list of rules "p_1_..._p_k.elims" is no longer available.
2891 * New package "function"/"fun" for general recursive functions,
2892 supporting mutual and nested recursion, definitions in local contexts,
2893 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2894 for small examples, and the separate tutorial on the function
2895 package. The old recdef "package" is still available as before, but
2896 users are encouraged to use the new package.
2898 * Method "lexicographic_order" automatically synthesizes termination
2899 relations as lexicographic combinations of size measures.
2901 * Case-expressions allow arbitrary constructor-patterns (including
2902 "_") and take their order into account, like in functional
2903 programming. Internally, this is translated into nested
2904 case-expressions; missing cases are added and mapped to the predefined
2905 constant "undefined". In complicated cases printing may no longer show
2906 the original input but the internal form. Lambda-abstractions allow
2907 the same form of pattern matching: "% pat1 => e1 | ..." is an
2908 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2911 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2912 is an abbreviation for "of_nat :: nat => int". The simplification
2913 rules for "of_nat" have been changed to work like "int" did
2914 previously. Potential INCOMPATIBILITY:
2915 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2916 - of_nat_diff and of_nat_mult are no longer default simp rules
2918 * Method "algebra" solves polynomial equations over (semi)rings using
2919 Groebner bases. The (semi)ring structure is defined by locales and the
2920 tool setup depends on that generic context. Installing the method for
2921 a specific type involves instantiating the locale and possibly adding
2922 declarations for computation on the coefficients. The method is
2923 already instantiated for natural numbers and for the axiomatic class
2924 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2925 CALCULEMUS 2007 for the general principles underlying this
2926 architecture of context-aware proof-tools.
2928 * Method "ferrack" implements quantifier elimination over
2929 special-purpose dense linear orders using locales (analogous to
2930 "algebra"). The method is already installed for class
2931 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2934 * Former constant "List.op @" now named "List.append". Use ML
2935 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2936 circumvent possible incompatibilities when working on ML level.
2938 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2940 * New function listsum :: 'a list => 'a for arbitrary monoids.
2941 Special syntax: "SUM x <- xs. f x" (and latex variants)
2943 * New syntax for Haskell-like list comprehension (input only), eg.
2944 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2946 * The special syntax for function "filter" has changed from [x :
2947 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2948 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2950 * [a..b] is now defined for arbitrary linear orders. It used to be
2951 defined on nat only, as an abbreviation for [a..<Suc b]
2954 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2956 * New functions "sorted" and "sort" in src/HOL/List.thy.
2958 * New lemma collection field_simps (an extension of ring_simps) for
2959 manipulating (in)equations involving division. Multiplies with all
2960 denominators that can be proved to be non-zero (in equations) or
2961 positive/negative (in inequations).
2963 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2964 have been improved and renamed to ring_simps, group_simps and
2965 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2966 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2968 * Theory Library/Commutative_Ring: switched from recdef to function
2969 package; constants add, mul, pow now curried. Infix syntax for
2970 algebraic operations.
2972 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2975 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2978 * HOL/records: generalised field-update to take a function on the
2979 field rather than the new value: r(|A := x|) is translated to A_update
2980 (K x) r The K-combinator that is internally used is called K_record.
2981 INCOMPATIBILITY: Usage of the plain update functions has to be
2984 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2985 * x = 0, which are required for a semiring. Richer structures do not
2986 inherit from semiring_0 anymore, because this property is a theorem
2987 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2988 there is more to prove, but this is mostly trivial.
2990 * Class "recpower" is generalized to arbitrary monoids, not just
2991 commutative semirings. INCOMPATIBILITY: may need to incorporate
2992 commutativity or semiring properties additionally.
2994 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2995 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2996 better use 'abbreviation'.
2998 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3000 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3001 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3002 significant changes for setting up numeral syntax for types:
3003 - New constants Numeral.pred and Numeral.succ instead
3004 of former Numeral.bin_pred and Numeral.bin_succ.
3005 - Use integer operations instead of bin_add, bin_mult and so on.
3006 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3007 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3009 See src/HOL/Integ/IntArith.thy for an example setup.
3011 * Command 'normal_form' computes the normal form of a term that may
3012 contain free variables. For example ``normal_form "rev [a, b, c]"''
3013 produces ``[b, c, a]'' (without proof). This command is suitable for
3014 heavy-duty computations because the functions are compiled to ML
3015 first. Correspondingly, a method "normalization" is provided. See
3016 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3018 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3019 25 like -->); output depends on the "iff" print_mode, the default is
3020 "A = B" (with priority 50).
3022 * Relations less (<) and less_eq (<=) are also available on type bool.
3023 Modified syntax to disallow nesting without explicit parentheses,
3024 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3027 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3029 * Relation composition operator "op O" now has precedence 75 and binds
3030 stronger than union and intersection. INCOMPATIBILITY.
3032 * The old set interval syntax "{m..n(}" (and relatives) has been
3033 removed. Use "{m..<n}" (and relatives) instead.
3035 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3036 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3037 ``declare [[simproc del: neq]]''.
3039 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3042 * Theorem Cons_eq_map_conv no longer declared as "simp".
3044 * Theorem setsum_mult renamed to setsum_right_distrib.
3046 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3049 * Reimplemented methods "sat" and "satx", with several improvements:
3050 goals no longer need to be stated as "<prems> ==> False", equivalences
3051 (i.e. "=" on type bool) are handled, variable names of the form
3052 "lit_<n>" are no longer reserved, significant speedup.
3054 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3055 zChaff is still supported as well.
3057 * 'inductive' and 'datatype': provide projections of mutual rules,
3058 bundled as foo_bar.inducts;
3060 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3063 * Library: moved theory Accessible_Part to main HOL.
3065 * Library: added theory Coinductive_List of potentially infinite lists
3066 as greatest fixed-point.
3068 * Library: added theory AssocList which implements (finite) maps as
3071 * Method "evaluation" solves goals (i.e. a boolean expression)
3072 efficiently by compiling it to ML. The goal is "proved" (via an
3073 oracle) if it evaluates to True.
3075 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3076 also when invoked by the simplifier. This results in the Simplifier
3077 being more powerful on arithmetic goals. INCOMPATIBILITY.
3078 Configuration option fast_arith_split_limit=0 recovers the old
3081 * Support for hex (0x20) and binary (0b1001) numerals.
3083 * New method: reify eqs (t), where eqs are equations for an
3084 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3085 parameter, computes a term s::'b and a list xs::'a list and proves the
3086 theorem I xs s = t. This is also known as reification or quoting. The
3087 resulting theorem is applied to the subgoal to substitute t with I xs
3088 s. If t is omitted, the subgoal itself is reified.
3090 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3091 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3092 where f is supposed to be a computable function (in the sense of code
3093 generattion). The method uses reify to compute s and xs as above then
3094 applies corr_thm and uses normalization by evaluation to "prove" f s =
3095 r and finally gets the theorem t = r, which is again applied to the
3096 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3098 * Reflection: Automatic reification now handels binding, an example is
3099 available in src/HOL/ex/ReflectionEx.thy
3101 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3102 command 'statespace' that is similar to 'record', but introduces an
3103 abstract specification based on the locale infrastructure instead of
3104 HOL types. This leads to extra flexibility in composing state spaces,
3105 in particular multiple inheritance and renaming of components.
3110 * Hyperreal: Functions root and sqrt are now defined on negative real
3111 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3112 Nonnegativity side conditions have been removed from many lemmas, so
3113 that more subgoals may now be solved by simplification; potential
3116 * Real: new type classes formalize real normed vector spaces and
3117 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3118 and norm :: 'a => real.
3120 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3121 reals into other types. The overloaded constant Reals :: 'a set is now
3122 defined as range of_real; potential INCOMPATIBILITY.
3124 * Real: proper support for ML code generation, including 'quickcheck'.
3125 Reals are implemented as arbitrary precision rationals.
3127 * Hyperreal: Several constants that previously worked only for the
3128 reals have been generalized, so they now work over arbitrary vector
3129 spaces. Type annotations may need to be added in some cases; potential
3132 Infinitesimal :: ('a::real_normed_vector) star set
3133 HFinite :: ('a::real_normed_vector) star set
3134 HInfinite :: ('a::real_normed_vector) star set
3135 approx :: ('a::real_normed_vector) star => 'a star => bool
3136 monad :: ('a::real_normed_vector) star => 'a star set
3137 galaxy :: ('a::real_normed_vector) star => 'a star set
3138 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3139 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3140 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3141 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3142 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3143 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3144 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3145 sgn :: 'a::real_normed_vector => 'a
3146 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3148 * Complex: Some complex-specific constants are now abbreviations for
3149 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3150 hnorm. Other constants have been entirely removed in favor of the
3151 polymorphic versions (INCOMPATIBILITY):
3155 HInfinite <-- CInfinite
3156 Infinitesimal <-- CInfinitesimal
3159 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3160 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3161 (ns)deriv <-- (ns)cderiv
3166 * Formalisation of ideals and the quotient construction over rings.
3168 * Order and lattice theory no longer based on records.
3171 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3172 greatest_closed. INCOMPATIBILITY.
3174 * Method algebra is now set up via an attribute. For examples see
3175 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3176 of algebraic structures.
3178 * Renamed theory CRing to Ring.
3183 * Substantial, yet incomplete support for nominal datatypes (binding
3184 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3185 src/HOL/Nominal/Examples. Prospective users should consult
3186 http://isabelle.in.tum.de/nominal/
3191 * ML basics: just one true type int, which coincides with IntInf.int
3194 * ML within Isar: antiquotations allow to embed statically-checked
3195 formal entities in the source, referring to the context available at
3196 compile-time. For example:
3198 ML {* @{sort "{zero,one}"} *}
3199 ML {* @{typ "'a => 'b"} *}
3200 ML {* @{term "%x. x"} *}
3201 ML {* @{prop "x == y"} *}
3202 ML {* @{ctyp "'a => 'b"} *}
3203 ML {* @{cterm "%x. x"} *}
3204 ML {* @{cprop "x == y"} *}
3205 ML {* @{thm asm_rl} *}
3206 ML {* @{thms asm_rl} *}
3207 ML {* @{type_name c} *}
3208 ML {* @{type_syntax c} *}
3209 ML {* @{const_name c} *}
3210 ML {* @{const_syntax c} *}
3213 ML {* @{theory Pure} *}
3214 ML {* @{theory_ref} *}
3215 ML {* @{theory_ref Pure} *}
3218 ML {* @{clasimpset} *}
3220 The same works for sources being ``used'' within an Isar context.
3222 * ML in Isar: improved error reporting; extra verbosity with
3223 ML_Context.trace enabled.
3225 * Pure/General/table.ML: the join operations now works via exceptions
3226 DUP/SAME instead of type option. This is simpler in simple cases, and
3227 admits slightly more efficient complex applications.
3229 * Pure: 'advanced' translation functions (parse_translation etc.) now
3230 use Context.generic instead of just theory.
3232 * Pure: datatype Context.generic joins theory/Proof.context and
3233 provides some facilities for code that works in either kind of
3234 context, notably GenericDataFun for uniform theory and proof data.
3236 * Pure: simplified internal attribute type, which is now always
3237 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3238 local (Proof.context) attributes have been discontinued, while
3239 minimizing code duplication. Thm.rule_attribute and
3240 Thm.declaration_attribute build canonical attributes; see also structure
3241 Context for further operations on Context.generic, notably
3242 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3243 declarations and definitions.
3245 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3246 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3247 init only required for impure data. INCOMPATIBILITY: empty really need
3248 to be empty (no dependencies on theory content!)
3250 * Pure/kernel: consts certification ignores sort constraints given in
3251 signature declarations. (This information is not relevant to the
3252 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3253 potential INCOMPATIBILITY.
3255 * Pure: axiomatic type classes are now purely definitional, with
3256 explicit proofs of class axioms and super class relations performed
3257 internally. See Pure/axclass.ML for the main internal interfaces --
3258 notably AxClass.define_class supercedes AxClass.add_axclass, and
3259 AxClass.axiomatize_class/classrel/arity supersede
3260 Sign.add_classes/classrel/arities.
3262 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3263 global/local versions on theory vs. Proof.context have been
3264 discontinued; Attrib.syntax and Method.syntax have been adapted
3265 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3266 attributes, methods, etc.
3268 * Pure: several functions of signature "... -> theory -> theory * ..."
3269 have been reoriented to "... -> theory -> ... * theory" in order to
3270 allow natural usage in combination with the ||>, ||>>, |-> and
3271 fold_map combinators.
3273 * Pure: official theorem names (closed derivations) and additional
3274 comments (tags) are now strictly separate. Name hints -- which are
3275 maintained as tags -- may be attached any time without affecting the
3278 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3279 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3280 achieve the old behaviour.
3282 * Pure: the "Goal" constant is now called "prop", supporting a
3283 slightly more general idea of ``protecting'' meta-level rule
3286 * Pure: Logic.(un)varify only works in a global context, which is now
3287 enforced instead of silently assumed. INCOMPATIBILITY, may use
3288 Logic.legacy_(un)varify as temporary workaround.
3290 * Pure: structure Name provides scalable operations for generating
3291 internal variable names, notably Name.variants etc. This replaces
3292 some popular functions from term.ML:
3294 Term.variant -> Name.variant
3295 Term.variantlist -> Name.variant_list
3296 Term.invent_names -> Name.invent_list
3298 Note that low-level renaming rarely occurs in new code -- operations
3299 from structure Variable are used instead (see below).
3301 * Pure: structure Variable provides fundamental operations for proper
3302 treatment of fixed/schematic variables in a context. For example,
3303 Variable.import introduces fixes for schematics of given facts and
3304 Variable.export reverses the effect (up to renaming) -- this replaces
3305 various freeze_thaw operations.
3307 * Pure: structure Goal provides simple interfaces for
3308 init/conclude/finish and tactical prove operations (replacing former
3309 Tactic.prove). Goal.prove is the canonical way to prove results
3310 within a given context; Goal.prove_global is a degraded version for
3311 theory level goals, including a global Drule.standard. Note that
3312 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3313 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3314 in a locale context).
3316 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3317 and type checking (Syntax.check_term etc.), with common combinations
3318 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3319 which are considered legacy and await removal.
3321 * Pure/Syntax: generic interfaces for type unchecking
3322 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3323 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3324 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3325 available for convenience, but refer to the very same operations using
3326 a mere theory instead of a full context.
3328 * Isar: simplified treatment of user-level errors, using exception
3329 ERROR of string uniformly. Function error now merely raises ERROR,
3330 without any side effect on output channels. The Isar toplevel takes
3331 care of proper display of ERROR exceptions. ML code may use plain
3332 handle/can/try; cat_error may be used to concatenate errors like this:
3334 ... handle ERROR msg => cat_error msg "..."
3336 Toplevel ML code (run directly or through the Isar toplevel) may be
3337 embedded into the Isar toplevel with exception display/debug like
3340 Isar.toplevel (fn () => ...)
3342 INCOMPATIBILITY, removed special transform_error facilities, removed
3343 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3344 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3345 -- use plain ERROR instead.
3347 * Isar: theory setup now has type (theory -> theory), instead of a
3348 list. INCOMPATIBILITY, may use #> to compose setup functions.
3350 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3351 ProofContext.debug/verbose flags.
3353 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3354 theory before entering a proof state. Transactions now always see a
3355 quasi-functional intermediate checkpoint, both in interactive and
3358 * Isar: simplified interfaces for outer syntax. Renamed
3359 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3360 OuterSyntax.add_parsers -- this functionality is now included in
3361 OuterSyntax.command etc. INCOMPATIBILITY.
3363 * Simplifier: the simpset of a running simplification process now
3364 contains a proof context (cf. Simplifier.the_context), which is the
3365 very context that the initial simpset has been retrieved from (by
3366 simpset_of/local_simpset_of). Consequently, all plug-in components
3367 (solver, looper etc.) may depend on arbitrary proof data.
3369 * Simplifier.inherit_context inherits the proof context (plus the
3370 local bounds) of the current simplification process; any simproc
3371 etc. that calls the Simplifier recursively should do this! Removed
3372 former Simplifier.inherit_bounds, which is already included here --
3373 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3374 specify an explicit context using Simplifier.context/theory_context.
3376 * Simplifier/Classical Reasoner: more abstract interfaces
3377 change_simpset/claset for modifying the simpset/claset reference of a
3378 theory; raw versions simpset/claset_ref etc. have been discontinued --
3381 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3387 * settings: the default heap location within ISABELLE_HOME_USER now
3388 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3389 Isabelle installations.
3391 * isabelle-process: option -S (secure mode) disables some critical
3392 operations, notably runtime compilation and evaluation of ML source
3395 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3397 * Support for parallel execution, using native multicore support of
3398 Poly/ML 5.1. The theory loader exploits parallelism when processing
3399 independent theories, according to the given theory header
3400 specifications. The maximum number of worker threads is specified via
3401 usedir option -M or the "max-threads" setting in Proof General. A
3402 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3403 to 6 on a 8-core machine. User-code needs to observe certain
3404 guidelines for thread-safe programming, see appendix A in the Isar
3405 Implementation manual.
3409 New in Isabelle2005 (October 2005)
3410 ----------------------------------
3414 * Theory headers: the new header syntax for Isar theories is
3417 imports <theory1> ... <theoryN>
3418 uses <file1> ... <fileM>
3421 where the 'uses' part is optional. The previous syntax
3423 theory <name> = <theory1> + ... + <theoryN>:
3425 will disappear in the next release. Use isatool fixheaders to convert
3426 existing theory files. Note that there is no change in ancient
3427 non-Isar theories now, but these will disappear soon.
3429 * Theory loader: parent theories can now also be referred to via
3430 relative and absolute paths.
3432 * Command 'find_theorems' searches for a list of criteria instead of a
3433 list of constants. Known criteria are: intro, elim, dest, name:string,
3434 simp:term, and any term. Criteria can be preceded by '-' to select
3435 theorems that do not match. Intro, elim, dest select theorems that
3436 match the current goal, name:s selects theorems whose fully qualified
3437 name contain s, and simp:term selects all simplification rules whose
3438 lhs match term. Any other term is interpreted as pattern and selects
3439 all theorems matching the pattern. Available in ProofGeneral under
3440 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3442 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3444 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3445 matching the current goal as introduction rule and not having "HOL."
3446 in their name (i.e. not being defined in theory HOL).
3448 * Command 'thms_containing' has been discontinued in favour of
3449 'find_theorems'; INCOMPATIBILITY.
3451 * Communication with Proof General is now 8bit clean, which means that
3452 Unicode text in UTF-8 encoding may be used within theory texts (both
3453 formal and informal parts). Cf. option -U of the Isabelle Proof
3454 General interface. Here are some simple examples (cf. src/HOL/ex):
3456 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3457 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3459 * Improved efficiency of the Simplifier and, to a lesser degree, the
3460 Classical Reasoner. Typical big applications run around 2 times
3464 *** Document preparation ***
3466 * Commands 'display_drafts' and 'print_drafts' perform simple output
3467 of raw sources. Only those symbols that do not require additional
3468 LaTeX packages (depending on comments in isabellesym.sty) are
3469 displayed properly, everything else is left verbatim. isatool display
3470 and isatool print are used as front ends (these are subject to the
3471 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3473 * Command tags control specific markup of certain regions of text,
3474 notably folding and hiding. Predefined tags include "theory" (for
3475 theory begin and end), "proof" for proof commands, and "ML" for
3476 commands involving ML code; the additional tags "visible" and
3477 "invisible" are unused by default. Users may give explicit tag
3478 specifications in the text, e.g. ''by %invisible (auto)''. The
3479 interpretation of tags is determined by the LaTeX job during document
3480 preparation: see option -V of isatool usedir, or options -n and -t of
3481 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3484 Several document versions may be produced at the same time via isatool
3485 usedir (the generated index.html will link all of them). Typical
3486 specifications include ''-V document=theory,proof,ML'' to present
3487 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3488 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3489 these parts without any formal replacement text. The Isabelle site
3490 default settings produce ''document'' and ''outline'' versions as
3493 * Several new antiquotations:
3495 @{term_type term} prints a term with its type annotated;
3497 @{typeof term} prints the type of a term;
3499 @{const const} is the same as @{term const}, but checks that the
3500 argument is a known logical constant;
3502 @{term_style style term} and @{thm_style style thm} print a term or
3503 theorem applying a "style" to it
3507 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3508 definitions, equations, inequations etc., 'concl' printing only the
3509 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3510 to print the specified premise. TermStyle.add_style provides an ML
3511 interface for introducing further styles. See also the "LaTeX Sugar"
3512 document practical applications. The ML antiquotation prints
3513 type-checked ML expressions verbatim.
3515 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3516 and 'text' support optional locale specification '(in loc)', which
3517 specifies the default context for interpreting antiquotations. For
3518 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3520 * Option 'locale=NAME' of antiquotations specifies an alternative
3521 context interpreting the subsequent argument. For example: @{thm
3522 [locale=lattice] inf_assoc}.
3524 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3527 * Proper output of antiquotations for theory commands involving a
3528 proof context (such as 'locale' or 'theorem (in loc) ...').
3530 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3531 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3533 * isatool usedir: new option -C (default true) controls whether option
3534 -D should include a copy of the original document directory; -C false
3535 prevents unwanted effects such as copying of administrative CVS data.
3540 * Considerably improved version of 'constdefs' command. Now performs
3541 automatic type-inference of declared constants; additional support for
3542 local structure declarations (cf. locales and HOL records), see also
3543 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3544 sequential dependencies of definitions within a single 'constdefs'
3545 section; moreover, the declared name needs to be an identifier. If
3546 all fails, consider to fall back on 'consts' and 'defs' separately.
3548 * Improved indexed syntax and implicit structures. First of all,
3549 indexed syntax provides a notational device for subscripted
3550 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3551 expressions. Secondly, in a local context with structure
3552 declarations, number indexes \<^sub>n or the empty index (default
3553 number 1) refer to a certain fixed variable implicitly; option
3554 show_structs controls printing of implicit structures. Typical
3555 applications of these concepts involve record types and locales.
3557 * New command 'no_syntax' removes grammar declarations (and
3558 translations) resulting from the given syntax specification, which is
3559 interpreted in the same manner as for the 'syntax' command.
3561 * 'Advanced' translation functions (parse_translation etc.) may depend
3562 on the signature of the theory context being presently used for
3563 parsing/printing, see also isar-ref manual.
3565 * Improved 'oracle' command provides a type-safe interface to turn an
3566 ML expression of type theory -> T -> term into a primitive rule of
3567 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3568 is already included here); see also FOL/ex/IffExample.thy;
3571 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3572 before); "cI" is no longer bound, use "c.intro" instead.
3573 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3574 axclasses vs. locales.
3576 * Improved internal renaming of symbolic identifiers -- attach primes
3577 instead of base 26 numbers.
3579 * New flag show_question_marks controls printing of leading question
3580 marks in schematic variable names.
3582 * In schematic variable names, *any* symbol following \<^isub> or
3583 \<^isup> is now treated as part of the base name. For example, the
3584 following works without printing of awkward ".0" indexes:
3586 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3589 * Inner syntax includes (*(*nested*) comments*).
3591 * Pretty printer now supports unbreakable blocks, specified in mixfix
3592 annotations as "(00...)".
3594 * Clear separation of logical types and nonterminals, where the latter
3595 may only occur in 'syntax' specifications or type abbreviations.
3596 Before that distinction was only partially implemented via type class
3597 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3598 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3599 exotic syntax specifications may require further adaption
3600 (e.g. Cube/Cube.thy).
3602 * Removed obsolete type class "logic", use the top sort {} instead.
3603 Note that non-logical types should be declared as 'nonterminals'
3604 rather than 'types'. INCOMPATIBILITY for new object-logic
3607 * Attributes 'induct' and 'cases': type or set names may now be
3608 locally fixed variables as well.
3610 * Simplifier: can now control the depth to which conditional rewriting
3611 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3614 * Simplifier: simplification procedures may now take the current
3615 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3616 interface), which is very useful for calling the Simplifier
3617 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3618 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3619 low-level mk_simproc no longer applies Logic.varify internally, to
3620 allow for use in a context of fixed variables.
3622 * thin_tac now works even if the assumption being deleted contains !!
3623 or ==>. More generally, erule now works even if the major premise of
3624 the elimination rule contains !! or ==>.
3626 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3628 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3629 from Pure, which contains all common declarations already. Both
3630 theories are defined via plain Isabelle/Isar .thy files.
3631 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3632 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3633 use isatool fixcpure to adapt your theory and ML sources.
3635 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3636 selections of theorems in named facts via index ranges.
3638 * 'print_theorems': in theory mode, really print the difference
3639 wrt. the last state (works for interactive theory development only),
3640 in proof mode print all local facts (cf. 'print_facts');
3642 * 'hide': option '(open)' hides only base names.
3644 * More efficient treatment of intermediate checkpoints in interactive
3647 * Code generator is now invoked via code_module (incremental code
3648 generation) and code_library (modular code generation, ML structures
3649 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3650 must be quoted when used as identifiers.
3652 * New 'value' command for reading, evaluating and printing terms using
3653 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3654 quoted when used as identifier.
3659 * New commands for the interpretation of locale expressions in
3660 theories (1), locales (2) and proof contexts (3). These generate
3661 proof obligations from the expression specification. After the
3662 obligations have been discharged, theorems of the expression are added
3663 to the theory, target locale or proof context. The synopsis of the
3664 commands is a follows:
3666 (1) interpretation expr inst
3667 (2) interpretation target < expr
3668 (3) interpret expr inst
3670 Interpretation in theories and proof contexts require a parameter
3671 instantiation of terms from the current context. This is applied to
3672 specifications and theorems of the interpreted expression.
3673 Interpretation in locales only permits parameter renaming through the
3674 locale expression. Interpretation is smart in that interpretations
3675 that are active already do not occur in proof obligations, neither are
3676 instantiated theorems stored in duplicate. Use 'print_interps' to
3677 inspect active interpretations of a particular locale. For details,
3678 see the Isar Reference manual. Examples can be found in
3679 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3681 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3682 'interpret' instead.
3684 * New context element 'constrains' for adding type constraints to
3687 * Context expressions: renaming of parameters with syntax
3690 * Locale declaration: 'includes' disallowed.
3692 * Proper static binding of attribute syntax -- i.e. types / terms /
3693 facts mentioned as arguments are always those of the locale definition
3694 context, independently of the context of later invocations. Moreover,
3695 locale operations (renaming and type / term instantiation) are applied
3696 to attribute arguments as expected.
3698 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3699 actual attributes; rare situations may require Attrib.attribute to
3700 embed those attributes into Attrib.src that lack concrete syntax.
3701 Attribute implementations need to cooperate properly with the static
3702 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3703 Attrib.XXX_thm etc. already do the right thing without further
3704 intervention. Only unusual applications -- such as "where" or "of"
3705 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3706 on the context and the facts involved -- may have to assign parsed
3707 values to argument tokens explicitly.
3709 * Changed parameter management in theorem generation for long goal
3710 statements with 'includes'. INCOMPATIBILITY: produces a different
3711 theorem statement in rare situations.
3713 * Locale inspection command 'print_locale' omits notes elements. Use
3714 'print_locale!' to have them included in the output.
3719 * Provers/hypsubst.ML: improved version of the subst method, for
3720 single-step rewriting: it now works in bound variable contexts. New is
3721 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3722 rewrite a different subterm than the original subst method, which is
3723 still available as 'simplesubst'.
3725 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3728 * Provers/trancl.ML: new transitivity reasoner for transitive and
3729 reflexive-transitive closure of relations.
3731 * Provers/blast.ML: new reference depth_limit to make blast's depth
3732 limit (previously hard-coded with a value of 20) user-definable.
3734 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3735 is peformed already. Object-logics merely need to finish their
3736 initial simpset configuration as before. INCOMPATIBILITY.
3741 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3744 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3746 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3747 and x-symbol; use option '-m epsilon' to get it actually printed.
3748 Moreover, the mathematically important symbolic identifier \<epsilon>
3749 becomes available as variable, constant etc. INCOMPATIBILITY,
3751 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3752 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3753 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3754 support corresponding Isar calculations.
3756 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3759 * theory SetInterval: changed the syntax for open intervals:
3768 The old syntax is still supported but will disappear in the next
3769 release. For conversion use the following Emacs search and replace
3770 patterns (these are not perfect but work quite well):
3772 {)\([^\.]*\)\.\. -> {\1<\.\.}
3773 \.\.\([^(}]*\)(} -> \.\.<\1}
3775 * Theory Commutative_Ring (in Library): method comm_ring for proving
3776 equalities in commutative rings; method 'algebra' provides a generic
3779 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3780 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3781 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3784 Some new syntax forms are available:
3786 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3787 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3788 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3789 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3791 The latter form "\<Sum>x < k. e" used to be based on a separate
3792 function "Summation", which has been discontinued.
3794 * theory Finite_Set: in structured induction proofs, the insert case
3795 is now 'case (insert x F)' instead of the old counterintuitive 'case
3798 * The 'refute' command has been extended to support a much larger
3799 fragment of HOL, including axiomatic type classes, constdefs and
3800 typedefs, inductive datatypes and recursion.
3802 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3803 Requires zChaff with proof generation to be installed. See
3804 HOL/ex/SAT_Examples.thy for examples.
3806 * Datatype induction via method 'induct' now preserves the name of the
3807 induction variable. For example, when proving P(xs::'a list) by
3808 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3809 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3810 in unstructured proof scripts.
3812 * Reworked implementation of records. Improved scalability for
3813 records with many fields, avoiding performance problems for type
3814 inference. Records are no longer composed of nested field types, but
3815 of nested extension types. Therefore the record type only grows linear
3816 in the number of extensions and not in the number of fields. The
3817 top-level (users) view on records is preserved. Potential
3818 INCOMPATIBILITY only in strange cases, where the theory depends on the
3819 old record representation. The type generated for a record is called
3820 <record_name>_ext_type.
3822 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3823 proofs triggered by a record definition or a simproc (if
3824 quick_and_dirty is enabled). Definitions of large records can take
3827 New simproc record_upd_simproc for simplification of multiple record
3828 updates enabled by default. Moreover, trivial updates are also
3829 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3830 occasionally, since simplification is more powerful by default.
3832 * typedef: proper support for polymorphic sets, which contain extra
3833 type-variables in the term.
3835 * Simplifier: automatically reasons about transitivity chains
3836 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3837 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3838 old proofs break occasionally as simplification may now solve more
3839 goals than previously.
3841 * Simplifier: converts x <= y into x = y if assumption y <= x is
3842 present. Works for all partial orders (class "order"), in particular
3843 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3846 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3847 bound variable or a constant then the let is unfolded. Otherwise
3848 first a is simplified to b, and then f b is simplified to g. If
3849 possible we abstract b from g arriving at "let x = b in h x",
3850 otherwise we unfold the let and arrive at g. The simproc can be
3851 enabled/disabled by the reference use_let_simproc. Potential
3852 INCOMPATIBILITY since simplification is more powerful by default.
3854 * Classical reasoning: the meson method now accepts theorems as arguments.
3856 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3857 jobs to provide advice on the provability of subgoals.
3859 * Theory OrderedGroup and Ring_and_Field: various additions and
3860 improvements to faciliate calculations involving equalities and
3863 The following theorems have been eliminated or modified
3866 abs_eq now named abs_of_nonneg
3867 abs_of_ge_0 now named abs_of_nonneg
3868 abs_minus_eq now named abs_of_nonpos
3869 imp_abs_id now named abs_of_nonneg
3870 imp_abs_neg_id now named abs_of_nonpos
3871 mult_pos now named mult_pos_pos
3872 mult_pos_le now named mult_nonneg_nonneg
3873 mult_pos_neg_le now named mult_nonneg_nonpos
3874 mult_pos_neg2_le now named mult_nonneg_nonpos2
3875 mult_neg now named mult_neg_neg
3876 mult_neg_le now named mult_nonpos_nonpos
3878 * The following lemmas in Ring_and_Field have been added to the simplifier:
3881 not_square_less_zero
3883 The following lemmas have been deleted from Real/RealPow:
3893 * Theory Parity: added rules for simplifying exponents.
3897 The following theorems have been eliminated or modified
3900 list_all_Nil now named list_all.simps(1)
3901 list_all_Cons now named list_all.simps(2)
3902 list_all_conv now named list_all_iff
3903 set_mem_eq now named mem_iff
3905 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3906 asymptotic "big O" calculations. See the notes in BigO.thy.
3911 * Theory RealDef: better support for embedding natural numbers and
3912 integers in the reals.
3914 The following theorems have been eliminated or modified
3917 exp_ge_add_one_self now requires no hypotheses
3918 real_of_int_add reversed direction of equality (use [symmetric])
3919 real_of_int_minus reversed direction of equality (use [symmetric])
3920 real_of_int_diff reversed direction of equality (use [symmetric])
3921 real_of_int_mult reversed direction of equality (use [symmetric])
3923 * Theory RComplete: expanded support for floor and ceiling functions.
3925 * Theory Ln is new, with properties of the natural logarithm
3927 * Hyperreal: There is a new type constructor "star" for making
3928 nonstandard types. The old type names are now type synonyms:
3932 hcomplex = complex star
3934 * Hyperreal: Many groups of similarly-defined constants have been
3935 replaced by polymorphic versions (INCOMPATIBILITY):
3937 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3939 starset <-- starsetNat, starsetC
3940 *s* <-- *sNat*, *sc*
3941 starset_n <-- starsetNat_n, starsetC_n
3942 *sn* <-- *sNatn*, *scn*
3943 InternalSets <-- InternalNatSets, InternalCSets
3945 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3946 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3947 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3948 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3949 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3951 * Hyperreal: Many type-specific theorems have been removed in favor of
3952 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3954 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3955 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3956 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3957 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3958 right_minus <-- hypreal_add_minus
3959 left_minus <-- {hypreal,hcomplex}_add_minus_left
3960 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3961 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3962 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3963 mult_1_right <-- hcomplex_mult_one_right
3964 mult_zero_left <-- hcomplex_mult_zero_left
3965 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3966 right_distrib <-- hypnat_add_mult_distrib2
3967 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3968 right_inverse <-- hypreal_mult_inverse
3969 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3970 order_refl <-- {hypreal,hypnat}_le_refl
3971 order_trans <-- {hypreal,hypnat}_le_trans
3972 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3973 order_less_le <-- {hypreal,hypnat}_less_le
3974 linorder_linear <-- {hypreal,hypnat}_le_linear
3975 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3976 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3977 add_nonneg_nonneg <-- hypreal_le_add_order
3979 * Hyperreal: Separate theorems having to do with type-specific
3980 versions of constants have been merged into theorems that apply to the
3981 new polymorphic constants (INCOMPATIBILITY):
3983 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3984 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3985 STAR_Un <-- {STAR,NatStar,STARC}_Un
3986 STAR_Int <-- {STAR,NatStar,STARC}_Int
3987 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3988 STAR_subset <-- {STAR,NatStar,STARC}_subset
3989 STAR_mem <-- {STAR,NatStar,STARC}_mem
3990 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3991 STAR_diff <-- {STAR,STARC}_diff
3992 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3993 STARC_hcomplex_of_complex}_image_subset
3994 starset_n_Un <-- starset{Nat,C}_n_Un
3995 starset_n_Int <-- starset{Nat,C}_n_Int
3996 starset_n_Compl <-- starset{Nat,C}_n_Compl
3997 starset_n_diff <-- starset{Nat,C}_n_diff
3998 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3999 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4000 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4001 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4002 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4003 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4004 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4005 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4006 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4007 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4008 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4009 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4010 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4011 starfun_diff <-- starfun{C,RC,CR}_diff
4012 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4013 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4014 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4015 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4016 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4017 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4018 starfun_Id <-- starfunC_Id
4019 starfun_approx <-- starfun{Nat,CR}_approx
4020 starfun_capprox <-- starfun{C,RC}_capprox
4021 starfun_abs <-- starfunNat_rabs
4022 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4023 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4024 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4025 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4026 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4027 starfun_add_approx <-- starfunCR_add_approx
4028 starfun_inverse_inverse <-- starfunC_inverse_inverse
4029 starfun_divide <-- starfun{C,CR,RC}_divide
4030 starfun_n <-- starfun{Nat,C}_n
4031 starfun_n_mult <-- starfun{Nat,C}_n_mult
4032 starfun_n_add <-- starfun{Nat,C}_n_add
4033 starfun_n_add_minus <-- starfunNat_n_add_minus
4034 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4035 starfun_n_minus <-- starfun{Nat,C}_n_minus
4036 starfun_n_eq <-- starfun{Nat,C}_n_eq
4038 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4039 star_n_minus <-- {hypreal,hcomplex}_minus
4040 star_n_diff <-- {hypreal,hcomplex}_diff
4041 star_n_mult <-- {hypreal,hcomplex}_mult
4042 star_n_inverse <-- {hypreal,hcomplex}_inverse
4043 star_n_le <-- {hypreal,hypnat}_le
4044 star_n_less <-- {hypreal,hypnat}_less
4045 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4046 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4047 star_n_abs <-- hypreal_hrabs
4048 star_n_divide <-- hcomplex_divide
4050 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4051 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4052 star_of_diff <-- hypreal_of_real_diff
4053 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4054 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4055 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4056 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4057 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4058 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4059 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4060 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4061 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4062 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4063 star_of_number_of <-- {hypreal,hcomplex}_number_of
4064 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4065 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4066 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4067 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4068 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4069 star_of_power <-- hypreal_of_real_power
4070 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4072 * Hyperreal: new method "transfer" that implements the transfer
4073 principle of nonstandard analysis. With a subgoal that mentions
4074 nonstandard types like "'a star", the command "apply transfer"
4075 replaces it with an equivalent one that mentions only standard types.
4076 To be successful, all free variables must have standard types; non-
4077 standard variables must have explicit universal quantifiers.
4079 * Hyperreal: A theory of Taylor series.
4084 * Discontinued special version of 'constdefs' (which used to support
4085 continuous functions) in favor of the general Pure one with full
4088 * New simplification procedure for solving continuity conditions; it
4089 is much faster on terms with many nested lambda abstractions (cubic
4090 instead of exponential time).
4092 * New syntax for domain package: selector names are now optional.
4093 Parentheses should be omitted unless argument is lazy, for example:
4095 domain 'a stream = cons "'a" (lazy "'a stream")
4097 * New command 'fixrec' for defining recursive functions with pattern
4098 matching; defining multiple functions with mutual recursion is also
4099 supported. Patterns may include the constants cpair, spair, up, sinl,
4100 sinr, or any data constructor defined by the domain package. The given
4101 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4102 syntax and examples.
4104 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4105 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4106 but the proof obligation additionally includes an admissibility
4107 requirement. The packages generate instances of class cpo or pcpo,
4108 with continuity and strictness theorems for Rep and Abs.
4110 * HOLCF: Many theorems have been renamed according to a more standard naming
4111 scheme (INCOMPATIBILITY):
4113 foo_inject: "foo$x = foo$y ==> x = y"
4114 foo_eq: "(foo$x = foo$y) = (x = y)"
4115 foo_less: "(foo$x << foo$y) = (x << y)"
4116 foo_strict: "foo$UU = UU"
4117 foo_defined: "... ==> foo$x ~= UU"
4118 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4123 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4124 including the First Isomorphism Theorem (on quotienting by the kernel
4127 * ZF/Simplifier: install second copy of type solver that actually
4128 makes use of TC rules declared to Isar proof contexts (or locales);
4129 the old version is still required for ML proof scripts.
4134 * Converted to Isar theory format; use locales instead of axiomatic
4140 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4143 * Pure/library.ML no longer defines its own option datatype, but uses
4144 that of the SML basis, which has constructors NONE and SOME instead of
4145 None and Some, as well as exception Option.Option instead of OPTION.
4146 The functions the, if_none, is_some, is_none have been adapted
4147 accordingly, while Option.map replaces apsome.
4149 * Pure/library.ML: the exception LIST has been given up in favour of
4150 the standard exceptions Empty and Subscript, as well as
4151 Library.UnequalLengths. Function like Library.hd and Library.tl are
4152 superceded by the standard hd and tl functions etc.
4154 A number of basic list functions are no longer exported to the ML
4155 toplevel, as they are variants of predefined functions. The following
4156 suggests how one can translate existing code:
4158 rev_append xs ys = List.revAppend (xs, ys)
4159 nth_elem (i, xs) = List.nth (xs, i)
4160 last_elem xs = List.last xs
4161 flat xss = List.concat xss
4162 seq fs = List.app fs
4163 partition P xs = List.partition P xs
4164 mapfilter f xs = List.mapPartial f xs
4166 * Pure/library.ML: several combinators for linear functional
4167 transformations, notably reverse application and composition:
4170 (x, y) |-> f f #-> g
4172 * Pure/library.ML: introduced/changed precedence of infix operators:
4174 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4176 infix 3 o oo ooo oooo;
4177 infix 4 ~~ upto downto;
4179 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4182 * Pure/library.ML: natural list combinators fold, fold_rev, and
4183 fold_map support linear functional transformations and nesting. For
4186 fold f [x1, ..., xN] y =
4187 y |> f x1 |> ... |> f xN
4189 (fold o fold) f [xs1, ..., xsN] y =
4190 y |> fold f xs1 |> ... |> fold f xsN
4192 fold f [x1, ..., xN] =
4195 (fold o fold) f [xs1, ..., xsN] =
4196 fold f xs1 #> ... #> fold f xsN
4198 * Pure/library.ML: the following selectors on type 'a option are
4201 the: 'a option -> 'a (*partial*)
4202 these: 'a option -> 'a where 'a = 'b list
4203 the_default: 'a -> 'a option -> 'a
4204 the_list: 'a option -> 'a list
4206 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4207 basic operations for association lists, following natural argument
4208 order; moreover the explicit equality predicate passed here avoids
4209 potentially expensive polymorphic runtime equality checks.
4210 The old functions may be expressed as follows:
4212 assoc = uncurry (AList.lookup (op =))
4213 assocs = these oo AList.lookup (op =)
4214 overwrite = uncurry (AList.update (op =)) o swap
4216 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4218 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4219 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4221 replacing make_keylist and keyfilter (occassionally used)
4224 make_keylist = AList.make
4225 keyfilter = AList.find (op =)
4227 * eq_fst and eq_snd now take explicit equality parameter, thus
4228 avoiding eqtypes. Naive rewrites:
4230 eq_fst = eq_fst (op =)
4231 eq_snd = eq_snd (op =)
4233 * Removed deprecated apl and apr (rarely used).
4236 apl (n, op) =>>= curry op n
4237 apr (op, m) =>>= fn n => op (n, m)
4239 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4240 provides a reasonably efficient light-weight implementation of sets as
4243 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4244 few new operations; existing lookup and update are now curried to
4245 follow natural argument order (for use with fold etc.);
4246 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4248 * Pure/General: output via the Isabelle channels of
4249 writeln/warning/error etc. is now passed through Output.output, with a
4250 hook for arbitrary transformations depending on the print_mode
4251 (cf. Output.add_mode -- the first active mode that provides a output
4252 function wins). Already formatted output may be embedded into further
4253 text via Output.raw; the result of Pretty.string_of/str_of and derived
4254 functions (string_of_term/cterm/thm etc.) is already marked raw to
4255 accommodate easy composition of diagnostic messages etc. Programmers
4256 rarely need to care about Output.output or Output.raw at all, with
4257 some notable exceptions: Output.output is required when bypassing the
4258 standard channels (writeln etc.), or in token translations to produce
4259 properly formatted results; Output.raw is required when capturing
4260 already output material that will eventually be presented to the user
4261 a second time. For the default print mode, both Output.output and
4262 Output.raw have no effect.
4264 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4265 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4266 cumulative results are displayed at the end of a batch session.
4268 * Pure/General: File.sysify_path and File.quote_sysify path have been
4269 replaced by File.platform_path and File.shell_path (with appropriate
4270 hooks). This provides a clean interface for unusual systems where the
4271 internal and external process view of file names are different.
4273 * Pure: more efficient orders for basic syntactic entities: added
4274 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4275 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4276 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4277 orders now -- potential INCOMPATIBILITY for code that depends on a
4278 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4279 Library.sort_strings on result).
4281 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4282 fold_types traverse types/terms from left to right, observing natural
4283 argument order. Supercedes previous foldl_XXX versions, add_frees,
4284 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4286 * Pure: name spaces have been refined, with significant changes of the
4287 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4288 to extern(_table). The plain name entry path is superceded by a
4289 general 'naming' context, which also includes the 'policy' to produce
4290 a fully qualified name and external accesses of a fully qualified
4291 name; NameSpace.extend is superceded by context dependent
4292 Sign.declare_name. Several theory and proof context operations modify
4293 the naming context. Especially note Theory.restore_naming and
4294 ProofContext.restore_naming to get back to a sane state; note that
4295 Theory.add_path is no longer sufficient to recover from
4296 Theory.absolute_path in particular.
4298 * Pure: new flags short_names (default false) and unique_names
4299 (default true) for controlling output of qualified names. If
4300 short_names is set, names are printed unqualified. If unique_names is
4301 reset, the name prefix is reduced to the minimum required to achieve
4302 the original result when interning again, even if there is an overlap
4303 with earlier declarations.
4305 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4306 now 'extend', and 'merge' gets an additional Pretty.pp argument
4307 (useful for printing error messages). INCOMPATIBILITY.
4309 * Pure: major reorganization of the theory context. Type Sign.sg and
4310 Theory.theory are now identified, referring to the universal
4311 Context.theory (see Pure/context.ML). Actual signature and theory
4312 content is managed as theory data. The old code and interfaces were
4313 spread over many files and structures; the new arrangement introduces
4314 considerable INCOMPATIBILITY to gain more clarity:
4316 Context -- theory management operations (name, identity, inclusion,
4317 parents, ancestors, merge, etc.), plus generic theory data;
4319 Sign -- logical signature and syntax operations (declaring consts,
4320 types, etc.), plus certify/read for common entities;
4322 Theory -- logical theory operations (stating axioms, definitions,
4323 oracles), plus a copy of logical signature operations (consts,
4324 types, etc.); also a few basic management operations (Theory.copy,
4327 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4328 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4329 for convenience -- they merely return the theory.
4331 * Pure: type Type.tsig is superceded by theory in most interfaces.
4333 * Pure: the Isar proof context type is already defined early in Pure
4334 as Context.proof (note that ProofContext.context and Proof.context are
4335 aliases, where the latter is the preferred name). This enables other
4336 Isabelle components to refer to that type even before Isar is present.
4338 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4339 typeK, constK, axiomK, oracleK), but provide explicit operations for
4340 any of these kinds. For example, Sign.intern typeK is now
4341 Sign.intern_type, Theory.hide_space Sign.typeK is now
4342 Theory.hide_types. Also note that former
4343 Theory.hide_classes/types/consts are now
4344 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4345 internalize their arguments! INCOMPATIBILITY.
4347 * Pure: get_thm interface (of PureThy and ProofContext) expects
4348 datatype thmref (with constructors Name and NameSelection) instead of
4349 plain string -- INCOMPATIBILITY;
4351 * Pure: cases produced by proof methods specify options, where NONE
4352 means to remove case bindings -- INCOMPATIBILITY in
4355 * Pure: the following operations retrieve axioms or theorems from a
4356 theory node or theory hierarchy, respectively:
4358 Theory.axioms_of: theory -> (string * term) list
4359 Theory.all_axioms_of: theory -> (string * term) list
4360 PureThy.thms_of: theory -> (string * thm) list
4361 PureThy.all_thms_of: theory -> (string * thm) list
4363 * Pure: print_tac now outputs the goal through the trace channel.
4365 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4366 Reference Toplevel.debug (default false) controls detailed printing
4367 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4368 controls execution profiling -- set to 1 for time and 2 for space
4369 (both increase the runtime).
4371 * Isar session: The initial use of ROOT.ML is now always timed,
4372 i.e. the log will show the actual process times, in contrast to the
4373 elapsed wall-clock time that the outer shell wrapper produces.
4375 * Simplifier: improved handling of bound variables (nameless
4376 representation, avoid allocating new strings). Simprocs that invoke
4377 the Simplifier recursively should use Simplifier.inherit_bounds to
4378 avoid local name clashes. Failure to do so produces warnings
4379 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4380 for further details.
4382 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4383 bindings for all theorems stored within a given theory; this may help
4384 in porting non-Isar theories to Isar ones, while keeping ML proof
4385 scripts for the time being.
4387 * ML operator HTML.with_charset specifies the charset begin used for
4388 generated HTML files. For example:
4390 HTML.with_charset "utf-8" use_thy "Hebrew";
4391 HTML.with_charset "utf-8" use_thy "Chinese";
4396 * Allow symlinks to all proper Isabelle executables (Isabelle,
4397 isabelle, isatool etc.).
4399 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4400 isatool doc, isatool mkdir, display_drafts etc.).
4402 * isatool usedir: option -f allows specification of the ML file to be
4403 used by Isabelle; default is ROOT.ML.
4405 * New isatool version outputs the version identifier of the Isabelle
4406 distribution being used.
4408 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4409 (containing Boolean satisfiability problems) into Isabelle/HOL
4414 New in Isabelle2004 (April 2004)
4415 --------------------------------
4419 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4420 Replaces linorder.ML.
4422 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4423 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4424 (\<a>...\<z>), are now considered normal letters, and can therefore
4425 be used anywhere where an ASCII letter (a...zA...Z) has until
4426 now. COMPATIBILITY: This obviously changes the parsing of some
4427 terms, especially where a symbol has been used as a binder, say
4428 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4429 as an identifier. Fix it by inserting a space around former
4430 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4431 existing theory and ML files.
4433 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4435 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4436 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4437 a normal (but invisible) letter. For multiple letter subscripts repeat
4438 \<^isub> like this: x\<^isub>1\<^isub>2.
4440 * Pure: There are now sub-/superscripts that can span more than one
4441 character. Text between \<^bsub> and \<^esub> is set in subscript in
4442 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4443 superscript. The new control characters are not identifier parts.
4445 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4446 content of "..." to the latex file instead of \isacntrl... . The "..."
4447 may consist of any printable characters excluding the end bracket >.
4449 * Pure: Using new Isar command "finalconsts" (or the ML functions
4450 Theory.add_finals or Theory.add_finals_i) it is now possible to
4451 declare constants "final", which prevents their being given a definition
4452 later. It is useful for constants whose behaviour is fixed axiomatically
4453 rather than definitionally, such as the meta-logic connectives.
4455 * Pure: 'instance' now handles general arities with general sorts
4456 (i.e. intersections of classes),
4458 * Presentation: generated HTML now uses a CSS style sheet to make layout
4459 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4460 It can be changed to alter the colors/layout of generated pages.
4465 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4466 cut_tac, subgoal_tac and thin_tac:
4467 - Now understand static (Isar) contexts. As a consequence, users of Isar
4468 locales are no longer forced to write Isar proof scripts.
4469 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4471 - INCOMPATIBILITY: names of variables to be instantiated may no
4472 longer be enclosed in quotes. Instead, precede variable name with `?'.
4473 This is consistent with the instantiation attribute "where".
4475 * Attributes "where" and "of":
4476 - Now take type variables of instantiated theorem into account when reading
4477 the instantiation string. This fixes a bug that caused instantiated
4478 theorems to have too special types in some circumstances.
4479 - "where" permits explicit instantiations of type variables.
4481 * Calculation commands "moreover" and "also" no longer interfere with
4482 current facts ("this"), admitting arbitrary combinations with "then"
4486 - Goal statements involving the context element "includes" no longer
4487 generate theorems with internal delta predicates (those ending on
4488 "_axioms") in the premise.
4489 Resolve particular premise with <locale>.intro to obtain old form.
4490 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4491 specification and "includes" elements in goal statement.
4492 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4493 [intro?] and [elim?] (respectively) by default.
4494 - Experimental command for instantiation of locales in proof contexts:
4495 instantiate <label>[<attrs>]: <loc>
4496 Instantiates locale <loc> and adds all its theorems to the current context
4497 taking into account their attributes. Label and attrs are optional
4498 modifiers, like in theorem declarations. If present, names of
4499 instantiated theorems are qualified with <label>, and the attributes
4500 <attrs> are applied after any attributes these theorems might have already.
4501 If the locale has assumptions, a chained fact of the form
4502 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4503 are derived. The command does not support old-style locales declared
4504 with "locale (open)".
4505 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4507 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4513 * Proof import: new image HOL4 contains the imported library from
4514 the HOL4 system with about 2500 theorems. It is imported by
4515 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4516 can be used like any other Isabelle image. See
4517 HOL/Import/HOL/README for more information.
4520 - Much improved handling of linear and partial orders.
4521 Reasoners for linear and partial orders are set up for type classes
4522 "linorder" and "order" respectively, and are added to the default simpset
4523 as solvers. This means that the simplifier can build transitivity chains
4524 to solve goals from the assumptions.
4525 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4526 of blast or auto after simplification become unnecessary because the goal
4527 is solved by simplification already.
4529 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4530 all proved in axiomatic type classes for semirings, rings and fields.
4533 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4534 now formalized using the Ring_and_Field theory mentioned above.
4535 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4536 than before, because now they are set up once in a generic manner.
4537 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4538 Look for the general versions in Ring_and_Field (and Power if they concern
4541 * Type "rat" of the rational numbers is now available in HOL-Complex.
4544 - Record types are now by default printed with their type abbreviation
4545 instead of the list of all field types. This can be configured via
4546 the reference "print_record_type_abbr".
4547 - Simproc "record_upd_simproc" for simplification of multiple updates added
4548 (not enabled by default).
4549 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4550 EX x. x = sel r to True (not enabled by default).
4551 - Tactic "record_split_simp_tac" to split and simplify records added.
4553 * 'specification' command added, allowing for definition by
4554 specification. There is also an 'ax_specification' command that
4555 introduces the new constants axiomatically.
4557 * arith(_tac) is now able to generate counterexamples for reals as well.
4559 * HOL-Algebra: new locale "ring" for non-commutative rings.
4561 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4562 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4564 * HOL-Matrix: a first theory for matrices in HOL with an application of
4565 matrix theory to linear programming.
4567 * Unions and Intersections:
4568 The latex output syntax of UN and INT has been changed
4569 from "\Union x \in A. B" to "\Union_{x \in A} B"
4570 i.e. the index formulae has become a subscript.
4571 Similarly for "\Union x. B", and for \Inter instead of \Union.
4573 * Unions and Intersections over Intervals:
4574 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4575 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4576 like in normal math, and corresponding versions for < and for intersection.
4578 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4579 lexicographic dictonary ordering has been added as "lexord".
4581 * ML: the legacy theory structures Int and List have been removed. They had
4582 conflicted with ML Basis Library structures having the same names.
4584 * 'refute' command added to search for (finite) countermodels. Only works
4585 for a fragment of HOL. The installation of an external SAT solver is
4586 highly recommended. See "HOL/Refute.thy" for details.
4588 * 'quickcheck' command: Allows to find counterexamples by evaluating
4589 formulae under an assignment of free variables to random values.
4590 In contrast to 'refute', it can deal with inductive datatypes,
4591 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4597 * Streams now come with concatenation and are part of the HOLCF image
4601 New in Isabelle2003 (May 2003)
4602 ------------------------------
4606 * Provers/simplifier:
4608 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4609 Assumptions are now subject to complete mutual simplification,
4610 not just from left to right. The simplifier now preserves
4611 the order of assumptions.
4613 Potential INCOMPATIBILITY:
4615 -- simp sometimes diverges where the old version did
4616 not, e.g. invoking simp on the goal
4618 [| P (f x); y = x; f x = f y |] ==> Q
4620 now gives rise to the infinite reduction sequence
4622 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4624 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4627 -- Tactics combining classical reasoner and simplification (such as auto)
4628 are also affected by this change, because many of them rely on
4629 simp. They may sometimes diverge as well or yield a different numbers
4630 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4631 in case of problems. Sometimes subsequent calls to the classical
4632 reasoner will fail because a preceeding call to the simplifier too
4633 eagerly simplified the goal, e.g. deleted redundant premises.
4635 - The simplifier trace now shows the names of the applied rewrite rules
4637 - You can limit the number of recursive invocations of the simplifier
4638 during conditional rewriting (where the simplifie tries to solve the
4639 conditions before applying the rewrite rule):
4640 ML "simp_depth_limit := n"
4641 where n is an integer. Thus you can force termination where previously
4642 the simplifier would diverge.
4644 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4646 - No longer aborts on failed congruence proof. Instead, the
4647 congruence is ignored.
4649 * Pure: New generic framework for extracting programs from constructive
4650 proofs. See HOL/Extraction.thy for an example instantiation, as well
4651 as HOL/Extraction for some case studies.
4653 * Pure: The main goal of the proof state is no longer shown by default, only
4654 the subgoals. This behaviour is controlled by a new flag.
4655 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4656 (ML: Proof.show_main_goal).
4658 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4659 rules whose conclusion matches subgoal 1:
4660 PG menu: Isabelle/Isar -> Show me -> matching rules
4661 The rules are ordered by how closely they match the subgoal.
4662 In particular, rules that solve a subgoal outright are displayed first
4663 (or rather last, the way they are printed).
4664 (ML: ProofGeneral.print_intros())
4666 * Pure: New flag trace_unify_fail causes unification to print
4667 diagnostic information (PG: in trace buffer) when it fails. This is
4668 useful for figuring out why single step proofs like rule, erule or
4671 * Pure: Locale specifications now produce predicate definitions
4672 according to the body of text (covering assumptions modulo local
4673 definitions); predicate "loc_axioms" covers newly introduced text,
4674 while "loc" is cumulative wrt. all included locale expressions; the
4675 latter view is presented only on export into the global theory
4676 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4677 on the old view without predicates;
4679 * Pure: predefined locales "var" and "struct" are useful for sharing
4680 parameters (as in CASL, for example); just specify something like
4681 ``var x + var y + struct M'' as import;
4683 * Pure: improved thms_containing: proper indexing of facts instead of
4684 raw theorems; check validity of results wrt. current name space;
4685 include local facts of proof configuration (also covers active
4686 locales), cover fixed variables in index; may use "_" in term
4687 specification; an optional limit for the number of printed facts may
4688 be given (the default is 40);
4690 * Pure: disallow duplicate fact bindings within new-style theory files
4693 * Provers: improved induct method: assumptions introduced by case
4694 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4695 the goal statement); "foo" still refers to all facts collectively;
4697 * Provers: the function blast.overloaded has been removed: all constants
4698 are regarded as potentially overloaded, which improves robustness in exchange
4699 for slight decrease in efficiency;
4701 * Provers/linorder: New generic prover for transitivity reasoning over
4702 linear orders. Note: this prover is not efficient!
4704 * Isar: preview of problems to finish 'show' now produce an error
4705 rather than just a warning (in interactive mode);
4712 - Produces a counter example if it cannot prove a goal.
4713 Note that the counter example may be spurious if the goal is not a formula
4714 of quantifier-free linear arithmetic.
4715 In ProofGeneral the counter example appears in the trace buffer.
4717 - Knows about div k and mod k where k is a numeral of type nat or int.
4719 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4720 linear arithmetic fails. This takes account of quantifiers and divisibility.
4721 Presburger arithmetic can also be called explicitly via presburger(_tac).
4723 * simp's arithmetic capabilities have been enhanced a bit: it now
4724 takes ~= in premises into account (by performing a case split);
4726 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4727 are distributed over a sum of terms;
4729 * New tactic "trans_tac" and method "trans" instantiate
4730 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4733 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4734 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4736 * 'typedef' command has new option "open" to suppress the set
4739 * functions Min and Max on finite sets have been introduced (theory
4742 * attribute [symmetric] now works for relations as well; it turns
4743 (x,y) : R^-1 into (y,x) : R, and vice versa;
4745 * induct over a !!-quantified statement (say !!x1..xn):
4746 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4748 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4749 %x. None. Warning: empty_def now refers to the previously hidden definition
4752 * Algebra: formalization of classical algebra. Intended as base for
4753 any algebraic development in Isabelle. Currently covers group theory
4754 (up to Sylow's theorem) and ring theory (Universal Property of
4755 Univariate Polynomials). Contributions welcome;
4757 * GroupTheory: deleted, since its material has been moved to Algebra;
4759 * Complex: new directory of the complex numbers with numeric constants,
4760 nonstandard complex numbers, and some complex analysis, standard and
4761 nonstandard (Jacques Fleuriot);
4763 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4765 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4768 * Real/HahnBanach: updated and adapted to locales;
4770 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4773 * UNITY: added the Meier-Sanders theory of progress sets;
4775 * MicroJava: bytecode verifier and lightweight bytecode verifier
4776 as abstract algorithms, instantiated to the JVM;
4778 * Bali: Java source language formalization. Type system, operational
4779 semantics, axiomatic semantics. Supported language features:
4780 classes, interfaces, objects,virtual methods, static methods,
4781 static/instance fields, arrays, access modifiers, definite
4782 assignment, exceptions.
4787 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4790 * Main ZF: virtually all theories converted to new-style format;
4795 * Pure: Tactic.prove provides sane interface for internal proofs;
4796 omits the infamous "standard" operation, so this is more appropriate
4797 than prove_goalw_cterm in many situations (e.g. in simprocs);
4799 * Pure: improved error reporting of simprocs;
4801 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4805 *** Document preparation ***
4807 * uses \par instead of \\ for line breaks in theory text. This may
4808 shift some page breaks in large documents. To get the old behaviour
4809 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4811 * minimized dependencies of isabelle.sty and isabellesym.sty on
4814 * \<euro> now needs package babel/greek instead of marvosym (which
4817 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4822 New in Isabelle2002 (March 2002)
4823 --------------------------------
4825 *** Document preparation ***
4827 * greatly simplified document preparation setup, including more
4828 graceful interpretation of isatool usedir -i/-d/-D options, and more
4829 instructive isatool mkdir; users should basically be able to get
4830 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4831 users may run a separate document processing stage manually like this:
4832 "isatool usedir -D output HOL Test && isatool document Test/output";
4834 * theory dependency graph may now be incorporated into documents;
4835 isatool usedir -g true will produce session_graph.eps/.pdf for use
4836 with \includegraphics of LaTeX;
4838 * proper spacing of consecutive markup elements, especially text
4839 blocks after section headings;
4841 * support bold style (for single symbols only), input syntax is like
4842 this: "\<^bold>\<alpha>" or "\<^bold>A";
4844 * \<bullet> is now output as bold \cdot by default, which looks much
4845 better in printed text;
4847 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4848 note that these symbols are currently unavailable in Proof General /
4849 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4851 * isatool latex no longer depends on changed TEXINPUTS, instead
4852 isatool document copies the Isabelle style files to the target
4858 * Pure/Provers: improved proof by cases and induction;
4859 - 'case' command admits impromptu naming of parameters (such as
4861 - 'induct' method divinates rule instantiation from the inductive
4862 claim; no longer requires excessive ?P bindings for proper
4863 instantiation of cases;
4864 - 'induct' method properly enumerates all possibilities of set/type
4865 rules; as a consequence facts may be also passed through *type*
4866 rules without further ado;
4867 - 'induct' method now derives symbolic cases from the *rulified*
4868 rule (before it used to rulify cases stemming from the internal
4869 atomized version); this means that the context of a non-atomic
4870 statement becomes is included in the hypothesis, avoiding the
4871 slightly cumbersome show "PROP ?case" form;
4872 - 'induct' may now use elim-style induction rules without chaining
4873 facts, using ``missing'' premises from the goal state; this allows
4874 rules stemming from inductive sets to be applied in unstructured
4875 scripts, while still benefitting from proper handling of non-atomic
4876 statements; NB: major inductive premises need to be put first, all
4877 the rest of the goal is passed through the induction;
4878 - 'induct' proper support for mutual induction involving non-atomic
4879 rule statements (uses the new concept of simultaneous goals, see
4881 - append all possible rule selections, but only use the first
4882 success (no backtracking);
4883 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4884 - undeclared rule case names default to numbers 1, 2, 3, ...;
4885 - added 'print_induct_rules' (covered by help item in recent Proof
4887 - moved induct/cases attributes to Pure, methods to Provers;
4888 - generic method setup instantiated for FOL and HOL;
4890 * Pure: support multiple simultaneous goal statements, for example
4891 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4892 meta-level mechanism, this acts as if several individual goals had
4893 been stated separately; in particular common proof methods need to be
4894 repeated in order to cover all claims; note that a single elimination
4895 step is *not* sufficient to establish the two conjunctions, so this
4898 assume "A & B" then have A and B .. (*".." fails*)
4900 better use "obtain" in situations as above; alternative refer to
4901 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4903 * Pure: proper integration with ``locales''; unlike the original
4904 version by Florian Kammller, Isar locales package high-level proof
4905 contexts rather than raw logical ones (e.g. we admit to include
4906 attributes everywhere); operations on locales include merge and
4907 rename; support for implicit arguments (``structures''); simultaneous
4908 type-inference over imports and text; see also HOL/ex/Locales.thy for
4911 * Pure: the following commands have been ``localized'', supporting a
4912 target locale specification "(in name)": 'lemma', 'theorem',
4913 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4914 stored both within the locale and at the theory level (exported and
4915 qualified by the locale name);
4917 * Pure: theory goals may now be specified in ``long'' form, with
4918 ad-hoc contexts consisting of arbitrary locale elements. for example
4919 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4920 definitions may be given, too); the result is a meta-level rule with
4921 the context elements being discharged in the obvious way;
4923 * Pure: new proof command 'using' allows to augment currently used
4924 facts after a goal statement ('using' is syntactically analogous to
4925 'apply', but acts on the goal's facts only); this allows chained facts
4926 to be separated into parts given before and after a claim, as in
4927 ``from a and b have C using d and e <proof>'';
4929 * Pure: renamed "antecedent" case to "rule_context";
4931 * Pure: new 'judgment' command records explicit information about the
4932 object-logic embedding (used by several tools internally); no longer
4933 use hard-wired "Trueprop";
4935 * Pure: added 'corollary' command;
4937 * Pure: fixed 'token_translation' command;
4939 * Pure: removed obsolete 'exported' attribute;
4941 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4942 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4943 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4945 * Pure: method 'atomize' presents local goal premises as object-level
4946 statements (atomic meta-level propositions); setup controlled via
4947 rewrite rules declarations of 'atomize' attribute; example
4948 application: 'induct' method with proper rule statements in improper
4951 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4952 now consider the syntactic context of assumptions, giving a better
4953 chance to get type-inference of the arguments right (this is
4954 especially important for locales);
4956 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4959 * Pure/obtain: the formal conclusion "thesis", being marked as
4960 ``internal'', may no longer be reference directly in the text;
4961 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4964 * Pure: generic 'sym' attribute which declares a rule both as pure
4965 'elim?' and for the 'symmetric' operation;
4967 * Pure: marginal comments ``--'' may now occur just anywhere in the
4968 text; the fixed correlation with particular command syntax has been
4971 * Pure: new method 'rules' is particularly well-suited for proof
4972 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4973 but often produces more compact proof terms with less detours;
4975 * Pure/Provers/classical: simplified integration with pure rule
4976 attributes and methods; the classical "intro?/elim?/dest?"
4977 declarations coincide with the pure ones; the "rule" method no longer
4978 includes classically swapped intros; "intro" and "elim" methods no
4979 longer pick rules from the context; also got rid of ML declarations
4980 AddXIs/AddXEs/AddXDs; all of this has some potential for
4983 * Provers/classical: attribute 'swapped' produces classical inversions
4984 of introduction rules;
4986 * Provers/simplifier: 'simplified' attribute may refer to explicit
4987 rules instead of full simplifier context; 'iff' attribute handles
4990 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4992 * HOL: 'recdef' now fails on unfinished automated proofs, use
4993 "(permissive)" option to recover old behavior;
4995 * HOL: 'inductive' no longer features separate (collective) attributes
4996 for 'intros' (was found too confusing);
4998 * HOL: properly declared induction rules less_induct and
5004 * HOL: moved over to sane numeral syntax; the new policy is as
5007 - 0 and 1 are polymorphic constants, which are defined on any
5008 numeric type (nat, int, real etc.);
5010 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5011 binary representation internally;
5013 - type nat has special constructor Suc, and generally prefers Suc 0
5014 over 1::nat and Suc (Suc 0) over 2::nat;
5016 This change may cause significant problems of INCOMPATIBILITY; here
5017 are some hints on converting existing sources:
5019 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5020 entities, so expressions involving "-" (unary or binary minus) need
5021 to be spaced properly;
5023 - existing occurrences of "1" may need to be constraint "1::nat" or
5024 even replaced by Suc 0; similar for old "2";
5026 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5028 - remove all special provisions on numerals in proofs;
5030 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5031 representation (depends on bin_arith_simps in the default context);
5033 * HOL: symbolic syntax for x^2 (numeral 2);
5035 * HOL: the class of all HOL types is now called "type" rather than
5036 "term"; INCOMPATIBILITY, need to adapt references to this type class
5037 in axclass/classes, instance/arities, and (usually rare) occurrences
5038 in typings (of consts etc.); internally the class is called
5039 "HOL.type", ML programs should refer to HOLogic.typeS;
5041 * HOL/record package improvements:
5042 - new derived operations "fields" to build a partial record section,
5043 "extend" to promote a fixed record to a record scheme, and
5044 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5045 declared as simp by default;
5046 - shared operations ("more", "fields", etc.) now need to be always
5047 qualified) --- potential INCOMPATIBILITY;
5048 - removed "make_scheme" operations (use "make" with "extend") --
5050 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5051 - provides cases/induct rules for use with corresponding Isar
5052 methods (for concrete records, record schemes, concrete more
5053 parts, and schematic more parts -- in that order);
5054 - internal definitions directly based on a light-weight abstract
5055 theory of product types over typedef rather than datatype;
5057 * HOL: generic code generator for generating executable ML code from
5058 specifications; specific support for HOL constructs such as inductive
5059 datatypes and sets, as well as recursive functions; can be invoked
5060 via 'generate_code' theory section;
5062 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5064 * HOL: consolidated and renamed several theories. In particular:
5065 Ord.thy has been absorbed into HOL.thy
5066 String.thy has been absorbed into List.thy
5068 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5069 (beware of argument permutation!);
5071 * HOL: linorder_less_split superseded by linorder_cases;
5073 * HOL/List: "nodups" renamed to "distinct";
5075 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5076 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5077 - Ex_def has changed, now need to use some_eq_ex
5079 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5080 in this (rare) case use:
5082 delSWrapper "split_all_tac"
5083 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5085 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5088 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5089 Isabelle's type classes, ^ on functions and relations has too general
5090 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5091 necessary to attach explicit type constraints;
5093 * HOL/Relation: the prefix name of the infix "O" has been changed from
5094 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5095 renamed accordingly (eg "compI" -> "rel_compI").
5097 * HOL: syntax translations now work properly with numerals and records
5100 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5101 of "lam" -- INCOMPATIBILITY;
5103 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5104 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5105 renamed "Product_Type.unit";
5107 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5109 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5110 the "cases" method);
5112 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5115 * HOL/IMP: updated and converted to new-style theory format; several
5116 parts turned into readable document, with proper Isar proof texts and
5117 some explanations (by Gerwin Klein);
5119 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5121 * HOL-Hyperreal is now a logic image;
5126 * Isar: consts/constdefs supports mixfix syntax for continuous
5129 * Isar: domain package adapted to new-style theory format, e.g. see
5132 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5133 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5134 lift.induct_tac, always use UU instead of Undef;
5136 * HOLCF/IMP: updated and converted to new-style theory;
5141 * Isar: proper integration of logic-specific tools and packages,
5142 including theory commands '(co)inductive', '(co)datatype',
5143 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5144 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5146 * theory Main no longer includes AC; for the Axiom of Choice, base
5147 your theory on Main_ZFC;
5149 * the integer library now covers quotients and remainders, with many
5150 laws relating division to addition, multiplication, etc.;
5152 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5153 typeless version of the formalism;
5155 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5158 * ZF/Induct: new directory for examples of inductive definitions,
5159 including theory Multiset for multiset orderings; converted to
5160 new-style theory format;
5162 * ZF: many new theorems about lists, ordinals, etc.;
5167 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5168 variable proof controls level of detail: 0 = no proofs (only oracle
5169 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5170 also ref manual for further ML interfaces;
5172 * Pure/axclass: removed obsolete ML interface
5173 goal_subclass/goal_arity;
5175 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5176 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5177 separate tokens, so expressions involving minus need to be spaced
5180 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5181 rather than "infixl" or "infixr";
5183 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5184 sort constraint specifications in type inference; e.g. "x::_::foo"
5185 ensures that the type of "x" is of sort "foo" (but not necessarily a
5188 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5189 control output of nested => (types); the default behavior is
5192 * Pure/syntax: builtin parse translation for "_constify" turns valued
5193 tokens into AST constants;
5195 * Pure/syntax: prefer later declarations of translations and print
5196 translation functions; potential INCOMPATIBILITY: need to reverse
5197 multiple declarations for same syntax element constant;
5199 * Pure/show_hyps reset by default (in accordance to existing Isar
5202 * Provers/classical: renamed addaltern to addafter, addSaltern to
5205 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5208 * system: tested support for MacOS X; should be able to get Isabelle +
5209 Proof General to work in a plain Terminal after installing Poly/ML
5210 (e.g. from the Isabelle distribution area) and GNU bash alone
5211 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5212 support requires further installations, e.g. from
5213 http://fink.sourceforge.net/);
5215 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5217 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5218 of 40 MB), cf. ML_OPTIONS;
5220 * system: Proof General keywords specification is now part of the
5221 Isabelle distribution (see etc/isar-keywords.el);
5223 * system: support for persistent Proof General sessions (refrain from
5224 outdating all loaded theories on startup); user may create writable
5225 logic images like this: ``isabelle -q HOL Test'';
5227 * system: smart selection of Isabelle process versus Isabelle
5228 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5229 run both "isabelle" and "Isabelle" even if file names are badly
5230 damaged (executable inspects the case of the first letter of its own
5231 name); added separate "isabelle-process" and "isabelle-interface";
5233 * system: refrain from any attempt at filtering input streams; no
5234 longer support ``8bit'' encoding of old isabelle font, instead proper
5235 iso-latin characters may now be used; the related isatools
5236 "symbolinput" and "nonascii" have disappeared as well;
5238 * system: removed old "xterm" interface (the print modes "xterm" and
5239 "xterm_color" are still available for direct use in a suitable
5244 New in Isabelle99-2 (February 2001)
5245 -----------------------------------
5247 *** Overview of INCOMPATIBILITIES ***
5249 * HOL: please note that theories in the Library and elsewhere often use the
5250 new-style (Isar) format; to refer to their theorems in an ML script you must
5251 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5253 * HOL: inductive package no longer splits induction rule aggressively,
5254 but only as far as specified by the introductions given; the old
5255 format may be recovered via ML function complete_split_rule or attribute
5256 'split_rule (complete)';
5258 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5259 gfp_Tarski to gfp_unfold;
5261 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5263 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5264 relation); infix "^^" has been renamed "``"; infix "``" has been
5265 renamed "`"; "univalent" has been renamed "single_valued";
5267 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5270 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5272 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5274 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5275 consequence, it is no longer monotonic wrt. the local goal context
5276 (which is now passed through the inductive cases);
5278 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5279 \<gg> to \<ggreater>;
5282 *** Document preparation ***
5284 * \isabellestyle{NAME} selects version of Isabelle output (currently
5285 available: are "it" for near math-mode best-style output, "sl" for
5286 slanted text style, and "tt" for plain type-writer; if no
5287 \isabellestyle command is given, output is according to slanted
5290 * support sub/super scripts (for single symbols only), input syntax is
5291 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5293 * some more standard symbols; see Appendix A of the system manual for
5294 the complete list of symbols defined in isabellesym.sty;
5296 * improved isabelle style files; more abstract symbol implementation
5297 (should now use \isamath{...} and \isatext{...} in custom symbol
5300 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5301 state; Note that presentation of goal states does not conform to
5302 actual human-readable proof documents. Please do not include goal
5303 states into document output unless you really know what you are doing!
5305 * proper indentation of antiquoted output with proportional LaTeX
5308 * no_document ML operator temporarily disables LaTeX document
5311 * isatool unsymbolize tunes sources for plain ASCII communication;
5316 * Pure: Isar now suffers initial goal statements to contain unbound
5317 schematic variables (this does not conform to actual readable proof
5318 documents, due to unpredictable outcome and non-compositional proof
5319 checking); users who know what they are doing may use schematic goals
5320 for Prolog-style synthesis of proven results;
5322 * Pure: assumption method (an implicit finishing) now handles actual
5325 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5326 initial goal, declare "that" only as Pure intro (only for single
5327 steps); the "that" rule assumption may now be involved in implicit
5328 finishing, thus ".." becomes a feasible for trivial obtains;
5330 * Pure: default proof step now includes 'intro_classes'; thus trivial
5331 instance proofs may be performed by "..";
5333 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5336 * Pure: more robust selection of calculational rules;
5338 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5339 rule (as well as the assumption rule);
5341 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5342 lemmas, using the graph browser tool;
5344 * Pure: predict failure of "show" in interactive mode;
5346 * Pure: 'thms_containing' now takes actual terms as arguments;
5348 * HOL: improved method 'induct' --- now handles non-atomic goals
5349 (potential INCOMPATIBILITY); tuned error handling;
5351 * HOL: cases and induct rules now provide explicit hints about the
5352 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5353 any remaining facts are inserted into the goal verbatim;
5355 * HOL: local contexts (aka cases) may now contain term bindings as
5356 well; the 'cases' and 'induct' methods new provide a ?case binding for
5357 the result to be shown in each case;
5359 * HOL: added 'recdef_tc' command;
5361 * isatool convert assists in eliminating legacy ML scripts;
5366 * HOL/Library: a collection of generic theories to be used together
5367 with main HOL; the theory loader path already includes this directory
5368 by default; the following existing theories have been moved here:
5369 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5370 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5372 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5373 modelling and verification task performed in Isabelle/HOL +
5374 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5376 * HOL/Algebra: special summation operator SUM no longer exists, it has
5377 been replaced by setsum; infix 'assoc' now has priority 50 (like
5378 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5379 'domain', this makes the theory consistent with mathematical
5382 * HOL basics: added overloaded operations "inverse" and "divide"
5383 (infix "/"), syntax for generic "abs" operation, generic summation
5386 * HOL/typedef: simplified package, provide more useful rules (see also
5389 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5390 now expressed as a proper nested rule (old-style tactic scripts may
5391 require atomize_strip_tac to cope with non-atomic premises);
5393 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5394 to "split_conv" (old name still available for compatibility);
5396 * HOL: improved concrete syntax for strings (e.g. allows translation
5397 rules with string literals);
5399 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5400 and Fleuriot's mechanization of analysis, including the transcendental
5401 functions for the reals;
5403 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5408 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5409 "lam" is displayed as TWO lambda-symbols
5411 * CTT: theory Main now available, containing everything (that is, Bool
5417 * Pure: the Simplifier has been implemented properly as a derived rule
5418 outside of the actual kernel (at last!); the overall performance
5419 penalty in practical applications is about 50%, while reliability of
5420 the Isabelle inference kernel has been greatly improved;
5422 * print modes "brackets" and "no_brackets" control output of nested =>
5423 (types) and ==> (props); the default behaviour is "brackets";
5425 * Provers: fast_tac (and friends) now handle actual object-logic rules
5426 as assumptions as well;
5428 * system: support Poly/ML 4.0;
5430 * system: isatool install handles KDE version 1 or 2;
5434 New in Isabelle99-1 (October 2000)
5435 ----------------------------------
5437 *** Overview of INCOMPATIBILITIES ***
5439 * HOL: simplification of natural numbers is much changed; to partly
5440 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5441 issue the following ML commands:
5443 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5444 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5446 * HOL: simplification no longer dives into case-expressions; this is
5447 controlled by "t.weak_case_cong" for each datatype t;
5449 * HOL: nat_less_induct renamed to less_induct;
5451 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5452 fixsome to patch .thy and .ML sources automatically;
5454 select_equality -> some_equality
5455 select_eq_Ex -> some_eq_ex
5456 selectI2EX -> someI2_ex
5459 select1_equality -> some1_equality
5460 Eps_sym_eq -> some_sym_eq_trivial
5461 Eps_eq -> some_eq_trivial
5463 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5465 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5468 * HOL: the recursion equations generated by 'recdef' are now called
5469 f.simps instead of f.rules;
5471 * HOL: qed_spec_mp now also handles bounded ALL as well;
5473 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5474 sometimes be needed;
5476 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5478 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5480 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5481 product is now "<*>" instead of "Times"; the lexicographic product is
5482 now "<*lex*>" instead of "**";
5484 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5485 of main HOL, but was unused); better use HOL's datatype package;
5487 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5488 the old syntax may be recovered as follows:
5491 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5492 (infixl "\\<oplus>" 100)
5494 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5496 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5497 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5500 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5501 changed from A/r to A//r;
5503 * ZF: new treatment of arithmetic (nat & int) may break some old
5506 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5507 rulify -> rule_format, elimify -> elim_format, ...);
5509 * Isar/Provers: intro/elim/dest attributes changed; renamed
5510 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5511 should have to change intro!! to intro? only); replaced "delrule" by
5514 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5516 * Provers: strengthened force_tac by using new first_best_tac;
5518 * LaTeX document preparation: several changes of isabelle.sty (see
5522 *** Document preparation ***
5524 * formal comments (text blocks etc.) in new-style theories may now
5525 contain antiquotations of thm/prop/term/typ/text to be presented
5526 according to latex print mode; concrete syntax is like this:
5527 @{term[show_types] "f(x) = a + x"};
5529 * isatool mkdir provides easy setup of Isabelle session directories,
5530 including proper document sources;
5532 * generated LaTeX sources are now deleted after successful run
5533 (isatool document -c); may retain a copy somewhere else via -D option
5536 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5537 style files, achieving self-contained LaTeX sources and simplifying
5540 * old-style theories now produce (crude) LaTeX output as well;
5542 * browser info session directories are now self-contained (may be put
5543 on WWW server seperately); improved graphs of nested sessions; removed
5544 graph for 'all sessions';
5546 * several improvements in isabelle style files; \isabellestyle{it}
5547 produces fake math mode output; \isamarkupheader is now \section by
5548 default; see lib/texinputs/isabelle.sty etc.;
5553 * Isar/Pure: local results and corresponding term bindings are now
5554 subject to Hindley-Milner polymorphism (similar to ML); this
5555 accommodates incremental type-inference very nicely;
5557 * Isar/Pure: new derived language element 'obtain' supports
5558 generalized existence reasoning;
5560 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5561 support accumulation of results, without applying any rules yet;
5562 useful to collect intermediate results without explicit name
5563 references, and for use with transitivity rules with more than 2
5566 * Isar/Pure: scalable support for case-analysis type proofs: new
5567 'case' language element refers to local contexts symbolically, as
5568 produced by certain proof methods; internally, case names are attached
5569 to theorems as "tags";
5571 * Isar/Pure: theory command 'hide' removes declarations from
5572 class/type/const name spaces;
5574 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5575 indicate potential overloading;
5577 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5579 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5580 "{a,b,c}" instead of {a,b,c};
5582 * Isar/Pure now provides its own version of intro/elim/dest
5583 attributes; useful for building new logics, but beware of confusion
5584 with the version in Provers/classical;
5586 * Isar/Pure: the local context of (non-atomic) goals is provided via
5587 case name 'antecedent';
5589 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5590 to the current context is now done automatically);
5592 * Isar/Pure: theory command 'method_setup' provides a simple interface
5593 for definining proof methods in ML;
5595 * Isar/Provers: intro/elim/dest attributes changed; renamed
5596 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5597 most cases, one should have to change intro!! to intro? only);
5598 replaced "delrule" by "rule del";
5600 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5601 'symmetric' attribute (the latter supercedes [RS sym]);
5603 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5604 method modifier); 'simp' method: 'only:' modifier removes loopers as
5605 well (including splits);
5607 * Isar/Provers: Simplifier and Classical methods now support all kind
5608 of modifiers used in the past, including 'cong', 'iff', etc.
5610 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5611 of Simplifier and Classical reasoner);
5613 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5614 now support named cases; major packages (inductive, datatype, primrec,
5615 recdef) support case names and properly name parameters;
5617 * Isar/HOL: new transitivity rules for substitution in inequalities --
5618 monotonicity conditions are extracted to be proven at end of
5621 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5624 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5625 split_if split_if_asm; datatype package provides theorems foo.splits =
5626 foo.split foo.split_asm for each datatype;
5628 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5629 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5630 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5631 use "(cases (simplified))" method in proper proof texts);
5633 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5635 * Isar: names of theorems etc. may be natural numbers as well;
5637 * Isar: 'pr' command: optional arguments for goals_limit and
5638 ProofContext.prems_limit; no longer prints theory contexts, but only
5641 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5642 additional print modes to be specified; e.g. "pr(latex)" will print
5643 proof state according to the Isabelle LaTeX style;
5645 * Isar: improved support for emulating tactic scripts, including proof
5646 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5647 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5648 (for HOL datatypes);
5650 * Isar: simplified (more robust) goal selection of proof methods: 1st
5651 goal, all goals, or explicit goal specifier (tactic emulation); thus
5652 'proof method scripts' have to be in depth-first order;
5654 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5656 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5657 should instead use individual commands for printing items
5658 (print_commands, print_methods etc.);
5660 * Isar: added 'nothing' --- the empty list of theorems;
5665 * HOL/MicroJava: formalization of a fragment of Java, together with a
5666 corresponding virtual machine and a specification of its bytecode
5667 verifier and a lightweight bytecode verifier, including proofs of
5668 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5669 Cornelia Pusch (see also the homepage of project Bali at
5670 http://isabelle.in.tum.de/Bali/);
5672 * HOL/Algebra: new theory of rings and univariate polynomials, by
5675 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5676 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5679 * HOL/Lattice: fundamental concepts of lattice theory and order
5680 structures, including duals, properties of bounds versus algebraic
5681 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5682 Theorem for complete lattices etc.; may also serve as a demonstration
5683 for abstract algebraic reasoning using axiomatic type classes, and
5684 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5686 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5689 * HOL/IMPP: extension of IMP with local variables and mutually
5690 recursive procedures, by David von Oheimb;
5692 * HOL/Lambda: converted into new-style theory and document;
5694 * HOL/ex/Multiquote: example of multiple nested quotations and
5695 anti-quotations -- basically a generalized version of de-Bruijn
5696 representation; very useful in avoiding lifting of operations;
5698 * HOL/record: added general record equality rule to simpset; fixed
5699 select-update simplification procedure to handle extended records as
5700 well; admit "r" as field name;
5702 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5703 other numeric types and also as the identity of groups, rings, etc.;
5705 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5706 Types nat and int belong to this axclass;
5708 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5709 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5710 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5711 two terms #m*u and #n*u are replaced by #(m+n)*u
5712 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5713 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5714 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5716 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5717 powerful prover for predicate logic but knows nothing of clasets; see
5718 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5720 * HOL: new version of "case_tac" subsumes both boolean case split and
5721 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5722 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5724 * HOL: simplification no longer dives into case-expressions: only the
5725 selector expression is simplified, but not the remaining arms; to
5726 enable full simplification of case-expressions for datatype t, you may
5727 remove t.weak_case_cong from the simpset, either globally (Delcongs
5728 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5730 * HOL/recdef: the recursion equations generated by 'recdef' for
5731 function 'f' are now called f.simps instead of f.rules; if all
5732 termination conditions are proved automatically, these simplification
5733 rules are added to the simpset, as in primrec; rules may be named
5734 individually as well, resulting in a separate list of theorems for
5737 * HOL/While is a new theory that provides a while-combinator. It
5738 permits the definition of tail-recursive functions without the
5739 provision of a termination measure. The latter is necessary once the
5740 invariant proof rule for while is applied.
5742 * HOL: new (overloaded) notation for the set of elements below/above
5743 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5745 * HOL: theorems impI, allI, ballI bound as "strip";
5747 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5748 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5749 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5751 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5753 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5754 main HOL, but was unused);
5756 * HOL: fewer consts declared as global (e.g. have to refer to
5757 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5759 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5760 in case of overlap with user translations (e.g. judgements over
5761 tuples); (note that the underlying logical represenation is still
5767 * ZF: simplification automatically cancels common terms in arithmetic
5768 expressions over nat and int;
5770 * ZF: new treatment of nat to minimize type-checking: all operators
5771 coerce their operands to a natural number using the function natify,
5772 making the algebraic laws unconditional;
5774 * ZF: as above, for int: operators coerce their operands to an integer
5775 using the function intify;
5777 * ZF: the integer library now contains many of the usual laws for the
5778 orderings, including $<=, and monotonicity laws for $+ and $*;
5780 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5783 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5784 to the simplifier and classical reasoner simultaneously;
5789 * Provers: blast_tac now handles actual object-logic rules as
5790 assumptions; note that auto_tac uses blast_tac internally as well;
5792 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5793 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5795 * Provers: delrules now handles destruct rules as well (no longer need
5796 explicit make_elim);
5798 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5799 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5800 use instead the strong form,
5801 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5802 in HOL, FOL and ZF the function cla_make_elim will create such rules
5803 from destruct-rules;
5805 * Provers: Simplifier.easy_setup provides a fast path to basic
5806 Simplifier setup for new object-logics;
5808 * Pure: AST translation rules no longer require constant head on LHS;
5810 * Pure: improved name spaces: ambiguous output is qualified; support
5811 for hiding of names;
5813 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5814 XSYMBOL_HOME; no longer need to do manual configuration in most
5817 * system: compression of ML heaps images may now be controlled via -c
5818 option of isabelle and isatool usedir (currently only observed by
5821 * system: isatool installfonts may handle X-Symbol fonts as well (very
5822 useful for remote X11);
5824 * system: provide TAGS file for Isabelle sources;
5826 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5829 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5830 timing flag supersedes proof_timing and Toplevel.trace;
5832 * ML: new combinators |>> and |>>> for incremental transformations
5833 with secondary results (e.g. certain theory extensions):
5835 * ML: PureThy.add_defs gets additional argument to indicate potential
5836 overloading (usually false);
5838 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5843 New in Isabelle99 (October 1999)
5844 --------------------------------
5846 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5848 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5849 are no longer simplified. (This allows the simplifier to unfold recursive
5850 functional programs.) To restore the old behaviour, declare
5852 Delcongs [if_weak_cong];
5854 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5857 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5859 * HOL/datatype: mutual_induct_tac no longer exists --
5860 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5862 * HOL/typedef: fixed type inference for representing set; type
5863 arguments now have to occur explicitly on the rhs as type constraints;
5865 * ZF: The con_defs part of an inductive definition may no longer refer
5866 to constants declared in the same theory;
5868 * HOL, ZF: the function mk_cases, generated by the inductive
5869 definition package, has lost an argument. To simplify its result, it
5870 uses the default simpset instead of a supplied list of theorems.
5872 * HOL/List: the constructors of type list are now Nil and Cons;
5874 * Simplifier: the type of the infix ML functions
5875 setSSolver addSSolver setSolver addSolver
5876 is now simpset * solver -> simpset where `solver' is a new abstract type
5877 for packaging solvers. A solver is created via
5878 mk_solver: string -> (thm list -> int -> tactic) -> solver
5879 where the string argument is only a comment.
5884 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5885 decision procedure for linear arithmetic. Currently it is used for
5886 types `nat', `int', and `real' in HOL (see below); it can, should and
5887 will be instantiated for other types and logics as well.
5889 * The simplifier now accepts rewrite rules with flexible heads, eg
5890 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5891 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5897 * New Isabelle/Isar subsystem provides an alternative to traditional
5898 tactical theorem proving; together with the ProofGeneral/isar user
5899 interface it offers an interactive environment for developing human
5900 readable proof documents (Isar == Intelligible semi-automated
5901 reasoning); for further information see isatool doc isar-ref,
5902 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5904 * improved and simplified presentation of theories: better HTML markup
5905 (including colors), graph views in several sizes; isatool usedir now
5906 provides a proper interface for user theories (via -P option); actual
5907 document preparation based on (PDF)LaTeX is available as well (for
5908 new-style theories only); see isatool doc system for more information;
5910 * native support for Proof General, both for classic Isabelle and
5913 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5914 using the graph browser tool;
5916 * Isabelle manuals now also available as PDF;
5918 * theory loader rewritten from scratch (may not be fully
5919 bug-compatible); old loadpath variable has been replaced by show_path,
5920 add_path, del_path, reset_path functions; new operations such as
5921 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5924 * improved isatool install: option -k creates KDE application icon,
5925 option -p DIR installs standalone binaries;
5927 * added ML_PLATFORM setting (useful for cross-platform installations);
5928 more robust handling of platform specific ML images for SML/NJ;
5930 * the settings environment is now statically scoped, i.e. it is never
5931 created again in sub-processes invoked from isabelle, isatool, or
5934 * path element specification '~~' refers to '$ISABELLE_HOME';
5936 * in locales, the "assumes" and "defines" parts may be omitted if
5939 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5942 * new print_mode "HTML";
5944 * new flag show_tags controls display of tags of theorems (which are
5945 basically just comments that may be attached by some tools);
5947 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5948 mode and goal output format:
5950 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5952 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5954 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5955 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5957 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5959 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5961 * function bind_thms stores lists of theorems (cf. bind_thm);
5963 * new shorthand tactics ftac, eatac, datac, fatac;
5965 * qed (and friends) now accept "" as result name; in that case the
5966 theorem is not stored, but proper checks and presentation of the
5969 * theorem database now also indexes constants "Trueprop", "all",
5970 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5975 ** HOL arithmetic **
5977 * There are now decision procedures for linear arithmetic over nat and
5980 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5981 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5982 are treated as atomic; subformulae not involving type `nat' or `int'
5983 are ignored; quantified subformulae are ignored unless they are
5984 positive universal or negative existential. The tactic has to be
5985 invoked by hand and can be a little bit slow. In particular, the
5986 running time is exponential in the number of occurrences of `min' and
5987 `max', and `-' on `nat'.
5989 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5990 (negated) (in)equalities among the premises and the conclusion into
5991 account (i.e. no compound formulae) and does not know about `min' and
5992 `max', and `-' on `nat'. It is fast and is used automatically by the
5995 NB: At the moment, these decision procedures do not cope with mixed
5996 nat/int formulae where the two parts interact, such as `m < n ==>
5999 * HOL/Numeral provides a generic theory of numerals (encoded
6000 efficiently as bit strings); setup for types nat/int/real is in place;
6001 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6002 int, existing theories and proof scripts may require a few additional
6005 * integer division and remainder can now be performed on constant
6008 * many properties of integer multiplication, division and remainder
6011 * An interface to the Stanford Validity Checker (SVC) is available through the
6012 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6013 are proved automatically. SVC must be installed separately, and its results
6014 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6015 invocation of the underlying oracle). For SVC see
6016 http://verify.stanford.edu/SVC
6018 * IsaMakefile: the HOL-Real target now builds an actual image;
6023 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6024 (in Isabelle/Isar) -- by Gertrud Bauer;
6026 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6027 analysis for assembly languages with subtypes;
6029 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6030 -- avoids syntactic ambiguities and treats state, transition, and
6031 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6032 changed syntax and (many) tactics;
6034 * HOL/inductive: Now also handles more general introduction rules such
6035 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6036 theorems are now maintained within the theory (maintained via the
6039 * HOL/datatype: Now also handles arbitrarily branching datatypes
6040 (using function types) such as
6042 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6044 * HOL/record: record_simproc (part of the default simpset) takes care
6045 of selectors applied to updated records; record_split_tac is no longer
6046 part of the default claset; update_defs may now be removed from the
6047 simpset in many cases; COMPATIBILITY: old behavior achieved by
6049 claset_ref () := claset() addSWrapper record_split_wrapper;
6050 Delsimprocs [record_simproc]
6052 * HOL/typedef: fixed type inference for representing set; type
6053 arguments now have to occur explicitly on the rhs as type constraints;
6055 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6056 names rather than an ML expression;
6058 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6059 supplied later. Program schemes can be defined, such as
6060 "While B C s = (if B s then While B C (C s) else s)"
6061 where the well-founded relation can be chosen after B and C have been given.
6063 * HOL/List: the constructors of type list are now Nil and Cons;
6064 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6065 course, ML tools referring to List.list.op # etc. have to be adapted;
6067 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6068 disabled by default; run isabelle with option -m HOL to get back to
6069 the original Gordon/HOL-style output;
6071 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6072 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6074 * HOL basic syntax simplified (more orthogonal): all variants of
6075 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6076 Eps operator is provided as well: "SOME x. P[x]";
6078 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6080 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6081 thus available for user theories;
6083 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6084 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6087 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6088 several times and then mp;
6093 * the notation <<...>> is now available as a notation for sequences of
6096 * the simplifier is now installed
6098 * the axiom system has been generalized (thanks to Soren Heilmann)
6100 * the classical reasoner now has a default rule database
6105 * new primrec section allows primitive recursive functions to be given
6106 directly (as in HOL) over datatypes and the natural numbers;
6108 * new tactics induct_tac and exhaust_tac for induction (or case
6109 analysis) over datatypes and the natural numbers;
6111 * the datatype declaration of type T now defines the recursor T_rec;
6113 * simplification automatically does freeness reasoning for datatype
6116 * automatic type-inference, with AddTCs command to insert new
6117 type-checking rules;
6119 * datatype introduction rules are now added as Safe Introduction rules
6122 * the syntax "if P then x else y" is now available in addition to
6126 *** Internal programming interfaces ***
6128 * tuned simplifier trace output; new flag debug_simp;
6130 * structures Vartab / Termtab (instances of TableFun) offer efficient
6131 tables indexed by indexname_ord / term_ord (compatible with aconv);
6133 * AxClass.axclass_tac lost the theory argument;
6135 * tuned current_goals_markers semantics: begin / end goal avoids
6136 printing empty lines;
6138 * removed prs and prs_fn hook, which was broken because it did not
6139 include \n in its semantics, forcing writeln to add one
6140 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6141 string -> unit if you really want to output text without newline;
6143 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6144 plain output, interface builders may have to enable 'isabelle_font'
6145 mode to get Isabelle font glyphs as before;
6147 * refined token_translation interface; INCOMPATIBILITY: output length
6148 now of type real instead of int;
6150 * theory loader actions may be traced via new ThyInfo.add_hook
6151 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6152 your own database of information attached to *whole* theories -- as
6153 opposed to intra-theory data slots offered via TheoryDataFun;
6155 * proper handling of dangling sort hypotheses (at last!);
6156 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6157 extra sort hypotheses that can be witnessed from the type signature;
6158 the force_strip_shyps flag is gone, any remaining shyps are simply
6159 left in the theorem (with a warning issued by strip_shyps_warning);
6163 New in Isabelle98-1 (October 1998)
6164 ----------------------------------
6166 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6168 * several changes of automated proof tools;
6170 * HOL: major changes to the inductive and datatype packages, including
6171 some minor incompatibilities of theory syntax;
6173 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6176 * HOL: removed duplicate thms in Arith:
6177 less_imp_add_less should be replaced by trans_less_add1
6178 le_imp_add_le should be replaced by trans_le_add1
6180 * HOL: unary minus is now overloaded (new type constraints may be
6183 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6184 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6185 now taken as an integer constant.
6187 * Pure: ML function 'theory_of' renamed to 'theory';
6193 1. Asm_full_simp_tac is now more aggressive.
6194 1. It will sometimes reorient premises if that increases their power to
6196 2. It does no longer proceed strictly from left to right but may also
6197 rotate premises to achieve further simplification.
6198 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6199 old Asm_full_simp_tac in that it does not rotate premises.
6200 2. The simplifier now knows a little bit about nat-arithmetic.
6202 * Classical reasoner: wrapper mechanism for the classical reasoner now
6203 allows for selected deletion of wrappers, by introduction of names for
6204 wrapper functionals. This implies that addbefore, addSbefore,
6205 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6206 and that adding two tactics with the same name overwrites the first
6207 one (emitting a warning).
6208 type wrapper = (int -> tactic) -> (int -> tactic)
6209 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6210 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6211 delWrapper, delSWrapper: claset * string -> claset
6212 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6214 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6215 semantics; addbefore now affects only the unsafe part of step_tac
6216 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6217 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6220 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6221 compWrapper; added safe wrapper (and access functions for it);
6223 * HOL/split_all_tac is now much faster and fails if there is nothing
6224 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6225 and the names of the automatically generated variables have changed.
6226 split_all_tac has moved within claset() from unsafe wrappers to safe
6227 wrappers, which means that !!-bound variables are split much more
6228 aggressively, and safe_tac and clarify_tac now split such variables.
6229 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6230 Note: the same holds for record_split_tac, which does the job of
6231 split_all_tac for record fields.
6233 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6234 permanently to the default simpset using Addsplits just like
6235 Addsimps. They can be removed via Delsplits just like
6236 Delsimps. Lower-case versions are also available.
6238 * HOL/Simplifier: The rule split_if is now part of the default
6239 simpset. This means that the simplifier will eliminate all occurrences
6240 of if-then-else in the conclusion of a goal. To prevent this, you can
6241 either remove split_if completely from the default simpset by
6242 `Delsplits [split_if]' or remove it in a specific call of the
6243 simplifier using `... delsplits [split_if]'. You can also add/delete
6244 other case splitting rules to/from the default simpset: every datatype
6245 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6246 t is the name of the datatype).
6248 * Classical reasoner / Simplifier combination: new force_tac (and
6249 derivatives Force_tac, force) combines rewriting and classical
6250 reasoning (and whatever other tools) similarly to auto_tac, but is
6251 aimed to solve the given subgoal completely.
6256 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6257 and `goalw': the theory is no longer needed as an explicit argument -
6258 the current theory context is used; assumptions are no longer returned
6259 at the ML-level unless one of them starts with ==> or !!; it is
6260 recommended to convert to these new commands using isatool fixgoal
6261 (backup your sources first!);
6263 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6264 the current theory context, and 'theory' to lookup stored theories;
6266 * new theory section 'locale' for declaring constants, assumptions and
6267 definitions that have local scope;
6269 * new theory section 'nonterminals' for purely syntactic types;
6271 * new theory section 'setup' for generic ML setup functions
6272 (e.g. package initialization);
6274 * the distribution now includes Isabelle icons: see
6275 lib/logo/isabelle-{small,tiny}.xpm;
6277 * isatool install - install binaries with absolute references to
6280 * isatool logo -- create instances of the Isabelle logo (as EPS);
6282 * print mode 'emacs' reserved for Isamode;
6284 * support multiple print (ast) translations per constant name;
6286 * theorems involving oracles are now printed with a suffixed [!];
6291 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6293 * HOL/inductive package reorganized and improved: now supports mutual
6299 oddI "n : EVEN ==> Suc n : ODD"
6300 evenI "n : ODD ==> Suc n : EVEN"
6302 new theorem list "elims" contains an elimination rule for each of the
6303 recursive sets; inductive definitions now handle disjunctive premises
6304 correctly (also ZF);
6306 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6307 "mutual_induct" no longer exists - the induction rule is always
6308 contained in "induct";
6311 * HOL/datatype package re-implemented and greatly improved: now
6312 supports mutually recursive datatypes such as
6315 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6316 | SUM ('a aexp) ('a aexp)
6317 | DIFF ('a aexp) ('a aexp)
6320 'a bexp = LESS ('a aexp) ('a aexp)
6321 | AND ('a bexp) ('a bexp)
6322 | OR ('a bexp) ('a bexp)
6324 as well as indirectly recursive datatypes such as
6327 ('a, 'b) term = Var 'a
6328 | App 'b ((('a, 'b) term) list)
6330 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6331 induction on mutually / indirectly recursive datatypes.
6333 Primrec equations are now stored in theory and can be accessed via
6334 <function_name>.simps.
6338 - Theories using datatypes must now have theory Datatype as an
6340 - The specific <typename>.induct_tac no longer exists - use the
6341 generic induct_tac instead.
6342 - natE has been renamed to nat.exhaust - use exhaust_tac
6343 instead of res_inst_tac ... natE. Note that the variable
6344 names in nat.exhaust differ from the names in natE, this
6345 may cause some "fragile" proofs to fail.
6346 - The theorems split_<typename>_case and split_<typename>_case_asm
6347 have been renamed to <typename>.split and <typename>.split_asm.
6348 - Since default sorts of type variables are now handled correctly,
6349 some datatype definitions may have to be annotated with explicit
6351 - Primrec definitions no longer require function name and type
6352 of recursive argument.
6354 Consider using isatool fixdatatype to adapt your theories and proof
6355 scripts to the new package (backup your sources first!).
6358 * HOL/record package: considerably improved implementation; now
6359 includes concrete syntax for record types, terms, updates; theorems
6360 for surjective pairing and splitting !!-bound record variables; proof
6361 support is as follows:
6363 1) standard conversions (selectors or updates applied to record
6364 constructor terms) are part of the standard simpset;
6366 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6367 made part of standard simpset and claset via addIffs;
6369 3) a tactic for record field splitting (record_split_tac) is part of
6370 the standard claset (addSWrapper);
6372 To get a better idea about these rules you may retrieve them via
6373 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6374 the name of your record type.
6376 The split tactic 3) conceptually simplifies by the following rule:
6378 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6380 Thus any record variable that is bound by meta-all will automatically
6381 blow up into some record constructor term, consequently the
6382 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6383 solve record problems automatically.
6386 * reorganized the main HOL image: HOL/Integ and String loaded by
6387 default; theory Main includes everything;
6389 * automatic simplification of integer sums and comparisons, using cancellation;
6391 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6393 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6395 * many new identities for unions, intersections, set difference, etc.;
6397 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6398 called split_if, split_split, split_sum_case and split_nat_case (to go
6399 with add/delsplits);
6401 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6402 (?x::unit) = (); this is made part of the default simpset, which COULD
6403 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6404 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6405 unit_abs_eta_conv is added in order to counter the effect of
6406 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6409 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6412 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6413 It and 'sym RS equals0D' are now in the default claset, giving automatic
6414 disjointness reasoning but breaking a few old proofs.
6416 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6417 to 'converse' from 'inverse' (for compatibility with ZF and some
6420 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6421 the well-founded relation;
6423 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6424 Compl A. The "Compl" syntax remains available as input syntax for this
6427 * HOL/Update: new theory of function updates:
6428 f(a:=b) == %x. if x=a then b else f x
6429 may also be iterated as in f(a:=b,c:=d,...);
6431 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6434 - new function list_update written xs[i:=v] that updates the i-th
6435 list position. May also be iterated as in xs[i:=a,j:=b,...].
6436 - new function `upt' written [i..j(] which generates the list
6437 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6438 bound write [i..j], which is a shorthand for [i..j+1(].
6439 - new lexicographic orderings and corresponding wellfoundedness theorems.
6442 - removed 'pred' (predecessor) function;
6443 - generalized some theorems about n-1;
6444 - many new laws about "div" and "mod";
6445 - new laws about greatest common divisors (see theory ex/Primes);
6447 * HOL/Relation: renamed the relational operator r^-1 "converse"
6448 instead of "inverse";
6450 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6451 of the multiset ordering;
6453 * directory HOL/Real: a construction of the reals using Dedekind cuts
6454 (not included by default);
6456 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6458 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6459 programs, i.e. different program variables may have different types.
6461 * calling (stac rew i) now fails if "rew" has no effect on the goal
6462 [previously, this check worked only if the rewrite rule was unconditional]
6463 Now rew can involve either definitions or equalities (either == or =).
6468 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6469 only the theorems proved on ZF.ML;
6471 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6472 It and 'sym RS equals0D' are now in the default claset, giving automatic
6473 disjointness reasoning but breaking a few old proofs.
6475 * ZF/Update: new theory of function updates
6476 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6477 may also be iterated as in f(a:=b,c:=d,...);
6479 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6481 * calling (stac rew i) now fails if "rew" has no effect on the goal
6482 [previously, this check worked only if the rewrite rule was unconditional]
6483 Now rew can involve either definitions or equalities (either == or =).
6485 * case_tac provided for compatibility with HOL
6486 (like the old excluded_middle_tac, but with subgoals swapped)
6489 *** Internal programming interfaces ***
6491 * Pure: several new basic modules made available for general use, see
6492 also src/Pure/README;
6494 * improved the theory data mechanism to support encapsulation (data
6495 kind name replaced by private Object.kind, acting as authorization
6496 key); new type-safe user interface via functor TheoryDataFun; generic
6497 print_data function becomes basically useless;
6499 * removed global_names compatibility flag -- all theory declarations
6500 are qualified by default;
6502 * module Pure/Syntax now offers quote / antiquote translation
6503 functions (useful for Hoare logic etc. with implicit dependencies);
6504 see HOL/ex/Antiquote for an example use;
6506 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6509 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6512 * Display.print_goals function moved to Locale.print_goals;
6514 * standard print function for goals supports current_goals_markers
6515 variable for marking begin of proof, end of proof, start of goal; the
6516 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6517 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6522 New in Isabelle98 (January 1998)
6523 --------------------------------
6525 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6527 * changed lexical syntax of terms / types: dots made part of long
6528 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6530 * simpset (and claset) reference variable replaced by functions
6531 simpset / simpset_ref;
6533 * no longer supports theory aliases (via merge) and non-trivial
6534 implicit merge of thms' signatures;
6536 * most internal names of constants changed due to qualified names;
6538 * changed Pure/Sequence interface (see Pure/seq.ML);
6541 *** General Changes ***
6543 * hierachically structured name spaces (for consts, types, axms, thms
6544 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6545 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6546 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6547 long_names for fully qualified output names; NOTE: ML programs
6548 (special tactics, packages etc.) referring to internal names may have
6549 to be adapted to cope with fully qualified names; in case of severe
6550 backward campatibility problems try setting 'global_names' at compile
6551 time to have enrything declared within a flat name space; one may also
6552 fine tune name declarations in theories via the 'global' and 'local'
6555 * reimplemented the implicit simpset and claset using the new anytype
6556 data filed in signatures; references simpset:simpset ref etc. are
6557 replaced by functions simpset:unit->simpset and
6558 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6559 to patch your ML files accordingly;
6561 * HTML output now includes theory graph data for display with Java
6562 applet or isatool browser; data generated automatically via isatool
6563 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6565 * defs may now be conditional; improved rewrite_goals_tac to handle
6566 conditional equations;
6568 * defs now admits additional type arguments, using TYPE('a) syntax;
6570 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6571 creates a new theory node; implicit merge of thms' signatures is
6572 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6573 transfer:theory->thm->thm in (rare) cases;
6575 * improved handling of draft signatures / theories; draft thms (and
6576 ctyps, cterms) are automatically promoted to real ones;
6578 * slightly changed interfaces for oracles: admit many per theory, named
6579 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6581 * print_goals: optional output of const types (set show_consts and
6584 * improved output of warnings (###) and errors (***);
6586 * subgoal_tac displays a warning if the new subgoal has type variables;
6588 * removed old README and Makefiles;
6590 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6592 * removed obsolete init_pps and init_database;
6594 * deleted the obsolete tactical STATE, which was declared by
6595 fun STATE tacfun st = tacfun st st;
6597 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6598 (which abbreviates $HOME);
6600 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6601 use isatool fixseq to adapt your ML programs (this works for fully
6602 qualified references to the Sequence structure only!);
6604 * use_thy no longer requires writable current directory; it always
6605 reloads .ML *and* .thy file, if either one is out of date;
6608 *** Classical Reasoner ***
6610 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6611 tactics that use classical reasoning to simplify a subgoal without
6612 splitting it into several subgoals;
6614 * Safe_tac: like safe_tac but uses the default claset;
6619 * added simplification meta rules:
6620 (asm_)(full_)simplify: simpset -> thm -> thm;
6622 * simplifier.ML no longer part of Pure -- has to be loaded by object
6625 * added prems argument to simplification procedures;
6627 * HOL, FOL, ZF: added infix function `addsplits':
6628 instead of `<simpset> setloop (split_tac <thms>)'
6629 you can simply write `<simpset> addsplits <thms>'
6634 * TYPE('a) syntax for type reflection terms;
6636 * no longer handles consts with name "" -- declare as 'syntax' instead;
6638 * pretty printer: changed order of mixfix annotation preference (again!);
6640 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6645 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6646 with `addloop' of the simplifier to faciliate case splitting in premises.
6648 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6650 * HOL/Auth: new protocol proofs including some for the Internet
6653 * HOL/Map: new theory of `maps' a la VDM;
6655 * HOL/simplifier: simplification procedures nat_cancel_sums for
6656 cancelling out common nat summands from =, <, <= (in)equalities, or
6657 differences; simplification procedures nat_cancel_factor for
6658 cancelling common factor from =, <, <= (in)equalities over natural
6659 sums; nat_cancel contains both kinds of procedures, it is installed by
6660 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6662 * HOL/simplifier: terms of the form
6663 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6665 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6666 and those of the form
6667 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6669 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6672 Each datatype `t' now comes with a theorem `split_t_case' of the form
6674 P(t_case f1 ... fn x) =
6675 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6677 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6680 and a theorem `split_t_case_asm' of the form
6682 P(t_case f1 ... fn x) =
6683 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6685 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6687 which can be added to a simpset via `addsplits'. The existing theorems
6688 expand_list_case and expand_option_case have been renamed to
6689 split_list_case and split_option_case.
6692 - `pred n' is automatically converted to `n-1'.
6693 Users are strongly encouraged not to use `pred' any longer,
6694 because it will disappear altogether at some point.
6695 - Users are strongly encouraged to write "0 < n" rather than
6696 "n ~= 0". Theorems and proof tools have been modified towards this
6700 the function "set_of_list" has been renamed "set" (and its theorems too);
6701 the function "nth" now takes its arguments in the reverse order and
6702 has acquired the infix notation "!" as in "xs!n".
6704 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6706 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6707 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6709 * HOL/record: extensible records with schematic structural subtyping
6710 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6711 still lacks various theorems and concrete record syntax;
6716 * removed "axioms" and "generated by" sections;
6718 * replaced "ops" section by extended "consts" section, which is capable of
6719 handling the continuous function space "->" directly;
6722 . proves theorems immediately and stores them in the theory,
6723 . creates hierachical name space,
6724 . now uses normal mixfix annotations (instead of cinfix...),
6725 . minor changes to some names and values (for consistency),
6726 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6727 . separator between mutual domain defs: changed "," to "and",
6728 . improved handling of sort constraints; now they have to
6729 appear on the left-hand side of the equations only;
6731 * fixed LAM <x,y,zs>.b syntax;
6733 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6734 adm (%x. P (t x)), where P is chainfinite and t continuous;
6739 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6740 with `addloop' of the simplifier to faciliate case splitting in premises.
6742 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6743 in HOL, they strip ALL and --> from proved theorems;
6747 New in Isabelle94-8 (May 1997)
6748 ------------------------------
6750 *** General Changes ***
6752 * new utilities to build / run / maintain Isabelle etc. (in parts
6753 still somewhat experimental); old Makefiles etc. still functional;
6755 * new 'Isabelle System Manual';
6757 * INSTALL text, together with ./configure and ./build scripts;
6759 * reimplemented type inference for greater efficiency, better error
6760 messages and clean internal interface;
6762 * prlim command for dealing with lots of subgoals (an easier way of
6763 setting goals_limit);
6768 * supports alternative (named) syntax tables (parser and pretty
6769 printer); internal interface is provided by add_modesyntax(_i);
6771 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6772 be used in conjunction with the Isabelle symbol font; uses the
6773 "symbols" syntax table;
6775 * added token_translation interface (may translate name tokens in
6776 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6777 the current print_mode); IMPORTANT: user print translation functions
6778 are responsible for marking newly introduced bounds
6779 (Syntax.mark_boundT);
6781 * token translations for modes "xterm" and "xterm_color" that display
6782 names in bold, underline etc. or colors (which requires a color
6785 * infixes may now be declared with names independent of their syntax;
6787 * added typed_print_translation (like print_translation, but may
6788 access type of constant);
6791 *** Classical Reasoner ***
6793 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6794 some limitations. Blast_tac...
6795 + ignores addss, addbefore, addafter; this restriction is intrinsic
6796 + ignores elimination rules that don't have the correct format
6797 (the conclusion MUST be a formula variable)
6798 + ignores types, which can make HOL proofs fail
6799 + rules must not require higher-order unification, e.g. apply_type in ZF
6800 [message "Function Var's argument not a bound variable" relates to this]
6801 + its proof strategy is more general but can actually be slower
6803 * substitution with equality assumptions no longer permutes other
6806 * minor changes in semantics of addafter (now called addaltern); renamed
6807 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6808 (and access functions for it);
6810 * improved combination of classical reasoner and simplifier:
6811 + functions for handling clasimpsets
6812 + improvement of addss: now the simplifier is called _after_ the
6814 + safe variant of addss called addSss: uses safe simplifications
6815 _during_ the safe steps. It is more complete as it allows multiple
6816 instantiations of unknowns (e.g. with slow_tac).
6820 * added interface for simplification procedures (functions that
6821 produce *proven* rewrite rules on the fly, depending on current
6824 * ordering on terms as parameter (used for ordered rewriting);
6826 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6828 * the solver is now split into a safe and an unsafe part.
6829 This should be invisible for the normal user, except that the
6830 functions setsolver and addsolver have been renamed to setSolver and
6831 addSolver; added safe_asm_full_simp_tac;
6836 * a generic induction tactic `induct_tac' which works for all datatypes and
6837 also for type `nat';
6839 * a generic case distinction tactic `exhaust_tac' which works for all
6840 datatypes and also for type `nat';
6842 * each datatype comes with a function `size';
6844 * patterns in case expressions allow tuple patterns as arguments to
6845 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6847 * primrec now also works with type nat;
6849 * recdef: a new declaration form, allows general recursive functions to be
6850 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6852 * the constant for negation has been renamed from "not" to "Not" to
6853 harmonize with FOL, ZF, LK, etc.;
6855 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6858 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6860 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6861 problems in commutative rings, using axiomatic type classes for + and *;
6863 * more examples in HOL/MiniML and HOL/Auth;
6865 * more default rewrite rules for quantifiers, union/intersection;
6867 * a new constant `arbitrary == @x.False';
6869 * HOLCF/IOA replaces old HOL/IOA;
6871 * HOLCF changes: derived all rules and arities
6872 + axiomatic type classes instead of classes
6873 + typedef instead of faking type definitions
6874 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6875 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6876 + eliminated the types void, one, tr
6877 + use unit lift and bool lift (with translations) instead of one and tr
6878 + eliminated blift from Lift3.thy (use Def instead of blift)
6879 all eliminated rules are derived as theorems --> no visible changes ;
6884 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6885 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6886 as ZF_cs addSIs [equalityI];
6890 New in Isabelle94-7 (November 96)
6891 ---------------------------------
6893 * allowing negative levels (as offsets) in prlev and choplev;
6895 * super-linear speedup for large simplifications;
6897 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6898 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6899 FAIL); can suppress it using the command Delsimps (ex_simps @
6900 all_simps); De Morgan laws are also now included, by default;
6902 * improved printing of ==> : ~:
6904 * new object-logic "Sequents" adds linear logic, while replacing LK
6905 and Modal (thanks to Sara Kalvala);
6907 * HOL/Auth: correctness proofs for authentication protocols;
6909 * HOL: new auto_tac combines rewriting and classical reasoning (many
6910 examples on HOL/Auth);
6912 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6913 the rewriter and classical reasoner simultaneously;
6915 * function uresult no longer returns theorems in "standard" format;
6916 regain previous version by: val uresult = standard o uresult;
6923 * oracles -- these establish an interface between Isabelle and trusted
6924 external reasoners, which may deliver results as theorems;
6926 * proof objects (in particular record all uses of oracles);
6928 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6930 * "constdefs" section in theory files;
6932 * "primrec" section (HOL) no longer requires names;
6934 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6941 * reduced space requirements;
6943 * automatic HTML generation from theories;
6945 * theory files no longer require "..." (quotes) around most types;
6947 * new examples, including two proofs of the Church-Rosser theorem;
6949 * non-curried (1994) version of HOL is no longer distributed;
6956 * greatly reduced space requirements;
6958 * theory files (.thy) no longer require \...\ escapes at line breaks;
6960 * searchable theorem database (see the section "Retrieving theorems" on
6961 page 8 of the Reference Manual);
6963 * new examples, including Grabczewski's monumental case study of the
6966 * The previous version of HOL renamed to Old_HOL;
6968 * The new version of HOL (previously called CHOL) uses a curried syntax
6969 for functions. Application looks like f a b instead of f(a,b);
6971 * Mutually recursive inductive definitions finally work in HOL;
6973 * In ZF, pattern-matching on tuples is now available in all abstractions and
6974 translates to the operator "split";
6981 * new infix operator, addss, allowing the classical reasoner to
6982 perform simplification at each step of its search. Example:
6983 fast_tac (cs addss ss)
6985 * a new logic, CHOL, the same as HOL, but with a curried syntax
6986 for functions. Application looks like f a b instead of f(a,b). Also pairs
6987 look like (a,b) instead of <a,b>;
6989 * PLEASE NOTE: CHOL will eventually replace HOL!
6991 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6992 It translates to the operator "split". A new theory of integers is available;
6994 * In ZF, integer numerals now denote two's-complement binary integers.
6995 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6997 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6998 of the Axiom of Choice;
7005 * Significantly faster resolution;
7007 * the different sections in a .thy file can now be mixed and repeated
7010 * Database of theorems for FOL, HOL and ZF. New
7011 commands including qed, qed_goal and bind_thm store theorems in the database.
7013 * Simple database queries: return a named theorem (get_thm) or all theorems of
7014 a given theory (thms_of), or find out what theory a theorem was proved in
7017 * Bugs fixed in the inductive definition and datatype packages;
7019 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7020 and HOL_dup_cs obsolete;
7022 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7025 * Simpler definition of function space in ZF;
7027 * new results about cardinal and ordinal arithmetic in ZF;
7029 * 'subtype' facility in HOL for introducing new types as subsets of existing
7032 :mode=text:wrap=hard:maxLineLen=72: