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 * Dropped theorem duplicate comp_arith; use semiring_norm instead. INCOMPATIBILITY.
145 * Theory 'Finite_Set': various folding_* locales facilitate the application
146 of the various fold combinators on finite sets.
148 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
149 provides abstract red-black tree type which is backed by RBT_Impl
150 as implementation. INCOMPATIBILTY.
152 * Command 'typedef' now works within a local theory context -- without
153 introducing dependencies on parameters or assumptions, which is not
154 possible in Isabelle/Pure/HOL. Note that the logical environment may
155 contain multiple interpretations of local typedefs (with different
156 non-emptiness proofs), even in a global theory context.
158 * Theory Library/Coinductive_List has been removed -- superceded by
159 AFP/thys/Coinductive.
161 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
162 Min, Max from theory Finite_Set. INCOMPATIBILITY.
164 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
167 * New set of rules "ac_simps" provides combined assoc / commute rewrites
168 for all interpretations of the appropriate generic locales.
170 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
171 into theories "Rings" and "Fields"; for more appropriate and more
172 consistent names suitable for name prefixes within the HOL theories.
175 * Some generic constants have been put to appropriate theories:
176 * less_eq, less: Orderings
177 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
178 * inverse, divide: Rings
181 * More consistent naming of type classes involving orderings (and lattices):
183 lower_semilattice ~> semilattice_inf
184 upper_semilattice ~> semilattice_sup
186 dense_linear_order ~> dense_linorder
188 pordered_ab_group_add ~> ordered_ab_group_add
189 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
190 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
191 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
192 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
193 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
194 pordered_cancel_semiring ~> ordered_cancel_semiring
195 pordered_comm_monoid_add ~> ordered_comm_monoid_add
196 pordered_comm_ring ~> ordered_comm_ring
197 pordered_comm_semiring ~> ordered_comm_semiring
198 pordered_ring ~> ordered_ring
199 pordered_ring_abs ~> ordered_ring_abs
200 pordered_semiring ~> ordered_semiring
202 ordered_ab_group_add ~> linordered_ab_group_add
203 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
204 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
205 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
206 ordered_field ~> linordered_field
207 ordered_field_no_lb ~> linordered_field_no_lb
208 ordered_field_no_ub ~> linordered_field_no_ub
209 ordered_field_dense_linear_order ~> dense_linordered_field
210 ordered_idom ~> linordered_idom
211 ordered_ring ~> linordered_ring
212 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
213 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
214 ordered_ring_strict ~> linordered_ring_strict
215 ordered_semidom ~> linordered_semidom
216 ordered_semiring ~> linordered_semiring
217 ordered_semiring_1 ~> linordered_semiring_1
218 ordered_semiring_1_strict ~> linordered_semiring_1_strict
219 ordered_semiring_strict ~> linordered_semiring_strict
221 The following slightly odd type classes have been moved to
222 a separate theory Library/Lattice_Algebras.thy:
224 lordered_ab_group_add ~> lattice_ab_group_add
225 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
226 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
227 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
228 lordered_ring ~> lattice_ring
232 * Refined field classes:
233 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
234 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
235 * numerous lemmas have been ported from field to division_ring;
238 * Refined algebra theorem collections:
239 * dropped theorem group group_simps, use algebra_simps instead;
240 * dropped theorem group ring_simps, use field_simps instead;
241 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
242 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
245 * Theory Finite_Set and List: some lemmas have been generalized from
248 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
249 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
250 inter_Inter_fold_inter ~> inf_Inf_fold_inf
251 union_Union_fold_union ~> sup_Sup_fold_sup
252 Inter_fold_inter ~> Inf_fold_inf
253 Union_fold_union ~> Sup_fold_sup
254 inter_INTER_fold_inter ~> inf_INFI_fold_inf
255 union_UNION_fold_union ~> sup_SUPR_fold_sup
256 INTER_fold_inter ~> INFI_fold_inf
257 UNION_fold_union ~> SUPR_fold_sup
259 * Theory Complete_Lattice: lemmas top_def and bot_def have been
260 replaced by the more convenient lemmas Inf_empty and Sup_empty.
261 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
262 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
263 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
264 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
266 * HOLogic.strip_psplit: types are returned in syntactic order, similar
267 to other strip and tuple operations. INCOMPATIBILITY.
269 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
270 * pointwise ordering is instance of class order with standard syntax <= and <;
271 * multiset ordering has syntax <=# and <#; partial order properties are provided
272 by means of interpretation with prefix multiset_order;
273 * less duplication, less historical organization of sections,
274 conversion from associations lists to multisets, rudimentary code generation;
275 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
278 * Code generation: ML and OCaml code is decorated with signatures.
280 * Theory List: added transpose.
282 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
283 clash with new theory Quotient in Main HOL.
285 * Library/Nat_Bijection.thy is a collection of bijective functions
286 between nat and other types, which supersedes the older libraries
287 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
290 Nat_Int_Bij.nat2_to_nat ~> prod_encode
291 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
292 Nat_Int_Bij.int_to_nat_bij ~> int_encode
293 Nat_Int_Bij.nat_to_int_bij ~> int_decode
294 Countable.pair_encode ~> prod_encode
295 NatIso.prod2nat ~> prod_encode
296 NatIso.nat2prod ~> prod_decode
297 NatIso.sum2nat ~> sum_encode
298 NatIso.nat2sum ~> sum_decode
299 NatIso.list2nat ~> list_encode
300 NatIso.nat2list ~> list_decode
301 NatIso.set2nat ~> set_encode
302 NatIso.nat2set ~> set_decode
305 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
306 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
307 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
308 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
309 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
310 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
311 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
312 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
313 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
314 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
315 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
316 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
317 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
322 * Sorts.certify_sort and derived "cert" operations for types and terms
323 no longer minimize sorts. Thus certification at the boundary of the
324 inference kernel becomes invariant under addition of class relations,
325 which is an important monotonicity principle. Sorts are now minimized
326 in the syntax layer only, at the boundary between the end-user and the
327 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
328 explicitly in rare situations.
330 * Antiquotations for basic formal entities:
332 @{class NAME} -- type class
333 @{class_syntax NAME} -- syntax representation of the above
335 @{type_name NAME} -- logical type
336 @{type_abbrev NAME} -- type abbreviation
337 @{nonterminal NAME} -- type of concrete syntactic category
338 @{type_syntax NAME} -- syntax representation of any of the above
340 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
341 @{const_abbrev NAME} -- abbreviated constant
342 @{const_syntax NAME} -- syntax representation of any of the above
344 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
345 syntax constant (cf. 'syntax' command).
347 * Antiquotation @{make_string} inlines a function to print arbitrary
348 values similar to the ML toplevel. The result is compiler dependent
349 and may fall back on "?" in certain situations.
351 * Renamed old-style Drule.standard to Drule.export_without_context, to
352 emphasize that this is in no way a standard operation.
355 * Curried take and drop in library.ML; negative length is interpreted
356 as infinity (as in chop). INCOMPATIBILITY.
358 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
359 usual for resolution. Rare INCOMPATIBILITY.
361 * Discontinued old TheoryDataFun with its copy/init operation -- data
362 needs to be pure. Functor Theory_Data_PP retains the traditional
363 Pretty.pp argument to merge, which is absent in the standard
366 * Renamed varify/unvarify operations to varify_global/unvarify_global
367 to emphasize that these only work in a global situation (which is
370 * Configuration options now admit dynamic default values, depending on
371 the context or even global references.
373 * Most operations that refer to a global context are named
374 accordingly, e.g. Simplifier.global_context or
375 ProofContext.init_global. There are some situations where a global
376 context actually works, but under normal circumstances one needs to
377 pass the proper local context through the code!
382 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
383 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
384 proof terms are enabled unconditionally in the new HOL-Proofs image.
386 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
387 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
390 * Old lib/scripts/polyml-platform is superseded by the
391 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
392 variant, even on a 64 bit machine. The following example setting
393 prefers 64 bit if available:
395 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
399 New in Isabelle2009-1 (December 2009)
400 -------------------------------------
404 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
405 one backslash should be used, even in ML sources.
410 * Locale interpretation propagates mixins along the locale hierarchy.
411 The currently only available mixins are the equations used to map
412 local definitions to terms of the target domain of an interpretation.
414 * Reactivated diagnostic command 'print_interps'. Use "print_interps
415 loc" to print all interpretations of locale "loc" in the theory.
416 Interpretations in proofs are not shown.
418 * Thoroughly revised locales tutorial. New section on conditional
421 * On instantiation of classes, remaining undefined class parameters
422 are formally declared. INCOMPATIBILITY.
425 *** Document preparation ***
427 * New generalized style concept for printing terms: @{foo (style) ...}
428 instead of @{foo_style style ...} (old form is still retained for
429 backward compatibility). Styles can be also applied for
430 antiquotations prop, term_type and typeof.
435 * New proof method "smt" for a combination of first-order logic with
436 equality, linear and nonlinear (natural/integer/real) arithmetic, and
437 fixed-size bitvectors; there is also basic support for higher-order
438 features (esp. lambda abstractions). It is an incomplete decision
439 procedure based on external SMT solvers using the oracle mechanism;
440 for the SMT solver Z3, this method is proof-producing. Certificates
441 are provided to avoid calling the external solvers solely for
442 re-checking proofs. Due to a remote SMT service there is no need for
443 installing SMT solvers locally. See src/HOL/SMT.
445 * New commands to load and prove verification conditions generated by
446 the Boogie program verifier or derived systems (e.g. the Verifying C
447 Compiler (VCC) or Spec#). See src/HOL/Boogie.
449 * New counterexample generator tool 'nitpick' based on the Kodkod
450 relational model finder. See src/HOL/Tools/Nitpick and
451 src/HOL/Nitpick_Examples.
453 * New commands 'code_pred' and 'values' to invoke the predicate
454 compiler and to enumerate values of inductive predicates.
456 * A tabled implementation of the reflexive transitive closure.
458 * New implementation of quickcheck uses generic code generator;
459 default generators are provided for all suitable HOL types, records
460 and datatypes. Old quickcheck can be re-activated importing theory
461 Library/SML_Quickcheck.
463 * New testing tool Mirabelle for automated proof tools. Applies
464 several tools and tactics like sledgehammer, metis, or quickcheck, to
465 every proof step in a theory. To be used in batch mode via the
468 * New proof method "sos" (sum of squares) for nonlinear real
469 arithmetic (originally due to John Harison). It requires theory
470 Library/Sum_Of_Squares. It is not a complete decision procedure but
471 works well in practice on quantifier-free real arithmetic with +, -,
472 *, ^, =, <= and <, i.e. boolean combinations of equalities and
473 inequalities between polynomials. It makes use of external
474 semidefinite programming solvers. Method "sos" generates a
475 certificate that can be pasted into the proof thus avoiding the need
476 to call an external tool every time the proof is checked. See
477 src/HOL/Library/Sum_Of_Squares.
479 * New method "linarith" invokes existing linear arithmetic decision
482 * New command 'atp_minimal' reduces result produced by Sledgehammer.
484 * New Sledgehammer option "Full Types" in Proof General settings menu.
485 Causes full type information to be output to the ATPs. This slows
486 ATPs down considerably but eliminates a source of unsound "proofs"
489 * New method "metisFT": A version of metis that uses full type
490 information in order to avoid failures of proof reconstruction.
492 * New evaluator "approximate" approximates an real valued term using
493 the same method as the approximation method.
495 * Method "approximate" now supports arithmetic expressions as
496 boundaries of intervals and implements interval splitting and Taylor
499 * ML antiquotation @{code_datatype} inserts definition of a datatype
500 generated by the code generator; e.g. see src/HOL/Predicate.thy.
502 * New theory SupInf of the supremum and infimum operators for sets of
505 * New theory Probability, which contains a development of measure
506 theory, eventually leading to Lebesgue integration and probability.
508 * Extended Multivariate Analysis to include derivation and Brouwer's
511 * Reorganization of number theory, INCOMPATIBILITY:
512 - new number theory development for nat and int, in theories Divides
513 and GCD as well as in new session Number_Theory
514 - some constants and facts now suffixed with _nat and _int
516 - former session NumberTheory now named Old_Number_Theory, including
517 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
518 - moved theory Pocklington from src/HOL/Library to
519 src/HOL/Old_Number_Theory
521 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
522 lcm of finite and infinite sets. It is shown that they form a complete
525 * Class semiring_div requires superclass no_zero_divisors and proof of
526 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
527 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
528 generalized to class semiring_div, subsuming former theorems
529 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
530 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
533 * Refinements to lattice classes and sets:
534 - less default intro/elim rules in locale variant, more default
535 intro/elim rules in class variant: more uniformity
536 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
538 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
540 - renamed ACI to inf_sup_aci
541 - new class "boolean_algebra"
542 - class "complete_lattice" moved to separate theory
543 "Complete_Lattice"; corresponding constants (and abbreviations)
544 renamed and with authentic syntax:
545 Set.Inf ~> Complete_Lattice.Inf
546 Set.Sup ~> Complete_Lattice.Sup
547 Set.INFI ~> Complete_Lattice.INFI
548 Set.SUPR ~> Complete_Lattice.SUPR
549 Set.Inter ~> Complete_Lattice.Inter
550 Set.Union ~> Complete_Lattice.Union
551 Set.INTER ~> Complete_Lattice.INTER
552 Set.UNION ~> Complete_Lattice.UNION
553 - authentic syntax for
556 - mere abbreviations:
559 Set.inter (for inf, formerly Set.Int)
560 Set.union (for sup, formerly Set.Un)
561 Complete_Lattice.Inter (for Inf)
562 Complete_Lattice.Union (for Sup)
563 Complete_Lattice.INTER (for INFI)
564 Complete_Lattice.UNION (for SUPR)
565 - object-logic definitions as far as appropriate
567 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
568 Un_subset_iff are explicitly deleted as default simp rules; then also
569 their lattice counterparts le_inf_iff and le_sup_iff have to be
570 deleted to achieve the desired effect.
572 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
573 rules by default any longer; the same applies to min_max.inf_absorb1
574 etc. INCOMPATIBILITY.
576 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
577 pred_set_conv by default. INCOMPATIBILITY.
579 * Power operations on relations and functions are now one dedicated
580 constant "compow" with infix syntax "^^". Power operation on
581 multiplicative monoids retains syntax "^" and is now defined generic
582 in class power. INCOMPATIBILITY.
584 * Relation composition "R O S" now has a more standard argument order:
585 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
586 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
587 break, since the O_assoc rule was not rewritten like this. Fix using
588 O_assoc[symmetric]. The same applies to the curried version "R OO S".
590 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
591 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
594 * Most rules produced by inductive and datatype package have mandatory
595 prefixes. INCOMPATIBILITY.
597 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
598 the attribute of the same name. Each of the theorems in the list
599 DERIV_intros assumes composition with an additional function and
600 matches a variable to the derivative, which has to be solved by the
601 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
602 of most elementary terms. Former Maclauren.DERIV_tac and
603 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
606 * Code generator attributes follow the usual underscore convention:
607 code_unfold replaces code unfold
608 code_post replaces code post
613 sizechange -> size_change
614 induct_scheme -> induction_schema
617 * Discontinued abbreviation "arbitrary" of constant "undefined".
618 INCOMPATIBILITY, use "undefined" directly.
621 Suc_eq_add_numeral_1 -> Suc_eq_plus1
622 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
623 Suc_plus1 -> Suc_eq_plus1
624 *anti_sym -> *antisym*
625 vector_less_eq_def -> vector_le_def
628 * Added theorem List.map_map as [simp]. Removed List.map_compose.
631 * Removed predicate "M hassize n" (<--> card M = n & finite M).
637 * Theory Representable defines a class "rep" of domains that are
638 representable (via an ep-pair) in the universal domain type "udom".
639 Instances are provided for all type constructors defined in HOLCF.
641 * The 'new_domain' command is a purely definitional version of the
642 domain package, for representable domains. Syntax is identical to the
643 old domain package. The 'new_domain' package also supports indirect
644 recursion using previously-defined type constructors. See
645 src/HOLCF/ex/New_Domain.thy for examples.
647 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
648 on the left-hand side of an equation, and then performs
649 simplification. Rewriting is done using rules declared with the
650 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
651 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
653 * The pattern-match compiler in 'fixrec' can now handle constructors
654 with HOL function types. Pattern-match combinators for the Pair
655 constructor are pre-configured.
657 * The 'fixrec' package now produces better fixed-point induction rules
658 for mutually-recursive definitions: Induction rules have conclusions
659 of the form "P foo bar" instead of "P <foo, bar>".
661 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
662 been renamed to "below". The name "below" now replaces "less" in many
663 theorem names. (Legacy theorem names using "less" are still supported
666 * The 'fixrec' package now supports "bottom patterns". Bottom
667 patterns can be used to generate strictness rules, or to make
668 functions more strict (much like the bang-patterns supported by the
669 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
675 * Support for Poly/ML 5.3.0, with improved reporting of compiler
676 errors and run-time exceptions, including detailed source positions.
678 * Structure Name_Space (formerly NameSpace) now manages uniquely
679 identified entries, with some additional information such as source
680 position, logical grouping etc.
682 * Theory and context data is now introduced by the simplified and
683 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
684 to be pure, but the old TheoryDataFun for mutable data (with explicit
685 copy operation) is still available for some time.
687 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
688 provides a high-level programming interface to synchronized state
689 variables with atomic update. This works via pure function
690 application within a critical section -- its runtime should be as
691 short as possible; beware of deadlocks if critical code is nested,
692 either directly or indirectly via other synchronized variables!
694 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
695 wraps raw ML references, explicitly indicating their non-thread-safe
696 behaviour. The Isar toplevel keeps this structure open, to
697 accommodate Proof General as well as quick and dirty interactive
698 experiments with references.
700 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
701 parallel tactical reasoning.
703 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
704 are similar to SUBPROOF, but are slightly more flexible: only the
705 specified parts of the subgoal are imported into the context, and the
706 body tactic may introduce new subgoals and schematic variables.
708 * Old tactical METAHYPS, which does not observe the proof context, has
709 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
710 or Subgoal.FOCUS etc.
712 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
713 functors have their own ML name space there is no point to mark them
714 separately.) Minor INCOMPATIBILITY.
716 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
718 * Renamed several structures FooBar to Foo_Bar. Occasional,
721 * Operations of structure Skip_Proof no longer require quick_and_dirty
722 mode, which avoids critical setmp.
724 * Eliminated old Attrib.add_attributes, Method.add_methods and related
725 combinators for "args". INCOMPATIBILITY, need to use simplified
726 Attrib/Method.setup introduced in Isabelle2009.
728 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
729 back on global_simpset_of, global_claset_of, global_clasimpset_of as
730 last resort. INCOMPATIBILITY.
732 * Display.pretty_thm now requires a proper context (cf. former
733 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
734 or even Display.pretty_thm_without_context as last resort.
737 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
738 Syntax.pretty_typ/term directly, preferably with proper context
739 instead of global theory.
744 * Further fine tuning of parallel proof checking, scales up to 8 cores
745 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
748 * Support for additional "Isabelle components" via etc/components, see
749 also the system manual.
751 * The isabelle makeall tool now operates on all components with
752 IsaMakefile, not just hardwired "logics".
754 * Removed "compress" option from isabelle-process and isabelle usedir;
755 this is always enabled.
757 * Discontinued support for Poly/ML 4.x versions.
759 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
760 on a given logic image. This requires the lighttpd webserver and is
761 currently supported on Linux only.
765 New in Isabelle2009 (April 2009)
766 --------------------------------
770 * Simplified main Isabelle executables, with less surprises on
771 case-insensitive file-systems (such as Mac OS).
773 - The main Isabelle tool wrapper is now called "isabelle" instead of
776 - The former "isabelle" alias for "isabelle-process" has been
777 removed (should rarely occur to regular users).
779 - The former "isabelle-interface" and its alias "Isabelle" have been
780 removed (interfaces are now regular Isabelle tools).
782 Within scripts and make files, the Isabelle environment variables
783 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
784 respectively. (The latter are still available as legacy feature.)
786 The old isabelle-interface wrapper could react in confusing ways if
787 the interface was uninstalled or changed otherwise. Individual
788 interface tool configuration is now more explicit, see also the
789 Isabelle system manual. In particular, Proof General is now available
790 via "isabelle emacs".
792 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
793 purge installed copies of Isabelle executables and re-run "isabelle
794 install -p ...", or use symlinks.
796 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
797 old ~/isabelle, which was slightly non-standard and apt to cause
798 surprises on case-insensitive file-systems (such as Mac OS).
800 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
801 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
802 care is required when using older releases of Isabelle. Note that
803 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
804 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
806 * Proofs of fully specified statements are run in parallel on
807 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
808 a regular 4-core machine, if the initial heap space is made reasonably
809 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
811 * The main reference manuals ("isar-ref", "implementation", and
812 "system") have been updated and extended. Formally checked references
813 as hyperlinks are now available uniformly.
818 * Complete re-implementation of locales. INCOMPATIBILITY in several
819 respects. The most important changes are listed below. See the
820 Tutorial on Locales ("locales" manual) for details.
822 - In locale expressions, instantiation replaces renaming. Parameters
823 must be declared in a for clause. To aid compatibility with previous
824 parameter inheritance, in locale declarations, parameters that are not
825 'touched' (instantiation position "_" or omitted) are implicitly added
826 with their syntax at the beginning of the for clause.
828 - Syntax from abbreviations and definitions in locales is available in
829 locale expressions and context elements. The latter is particularly
830 useful in locale declarations.
832 - More flexible mechanisms to qualify names generated by locale
833 expressions. Qualifiers (prefixes) may be specified in locale
834 expressions, and can be marked as mandatory (syntax: "name!:") or
835 optional (syntax "name?:"). The default depends for plain "name:"
836 depends on the situation where a locale expression is used: in
837 commands 'locale' and 'sublocale' prefixes are optional, in
838 'interpretation' and 'interpret' prefixes are mandatory. The old
839 implicit qualifiers derived from the parameter names of a locale are
842 - Command "sublocale l < e" replaces "interpretation l < e". The
843 instantiation clause in "interpretation" and "interpret" (square
844 brackets) is no longer available. Use locale expressions.
846 - When converting proof scripts, mandatory qualifiers in
847 'interpretation' and 'interpret' should be retained by default, even
848 if this is an INCOMPATIBILITY compared to former behavior. In the
849 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
850 in locale expressions range over a single locale instance only.
852 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
853 In existing theorem specifications replace the includes element by the
854 respective context elements of the included locale, omitting those
855 that are already present in the theorem specification. Multiple
856 assume elements of a locale should be replaced by a single one
857 involving the locale predicate. In the proof body, declarations (most
858 notably theorems) may be regained by interpreting the respective
859 locales in the proof context as required (command "interpret").
861 If using "includes" in replacement of a target solely because the
862 parameter types in the theorem are not as general as in the target,
863 consider declaring a new locale with additional type constraints on
864 the parameters (context element "constrains").
866 - Discontinued "locale (open)". INCOMPATIBILITY.
868 - Locale interpretation commands no longer attempt to simplify goal.
869 INCOMPATIBILITY: in rare situations the generated goal differs. Use
870 methods intro_locales and unfold_locales to clarify.
872 - Locale interpretation commands no longer accept interpretation
873 attributes. INCOMPATIBILITY.
875 * Class declaration: so-called "base sort" must not be given in import
876 list any longer, but is inferred from the specification. Particularly
883 class foo = type + ...
885 * Class target: global versions of theorems stemming do not carry a
886 parameter prefix any longer. INCOMPATIBILITY.
888 * Class 'instance' command no longer accepts attached definitions.
889 INCOMPATIBILITY, use proper 'instantiation' target instead.
891 * Recovered hiding of consts, which was accidentally broken in
892 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
893 makes c inaccessible; consider using ``hide (open) const c'' instead.
895 * Slightly more coherent Pure syntax, with updated documentation in
896 isar-ref manual. Removed locales meta_term_syntax and
897 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
898 INCOMPATIBILITY in rare situations. Note that &&& should not be used
899 directly in regular applications.
901 * There is a new syntactic category "float_const" for signed decimal
902 fractions (e.g. 123.45 or -123.45).
904 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
905 interface with 'setup' command instead.
907 * Command 'local_setup' is similar to 'setup', but operates on a local
910 * The 'axiomatization' command now only works within a global theory
911 context. INCOMPATIBILITY.
913 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
914 hypotheses. Sorts required in the course of reasoning need to be
915 covered by the constraints in the initial statement, completed by the
916 type instance information of the background theory. Non-trivial sort
917 hypotheses, which rarely occur in practice, may be specified via
918 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
920 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
922 The result contains an implicit sort hypotheses as before --
923 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
926 * Generalized Isar history, with support for linear undo, direct state
929 * Changed defaults for unify configuration options:
931 unify_trace_bound = 50 (formerly 25)
932 unify_search_bound = 60 (formerly 30)
934 * Different bookkeeping for code equations (INCOMPATIBILITY):
936 a) On theory merge, the last set of code equations for a particular
937 constant is taken (in accordance with the policy applied by other
938 parts of the code generator framework).
940 b) Code equations stemming from explicit declarations (e.g. code
941 attribute) gain priority over default code equations stemming
942 from definition, primrec, fun etc.
944 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
946 * Unified theorem tables for both code generators. Thus [code
947 func] has disappeared and only [code] remains. INCOMPATIBILITY.
949 * Command 'find_consts' searches for constants based on type and name
952 find_consts "_ => bool"
954 By default, matching is against subtypes, but it may be restricted to
955 the whole type. Searching by name is possible. Multiple queries are
956 conjunctive and queries may be negated by prefixing them with a
959 find_consts strict: "_ => bool" name: "Int" -"int => int"
961 * New 'find_theorems' criterion "solves" matches theorems that
962 directly solve the current goal (modulo higher-order unification).
964 * Auto solve feature for main theorem statements: whenever a new goal
965 is stated, "find_theorems solves" is called; any theorems that could
966 solve the lemma directly are listed as part of the goal state.
967 Cf. associated options in Proof General Isabelle settings menu,
968 enabled by default, with reasonable timeout for pathological cases of
969 higher-order unification.
972 *** Document preparation ***
974 * Antiquotation @{lemma} now imitates a regular terminal proof,
975 demanding keyword 'by' and supporting the full method expression
976 syntax just like the Isar command 'by'.
981 * Integrated main parts of former image HOL-Complex with HOL. Entry
982 points Main and Complex_Main remain as before.
984 * Logic image HOL-Plain provides a minimal HOL with the most important
985 tools available (inductive, datatype, primrec, ...). This facilitates
986 experimentation and tool development. Note that user applications
987 (and library theories) should never refer to anything below theory
990 * Logic image HOL-Main stops at theory Main, and thus facilitates
991 experimentation due to shorter build times.
993 * Logic image HOL-NSA contains theories of nonstandard analysis which
994 were previously part of former HOL-Complex. Entry point Hyperreal
995 remains valid, but theories formerly using Complex_Main should now use
996 new entry point Hypercomplex.
998 * Generic ATP manager for Sledgehammer, based on ML threads instead of
999 Posix processes. Avoids potentially expensive forking of the ML
1000 process. New thread-based implementation also works on non-Unix
1001 platforms (Cygwin). Provers are no longer hardwired, but defined
1002 within the theory via plain ML wrapper functions. Basic Sledgehammer
1003 commands are covered in the isar-ref manual.
1005 * Wrapper scripts for remote SystemOnTPTP service allows to use
1006 sledgehammer without local ATP installation (Vampire etc.). Other
1007 provers may be included via suitable ML wrappers, see also
1008 src/HOL/ATP_Linkup.thy.
1010 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1013 * The metis method no longer fails because the theorem is too trivial
1014 (contains the empty clause).
1016 * The metis method now fails in the usual manner, rather than raising
1017 an exception, if it determines that it cannot prove the theorem.
1019 * Method "coherent" implements a prover for coherent logic (see also
1020 src/Tools/coherent.ML).
1022 * Constants "undefined" and "default" replace "arbitrary". Usually
1023 "undefined" is the right choice to replace "arbitrary", though
1024 logically there is no difference. INCOMPATIBILITY.
1026 * Command "value" now integrates different evaluation mechanisms. The
1027 result of the first successful evaluation mechanism is printed. In
1028 square brackets a particular named evaluation mechanisms may be
1029 specified (currently, [SML], [code] or [nbe]). See further
1030 src/HOL/ex/Eval_Examples.thy.
1032 * Normalization by evaluation now allows non-leftlinear equations.
1033 Declare with attribute [code nbe].
1035 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1036 as the structured Isar versions "cases" and "induct", cf. the
1037 corresponding "cases" and "induct" attributes. Mutual induction rules
1038 are now presented as a list of individual projections
1039 (e.g. foo_bar.inducts for types foo and bar); the old format with
1040 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1041 rare situations a different rule is selected --- notably nested tuple
1042 elimination instead of former prod.exhaust: use explicit (case_tac t
1043 rule: prod.exhaust) here.
1045 * Attributes "cases", "induct", "coinduct" support "del" option.
1047 * Removed fact "case_split_thm", which duplicates "case_split".
1049 * The option datatype has been moved to a new theory Option. Renamed
1050 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1052 * New predicate "strict_mono" classifies strict functions on partial
1053 orders. With strict functions on linear orders, reasoning about
1054 (in)equalities is facilitated by theorems "strict_mono_eq",
1055 "strict_mono_less_eq" and "strict_mono_less".
1057 * Some set operations are now proper qualified constants with
1058 authentic syntax. INCOMPATIBILITY:
1069 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1072 * Auxiliary class "itself" has disappeared -- classes without any
1073 parameter are treated as expected by the 'class' command.
1075 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1077 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1078 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1080 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1081 method "approximation". It proves formulas on real values by using
1082 interval arithmetic. In the formulas are also the transcendental
1083 functions sin, cos, tan, atan, ln, exp and the constant pi are
1084 allowed. For examples see
1085 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1087 * Theory "Reflection" now resides in HOL/Library.
1089 * Entry point to Word library now simply named "Word".
1092 * Made source layout more coherent with logical distribution
1095 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1096 src/HOL/Library/Code_Message.thy ~> src/HOL/
1097 src/HOL/Library/GCD.thy ~> src/HOL/
1098 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1099 src/HOL/Library/Parity.thy ~> src/HOL/
1100 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1101 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1102 src/HOL/Real/Lubs.thy ~> src/HOL/
1103 src/HOL/Real/PReal.thy ~> src/HOL/
1104 src/HOL/Real/Rational.thy ~> src/HOL/
1105 src/HOL/Real/RComplete.thy ~> src/HOL/
1106 src/HOL/Real/RealDef.thy ~> src/HOL/
1107 src/HOL/Real/RealPow.thy ~> src/HOL/
1108 src/HOL/Real/Real.thy ~> src/HOL/
1109 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1110 src/HOL/Complex/Complex.thy ~> src/HOL/
1111 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1112 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1113 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1114 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1115 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1116 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1117 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1118 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1119 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1120 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1121 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1122 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1123 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1124 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1125 src/HOL/Real/Float ~> src/HOL/Library/
1126 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1127 src/HOL/Real/RealVector.thy ~> src/HOL/
1129 src/HOL/arith_data.ML ~> src/HOL/Tools
1130 src/HOL/hologic.ML ~> src/HOL/Tools
1131 src/HOL/simpdata.ML ~> src/HOL/Tools
1132 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1133 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1134 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1135 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1136 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1137 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1138 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1140 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1141 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1142 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1143 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1144 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1145 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1147 * If methods "eval" and "evaluation" encounter a structured proof
1148 state with !!/==>, only the conclusion is evaluated to True (if
1149 possible), avoiding strange error messages.
1151 * Method "sizechange" automates termination proofs using (a
1152 modification of) the size-change principle. Requires SAT solver. See
1153 src/HOL/ex/Termination.thy for examples.
1155 * Simplifier: simproc for let expressions now unfolds if bound
1156 variable occurs at most once in let expression body. INCOMPATIBILITY.
1158 * Method "arith": Linear arithmetic now ignores all inequalities when
1159 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1161 * New attribute "arith" for facts that should always be used
1162 automatically by arithmetic. It is intended to be used locally in
1165 assumes [arith]: "x > 0"
1167 Global usage is discouraged because of possible performance impact.
1169 * New classes "top" and "bot" with corresponding operations "top" and
1170 "bot" in theory Orderings; instantiation of class "complete_lattice"
1171 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1173 * Changed definition lemma "less_fun_def" in order to provide an
1174 instance for preorders on functions; use lemma "less_le" instead.
1177 * Theory Orderings: class "wellorder" moved here, with explicit
1178 induction rule "less_induct" as assumption. For instantiation of
1179 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1182 * Theory Orderings: added class "preorder" as superclass of "order".
1183 INCOMPATIBILITY: Instantiation proofs for order, linorder
1184 etc. slightly changed. Some theorems named order_class.* now named
1187 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1190 * Theory Finite_Set: added a new fold combinator of type
1192 ('a => 'b => 'b) => 'b => 'a set => 'b
1194 Occasionally this is more convenient than the old fold combinator
1195 which is now defined in terms of the new one and renamed to
1198 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1199 and "ring_simps" have been replaced by "algebra_simps" (which can be
1200 extended with further lemmas!). At the moment both still exist but
1201 the former will disappear at some point.
1203 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1204 class recpower. Type-specific simp rules for various recpower types
1205 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1207 rat_power_0 -> power_0
1208 rat_power_Suc -> power_Suc
1209 realpow_0 -> power_0
1210 realpow_Suc -> power_Suc
1211 complexpow_0 -> power_0
1212 complexpow_Suc -> power_Suc
1213 power_poly_0 -> power_0
1214 power_poly_Suc -> power_Suc
1216 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1217 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1218 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1219 of lemmas from Divides has been generalized from nat to class
1220 semiring_div. INCOMPATIBILITY. This involves the following theorem
1221 renames resulting from duplicate elimination:
1223 dvd_def_mod ~> dvd_eq_mod_eq_0
1224 zero_dvd_iff ~> dvd_0_left_iff
1225 dvd_0 ~> dvd_0_right
1226 DIVISION_BY_ZERO_DIV ~> div_by_0
1227 DIVISION_BY_ZERO_MOD ~> mod_by_0
1228 mult_div ~> div_mult_self2_is_id
1229 mult_mod ~> mod_mult_self2_is_0
1231 * Theory IntDiv: removed many lemmas that are instances of class-based
1232 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1233 rename old lemmas as follows:
1235 dvd_diff -> nat_dvd_diff
1236 dvd_zminus_iff -> dvd_minus_iff
1237 mod_add1_eq -> mod_add_eq
1238 mod_mult1_eq -> mod_mult_right_eq
1239 mod_mult1_eq' -> mod_mult_left_eq
1240 mod_mult_distrib_mod -> mod_mult_eq
1241 nat_mod_add_left_eq -> mod_add_left_eq
1242 nat_mod_add_right_eq -> mod_add_right_eq
1243 nat_mod_div_trivial -> mod_div_trivial
1244 nat_mod_mod_trivial -> mod_mod_trivial
1245 zdiv_zadd_self1 -> div_add_self1
1246 zdiv_zadd_self2 -> div_add_self2
1247 zdiv_zmult_self1 -> div_mult_self2_is_id
1248 zdiv_zmult_self2 -> div_mult_self1_is_id
1249 zdvd_triv_left -> dvd_triv_left
1250 zdvd_triv_right -> dvd_triv_right
1251 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1252 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1253 zmod_zadd_left_eq -> mod_add_left_eq
1254 zmod_zadd_right_eq -> mod_add_right_eq
1255 zmod_zadd_self1 -> mod_add_self1
1256 zmod_zadd_self2 -> mod_add_self2
1257 zmod_zadd1_eq -> mod_add_eq
1258 zmod_zdiff1_eq -> mod_diff_eq
1259 zmod_zdvd_zmod -> mod_mod_cancel
1260 zmod_zmod_cancel -> mod_mod_cancel
1261 zmod_zmult_self1 -> mod_mult_self2_is_0
1262 zmod_zmult_self2 -> mod_mult_self1_is_0
1265 zdvd_abs1 -> abs_dvd_iff
1266 zdvd_abs2 -> dvd_abs_iff
1267 zdvd_refl -> dvd_refl
1268 zdvd_trans -> dvd_trans
1269 zdvd_zadd -> dvd_add
1270 zdvd_zdiff -> dvd_diff
1271 zdvd_zminus_iff -> dvd_minus_iff
1272 zdvd_zminus2_iff -> minus_dvd_iff
1273 zdvd_zmultD -> dvd_mult_right
1274 zdvd_zmultD2 -> dvd_mult_left
1275 zdvd_zmult_mono -> mult_dvd_mono
1276 zdvd_0_right -> dvd_0_right
1277 zdvd_0_left -> dvd_0_left_iff
1278 zdvd_1_left -> one_dvd
1279 zminus_dvd_iff -> minus_dvd_iff
1281 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1283 * The real numbers offer decimal input syntax: 12.34 is translated
1284 into 1234/10^2. This translation is not reversed upon output.
1286 * Theory Library/Polynomial defines an abstract type 'a poly of
1287 univariate polynomials with coefficients of type 'a. In addition to
1288 the standard ring operations, it also supports div and mod. Code
1289 generation is also supported, using list-style constructors.
1291 * Theory Library/Inner_Product defines a class of real_inner for real
1292 inner product spaces, with an overloaded operation inner :: 'a => 'a
1293 => real. Class real_inner is a subclass of real_normed_vector from
1296 * Theory Library/Product_Vector provides instances for the product
1297 type 'a * 'b of several classes from RealVector and Inner_Product.
1298 Definitions of addition, subtraction, scalar multiplication, norms,
1299 and inner products are included.
1301 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1302 addition to the field operations, numerals and case syntax are also
1305 * Theory Library/Diagonalize provides constructive version of Cantor's
1306 first diagonalization argument.
1308 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1309 zlcm (for int); carried together from various gcd/lcm developements in
1310 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1311 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1312 may recover tupled syntax as follows:
1314 hide (open) const gcd
1315 abbreviation gcd where
1316 "gcd == (%(a, b). GCD.gcd a b)"
1318 GCD.gcd ("gcd '(_, _')")
1320 The same works for lcm, zgcd, zlcm.
1322 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1323 instantiations for algebraic structures. Removed some duplicate
1324 theorems. Changes in simp rules. INCOMPATIBILITY.
1326 * ML antiquotation @{code} takes a constant as argument and generates
1327 corresponding code in background and inserts name of the corresponding
1328 resulting ML value/function/datatype constructor binding in place.
1329 All occurrences of @{code} with a single ML block are generated
1330 simultaneously. Provides a generic and safe interface for
1331 instrumentalizing code generation. See
1332 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1333 In future you ought to refrain from ad-hoc compiling generated SML
1334 code on the ML toplevel. Note that (for technical reasons) @{code}
1335 cannot refer to constants for which user-defined serializations are
1336 set. Refer to the corresponding ML counterpart directly in that
1339 * Command 'rep_datatype': instead of theorem names the command now
1340 takes a list of terms denoting the constructors of the type to be
1341 represented as datatype. The characteristic theorems have to be
1342 proven. INCOMPATIBILITY. Also observe that the following theorems
1343 have disappeared in favour of existing ones:
1345 unit_induct ~> unit.induct
1346 prod_induct ~> prod.induct
1347 sum_induct ~> sum.induct
1348 Suc_Suc_eq ~> nat.inject
1349 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1354 * New locales for orders and lattices where the equivalence relation
1355 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1356 locales use a record structure with field eq for the equivalence.
1358 * New theory of factorial domains.
1360 * Units_l_inv and Units_r_inv are now simp rules by default.
1361 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1362 and/or r_inv will now also require deletion of these lemmas.
1364 * Renamed the following theorems, INCOMPATIBILITY:
1366 UpperD ~> Upper_memD
1367 LowerD ~> Lower_memD
1368 least_carrier ~> least_closed
1369 greatest_carrier ~> greatest_closed
1370 greatest_Lower_above ~> greatest_Lower_below
1371 one_zero ~> carrier_one_zero
1372 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1377 * Nominal datatypes can now contain type-variables.
1379 * Commands 'nominal_inductive' and 'equivariance' work with local
1382 * Nominal primrec can now works with local theory targets and its
1383 specification syntax now conforms to the general format as seen in
1386 * Method "perm_simp" honours the standard simplifier attributes
1387 (no_asm), (no_asm_use) etc.
1389 * The new predicate #* is defined like freshness, except that on the
1390 left hand side can be a set or list of atoms.
1392 * Experimental command 'nominal_inductive2' derives strong induction
1393 principles for inductive definitions. In contrast to
1394 'nominal_inductive', which can only deal with a fixed number of
1395 binders, it can deal with arbitrary expressions standing for sets of
1396 atoms to be avoided. The only inductive definition we have at the
1397 moment that needs this generalisation is the typing rule for Lets in
1400 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1401 -----------------------------------------------------------------
1402 Gamma |- Let x be t1 in t2 : T2
1404 In this rule one wants to avoid all the binders that are introduced by
1405 "close Gamma T1". We are looking for other examples where this
1406 feature might be useful. Please let us know.
1411 * Reimplemented the simplification procedure for proving continuity
1412 subgoals. The new simproc is extensible; users can declare additional
1413 continuity introduction rules with the attribute [cont2cont].
1415 * The continuity simproc now uses a different introduction rule for
1416 solving continuity subgoals on terms with lambda abstractions. In
1417 some rare cases the new simproc may fail to solve subgoals that the
1418 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1419 Potential INCOMPATIBILITY.
1421 * Command 'fixrec': specification syntax now conforms to the general
1422 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1423 examples. INCOMPATIBILITY.
1428 * Proof of Zorn's Lemma for partial orders.
1433 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1434 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1435 depends on multithreading, so timouts will not work before Poly/ML
1438 * High-level support for concurrent ML programming, see
1439 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1440 particularly convenient to organize independent functional
1441 computations. The concept of "synchronized variables" provides a
1442 higher-order interface for components with shared state, avoiding the
1443 delicate details of mutexes and condition variables. (Requires
1444 Poly/ML 5.2.1 or later.)
1446 * ML bindings produced via Isar commands are stored within the Isar
1447 context (theory or proof). Consequently, commands like 'use' and 'ML'
1448 become thread-safe and work with undo as expected (concerning
1449 top-level bindings, not side-effects on global references).
1450 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1451 compiler at runtime; really global bindings need to be given outside a
1452 theory. (Requires Poly/ML 5.2 or later.)
1454 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1455 context. Top-level ML bindings are stored within the proof context in
1456 a purely sequential fashion, disregarding the nested proof structure.
1457 ML bindings introduced by 'ML_prf' are discarded at the end of the
1458 proof. (Requires Poly/ML 5.2 or later.)
1460 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1461 and Method.setup, as well as Isar commands 'attribute_setup' and
1462 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1463 existing code accordingly, or use plain 'setup' together with old
1466 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1467 to 'a -> thm, while results are always tagged with an authentic oracle
1468 name. The Isar command 'oracle' is now polymorphic, no argument type
1469 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1470 accordingly. Note that extra performance may be gained by producing
1471 the cterm carefully, avoiding slow Thm.cterm_of.
1473 * Simplified interface for defining document antiquotations via
1474 ThyOutput.antiquotation, ThyOutput.output, and optionally
1475 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1476 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1479 * More systematic treatment of long names, abstract name bindings, and
1480 name space operations. Basic operations on qualified names have been
1481 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1482 Long_Name.append. Old type bstring has been mostly replaced by
1483 abstract type binding (see structure Binding), which supports precise
1484 qualification by packages and local theory targets, as well as proper
1485 tracking of source positions. INCOMPATIBILITY, need to wrap old
1486 bstring values into Binding.name, or better pass through abstract
1487 bindings everywhere. See further src/Pure/General/long_name.ML,
1488 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1490 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1491 LocalTheory.note etc.) now refer to the *full* internal name, not the
1492 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1494 * Disposed old type and term read functions (Sign.read_def_typ,
1495 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1496 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1497 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1498 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1499 resort for legacy applications.
1501 * Disposed old declarations, tactics, tactic combinators that refer to
1502 the simpset or claset of an implicit theory (such as Addsimps,
1503 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1504 embedded ML text, or local_simpset_of with a proper context passed as
1505 explicit runtime argument.
1507 * Rules and tactics that read instantiations (read_instantiate,
1508 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1509 context, which is required for parsing and type-checking. Moreover,
1510 the variables are specified as plain indexnames, not string encodings
1511 thereof. INCOMPATIBILITY.
1513 * Generic Toplevel.add_hook interface allows to analyze the result of
1514 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1515 for theorem dependency output of transactions resulting in a new
1518 * ML antiquotations: block-structured compilation context indicated by
1519 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1521 @{binding name} - basic name binding
1522 @{let ?pat = term} - term abbreviation (HO matching)
1523 @{note name = fact} - fact abbreviation
1524 @{thm fact} - singleton fact (with attributes)
1525 @{thms fact} - general fact (with attributes)
1526 @{lemma prop by method} - singleton goal
1527 @{lemma prop by meth1 meth2} - singleton goal
1528 @{lemma prop1 ... propN by method} - general goal
1529 @{lemma prop1 ... propN by meth1 meth2} - general goal
1530 @{lemma (open) ...} - open derivation
1535 * The Isabelle "emacs" tool provides a specific interface to invoke
1536 Proof General / Emacs, with more explicit failure if that is not
1537 installed (the old isabelle-interface script silently falls back on
1538 isabelle-process). The PROOFGENERAL_HOME setting determines the
1539 installation location of the Proof General distribution.
1541 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1542 the Isabelle process into a JVM/Scala application. See
1543 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1544 process wrapper has been discontinued.)
1546 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1548 * Various status messages (with exact source position information) are
1549 emitted, if proper markup print mode is enabled. This allows
1550 user-interface components to provide detailed feedback on internal
1555 New in Isabelle2008 (June 2008)
1556 -------------------------------
1560 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1561 and updated, with formally checked references as hyperlinks.
1563 * Theory loader: use_thy (and similar operations) no longer set the
1564 implicit ML context, which was occasionally hard to predict and in
1565 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1566 provides a proper context already.
1568 * Theory loader: old-style ML proof scripts being *attached* to a thy
1569 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1570 'use' within a theory file will do the job.
1572 * Name space merge now observes canonical order, i.e. the second space
1573 is inserted into the first one, while existing entries in the first
1574 space take precedence. INCOMPATIBILITY in rare situations, may try to
1575 swap theory imports.
1577 * Syntax: symbol \<chi> is now considered a letter. Potential
1578 INCOMPATIBILITY in identifier syntax etc.
1580 * Outer syntax: string tokens no longer admit escaped white space,
1581 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1582 white space without escapes.
1584 * Outer syntax: string tokens may contain arbitrary character codes
1585 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1591 * Context-dependent token translations. Default setup reverts locally
1592 fixed variables, and adds hilite markup for undeclared frees.
1594 * Unused theorems can be found using the new command 'unused_thms'.
1595 There are three ways of invoking it:
1598 Only finds unused theorems in the current theory.
1600 (2) unused_thms thy_1 ... thy_n -
1601 Finds unused theorems in the current theory and all of its ancestors,
1602 excluding the theories thy_1 ... thy_n and all of their ancestors.
1604 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1605 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1606 their ancestors, excluding the theories thy_1 ... thy_n and all of
1609 In order to increase the readability of the list produced by
1610 unused_thms, theorems that have been created by a particular instance
1611 of a theory command such as 'inductive' or 'function' are considered
1612 to belong to the same "group", meaning that if at least one theorem in
1613 this group is used, the other theorems in the same group are no longer
1614 reported as unused. Moreover, if all theorems in the group are
1615 unused, only one theorem in the group is displayed.
1617 Note that proof objects have to be switched on in order for
1618 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1619 usually the case when using Proof General with the default settings).
1621 * Authentic naming of facts disallows ad-hoc overwriting of previous
1622 theorems within the same name space. INCOMPATIBILITY, need to remove
1623 duplicate fact bindings, or even accidental fact duplications. Note
1624 that tools may maintain dynamically scoped facts systematically, using
1625 PureThy.add_thms_dynamic.
1627 * Command 'hide' now allows to hide from "fact" name space as well.
1629 * Eliminated destructive theorem database, simpset, claset, and
1630 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1631 update of theories within ML code.
1633 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1634 INCOMPATIBILITY, object-logics depending on former Pure require
1635 additional setup PureThy.old_appl_syntax_setup; object-logics
1636 depending on former CPure need to refer to Pure.
1638 * Commands 'use' and 'ML' are now purely functional, operating on
1639 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1640 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1643 * Command 'setup': discontinued implicit version with ML reference.
1645 * Instantiation target allows for simultaneous specification of class
1646 instance operations together with an instantiation proof.
1647 Type-checking phase allows to refer to class operations uniformly.
1648 See src/HOL/Complex/Complex.thy for an Isar example and
1649 src/HOL/Library/Eval.thy for an ML example.
1651 * Indexing of literal facts: be more serious about including only
1652 facts from the visible specification/proof context, but not the
1653 background context (locale etc.). Affects `prop` notation and method
1654 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1657 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1658 "(open)" option, which used to expose internal bound variables to the
1661 * Isar statements: removed obsolete case "rule_context".
1662 INCOMPATIBILITY, better use explicit fixes/assumes.
1664 * Locale proofs: default proof step now includes 'unfold_locales';
1665 hence 'proof' without argument may be used to unfold locale
1669 *** Document preparation ***
1671 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1672 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1673 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1674 spot); renamed link color from "darkblue" to "linkcolor" (default
1675 value unchanged, can be redefined via \definecolor); no longer sets
1676 "a4paper" option (unnecessary or even intrusive).
1678 * Antiquotation @{lemma A method} proves proposition A by the given
1679 method (either a method name or a method name plus (optional) method
1680 arguments in parentheses) and prints A just like @{prop A}.
1685 * New primrec package. Specification syntax conforms in style to
1686 definition/function/.... No separate induction rule is provided. The
1687 "primrec" command distinguishes old-style and new-style specifications
1688 by syntax. The former primrec package is now named OldPrimrecPackage.
1689 When adjusting theories, beware: constants stemming from new-style
1690 primrec specifications have authentic syntax.
1692 * Metis prover is now an order of magnitude faster, and also works
1693 with multithreading.
1695 * Metis: the maximum number of clauses that can be produced from a
1696 theorem is now given by the attribute max_clauses. Theorems that
1697 exceed this number are ignored, with a warning printed.
1699 * Sledgehammer no longer produces structured proofs by default. To
1700 enable, declare [[sledgehammer_full = true]]. Attributes
1701 reconstruction_modulus, reconstruction_sorts renamed
1702 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1704 * Method "induct_scheme" derives user-specified induction rules
1705 from well-founded induction and completeness of patterns. This factors
1706 out some operations that are done internally by the function package
1707 and makes them available separately. See
1708 src/HOL/ex/Induction_Scheme.thy for examples.
1710 * More flexible generation of measure functions for termination
1711 proofs: Measure functions can be declared by proving a rule of the
1712 form "is_measure f" and giving it the [measure_function] attribute.
1713 The "is_measure" predicate is logically meaningless (always true), and
1714 just guides the heuristic. To find suitable measure functions, the
1715 termination prover sets up the goal "is_measure ?f" of the appropriate
1716 type and generates all solutions by prolog-style backwards proof using
1719 This setup also deals with rules like
1721 "is_measure f ==> is_measure (list_size f)"
1723 which accommodates nested datatypes that recurse through lists.
1724 Similar rules are predeclared for products and option types.
1726 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1730 - Definitions of overloaded constants on sets have to be replaced by
1731 definitions on => and bool.
1733 - Some definitions of overloaded operators on sets can now be proved
1734 using the definitions of the operators on => and bool. Therefore,
1735 the following theorems have been renamed:
1737 subset_def -> subset_eq
1738 psubset_def -> psubset_eq
1739 set_diff_def -> set_diff_eq
1740 Compl_def -> Compl_eq
1741 Sup_set_def -> Sup_set_eq
1742 Inf_set_def -> Inf_set_eq
1743 sup_set_def -> sup_set_eq
1744 inf_set_def -> inf_set_eq
1746 - Due to the incompleteness of the HO unification algorithm, some
1747 rules such as subst may require manual instantiation, if some of
1748 the unknowns in the rule is a set.
1750 - Higher order unification and forward proofs:
1753 have "P (S::'a set)" <...>
1754 then have "EX S. P S" ..
1756 no longer works (due to the incompleteness of the HO unification
1757 algorithm) and must be replaced by the pattern
1764 - Calculational reasoning with subst (or similar rules):
1767 have "P (S::'a set)" <...>
1768 also have "S = T" <...>
1769 finally have "P T" .
1771 no longer works (for similar reasons as the previous example) and
1772 must be replaced by something like
1774 have "P (S::'a set)" <...>
1775 moreover have "S = T" <...>
1776 ultimately have "P T" by simp
1778 - Tactics or packages written in ML code:
1779 Code performing pattern matching on types via
1781 Type ("set", [T]) => ...
1783 must be rewritten. Moreover, functions like strip_type or
1784 binder_types no longer return the right value when applied to a
1787 T1 => ... => Tn => U => bool
1791 T1 => ... => Tn => U set
1793 * Merged theories Wellfounded_Recursion, Accessible_Part and
1794 Wellfounded_Relations to theory Wellfounded.
1796 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1798 * Class finite no longer treats UNIV as class parameter. Use class
1799 enum from theory Library/Enum instead to achieve a similar effect.
1802 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1803 and "Cons". INCOMPATIBILITY.
1805 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1806 Potential INCOMPATIBILITY.
1808 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1809 injective_fst_snd removed, use split_eta and prod_eqI instead.
1810 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1812 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1813 the same name in theory Orderings:
1823 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1824 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1825 and different variable names.
1827 * Library/Option_ord.thy: Canonical order on option type.
1829 * Library/RBT.thy: Red-black trees, an efficient implementation of
1832 * Library/Countable.thy: Type class for countable types.
1834 * Theory Int: The representation of numerals has changed. The infix
1835 operator BIT and the bit datatype with constructors B0 and B1 have
1836 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1837 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1838 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1841 * Theory Nat: definition of <= and < on natural numbers no longer
1842 depend on well-founded relations. INCOMPATIBILITY. Definitions
1843 le_def and less_def have disappeared. Consider lemmas not_less
1844 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1846 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1847 (whose purpose mainly is for various fold_set functionals) have been
1848 abandoned in favor of the existing algebraic classes
1849 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1850 lower_semilattice (resp. upper_semilattice) and linorder.
1853 * Theory Transitive_Closure: induct and cases rules now declare proper
1854 case_names ("base" and "step"). INCOMPATIBILITY.
1856 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1857 lattices. The form set-specific version is available as
1858 Inductive.lfp_ordinal_induct_set.
1860 * Renamed theorems "power.simps" to "power_int.simps".
1863 * Class semiring_div provides basic abstract properties of semirings
1864 with division and modulo operations. Subsumes former class dvd_mod.
1866 * Merged theories IntDef, Numeral and IntArith into unified theory
1867 Int. INCOMPATIBILITY.
1869 * Theory Library/Code_Index: type "index" now represents natural
1870 numbers rather than integers. INCOMPATIBILITY.
1872 * New class "uminus" with operation "uminus" (split of from class
1873 "minus" which now only has operation "minus", binary).
1876 * Constants "card", "internal_split", "option_map" now with authentic
1877 syntax. INCOMPATIBILITY.
1879 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1880 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1881 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1882 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1883 Sup_set_def, le_def, less_def, option_map_def now with object
1884 equality. INCOMPATIBILITY.
1886 * Records. Removed K_record, and replaced it by pure lambda term
1887 %x. c. The simplifier setup is now more robust against eta expansion.
1888 INCOMPATIBILITY: in cases explicitly referring to K_record.
1890 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1892 * Library/ListVector: new theory of arithmetic vector operations.
1894 * Library/Order_Relation: new theory of various orderings as sets of
1895 pairs. Defines preorders, partial orders, linear orders and
1896 well-orders on sets and on types.
1901 * Renamed some theories to allow to loading both ZF and HOL in the
1904 Datatype -> Datatype_ZF
1905 Inductive -> Inductive_ZF
1912 INCOMPATIBILITY: ZF theories that import individual theories below
1913 Main might need to be adapted. Regular theory Main is still
1914 available, as trivial extension of Main_ZF.
1919 * ML within Isar: antiquotation @{const name} or @{const
1920 name(typargs)} produces statically-checked Const term.
1922 * Functor NamedThmsFun: data is available to the user as dynamic fact
1923 (of the same name). Removed obsolete print command.
1925 * Removed obsolete "use_legacy_bindings" function.
1927 * The ``print mode'' is now a thread-local value derived from a global
1928 template (the former print_mode reference), thus access becomes
1929 non-critical. The global print_mode reference is for session
1930 management only; user-code should use print_mode_value,
1931 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1933 * Functions system/system_out provide a robust way to invoke external
1934 shell commands, with propagation of interrupts (requires Poly/ML
1935 5.2.1). Do not use OS.Process.system etc. from the basis library!
1940 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
1941 in accordance with Proof General 3.7, which prefers GNU emacs.
1943 * isatool tty runs Isabelle process with plain tty interaction;
1944 optional line editor may be specified via ISABELLE_LINE_EDITOR
1945 setting, the default settings attempt to locate "ledit" and "rlwrap".
1947 * isatool browser now works with Cygwin as well, using general
1948 "javapath" function defined in Isabelle process environment.
1950 * YXML notation provides a simple and efficient alternative to
1951 standard XML transfer syntax. See src/Pure/General/yxml.ML and
1952 isatool yxml as described in the Isabelle system manual.
1954 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
1955 provides general wrapper for managing an Isabelle process in a robust
1956 fashion, with ``cooked'' output from stdin/stderr.
1958 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
1959 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
1961 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
1962 way of changing the user's settings is via
1963 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
1966 * Multithreading.max_threads := 0 refers to the number of actual CPU
1967 cores of the underlying machine, which is a good starting point for
1968 optimal performance tuning. The corresponding usedir option -M allows
1969 "max" as an alias for "0". WARNING: does not work on certain versions
1970 of Mac OS (with Poly/ML 5.1).
1972 * isabelle-process: non-ML sessions are run with "nice", to reduce the
1973 adverse effect of Isabelle flooding interactive front-ends (notably
1974 ProofGeneral / XEmacs).
1978 New in Isabelle2007 (November 2007)
1979 -----------------------------------
1983 * More uniform information about legacy features, notably a
1984 warning/error of "Legacy feature: ...", depending on the state of the
1985 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
1986 legacy features will disappear eventually.
1988 * Theory syntax: the header format ``theory A = B + C:'' has been
1989 discontinued in favour of ``theory A imports B C begin''. Use isatool
1990 fixheaders to convert existing theory files. INCOMPATIBILITY.
1992 * Theory syntax: the old non-Isar theory file format has been
1993 discontinued altogether. Note that ML proof scripts may still be used
1994 with Isar theories; migration is usually quite simple with the ML
1995 function use_legacy_bindings. INCOMPATIBILITY.
1997 * Theory syntax: some popular names (e.g. 'class', 'declaration',
1998 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2001 * Theory loader: be more serious about observing the static theory
2002 header specifications (including optional directories), but not the
2003 accidental file locations of previously successful loads. The strict
2004 update policy of former update_thy is now already performed by
2005 use_thy, so the former has been removed; use_thys updates several
2006 theories simultaneously, just as 'imports' within a theory header
2007 specification, but without merging the results. Potential
2008 INCOMPATIBILITY: may need to refine theory headers and commands
2009 ROOT.ML which depend on load order.
2011 * Theory loader: optional support for content-based file
2012 identification, instead of the traditional scheme of full physical
2013 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2014 (cf. the system manual). The new scheme allows to work with
2015 non-finished theories in persistent session images, such that source
2016 files may be moved later on without requiring reloads.
2018 * Theory loader: old-style ML proof scripts being *attached* to a thy
2019 file (with the same base name as the theory) are considered a legacy
2020 feature, which will disappear eventually. Even now, the theory loader
2021 no longer maintains dependencies on such files.
2023 * Syntax: the scope for resolving ambiguities via type-inference is
2024 now limited to individual terms, instead of whole simultaneous
2025 specifications as before. This greatly reduces the complexity of the
2026 syntax module and improves flexibility by separating parsing and
2027 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2028 'fixes' etc.) are required in rare situations.
2030 * Syntax: constants introduced by new-style packages ('definition',
2031 'abbreviation' etc.) are passed through the syntax module in
2032 ``authentic mode''. This means that associated mixfix annotations
2033 really stick to such constants, independently of potential name space
2034 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2035 trees are represented slightly differently, may need to adapt syntax
2036 translations accordingly. Use CONST marker in 'translations' and
2037 @{const_syntax} antiquotation in 'parse_translation' etc.
2039 * Legacy goal package: reduced interface to the bare minimum required
2040 to keep existing proof scripts running. Most other user-level
2041 functions are now part of the OldGoals structure, which is *not* open
2042 by default (consider isatool expandshort before open OldGoals).
2043 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2044 these tend to cause confusion about the actual goal (!) context being
2045 used here, which is not necessarily the same as the_context().
2047 * Command 'find_theorems': supports "*" wild-card in "name:"
2048 criterion; "with_dups" option. Certain ProofGeneral versions might
2049 support a specific search form (see ProofGeneral/CHANGES).
2051 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2052 by default, which means that "prems" (and also "fixed variables") are
2053 suppressed from proof state output. Note that the ProofGeneral
2054 settings mechanism allows to change and save options persistently, but
2055 older versions of Isabelle will fail to start up if a negative prems
2058 * Local theory targets may be specified by non-nested blocks of
2059 ``context/locale/class ... begin'' followed by ``end''. The body may
2060 contain definitions, theorems etc., including any derived mechanism
2061 that has been implemented on top of these primitives. This concept
2062 generalizes the existing ``theorem (in ...)'' towards more versatility
2065 * Proof General interface: proper undo of final 'end' command;
2066 discontinued Isabelle/classic mode (ML proof scripts).
2069 *** Document preparation ***
2071 * Added antiquotation @{theory name} which prints the given name,
2072 after checking that it refers to a valid ancestor theory in the
2075 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2076 check the given source text as ML type/structure, printing verbatim.
2078 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2079 "c args == rhs" given in the current context. (Any number of
2080 arguments may be given on the LHS.)
2085 * The 'class' package offers a combination of axclass and locale to
2086 achieve Haskell-like type classes in Isabelle. Definitions and
2087 theorems within a class context produce both relative results (with
2088 implicit parameters according to the locale context), and polymorphic
2089 constants with qualified polymorphism (according to the class
2090 context). Within the body context of a 'class' target, a separate
2091 syntax layer ("user space type system") takes care of converting
2092 between global polymorphic consts and internal locale representation.
2093 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2094 "isatool doc classes" provides a tutorial.
2096 * Generic code generator framework allows to generate executable
2097 code for ML and Haskell (including Isabelle classes). A short usage
2100 internal compilation:
2101 export_code <list of constants (term syntax)> in SML
2102 writing SML code to a file:
2103 export_code <list of constants (term syntax)> in SML <filename>
2104 writing OCaml code to a file:
2105 export_code <list of constants (term syntax)> in OCaml <filename>
2106 writing Haskell code to a bunch of files:
2107 export_code <list of constants (term syntax)> in Haskell <filename>
2109 evaluating closed propositions to True/False using code generation:
2112 Reasonable default setup of framework in HOL.
2114 Theorem attributs for selecting and transforming function equations theorems:
2116 [code fun]: select a theorem as function equation for a specific constant
2117 [code fun del]: deselect a theorem as function equation for a specific constant
2118 [code inline]: select an equation theorem for unfolding (inlining) in place
2119 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2121 User-defined serializations (target in {SML, OCaml, Haskell}):
2123 code_const <and-list of constants (term syntax)>
2124 {(target) <and-list of const target syntax>}+
2126 code_type <and-list of type constructors>
2127 {(target) <and-list of type target syntax>}+
2129 code_instance <and-list of instances>
2131 where instance ::= <type constructor> :: <class>
2133 code_class <and_list of classes>
2134 {(target) <and-list of class target syntax>}+
2135 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2137 code_instance and code_class only are effective to target Haskell.
2139 For example usage see src/HOL/ex/Codegenerator.thy and
2140 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2141 generation from Isabelle/HOL theories is available via "isatool doc
2144 * Code generator: consts in 'consts_code' Isar commands are now
2145 referred to by usual term syntax (including optional type
2148 * Command 'no_translations' removes translation rules from theory
2151 * Overloaded definitions are now actually checked for acyclic
2152 dependencies. The overloading scheme is slightly more general than
2153 that of Haskell98, although Isabelle does not demand an exact
2154 correspondence to type class and instance declarations.
2155 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2156 exotic versions of overloading -- at the discretion of the user!
2158 Polymorphic constants are represented via type arguments, i.e. the
2159 instantiation that matches an instance against the most general
2160 declaration given in the signature. For example, with the declaration
2161 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2162 as c(nat). Overloading is essentially simultaneous structural
2163 recursion over such type arguments. Incomplete specification patterns
2164 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2165 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2166 Command 'print_theory' outputs the normalized system of recursive
2167 equations, see section "definitions".
2169 * Configuration options are maintained within the theory or proof
2170 context (with name and type bool/int/string), providing a very simple
2171 interface to a poor-man's version of general context data. Tools may
2172 declare options in ML (e.g. using Attrib.config_int) and then refer to
2173 these values using Config.get etc. Users may change options via an
2174 associated attribute of the same name. This form of context
2175 declaration works particularly well with commands 'declare' or
2176 'using', for example ``declare [[foo = 42]]''. Thus it has become
2177 very easy to avoid global references, which would not observe Isar
2178 toplevel undo/redo and fail to work with multithreading.
2180 Various global ML references of Pure and HOL have been turned into
2181 configuration options:
2183 Unify.search_bound unify_search_bound
2184 Unify.trace_bound unify_trace_bound
2185 Unify.trace_simp unify_trace_simp
2186 Unify.trace_types unify_trace_types
2187 Simplifier.simp_depth_limit simp_depth_limit
2188 Blast.depth_limit blast_depth_limit
2189 DatatypeProp.dtK datatype_distinctness_limit
2190 fast_arith_neq_limit fast_arith_neq_limit
2191 fast_arith_split_limit fast_arith_split_limit
2193 * Named collections of theorems may be easily installed as context
2194 data using the functor NamedThmsFun (see also
2195 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2196 attributes; there is also a toplevel print command. This facility is
2197 just a common case of general context data, which is the preferred way
2198 for anything more complex than just a list of facts in canonical
2201 * Isar: command 'declaration' augments a local theory by generic
2202 declaration functions written in ML. This enables arbitrary content
2203 being added to the context, depending on a morphism that tells the
2204 difference of the original declaration context wrt. the application
2205 context encountered later on.
2207 * Isar: proper interfaces for simplification procedures. Command
2208 'simproc_setup' declares named simprocs (with match patterns, and body
2209 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2210 context. ML antiquotation @{simproc name} retrieves named simprocs.
2212 * Isar: an extra pair of brackets around attribute declarations
2213 abbreviates a theorem reference involving an internal dummy fact,
2214 which will be ignored later --- only the effect of the attribute on
2215 the background context will persist. This form of in-place
2216 declarations is particularly useful with commands like 'declare' and
2217 'using', for example ``have A using [[simproc a]] by simp''.
2219 * Isar: method "assumption" (and implicit closing of subproofs) now
2220 takes simple non-atomic goal assumptions into account: after applying
2221 an assumption as a rule the resulting subgoals are solved by atomic
2222 assumption steps. This is particularly useful to finish 'obtain'
2223 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2224 without referring to the original premise "!!x. P x ==> thesis" in the
2225 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2228 * Isar: implicit use of prems from the Isar proof context is
2229 considered a legacy feature. Common applications like ``have A .''
2230 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2231 referencing facts explicitly here improves readability and
2232 maintainability of proof texts.
2234 * Isar: improper proof element 'guess' is like 'obtain', but derives
2235 the obtained context from the course of reasoning! For example:
2237 assume "EX x y. A x & B y" -- "any previous fact"
2238 then guess x and y by clarify
2240 This technique is potentially adventurous, depending on the facts and
2241 proof tools being involved here.
2243 * Isar: known facts from the proof context may be specified as literal
2244 propositions, using ASCII back-quote syntax. This works wherever
2245 named facts used to be allowed so far, in proof commands, proof
2246 methods, attributes etc. Literal facts are retrieved from the context
2247 according to unification of type and term parameters. For example,
2248 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2249 theorems in the current context, then these are valid literal facts:
2250 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2252 There is also a proof method "fact" which does the same composition
2253 for explicit goal states, e.g. the following proof texts coincide with
2254 certain special cases of literal facts:
2256 have "A" by fact == note `A`
2257 have "A ==> B" by fact == note `A ==> B`
2258 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2259 have "P a ==> Q a" by fact == note `P a ==> Q a`
2261 * Isar: ":" (colon) is no longer a symbolic identifier character in
2262 outer syntax. Thus symbolic identifiers may be used without
2263 additional white space in declarations like this: ``assume *: A''.
2265 * Isar: 'print_facts' prints all local facts of the current context,
2266 both named and unnamed ones.
2268 * Isar: 'def' now admits simultaneous definitions, e.g.:
2270 def x == "t" and y == "u"
2272 * Isar: added command 'unfolding', which is structurally similar to
2273 'using', but affects both the goal state and facts by unfolding given
2274 rewrite rules. Thus many occurrences of the 'unfold' method or
2275 'unfolded' attribute may be replaced by first-class proof text.
2277 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2278 and command 'unfolding' now all support object-level equalities
2279 (potentially conditional). The underlying notion of rewrite rule is
2280 analogous to the 'rule_format' attribute, but *not* that of the
2281 Simplifier (which is usually more generous).
2283 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2284 premises of a theorem by n. Useful in conjunction with drule.
2286 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2287 method expression within a sandbox consisting of the first N
2288 sub-goals, which need to exist. For example, ``simp_all [3]''
2289 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2290 simplifies all new goals that emerge from applying rule foo to the
2291 originally first one.
2293 * Isar: schematic goals are no longer restricted to higher-order
2294 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2297 * Isar: the conclusion of a long theorem statement is now either
2298 'shows' (a simultaneous conjunction, as before), or 'obtains'
2299 (essentially a disjunction of cases with local parameters and
2300 assumptions). The latter allows to express general elimination rules
2301 adequately; in this notation common elimination rules look like this:
2303 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2305 obtains x where "P x"
2307 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2311 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2317 The subsequent classical rules even refer to the formal "thesis"
2320 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2323 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2324 obtains "thesis ==> something"
2326 The actual proof of an 'obtains' statement is analogous to that of the
2327 Isar proof element 'obtain', only that there may be several cases.
2328 Optional case names may be specified in parentheses; these will be
2329 available both in the present proof and as annotations in the
2330 resulting rule, for later use with the 'cases' method (cf. attribute
2333 * Isar: the assumptions of a long theorem statement are available as
2334 "assms" fact in the proof context. This is more appropriate than the
2335 (historical) "prems", which refers to all assumptions of the current
2336 context, including those from the target locale, proof body etc.
2338 * Isar: 'print_statement' prints theorems from the current theory or
2339 proof context in long statement form, according to the syntax of a
2342 * Isar: 'obtain' takes an optional case name for the local context
2343 introduction rule (default "that").
2345 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2346 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2349 * Pure: syntax "CONST name" produces a fully internalized constant
2350 according to the current context. This is particularly useful for
2351 syntax translations that should refer to internal constant
2352 representations independently of name spaces.
2354 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2355 instead of "FOO ". This allows multiple binder declarations to coexist
2356 in the same context. INCOMPATIBILITY.
2358 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2359 primitive that also works in a locale context (both for constants and
2360 fixed variables). Type declaration and internal syntactic representation
2361 of given constants retrieved from the context. Likewise, the
2362 'no_notation' command allows to remove given syntax annotations from the
2365 * Isar/locales: new derived specification elements 'axiomatization',
2366 'definition', 'abbreviation', which support type-inference, admit
2367 object-level specifications (equality, equivalence). See also the
2368 isar-ref manual. Examples:
2371 eq (infix "===" 50) where
2372 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2374 definition "f x y = x + y + 1"
2375 definition g where "g x = f x x"
2378 neq (infix "=!=" 50) where
2379 "x =!= y == ~ (x === y)"
2381 These specifications may be also used in a locale context. Then the
2382 constants being introduced depend on certain fixed parameters, and the
2383 constant name is qualified by the locale base name. An internal
2384 abbreviation takes care for convenient input and output, making the
2385 parameters implicit and using the original short name. See also
2386 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2387 entities from a monomorphic theory.
2389 Presently, abbreviations are only available 'in' a target locale, but
2390 not inherited by general import expressions. Also note that
2391 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2392 'translations' in common applications. The "no_abbrevs" print mode
2393 prevents folding of abbreviations in term output.
2395 Concrete syntax is attached to specified constants in internal form,
2396 independently of name spaces. The parse tree representation is
2397 slightly different -- use 'notation' instead of raw 'syntax', and
2398 'translations' with explicit "CONST" markup to accommodate this.
2400 * Pure/Isar: unified syntax for new-style specification mechanisms
2401 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2402 full type inference and dummy patterns ("_"). For example:
2404 definition "K x _ = x"
2406 inductive conj for A B
2407 where "A ==> B ==> conj A B"
2409 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2410 the current context. Print mode "no_abbrevs" prevents inversion of
2411 abbreviations on output.
2413 * Isar/locales: improved parameter handling: use of locales "var" and
2414 "struct" no longer necessary; - parameter renamings are no longer
2415 required to be injective. For example, this allows to define
2416 endomorphisms as locale endom = homom mult mult h.
2418 * Isar/locales: changed the way locales with predicates are defined.
2419 Instead of accumulating the specification, the imported expression is
2420 now an interpretation. INCOMPATIBILITY: different normal form of
2421 locale expressions. In particular, in interpretations of locales with
2422 predicates, goals repesenting already interpreted fragments are not
2423 removed automatically. Use methods `intro_locales' and
2424 `unfold_locales'; see below.
2426 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2427 provide backward reasoning on locales predicates. The methods are
2428 aware of interpretations and discharge corresponding goals.
2429 `intro_locales' is less aggressive then `unfold_locales' and does not
2430 unfold predicates to assumptions.
2432 * Isar/locales: the order in which locale fragments are accumulated
2433 has changed. This enables to override declarations from fragments due
2434 to interpretations -- for example, unwanted simp rules.
2436 * Isar/locales: interpretation in theories and proof contexts has been
2437 extended. One may now specify (and prove) equations, which are
2438 unfolded in interpreted theorems. This is useful for replacing
2439 defined concepts (constants depending on locale parameters) by
2440 concepts already existing in the target context. Example:
2442 interpretation partial_order ["op <= :: [int, int] => bool"]
2443 where "partial_order.less (op <=) (x::int) y = (x < y)"
2445 Typically, the constant `partial_order.less' is created by a
2446 definition specification element in the context of locale
2449 * Method "induct": improved internal context management to support
2450 local fixes and defines on-the-fly. Thus explicit meta-level
2451 connectives !! and ==> are rarely required anymore in inductive goals
2452 (using object-logic connectives for this purpose has been long
2453 obsolete anyway). Common proof patterns are explained in
2454 src/HOL/Induct/Common_Patterns.thy, see also
2455 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2458 * Method "induct": improved handling of simultaneous goals. Instead of
2459 introducing object-level conjunction, the statement is now split into
2460 several conclusions, while the corresponding symbolic cases are nested
2461 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2462 see src/HOL/Induct/Common_Patterns.thy, for example.
2464 * Method "induct": mutual induction rules are now specified as a list
2465 of rule sharing the same induction cases. HOL packages usually provide
2466 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2467 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2468 mutual induction rules differently, i.e. like this:
2470 (induct rule: foo_bar.inducts)
2471 (induct set: foo bar)
2472 (induct pred: foo bar)
2473 (induct type: foo bar)
2475 The ML function ProjectRule.projections turns old-style rules into the
2478 * Method "coinduct": dual of induction, see
2479 src/HOL/Library/Coinductive_List.thy for various examples.
2481 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2482 considered a legacy feature.
2484 * Attribute "symmetric" produces result with standardized schematic
2485 variables (index 0). Potential INCOMPATIBILITY.
2487 * Simplifier: by default the simplifier trace only shows top level
2488 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2489 default. Thus there is less danger of being flooded by the trace. The
2490 trace indicates where parts have been suppressed.
2492 * Provers/classical: removed obsolete classical version of elim_format
2493 attribute; classical elim/dest rules are now treated uniformly when
2494 manipulating the claset.
2496 * Provers/classical: stricter checks to ensure that supplied intro,
2497 dest and elim rules are well-formed; dest and elim rules must have at
2500 * Provers/classical: attributes dest/elim/intro take an optional
2501 weight argument for the rule (just as the Pure versions). Weights are
2502 ignored by automated tools, but determine the search order of single
2505 * Syntax: input syntax now supports dummy variable binding "%_. b",
2506 where the body does not mention the bound variable. Note that dummy
2507 patterns implicitly depend on their context of bounds, which makes
2508 "{_. _}" match any set comprehension as expected. Potential
2509 INCOMPATIBILITY -- parse translations need to cope with syntactic
2510 constant "_idtdummy" in the binding position.
2512 * Syntax: removed obsolete syntactic constant "_K" and its associated
2513 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2514 for example "A -> B" => "Pi A (%_. B)".
2516 * Pure: 'class_deps' command visualizes the subclass relation, using
2517 the graph browser tool.
2519 * Pure: 'print_theory' now suppresses certain internal declarations by
2520 default; use '!' option for full details.
2525 * Method "metis" proves goals by applying the Metis general-purpose
2526 resolution prover (see also http://gilith.com/software/metis/).
2527 Examples are in the directory MetisExamples. WARNING: the
2528 Isabelle/HOL-Metis integration does not yet work properly with
2531 * Command 'sledgehammer' invokes external automatic theorem provers as
2532 background processes. It generates calls to the "metis" method if
2533 successful. These can be pasted into the proof. Users do not have to
2534 wait for the automatic provers to return. WARNING: does not really
2535 work with multi-threading.
2537 * New "auto_quickcheck" feature tests outermost goal statements for
2538 potential counter-examples. Controlled by ML references
2539 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2540 5000 milliseconds). Fails silently if statements is outside of
2541 executable fragment, or any other codgenerator problem occurs.
2543 * New constant "undefined" with axiom "undefined x = undefined".
2545 * Added class "HOL.eq", allowing for code generation with polymorphic
2548 * Some renaming of class constants due to canonical name prefixing in
2549 the new 'class' package:
2551 HOL.abs ~> HOL.abs_class.abs
2552 HOL.divide ~> HOL.divide_class.divide
2553 0 ~> HOL.zero_class.zero
2554 1 ~> HOL.one_class.one
2555 op + ~> HOL.plus_class.plus
2556 op - ~> HOL.minus_class.minus
2557 uminus ~> HOL.minus_class.uminus
2558 op * ~> HOL.times_class.times
2559 op < ~> HOL.ord_class.less
2560 op <= > HOL.ord_class.less_eq
2561 Nat.power ~> Power.power_class.power
2562 Nat.size ~> Nat.size_class.size
2563 Numeral.number_of ~> Numeral.number_class.number_of
2564 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2565 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2566 Orderings.min ~> Orderings.ord_class.min
2567 Orderings.max ~> Orderings.ord_class.max
2568 Divides.op div ~> Divides.div_class.div
2569 Divides.op mod ~> Divides.div_class.mod
2570 Divides.op dvd ~> Divides.div_class.dvd
2572 INCOMPATIBILITY. Adaptions may be required in the following cases:
2574 a) User-defined constants using any of the names "plus", "minus",
2575 "times", "less" or "less_eq". The standard syntax translations for
2576 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2579 b) Variables named "plus", "minus", "times", "less", "less_eq"
2580 INCOMPATIBILITY: use more specific names.
2582 c) Permutative equations (e.g. "a + b = b + a")
2583 Since the change of names also changes the order of terms, permutative
2584 rewrite rules may get applied in a different order. Experience shows
2585 that this is rarely the case (only two adaptions in the whole Isabelle
2586 distribution). INCOMPATIBILITY: rewrite proofs
2588 d) ML code directly refering to constant names
2589 This in general only affects hand-written proof tactics, simprocs and
2590 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2591 Consider using @{const_name} antiquotation.
2593 * New class "default" with associated constant "default".
2595 * Function "sgn" is now overloaded and available on int, real, complex
2596 (and other numeric types), using class "sgn". Two possible defs of
2597 sgn are given as equational assumptions in the classes sgn_if and
2598 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2601 * Locale "partial_order" now unified with class "order" (cf. theory
2602 Orderings), added parameter "less". INCOMPATIBILITY.
2604 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2605 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2606 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2608 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2609 changed order of proof goals in instance proofs.
2611 * The transitivity reasoner for partial and linear orders is set up
2612 for classes "order" and "linorder". Instances of the reasoner are available
2613 in all contexts importing or interpreting the corresponding locales.
2614 Method "order" invokes the reasoner separately; the reasoner
2615 is also integrated with the Simplifier as a solver. Diagnostic
2616 command 'print_orders' shows the available instances of the reasoner
2617 in the current context.
2619 * Localized monotonicity predicate in theory "Orderings"; integrated
2620 lemmas max_of_mono and min_of_mono with this predicate.
2623 * Formulation of theorem "dense" changed slightly due to integration
2624 with new class dense_linear_order.
2626 * Uniform lattice theory development in HOL.
2628 constants "meet" and "join" now named "inf" and "sup"
2629 constant "Meet" now named "Inf"
2631 classes "meet_semilorder" and "join_semilorder" now named
2632 "lower_semilattice" and "upper_semilattice"
2633 class "lorder" now named "lattice"
2634 class "comp_lat" now named "complete_lattice"
2636 Instantiation of lattice classes allows explicit definitions
2637 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2639 INCOMPATIBILITY. Theorem renames:
2641 meet_left_le ~> inf_le1
2642 meet_right_le ~> inf_le2
2643 join_left_le ~> sup_ge1
2644 join_right_le ~> sup_ge2
2645 meet_join_le ~> inf_sup_ord
2648 le_meet ~> le_inf_iff
2649 le_join ~> ge_sup_conv
2650 meet_idempotent ~> inf_idem
2651 join_idempotent ~> sup_idem
2652 meet_comm ~> inf_commute
2653 join_comm ~> sup_commute
2654 meet_leI1 ~> le_infI1
2655 meet_leI2 ~> le_infI2
2656 le_joinI1 ~> le_supI1
2657 le_joinI2 ~> le_supI2
2658 meet_assoc ~> inf_assoc
2659 join_assoc ~> sup_assoc
2660 meet_left_comm ~> inf_left_commute
2661 meet_left_idempotent ~> inf_left_idem
2662 join_left_comm ~> sup_left_commute
2663 join_left_idempotent ~> sup_left_idem
2666 le_def_meet ~> le_iff_inf
2667 le_def_join ~> le_iff_sup
2668 join_absorp2 ~> sup_absorb2
2669 join_absorp1 ~> sup_absorb1
2670 meet_absorp1 ~> inf_absorb1
2671 meet_absorp2 ~> inf_absorb2
2672 meet_join_absorp ~> inf_sup_absorb
2673 join_meet_absorp ~> sup_inf_absorb
2674 distrib_join_le ~> distrib_sup_le
2675 distrib_meet_le ~> distrib_inf_le
2677 add_meet_distrib_left ~> add_inf_distrib_left
2678 add_join_distrib_left ~> add_sup_distrib_left
2679 is_join_neg_meet ~> is_join_neg_inf
2680 is_meet_neg_join ~> is_meet_neg_sup
2681 add_meet_distrib_right ~> add_inf_distrib_right
2682 add_join_distrib_right ~> add_sup_distrib_right
2683 add_meet_join_distribs ~> add_sup_inf_distribs
2684 join_eq_neg_meet ~> sup_eq_neg_inf
2685 meet_eq_neg_join ~> inf_eq_neg_sup
2686 add_eq_meet_join ~> add_eq_inf_sup
2687 meet_0_imp_0 ~> inf_0_imp_0
2688 join_0_imp_0 ~> sup_0_imp_0
2689 meet_0_eq_0 ~> inf_0_eq_0
2690 join_0_eq_0 ~> sup_0_eq_0
2691 neg_meet_eq_join ~> neg_inf_eq_sup
2692 neg_join_eq_meet ~> neg_sup_eq_inf
2693 join_eq_if ~> sup_eq_if
2695 mono_meet ~> mono_inf
2696 mono_join ~> mono_sup
2697 meet_bool_eq ~> inf_bool_eq
2698 join_bool_eq ~> sup_bool_eq
2699 meet_fun_eq ~> inf_fun_eq
2700 join_fun_eq ~> sup_fun_eq
2701 meet_set_eq ~> inf_set_eq
2702 join_set_eq ~> sup_set_eq
2703 meet1_iff ~> inf1_iff
2704 meet2_iff ~> inf2_iff
2713 join1_iff ~> sup1_iff
2714 join2_iff ~> sup2_iff
2724 is_meet_Meet ~> is_meet_Inf
2725 Meet_bool_def ~> Inf_bool_def
2726 Meet_fun_def ~> Inf_fun_def
2727 Meet_greatest ~> Inf_greatest
2728 Meet_lower ~> Inf_lower
2729 Meet_set_def ~> Inf_set_def
2732 Sup_bool_eq ~> Sup_bool_def
2733 Sup_fun_eq ~> Sup_fun_def
2734 Sup_set_eq ~> Sup_set_def
2736 listsp_meetI ~> listsp_infI
2737 listsp_meet_eq ~> listsp_inf_eq
2742 * Added syntactic class "size"; overloaded constant "size" now has
2743 type "'a::size ==> bool"
2745 * Internal reorganisation of `size' of datatypes: size theorems
2746 "foo.size" are no longer subsumed by "foo.simps" (but are still
2747 simplification rules by default!); theorems "prod.size" now named
2750 * Class "div" now inherits from class "times" rather than "type".
2753 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2754 Linorder etc. have disappeared; operations defined in terms of
2755 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2757 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2759 * HOL-Word: New extensive library and type for generic, fixed size
2760 machine words, with arithemtic, bit-wise, shifting and rotating
2761 operations, reflection into int, nat, and bool lists, automation for
2762 linear arithmetic (by automatic reflection into nat or int), including
2763 lemmas on overflow and monotonicity. Instantiated to all appropriate
2764 arithmetic type classes, supporting automatic simplification of
2765 numerals on all operations.
2767 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2769 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2771 * Code generator library theories:
2772 - Code_Integer represents HOL integers by big integer literals in target
2774 - Code_Char represents HOL characters by character literals in target
2776 - Code_Char_chr like Code_Char, but also offers treatment of character
2777 codes; includes Code_Integer.
2778 - Executable_Set allows to generate code for finite sets using lists.
2779 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2781 - Executable_Real implements a subset of real numbers, namly those
2782 representable by rational numbers.
2783 - Efficient_Nat implements natural numbers by integers, which in general will
2784 result in higher efficency; pattern matching with 0/Suc is eliminated;
2785 includes Code_Integer.
2786 - Code_Index provides an additional datatype index which is mapped to
2787 target-language built-in integers.
2788 - Code_Message provides an additional datatype message_string which is isomorphic to
2789 strings; messages are mapped to target-language strings.
2791 * New package for inductive predicates
2793 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2796 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2797 for z_1 :: U_1 and ... and z_n :: U_m
2799 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2802 with full support for type-inference, rather than
2804 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2806 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2807 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2809 inductive "s z_1 ... z_m"
2811 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2814 For backward compatibility, there is a wrapper allowing inductive
2815 sets to be defined with the new package via
2818 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2819 for z_1 :: U_1 and ... and z_n :: U_m
2821 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2827 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2828 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2829 for z_1 :: U_1 and ... and z_n :: U_m
2831 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2832 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2835 if the additional syntax "p ..." is required.
2837 Numerous examples can be found in the subdirectories src/HOL/Auth,
2838 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2842 - Since declaration and definition of inductive sets or predicates
2843 is no longer separated, abbreviations involving the newly
2844 introduced sets or predicates must be specified together with the
2845 introduction rules after the 'where' keyword (see above), rather
2846 than before the actual inductive definition.
2848 - The variables in induction and elimination rules are now
2849 quantified in the order of their occurrence in the introduction
2850 rules, rather than in alphabetical order. Since this may break
2851 some proofs, these proofs either have to be repaired, e.g. by
2852 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2853 statements of the form
2855 case (rule_i a_i_1 ... a_i_{k_i})
2857 or the old order of quantification has to be restored by explicitly adding
2858 meta-level quantifiers in the introduction rules, i.e.
2860 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2862 - The format of the elimination rules is now
2864 p z_1 ... z_m x_1 ... x_n ==>
2865 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2870 (x_1, ..., x_n) : s z_1 ... z_m ==>
2871 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2874 for sets rather than
2876 x : s z_1 ... z_m ==>
2877 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2880 This may require terms in goals to be expanded to n-tuples
2881 (e.g. using case_tac or simplification with the split_paired_all
2882 rule) before the above elimination rule is applicable.
2884 - The elimination or case analysis rules for (mutually) inductive
2885 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2886 list of rules "p_1_..._p_k.elims" is no longer available.
2888 * New package "function"/"fun" for general recursive functions,
2889 supporting mutual and nested recursion, definitions in local contexts,
2890 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2891 for small examples, and the separate tutorial on the function
2892 package. The old recdef "package" is still available as before, but
2893 users are encouraged to use the new package.
2895 * Method "lexicographic_order" automatically synthesizes termination
2896 relations as lexicographic combinations of size measures.
2898 * Case-expressions allow arbitrary constructor-patterns (including
2899 "_") and take their order into account, like in functional
2900 programming. Internally, this is translated into nested
2901 case-expressions; missing cases are added and mapped to the predefined
2902 constant "undefined". In complicated cases printing may no longer show
2903 the original input but the internal form. Lambda-abstractions allow
2904 the same form of pattern matching: "% pat1 => e1 | ..." is an
2905 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2908 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2909 is an abbreviation for "of_nat :: nat => int". The simplification
2910 rules for "of_nat" have been changed to work like "int" did
2911 previously. Potential INCOMPATIBILITY:
2912 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2913 - of_nat_diff and of_nat_mult are no longer default simp rules
2915 * Method "algebra" solves polynomial equations over (semi)rings using
2916 Groebner bases. The (semi)ring structure is defined by locales and the
2917 tool setup depends on that generic context. Installing the method for
2918 a specific type involves instantiating the locale and possibly adding
2919 declarations for computation on the coefficients. The method is
2920 already instantiated for natural numbers and for the axiomatic class
2921 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2922 CALCULEMUS 2007 for the general principles underlying this
2923 architecture of context-aware proof-tools.
2925 * Method "ferrack" implements quantifier elimination over
2926 special-purpose dense linear orders using locales (analogous to
2927 "algebra"). The method is already installed for class
2928 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2931 * Former constant "List.op @" now named "List.append". Use ML
2932 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2933 circumvent possible incompatibilities when working on ML level.
2935 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
2937 * New function listsum :: 'a list => 'a for arbitrary monoids.
2938 Special syntax: "SUM x <- xs. f x" (and latex variants)
2940 * New syntax for Haskell-like list comprehension (input only), eg.
2941 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
2943 * The special syntax for function "filter" has changed from [x :
2944 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
2945 comprehension syntax, and for uniformity. INCOMPATIBILITY.
2947 * [a..b] is now defined for arbitrary linear orders. It used to be
2948 defined on nat only, as an abbreviation for [a..<Suc b]
2951 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
2953 * New functions "sorted" and "sort" in src/HOL/List.thy.
2955 * New lemma collection field_simps (an extension of ring_simps) for
2956 manipulating (in)equations involving division. Multiplies with all
2957 denominators that can be proved to be non-zero (in equations) or
2958 positive/negative (in inequations).
2960 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
2961 have been improved and renamed to ring_simps, group_simps and
2962 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
2963 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
2965 * Theory Library/Commutative_Ring: switched from recdef to function
2966 package; constants add, mul, pow now curried. Infix syntax for
2967 algebraic operations.
2969 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
2972 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
2975 * HOL/records: generalised field-update to take a function on the
2976 field rather than the new value: r(|A := x|) is translated to A_update
2977 (K x) r The K-combinator that is internally used is called K_record.
2978 INCOMPATIBILITY: Usage of the plain update functions has to be
2981 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
2982 * x = 0, which are required for a semiring. Richer structures do not
2983 inherit from semiring_0 anymore, because this property is a theorem
2984 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
2985 there is more to prove, but this is mostly trivial.
2987 * Class "recpower" is generalized to arbitrary monoids, not just
2988 commutative semirings. INCOMPATIBILITY: may need to incorporate
2989 commutativity or semiring properties additionally.
2991 * Constant "List.list_all2" in List.thy now uses authentic syntax.
2992 INCOMPATIBILITY: translations containing list_all2 may go wrong,
2993 better use 'abbreviation'.
2995 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
2997 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
2998 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
2999 significant changes for setting up numeral syntax for types:
3000 - New constants Numeral.pred and Numeral.succ instead
3001 of former Numeral.bin_pred and Numeral.bin_succ.
3002 - Use integer operations instead of bin_add, bin_mult and so on.
3003 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3004 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3006 See src/HOL/Integ/IntArith.thy for an example setup.
3008 * Command 'normal_form' computes the normal form of a term that may
3009 contain free variables. For example ``normal_form "rev [a, b, c]"''
3010 produces ``[b, c, a]'' (without proof). This command is suitable for
3011 heavy-duty computations because the functions are compiled to ML
3012 first. Correspondingly, a method "normalization" is provided. See
3013 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3015 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3016 25 like -->); output depends on the "iff" print_mode, the default is
3017 "A = B" (with priority 50).
3019 * Relations less (<) and less_eq (<=) are also available on type bool.
3020 Modified syntax to disallow nesting without explicit parentheses,
3021 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3024 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3026 * Relation composition operator "op O" now has precedence 75 and binds
3027 stronger than union and intersection. INCOMPATIBILITY.
3029 * The old set interval syntax "{m..n(}" (and relatives) has been
3030 removed. Use "{m..<n}" (and relatives) instead.
3032 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3033 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3034 ``declare [[simproc del: neq]]''.
3036 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3039 * Theorem Cons_eq_map_conv no longer declared as "simp".
3041 * Theorem setsum_mult renamed to setsum_right_distrib.
3043 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3046 * Reimplemented methods "sat" and "satx", with several improvements:
3047 goals no longer need to be stated as "<prems> ==> False", equivalences
3048 (i.e. "=" on type bool) are handled, variable names of the form
3049 "lit_<n>" are no longer reserved, significant speedup.
3051 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3052 zChaff is still supported as well.
3054 * 'inductive' and 'datatype': provide projections of mutual rules,
3055 bundled as foo_bar.inducts;
3057 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3060 * Library: moved theory Accessible_Part to main HOL.
3062 * Library: added theory Coinductive_List of potentially infinite lists
3063 as greatest fixed-point.
3065 * Library: added theory AssocList which implements (finite) maps as
3068 * Method "evaluation" solves goals (i.e. a boolean expression)
3069 efficiently by compiling it to ML. The goal is "proved" (via an
3070 oracle) if it evaluates to True.
3072 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3073 also when invoked by the simplifier. This results in the Simplifier
3074 being more powerful on arithmetic goals. INCOMPATIBILITY.
3075 Configuration option fast_arith_split_limit=0 recovers the old
3078 * Support for hex (0x20) and binary (0b1001) numerals.
3080 * New method: reify eqs (t), where eqs are equations for an
3081 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3082 parameter, computes a term s::'b and a list xs::'a list and proves the
3083 theorem I xs s = t. This is also known as reification or quoting. The
3084 resulting theorem is applied to the subgoal to substitute t with I xs
3085 s. If t is omitted, the subgoal itself is reified.
3087 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3088 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3089 where f is supposed to be a computable function (in the sense of code
3090 generattion). The method uses reify to compute s and xs as above then
3091 applies corr_thm and uses normalization by evaluation to "prove" f s =
3092 r and finally gets the theorem t = r, which is again applied to the
3093 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3095 * Reflection: Automatic reification now handels binding, an example is
3096 available in src/HOL/ex/ReflectionEx.thy
3098 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3099 command 'statespace' that is similar to 'record', but introduces an
3100 abstract specification based on the locale infrastructure instead of
3101 HOL types. This leads to extra flexibility in composing state spaces,
3102 in particular multiple inheritance and renaming of components.
3107 * Hyperreal: Functions root and sqrt are now defined on negative real
3108 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3109 Nonnegativity side conditions have been removed from many lemmas, so
3110 that more subgoals may now be solved by simplification; potential
3113 * Real: new type classes formalize real normed vector spaces and
3114 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3115 and norm :: 'a => real.
3117 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3118 reals into other types. The overloaded constant Reals :: 'a set is now
3119 defined as range of_real; potential INCOMPATIBILITY.
3121 * Real: proper support for ML code generation, including 'quickcheck'.
3122 Reals are implemented as arbitrary precision rationals.
3124 * Hyperreal: Several constants that previously worked only for the
3125 reals have been generalized, so they now work over arbitrary vector
3126 spaces. Type annotations may need to be added in some cases; potential
3129 Infinitesimal :: ('a::real_normed_vector) star set
3130 HFinite :: ('a::real_normed_vector) star set
3131 HInfinite :: ('a::real_normed_vector) star set
3132 approx :: ('a::real_normed_vector) star => 'a star => bool
3133 monad :: ('a::real_normed_vector) star => 'a star set
3134 galaxy :: ('a::real_normed_vector) star => 'a star set
3135 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3136 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3137 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3138 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3139 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3140 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3141 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3142 sgn :: 'a::real_normed_vector => 'a
3143 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3145 * Complex: Some complex-specific constants are now abbreviations for
3146 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3147 hnorm. Other constants have been entirely removed in favor of the
3148 polymorphic versions (INCOMPATIBILITY):
3152 HInfinite <-- CInfinite
3153 Infinitesimal <-- CInfinitesimal
3156 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3157 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3158 (ns)deriv <-- (ns)cderiv
3163 * Formalisation of ideals and the quotient construction over rings.
3165 * Order and lattice theory no longer based on records.
3168 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3169 greatest_closed. INCOMPATIBILITY.
3171 * Method algebra is now set up via an attribute. For examples see
3172 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3173 of algebraic structures.
3175 * Renamed theory CRing to Ring.
3180 * Substantial, yet incomplete support for nominal datatypes (binding
3181 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3182 src/HOL/Nominal/Examples. Prospective users should consult
3183 http://isabelle.in.tum.de/nominal/
3188 * ML basics: just one true type int, which coincides with IntInf.int
3191 * ML within Isar: antiquotations allow to embed statically-checked
3192 formal entities in the source, referring to the context available at
3193 compile-time. For example:
3195 ML {* @{sort "{zero,one}"} *}
3196 ML {* @{typ "'a => 'b"} *}
3197 ML {* @{term "%x. x"} *}
3198 ML {* @{prop "x == y"} *}
3199 ML {* @{ctyp "'a => 'b"} *}
3200 ML {* @{cterm "%x. x"} *}
3201 ML {* @{cprop "x == y"} *}
3202 ML {* @{thm asm_rl} *}
3203 ML {* @{thms asm_rl} *}
3204 ML {* @{type_name c} *}
3205 ML {* @{type_syntax c} *}
3206 ML {* @{const_name c} *}
3207 ML {* @{const_syntax c} *}
3210 ML {* @{theory Pure} *}
3211 ML {* @{theory_ref} *}
3212 ML {* @{theory_ref Pure} *}
3215 ML {* @{clasimpset} *}
3217 The same works for sources being ``used'' within an Isar context.
3219 * ML in Isar: improved error reporting; extra verbosity with
3220 ML_Context.trace enabled.
3222 * Pure/General/table.ML: the join operations now works via exceptions
3223 DUP/SAME instead of type option. This is simpler in simple cases, and
3224 admits slightly more efficient complex applications.
3226 * Pure: 'advanced' translation functions (parse_translation etc.) now
3227 use Context.generic instead of just theory.
3229 * Pure: datatype Context.generic joins theory/Proof.context and
3230 provides some facilities for code that works in either kind of
3231 context, notably GenericDataFun for uniform theory and proof data.
3233 * Pure: simplified internal attribute type, which is now always
3234 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3235 local (Proof.context) attributes have been discontinued, while
3236 minimizing code duplication. Thm.rule_attribute and
3237 Thm.declaration_attribute build canonical attributes; see also structure
3238 Context for further operations on Context.generic, notably
3239 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3240 declarations and definitions.
3242 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3243 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3244 init only required for impure data. INCOMPATIBILITY: empty really need
3245 to be empty (no dependencies on theory content!)
3247 * Pure/kernel: consts certification ignores sort constraints given in
3248 signature declarations. (This information is not relevant to the
3249 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3250 potential INCOMPATIBILITY.
3252 * Pure: axiomatic type classes are now purely definitional, with
3253 explicit proofs of class axioms and super class relations performed
3254 internally. See Pure/axclass.ML for the main internal interfaces --
3255 notably AxClass.define_class supercedes AxClass.add_axclass, and
3256 AxClass.axiomatize_class/classrel/arity supersede
3257 Sign.add_classes/classrel/arities.
3259 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3260 global/local versions on theory vs. Proof.context have been
3261 discontinued; Attrib.syntax and Method.syntax have been adapted
3262 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3263 attributes, methods, etc.
3265 * Pure: several functions of signature "... -> theory -> theory * ..."
3266 have been reoriented to "... -> theory -> ... * theory" in order to
3267 allow natural usage in combination with the ||>, ||>>, |-> and
3268 fold_map combinators.
3270 * Pure: official theorem names (closed derivations) and additional
3271 comments (tags) are now strictly separate. Name hints -- which are
3272 maintained as tags -- may be attached any time without affecting the
3275 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3276 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3277 achieve the old behaviour.
3279 * Pure: the "Goal" constant is now called "prop", supporting a
3280 slightly more general idea of ``protecting'' meta-level rule
3283 * Pure: Logic.(un)varify only works in a global context, which is now
3284 enforced instead of silently assumed. INCOMPATIBILITY, may use
3285 Logic.legacy_(un)varify as temporary workaround.
3287 * Pure: structure Name provides scalable operations for generating
3288 internal variable names, notably Name.variants etc. This replaces
3289 some popular functions from term.ML:
3291 Term.variant -> Name.variant
3292 Term.variantlist -> Name.variant_list
3293 Term.invent_names -> Name.invent_list
3295 Note that low-level renaming rarely occurs in new code -- operations
3296 from structure Variable are used instead (see below).
3298 * Pure: structure Variable provides fundamental operations for proper
3299 treatment of fixed/schematic variables in a context. For example,
3300 Variable.import introduces fixes for schematics of given facts and
3301 Variable.export reverses the effect (up to renaming) -- this replaces
3302 various freeze_thaw operations.
3304 * Pure: structure Goal provides simple interfaces for
3305 init/conclude/finish and tactical prove operations (replacing former
3306 Tactic.prove). Goal.prove is the canonical way to prove results
3307 within a given context; Goal.prove_global is a degraded version for
3308 theory level goals, including a global Drule.standard. Note that
3309 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3310 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3311 in a locale context).
3313 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3314 and type checking (Syntax.check_term etc.), with common combinations
3315 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3316 which are considered legacy and await removal.
3318 * Pure/Syntax: generic interfaces for type unchecking
3319 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3320 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3321 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3322 available for convenience, but refer to the very same operations using
3323 a mere theory instead of a full context.
3325 * Isar: simplified treatment of user-level errors, using exception
3326 ERROR of string uniformly. Function error now merely raises ERROR,
3327 without any side effect on output channels. The Isar toplevel takes
3328 care of proper display of ERROR exceptions. ML code may use plain
3329 handle/can/try; cat_error may be used to concatenate errors like this:
3331 ... handle ERROR msg => cat_error msg "..."
3333 Toplevel ML code (run directly or through the Isar toplevel) may be
3334 embedded into the Isar toplevel with exception display/debug like
3337 Isar.toplevel (fn () => ...)
3339 INCOMPATIBILITY, removed special transform_error facilities, removed
3340 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3341 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3342 -- use plain ERROR instead.
3344 * Isar: theory setup now has type (theory -> theory), instead of a
3345 list. INCOMPATIBILITY, may use #> to compose setup functions.
3347 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3348 ProofContext.debug/verbose flags.
3350 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3351 theory before entering a proof state. Transactions now always see a
3352 quasi-functional intermediate checkpoint, both in interactive and
3355 * Isar: simplified interfaces for outer syntax. Renamed
3356 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3357 OuterSyntax.add_parsers -- this functionality is now included in
3358 OuterSyntax.command etc. INCOMPATIBILITY.
3360 * Simplifier: the simpset of a running simplification process now
3361 contains a proof context (cf. Simplifier.the_context), which is the
3362 very context that the initial simpset has been retrieved from (by
3363 simpset_of/local_simpset_of). Consequently, all plug-in components
3364 (solver, looper etc.) may depend on arbitrary proof data.
3366 * Simplifier.inherit_context inherits the proof context (plus the
3367 local bounds) of the current simplification process; any simproc
3368 etc. that calls the Simplifier recursively should do this! Removed
3369 former Simplifier.inherit_bounds, which is already included here --
3370 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3371 specify an explicit context using Simplifier.context/theory_context.
3373 * Simplifier/Classical Reasoner: more abstract interfaces
3374 change_simpset/claset for modifying the simpset/claset reference of a
3375 theory; raw versions simpset/claset_ref etc. have been discontinued --
3378 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3384 * settings: the default heap location within ISABELLE_HOME_USER now
3385 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3386 Isabelle installations.
3388 * isabelle-process: option -S (secure mode) disables some critical
3389 operations, notably runtime compilation and evaluation of ML source
3392 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3394 * Support for parallel execution, using native multicore support of
3395 Poly/ML 5.1. The theory loader exploits parallelism when processing
3396 independent theories, according to the given theory header
3397 specifications. The maximum number of worker threads is specified via
3398 usedir option -M or the "max-threads" setting in Proof General. A
3399 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3400 to 6 on a 8-core machine. User-code needs to observe certain
3401 guidelines for thread-safe programming, see appendix A in the Isar
3402 Implementation manual.
3406 New in Isabelle2005 (October 2005)
3407 ----------------------------------
3411 * Theory headers: the new header syntax for Isar theories is
3414 imports <theory1> ... <theoryN>
3415 uses <file1> ... <fileM>
3418 where the 'uses' part is optional. The previous syntax
3420 theory <name> = <theory1> + ... + <theoryN>:
3422 will disappear in the next release. Use isatool fixheaders to convert
3423 existing theory files. Note that there is no change in ancient
3424 non-Isar theories now, but these will disappear soon.
3426 * Theory loader: parent theories can now also be referred to via
3427 relative and absolute paths.
3429 * Command 'find_theorems' searches for a list of criteria instead of a
3430 list of constants. Known criteria are: intro, elim, dest, name:string,
3431 simp:term, and any term. Criteria can be preceded by '-' to select
3432 theorems that do not match. Intro, elim, dest select theorems that
3433 match the current goal, name:s selects theorems whose fully qualified
3434 name contain s, and simp:term selects all simplification rules whose
3435 lhs match term. Any other term is interpreted as pattern and selects
3436 all theorems matching the pattern. Available in ProofGeneral under
3437 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3439 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3441 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3442 matching the current goal as introduction rule and not having "HOL."
3443 in their name (i.e. not being defined in theory HOL).
3445 * Command 'thms_containing' has been discontinued in favour of
3446 'find_theorems'; INCOMPATIBILITY.
3448 * Communication with Proof General is now 8bit clean, which means that
3449 Unicode text in UTF-8 encoding may be used within theory texts (both
3450 formal and informal parts). Cf. option -U of the Isabelle Proof
3451 General interface. Here are some simple examples (cf. src/HOL/ex):
3453 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3454 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3456 * Improved efficiency of the Simplifier and, to a lesser degree, the
3457 Classical Reasoner. Typical big applications run around 2 times
3461 *** Document preparation ***
3463 * Commands 'display_drafts' and 'print_drafts' perform simple output
3464 of raw sources. Only those symbols that do not require additional
3465 LaTeX packages (depending on comments in isabellesym.sty) are
3466 displayed properly, everything else is left verbatim. isatool display
3467 and isatool print are used as front ends (these are subject to the
3468 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3470 * Command tags control specific markup of certain regions of text,
3471 notably folding and hiding. Predefined tags include "theory" (for
3472 theory begin and end), "proof" for proof commands, and "ML" for
3473 commands involving ML code; the additional tags "visible" and
3474 "invisible" are unused by default. Users may give explicit tag
3475 specifications in the text, e.g. ''by %invisible (auto)''. The
3476 interpretation of tags is determined by the LaTeX job during document
3477 preparation: see option -V of isatool usedir, or options -n and -t of
3478 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3481 Several document versions may be produced at the same time via isatool
3482 usedir (the generated index.html will link all of them). Typical
3483 specifications include ''-V document=theory,proof,ML'' to present
3484 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3485 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3486 these parts without any formal replacement text. The Isabelle site
3487 default settings produce ''document'' and ''outline'' versions as
3490 * Several new antiquotations:
3492 @{term_type term} prints a term with its type annotated;
3494 @{typeof term} prints the type of a term;
3496 @{const const} is the same as @{term const}, but checks that the
3497 argument is a known logical constant;
3499 @{term_style style term} and @{thm_style style thm} print a term or
3500 theorem applying a "style" to it
3504 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3505 definitions, equations, inequations etc., 'concl' printing only the
3506 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3507 to print the specified premise. TermStyle.add_style provides an ML
3508 interface for introducing further styles. See also the "LaTeX Sugar"
3509 document practical applications. The ML antiquotation prints
3510 type-checked ML expressions verbatim.
3512 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3513 and 'text' support optional locale specification '(in loc)', which
3514 specifies the default context for interpreting antiquotations. For
3515 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3517 * Option 'locale=NAME' of antiquotations specifies an alternative
3518 context interpreting the subsequent argument. For example: @{thm
3519 [locale=lattice] inf_assoc}.
3521 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3524 * Proper output of antiquotations for theory commands involving a
3525 proof context (such as 'locale' or 'theorem (in loc) ...').
3527 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3528 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3530 * isatool usedir: new option -C (default true) controls whether option
3531 -D should include a copy of the original document directory; -C false
3532 prevents unwanted effects such as copying of administrative CVS data.
3537 * Considerably improved version of 'constdefs' command. Now performs
3538 automatic type-inference of declared constants; additional support for
3539 local structure declarations (cf. locales and HOL records), see also
3540 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3541 sequential dependencies of definitions within a single 'constdefs'
3542 section; moreover, the declared name needs to be an identifier. If
3543 all fails, consider to fall back on 'consts' and 'defs' separately.
3545 * Improved indexed syntax and implicit structures. First of all,
3546 indexed syntax provides a notational device for subscripted
3547 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3548 expressions. Secondly, in a local context with structure
3549 declarations, number indexes \<^sub>n or the empty index (default
3550 number 1) refer to a certain fixed variable implicitly; option
3551 show_structs controls printing of implicit structures. Typical
3552 applications of these concepts involve record types and locales.
3554 * New command 'no_syntax' removes grammar declarations (and
3555 translations) resulting from the given syntax specification, which is
3556 interpreted in the same manner as for the 'syntax' command.
3558 * 'Advanced' translation functions (parse_translation etc.) may depend
3559 on the signature of the theory context being presently used for
3560 parsing/printing, see also isar-ref manual.
3562 * Improved 'oracle' command provides a type-safe interface to turn an
3563 ML expression of type theory -> T -> term into a primitive rule of
3564 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3565 is already included here); see also FOL/ex/IffExample.thy;
3568 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3569 before); "cI" is no longer bound, use "c.intro" instead.
3570 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3571 axclasses vs. locales.
3573 * Improved internal renaming of symbolic identifiers -- attach primes
3574 instead of base 26 numbers.
3576 * New flag show_question_marks controls printing of leading question
3577 marks in schematic variable names.
3579 * In schematic variable names, *any* symbol following \<^isub> or
3580 \<^isup> is now treated as part of the base name. For example, the
3581 following works without printing of awkward ".0" indexes:
3583 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3586 * Inner syntax includes (*(*nested*) comments*).
3588 * Pretty printer now supports unbreakable blocks, specified in mixfix
3589 annotations as "(00...)".
3591 * Clear separation of logical types and nonterminals, where the latter
3592 may only occur in 'syntax' specifications or type abbreviations.
3593 Before that distinction was only partially implemented via type class
3594 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3595 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3596 exotic syntax specifications may require further adaption
3597 (e.g. Cube/Cube.thy).
3599 * Removed obsolete type class "logic", use the top sort {} instead.
3600 Note that non-logical types should be declared as 'nonterminals'
3601 rather than 'types'. INCOMPATIBILITY for new object-logic
3604 * Attributes 'induct' and 'cases': type or set names may now be
3605 locally fixed variables as well.
3607 * Simplifier: can now control the depth to which conditional rewriting
3608 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3611 * Simplifier: simplification procedures may now take the current
3612 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3613 interface), which is very useful for calling the Simplifier
3614 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3615 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3616 low-level mk_simproc no longer applies Logic.varify internally, to
3617 allow for use in a context of fixed variables.
3619 * thin_tac now works even if the assumption being deleted contains !!
3620 or ==>. More generally, erule now works even if the major premise of
3621 the elimination rule contains !! or ==>.
3623 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3625 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3626 from Pure, which contains all common declarations already. Both
3627 theories are defined via plain Isabelle/Isar .thy files.
3628 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3629 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3630 use isatool fixcpure to adapt your theory and ML sources.
3632 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3633 selections of theorems in named facts via index ranges.
3635 * 'print_theorems': in theory mode, really print the difference
3636 wrt. the last state (works for interactive theory development only),
3637 in proof mode print all local facts (cf. 'print_facts');
3639 * 'hide': option '(open)' hides only base names.
3641 * More efficient treatment of intermediate checkpoints in interactive
3644 * Code generator is now invoked via code_module (incremental code
3645 generation) and code_library (modular code generation, ML structures
3646 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3647 must be quoted when used as identifiers.
3649 * New 'value' command for reading, evaluating and printing terms using
3650 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3651 quoted when used as identifier.
3656 * New commands for the interpretation of locale expressions in
3657 theories (1), locales (2) and proof contexts (3). These generate
3658 proof obligations from the expression specification. After the
3659 obligations have been discharged, theorems of the expression are added
3660 to the theory, target locale or proof context. The synopsis of the
3661 commands is a follows:
3663 (1) interpretation expr inst
3664 (2) interpretation target < expr
3665 (3) interpret expr inst
3667 Interpretation in theories and proof contexts require a parameter
3668 instantiation of terms from the current context. This is applied to
3669 specifications and theorems of the interpreted expression.
3670 Interpretation in locales only permits parameter renaming through the
3671 locale expression. Interpretation is smart in that interpretations
3672 that are active already do not occur in proof obligations, neither are
3673 instantiated theorems stored in duplicate. Use 'print_interps' to
3674 inspect active interpretations of a particular locale. For details,
3675 see the Isar Reference manual. Examples can be found in
3676 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3678 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3679 'interpret' instead.
3681 * New context element 'constrains' for adding type constraints to
3684 * Context expressions: renaming of parameters with syntax
3687 * Locale declaration: 'includes' disallowed.
3689 * Proper static binding of attribute syntax -- i.e. types / terms /
3690 facts mentioned as arguments are always those of the locale definition
3691 context, independently of the context of later invocations. Moreover,
3692 locale operations (renaming and type / term instantiation) are applied
3693 to attribute arguments as expected.
3695 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3696 actual attributes; rare situations may require Attrib.attribute to
3697 embed those attributes into Attrib.src that lack concrete syntax.
3698 Attribute implementations need to cooperate properly with the static
3699 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3700 Attrib.XXX_thm etc. already do the right thing without further
3701 intervention. Only unusual applications -- such as "where" or "of"
3702 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3703 on the context and the facts involved -- may have to assign parsed
3704 values to argument tokens explicitly.
3706 * Changed parameter management in theorem generation for long goal
3707 statements with 'includes'. INCOMPATIBILITY: produces a different
3708 theorem statement in rare situations.
3710 * Locale inspection command 'print_locale' omits notes elements. Use
3711 'print_locale!' to have them included in the output.
3716 * Provers/hypsubst.ML: improved version of the subst method, for
3717 single-step rewriting: it now works in bound variable contexts. New is
3718 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3719 rewrite a different subterm than the original subst method, which is
3720 still available as 'simplesubst'.
3722 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3725 * Provers/trancl.ML: new transitivity reasoner for transitive and
3726 reflexive-transitive closure of relations.
3728 * Provers/blast.ML: new reference depth_limit to make blast's depth
3729 limit (previously hard-coded with a value of 20) user-definable.
3731 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3732 is peformed already. Object-logics merely need to finish their
3733 initial simpset configuration as before. INCOMPATIBILITY.
3738 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3741 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3743 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3744 and x-symbol; use option '-m epsilon' to get it actually printed.
3745 Moreover, the mathematically important symbolic identifier \<epsilon>
3746 becomes available as variable, constant etc. INCOMPATIBILITY,
3748 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3749 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3750 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3751 support corresponding Isar calculations.
3753 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3756 * theory SetInterval: changed the syntax for open intervals:
3765 The old syntax is still supported but will disappear in the next
3766 release. For conversion use the following Emacs search and replace
3767 patterns (these are not perfect but work quite well):
3769 {)\([^\.]*\)\.\. -> {\1<\.\.}
3770 \.\.\([^(}]*\)(} -> \.\.<\1}
3772 * Theory Commutative_Ring (in Library): method comm_ring for proving
3773 equalities in commutative rings; method 'algebra' provides a generic
3776 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3777 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3778 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3781 Some new syntax forms are available:
3783 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3784 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3785 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3786 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3788 The latter form "\<Sum>x < k. e" used to be based on a separate
3789 function "Summation", which has been discontinued.
3791 * theory Finite_Set: in structured induction proofs, the insert case
3792 is now 'case (insert x F)' instead of the old counterintuitive 'case
3795 * The 'refute' command has been extended to support a much larger
3796 fragment of HOL, including axiomatic type classes, constdefs and
3797 typedefs, inductive datatypes and recursion.
3799 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3800 Requires zChaff with proof generation to be installed. See
3801 HOL/ex/SAT_Examples.thy for examples.
3803 * Datatype induction via method 'induct' now preserves the name of the
3804 induction variable. For example, when proving P(xs::'a list) by
3805 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3806 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3807 in unstructured proof scripts.
3809 * Reworked implementation of records. Improved scalability for
3810 records with many fields, avoiding performance problems for type
3811 inference. Records are no longer composed of nested field types, but
3812 of nested extension types. Therefore the record type only grows linear
3813 in the number of extensions and not in the number of fields. The
3814 top-level (users) view on records is preserved. Potential
3815 INCOMPATIBILITY only in strange cases, where the theory depends on the
3816 old record representation. The type generated for a record is called
3817 <record_name>_ext_type.
3819 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3820 proofs triggered by a record definition or a simproc (if
3821 quick_and_dirty is enabled). Definitions of large records can take
3824 New simproc record_upd_simproc for simplification of multiple record
3825 updates enabled by default. Moreover, trivial updates are also
3826 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3827 occasionally, since simplification is more powerful by default.
3829 * typedef: proper support for polymorphic sets, which contain extra
3830 type-variables in the term.
3832 * Simplifier: automatically reasons about transitivity chains
3833 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3834 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3835 old proofs break occasionally as simplification may now solve more
3836 goals than previously.
3838 * Simplifier: converts x <= y into x = y if assumption y <= x is
3839 present. Works for all partial orders (class "order"), in particular
3840 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3843 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3844 bound variable or a constant then the let is unfolded. Otherwise
3845 first a is simplified to b, and then f b is simplified to g. If
3846 possible we abstract b from g arriving at "let x = b in h x",
3847 otherwise we unfold the let and arrive at g. The simproc can be
3848 enabled/disabled by the reference use_let_simproc. Potential
3849 INCOMPATIBILITY since simplification is more powerful by default.
3851 * Classical reasoning: the meson method now accepts theorems as arguments.
3853 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3854 jobs to provide advice on the provability of subgoals.
3856 * Theory OrderedGroup and Ring_and_Field: various additions and
3857 improvements to faciliate calculations involving equalities and
3860 The following theorems have been eliminated or modified
3863 abs_eq now named abs_of_nonneg
3864 abs_of_ge_0 now named abs_of_nonneg
3865 abs_minus_eq now named abs_of_nonpos
3866 imp_abs_id now named abs_of_nonneg
3867 imp_abs_neg_id now named abs_of_nonpos
3868 mult_pos now named mult_pos_pos
3869 mult_pos_le now named mult_nonneg_nonneg
3870 mult_pos_neg_le now named mult_nonneg_nonpos
3871 mult_pos_neg2_le now named mult_nonneg_nonpos2
3872 mult_neg now named mult_neg_neg
3873 mult_neg_le now named mult_nonpos_nonpos
3875 * The following lemmas in Ring_and_Field have been added to the simplifier:
3878 not_square_less_zero
3880 The following lemmas have been deleted from Real/RealPow:
3890 * Theory Parity: added rules for simplifying exponents.
3894 The following theorems have been eliminated or modified
3897 list_all_Nil now named list_all.simps(1)
3898 list_all_Cons now named list_all.simps(2)
3899 list_all_conv now named list_all_iff
3900 set_mem_eq now named mem_iff
3902 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3903 asymptotic "big O" calculations. See the notes in BigO.thy.
3908 * Theory RealDef: better support for embedding natural numbers and
3909 integers in the reals.
3911 The following theorems have been eliminated or modified
3914 exp_ge_add_one_self now requires no hypotheses
3915 real_of_int_add reversed direction of equality (use [symmetric])
3916 real_of_int_minus reversed direction of equality (use [symmetric])
3917 real_of_int_diff reversed direction of equality (use [symmetric])
3918 real_of_int_mult reversed direction of equality (use [symmetric])
3920 * Theory RComplete: expanded support for floor and ceiling functions.
3922 * Theory Ln is new, with properties of the natural logarithm
3924 * Hyperreal: There is a new type constructor "star" for making
3925 nonstandard types. The old type names are now type synonyms:
3929 hcomplex = complex star
3931 * Hyperreal: Many groups of similarly-defined constants have been
3932 replaced by polymorphic versions (INCOMPATIBILITY):
3934 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
3936 starset <-- starsetNat, starsetC
3937 *s* <-- *sNat*, *sc*
3938 starset_n <-- starsetNat_n, starsetC_n
3939 *sn* <-- *sNatn*, *scn*
3940 InternalSets <-- InternalNatSets, InternalCSets
3942 starfun <-- starfun{Nat,Nat2,C,RC,CR}
3943 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
3944 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
3945 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
3946 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
3948 * Hyperreal: Many type-specific theorems have been removed in favor of
3949 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
3951 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
3952 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
3953 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
3954 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
3955 right_minus <-- hypreal_add_minus
3956 left_minus <-- {hypreal,hcomplex}_add_minus_left
3957 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
3958 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
3959 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
3960 mult_1_right <-- hcomplex_mult_one_right
3961 mult_zero_left <-- hcomplex_mult_zero_left
3962 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
3963 right_distrib <-- hypnat_add_mult_distrib2
3964 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
3965 right_inverse <-- hypreal_mult_inverse
3966 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
3967 order_refl <-- {hypreal,hypnat}_le_refl
3968 order_trans <-- {hypreal,hypnat}_le_trans
3969 order_antisym <-- {hypreal,hypnat}_le_anti_sym
3970 order_less_le <-- {hypreal,hypnat}_less_le
3971 linorder_linear <-- {hypreal,hypnat}_le_linear
3972 add_left_mono <-- {hypreal,hypnat}_add_left_mono
3973 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
3974 add_nonneg_nonneg <-- hypreal_le_add_order
3976 * Hyperreal: Separate theorems having to do with type-specific
3977 versions of constants have been merged into theorems that apply to the
3978 new polymorphic constants (INCOMPATIBILITY):
3980 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
3981 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
3982 STAR_Un <-- {STAR,NatStar,STARC}_Un
3983 STAR_Int <-- {STAR,NatStar,STARC}_Int
3984 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
3985 STAR_subset <-- {STAR,NatStar,STARC}_subset
3986 STAR_mem <-- {STAR,NatStar,STARC}_mem
3987 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
3988 STAR_diff <-- {STAR,STARC}_diff
3989 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
3990 STARC_hcomplex_of_complex}_image_subset
3991 starset_n_Un <-- starset{Nat,C}_n_Un
3992 starset_n_Int <-- starset{Nat,C}_n_Int
3993 starset_n_Compl <-- starset{Nat,C}_n_Compl
3994 starset_n_diff <-- starset{Nat,C}_n_diff
3995 InternalSets_Un <-- Internal{Nat,C}Sets_Un
3996 InternalSets_Int <-- Internal{Nat,C}Sets_Int
3997 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
3998 InternalSets_diff <-- Internal{Nat,C}Sets_diff
3999 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4000 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4001 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4002 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4003 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4004 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4005 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4006 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4007 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4008 starfun_diff <-- starfun{C,RC,CR}_diff
4009 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4010 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4011 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4012 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4013 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4014 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4015 starfun_Id <-- starfunC_Id
4016 starfun_approx <-- starfun{Nat,CR}_approx
4017 starfun_capprox <-- starfun{C,RC}_capprox
4018 starfun_abs <-- starfunNat_rabs
4019 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4020 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4021 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4022 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4023 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4024 starfun_add_approx <-- starfunCR_add_approx
4025 starfun_inverse_inverse <-- starfunC_inverse_inverse
4026 starfun_divide <-- starfun{C,CR,RC}_divide
4027 starfun_n <-- starfun{Nat,C}_n
4028 starfun_n_mult <-- starfun{Nat,C}_n_mult
4029 starfun_n_add <-- starfun{Nat,C}_n_add
4030 starfun_n_add_minus <-- starfunNat_n_add_minus
4031 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4032 starfun_n_minus <-- starfun{Nat,C}_n_minus
4033 starfun_n_eq <-- starfun{Nat,C}_n_eq
4035 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4036 star_n_minus <-- {hypreal,hcomplex}_minus
4037 star_n_diff <-- {hypreal,hcomplex}_diff
4038 star_n_mult <-- {hypreal,hcomplex}_mult
4039 star_n_inverse <-- {hypreal,hcomplex}_inverse
4040 star_n_le <-- {hypreal,hypnat}_le
4041 star_n_less <-- {hypreal,hypnat}_less
4042 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4043 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4044 star_n_abs <-- hypreal_hrabs
4045 star_n_divide <-- hcomplex_divide
4047 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4048 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4049 star_of_diff <-- hypreal_of_real_diff
4050 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4051 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4052 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4053 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4054 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4055 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4056 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4057 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4058 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4059 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4060 star_of_number_of <-- {hypreal,hcomplex}_number_of
4061 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4062 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4063 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4064 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4065 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4066 star_of_power <-- hypreal_of_real_power
4067 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4069 * Hyperreal: new method "transfer" that implements the transfer
4070 principle of nonstandard analysis. With a subgoal that mentions
4071 nonstandard types like "'a star", the command "apply transfer"
4072 replaces it with an equivalent one that mentions only standard types.
4073 To be successful, all free variables must have standard types; non-
4074 standard variables must have explicit universal quantifiers.
4076 * Hyperreal: A theory of Taylor series.
4081 * Discontinued special version of 'constdefs' (which used to support
4082 continuous functions) in favor of the general Pure one with full
4085 * New simplification procedure for solving continuity conditions; it
4086 is much faster on terms with many nested lambda abstractions (cubic
4087 instead of exponential time).
4089 * New syntax for domain package: selector names are now optional.
4090 Parentheses should be omitted unless argument is lazy, for example:
4092 domain 'a stream = cons "'a" (lazy "'a stream")
4094 * New command 'fixrec' for defining recursive functions with pattern
4095 matching; defining multiple functions with mutual recursion is also
4096 supported. Patterns may include the constants cpair, spair, up, sinl,
4097 sinr, or any data constructor defined by the domain package. The given
4098 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4099 syntax and examples.
4101 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4102 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4103 but the proof obligation additionally includes an admissibility
4104 requirement. The packages generate instances of class cpo or pcpo,
4105 with continuity and strictness theorems for Rep and Abs.
4107 * HOLCF: Many theorems have been renamed according to a more standard naming
4108 scheme (INCOMPATIBILITY):
4110 foo_inject: "foo$x = foo$y ==> x = y"
4111 foo_eq: "(foo$x = foo$y) = (x = y)"
4112 foo_less: "(foo$x << foo$y) = (x << y)"
4113 foo_strict: "foo$UU = UU"
4114 foo_defined: "... ==> foo$x ~= UU"
4115 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4120 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4121 including the First Isomorphism Theorem (on quotienting by the kernel
4124 * ZF/Simplifier: install second copy of type solver that actually
4125 makes use of TC rules declared to Isar proof contexts (or locales);
4126 the old version is still required for ML proof scripts.
4131 * Converted to Isar theory format; use locales instead of axiomatic
4137 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4140 * Pure/library.ML no longer defines its own option datatype, but uses
4141 that of the SML basis, which has constructors NONE and SOME instead of
4142 None and Some, as well as exception Option.Option instead of OPTION.
4143 The functions the, if_none, is_some, is_none have been adapted
4144 accordingly, while Option.map replaces apsome.
4146 * Pure/library.ML: the exception LIST has been given up in favour of
4147 the standard exceptions Empty and Subscript, as well as
4148 Library.UnequalLengths. Function like Library.hd and Library.tl are
4149 superceded by the standard hd and tl functions etc.
4151 A number of basic list functions are no longer exported to the ML
4152 toplevel, as they are variants of predefined functions. The following
4153 suggests how one can translate existing code:
4155 rev_append xs ys = List.revAppend (xs, ys)
4156 nth_elem (i, xs) = List.nth (xs, i)
4157 last_elem xs = List.last xs
4158 flat xss = List.concat xss
4159 seq fs = List.app fs
4160 partition P xs = List.partition P xs
4161 mapfilter f xs = List.mapPartial f xs
4163 * Pure/library.ML: several combinators for linear functional
4164 transformations, notably reverse application and composition:
4167 (x, y) |-> f f #-> g
4169 * Pure/library.ML: introduced/changed precedence of infix operators:
4171 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4173 infix 3 o oo ooo oooo;
4174 infix 4 ~~ upto downto;
4176 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4179 * Pure/library.ML: natural list combinators fold, fold_rev, and
4180 fold_map support linear functional transformations and nesting. For
4183 fold f [x1, ..., xN] y =
4184 y |> f x1 |> ... |> f xN
4186 (fold o fold) f [xs1, ..., xsN] y =
4187 y |> fold f xs1 |> ... |> fold f xsN
4189 fold f [x1, ..., xN] =
4192 (fold o fold) f [xs1, ..., xsN] =
4193 fold f xs1 #> ... #> fold f xsN
4195 * Pure/library.ML: the following selectors on type 'a option are
4198 the: 'a option -> 'a (*partial*)
4199 these: 'a option -> 'a where 'a = 'b list
4200 the_default: 'a -> 'a option -> 'a
4201 the_list: 'a option -> 'a list
4203 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4204 basic operations for association lists, following natural argument
4205 order; moreover the explicit equality predicate passed here avoids
4206 potentially expensive polymorphic runtime equality checks.
4207 The old functions may be expressed as follows:
4209 assoc = uncurry (AList.lookup (op =))
4210 assocs = these oo AList.lookup (op =)
4211 overwrite = uncurry (AList.update (op =)) o swap
4213 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4215 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4216 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4218 replacing make_keylist and keyfilter (occassionally used)
4221 make_keylist = AList.make
4222 keyfilter = AList.find (op =)
4224 * eq_fst and eq_snd now take explicit equality parameter, thus
4225 avoiding eqtypes. Naive rewrites:
4227 eq_fst = eq_fst (op =)
4228 eq_snd = eq_snd (op =)
4230 * Removed deprecated apl and apr (rarely used).
4233 apl (n, op) =>>= curry op n
4234 apr (op, m) =>>= fn n => op (n, m)
4236 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4237 provides a reasonably efficient light-weight implementation of sets as
4240 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4241 few new operations; existing lookup and update are now curried to
4242 follow natural argument order (for use with fold etc.);
4243 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4245 * Pure/General: output via the Isabelle channels of
4246 writeln/warning/error etc. is now passed through Output.output, with a
4247 hook for arbitrary transformations depending on the print_mode
4248 (cf. Output.add_mode -- the first active mode that provides a output
4249 function wins). Already formatted output may be embedded into further
4250 text via Output.raw; the result of Pretty.string_of/str_of and derived
4251 functions (string_of_term/cterm/thm etc.) is already marked raw to
4252 accommodate easy composition of diagnostic messages etc. Programmers
4253 rarely need to care about Output.output or Output.raw at all, with
4254 some notable exceptions: Output.output is required when bypassing the
4255 standard channels (writeln etc.), or in token translations to produce
4256 properly formatted results; Output.raw is required when capturing
4257 already output material that will eventually be presented to the user
4258 a second time. For the default print mode, both Output.output and
4259 Output.raw have no effect.
4261 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4262 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4263 cumulative results are displayed at the end of a batch session.
4265 * Pure/General: File.sysify_path and File.quote_sysify path have been
4266 replaced by File.platform_path and File.shell_path (with appropriate
4267 hooks). This provides a clean interface for unusual systems where the
4268 internal and external process view of file names are different.
4270 * Pure: more efficient orders for basic syntactic entities: added
4271 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4272 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4273 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4274 orders now -- potential INCOMPATIBILITY for code that depends on a
4275 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4276 Library.sort_strings on result).
4278 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4279 fold_types traverse types/terms from left to right, observing natural
4280 argument order. Supercedes previous foldl_XXX versions, add_frees,
4281 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4283 * Pure: name spaces have been refined, with significant changes of the
4284 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4285 to extern(_table). The plain name entry path is superceded by a
4286 general 'naming' context, which also includes the 'policy' to produce
4287 a fully qualified name and external accesses of a fully qualified
4288 name; NameSpace.extend is superceded by context dependent
4289 Sign.declare_name. Several theory and proof context operations modify
4290 the naming context. Especially note Theory.restore_naming and
4291 ProofContext.restore_naming to get back to a sane state; note that
4292 Theory.add_path is no longer sufficient to recover from
4293 Theory.absolute_path in particular.
4295 * Pure: new flags short_names (default false) and unique_names
4296 (default true) for controlling output of qualified names. If
4297 short_names is set, names are printed unqualified. If unique_names is
4298 reset, the name prefix is reduced to the minimum required to achieve
4299 the original result when interning again, even if there is an overlap
4300 with earlier declarations.
4302 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4303 now 'extend', and 'merge' gets an additional Pretty.pp argument
4304 (useful for printing error messages). INCOMPATIBILITY.
4306 * Pure: major reorganization of the theory context. Type Sign.sg and
4307 Theory.theory are now identified, referring to the universal
4308 Context.theory (see Pure/context.ML). Actual signature and theory
4309 content is managed as theory data. The old code and interfaces were
4310 spread over many files and structures; the new arrangement introduces
4311 considerable INCOMPATIBILITY to gain more clarity:
4313 Context -- theory management operations (name, identity, inclusion,
4314 parents, ancestors, merge, etc.), plus generic theory data;
4316 Sign -- logical signature and syntax operations (declaring consts,
4317 types, etc.), plus certify/read for common entities;
4319 Theory -- logical theory operations (stating axioms, definitions,
4320 oracles), plus a copy of logical signature operations (consts,
4321 types, etc.); also a few basic management operations (Theory.copy,
4324 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4325 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4326 for convenience -- they merely return the theory.
4328 * Pure: type Type.tsig is superceded by theory in most interfaces.
4330 * Pure: the Isar proof context type is already defined early in Pure
4331 as Context.proof (note that ProofContext.context and Proof.context are
4332 aliases, where the latter is the preferred name). This enables other
4333 Isabelle components to refer to that type even before Isar is present.
4335 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4336 typeK, constK, axiomK, oracleK), but provide explicit operations for
4337 any of these kinds. For example, Sign.intern typeK is now
4338 Sign.intern_type, Theory.hide_space Sign.typeK is now
4339 Theory.hide_types. Also note that former
4340 Theory.hide_classes/types/consts are now
4341 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4342 internalize their arguments! INCOMPATIBILITY.
4344 * Pure: get_thm interface (of PureThy and ProofContext) expects
4345 datatype thmref (with constructors Name and NameSelection) instead of
4346 plain string -- INCOMPATIBILITY;
4348 * Pure: cases produced by proof methods specify options, where NONE
4349 means to remove case bindings -- INCOMPATIBILITY in
4352 * Pure: the following operations retrieve axioms or theorems from a
4353 theory node or theory hierarchy, respectively:
4355 Theory.axioms_of: theory -> (string * term) list
4356 Theory.all_axioms_of: theory -> (string * term) list
4357 PureThy.thms_of: theory -> (string * thm) list
4358 PureThy.all_thms_of: theory -> (string * thm) list
4360 * Pure: print_tac now outputs the goal through the trace channel.
4362 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4363 Reference Toplevel.debug (default false) controls detailed printing
4364 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4365 controls execution profiling -- set to 1 for time and 2 for space
4366 (both increase the runtime).
4368 * Isar session: The initial use of ROOT.ML is now always timed,
4369 i.e. the log will show the actual process times, in contrast to the
4370 elapsed wall-clock time that the outer shell wrapper produces.
4372 * Simplifier: improved handling of bound variables (nameless
4373 representation, avoid allocating new strings). Simprocs that invoke
4374 the Simplifier recursively should use Simplifier.inherit_bounds to
4375 avoid local name clashes. Failure to do so produces warnings
4376 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4377 for further details.
4379 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4380 bindings for all theorems stored within a given theory; this may help
4381 in porting non-Isar theories to Isar ones, while keeping ML proof
4382 scripts for the time being.
4384 * ML operator HTML.with_charset specifies the charset begin used for
4385 generated HTML files. For example:
4387 HTML.with_charset "utf-8" use_thy "Hebrew";
4388 HTML.with_charset "utf-8" use_thy "Chinese";
4393 * Allow symlinks to all proper Isabelle executables (Isabelle,
4394 isabelle, isatool etc.).
4396 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4397 isatool doc, isatool mkdir, display_drafts etc.).
4399 * isatool usedir: option -f allows specification of the ML file to be
4400 used by Isabelle; default is ROOT.ML.
4402 * New isatool version outputs the version identifier of the Isabelle
4403 distribution being used.
4405 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4406 (containing Boolean satisfiability problems) into Isabelle/HOL
4411 New in Isabelle2004 (April 2004)
4412 --------------------------------
4416 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4417 Replaces linorder.ML.
4419 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4420 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4421 (\<a>...\<z>), are now considered normal letters, and can therefore
4422 be used anywhere where an ASCII letter (a...zA...Z) has until
4423 now. COMPATIBILITY: This obviously changes the parsing of some
4424 terms, especially where a symbol has been used as a binder, say
4425 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4426 as an identifier. Fix it by inserting a space around former
4427 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4428 existing theory and ML files.
4430 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4432 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4433 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4434 a normal (but invisible) letter. For multiple letter subscripts repeat
4435 \<^isub> like this: x\<^isub>1\<^isub>2.
4437 * Pure: There are now sub-/superscripts that can span more than one
4438 character. Text between \<^bsub> and \<^esub> is set in subscript in
4439 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4440 superscript. The new control characters are not identifier parts.
4442 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4443 content of "..." to the latex file instead of \isacntrl... . The "..."
4444 may consist of any printable characters excluding the end bracket >.
4446 * Pure: Using new Isar command "finalconsts" (or the ML functions
4447 Theory.add_finals or Theory.add_finals_i) it is now possible to
4448 declare constants "final", which prevents their being given a definition
4449 later. It is useful for constants whose behaviour is fixed axiomatically
4450 rather than definitionally, such as the meta-logic connectives.
4452 * Pure: 'instance' now handles general arities with general sorts
4453 (i.e. intersections of classes),
4455 * Presentation: generated HTML now uses a CSS style sheet to make layout
4456 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4457 It can be changed to alter the colors/layout of generated pages.
4462 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4463 cut_tac, subgoal_tac and thin_tac:
4464 - Now understand static (Isar) contexts. As a consequence, users of Isar
4465 locales are no longer forced to write Isar proof scripts.
4466 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4468 - INCOMPATIBILITY: names of variables to be instantiated may no
4469 longer be enclosed in quotes. Instead, precede variable name with `?'.
4470 This is consistent with the instantiation attribute "where".
4472 * Attributes "where" and "of":
4473 - Now take type variables of instantiated theorem into account when reading
4474 the instantiation string. This fixes a bug that caused instantiated
4475 theorems to have too special types in some circumstances.
4476 - "where" permits explicit instantiations of type variables.
4478 * Calculation commands "moreover" and "also" no longer interfere with
4479 current facts ("this"), admitting arbitrary combinations with "then"
4483 - Goal statements involving the context element "includes" no longer
4484 generate theorems with internal delta predicates (those ending on
4485 "_axioms") in the premise.
4486 Resolve particular premise with <locale>.intro to obtain old form.
4487 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4488 specification and "includes" elements in goal statement.
4489 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4490 [intro?] and [elim?] (respectively) by default.
4491 - Experimental command for instantiation of locales in proof contexts:
4492 instantiate <label>[<attrs>]: <loc>
4493 Instantiates locale <loc> and adds all its theorems to the current context
4494 taking into account their attributes. Label and attrs are optional
4495 modifiers, like in theorem declarations. If present, names of
4496 instantiated theorems are qualified with <label>, and the attributes
4497 <attrs> are applied after any attributes these theorems might have already.
4498 If the locale has assumptions, a chained fact of the form
4499 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4500 are derived. The command does not support old-style locales declared
4501 with "locale (open)".
4502 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4504 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4510 * Proof import: new image HOL4 contains the imported library from
4511 the HOL4 system with about 2500 theorems. It is imported by
4512 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4513 can be used like any other Isabelle image. See
4514 HOL/Import/HOL/README for more information.
4517 - Much improved handling of linear and partial orders.
4518 Reasoners for linear and partial orders are set up for type classes
4519 "linorder" and "order" respectively, and are added to the default simpset
4520 as solvers. This means that the simplifier can build transitivity chains
4521 to solve goals from the assumptions.
4522 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4523 of blast or auto after simplification become unnecessary because the goal
4524 is solved by simplification already.
4526 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4527 all proved in axiomatic type classes for semirings, rings and fields.
4530 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4531 now formalized using the Ring_and_Field theory mentioned above.
4532 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4533 than before, because now they are set up once in a generic manner.
4534 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4535 Look for the general versions in Ring_and_Field (and Power if they concern
4538 * Type "rat" of the rational numbers is now available in HOL-Complex.
4541 - Record types are now by default printed with their type abbreviation
4542 instead of the list of all field types. This can be configured via
4543 the reference "print_record_type_abbr".
4544 - Simproc "record_upd_simproc" for simplification of multiple updates added
4545 (not enabled by default).
4546 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4547 EX x. x = sel r to True (not enabled by default).
4548 - Tactic "record_split_simp_tac" to split and simplify records added.
4550 * 'specification' command added, allowing for definition by
4551 specification. There is also an 'ax_specification' command that
4552 introduces the new constants axiomatically.
4554 * arith(_tac) is now able to generate counterexamples for reals as well.
4556 * HOL-Algebra: new locale "ring" for non-commutative rings.
4558 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4559 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4561 * HOL-Matrix: a first theory for matrices in HOL with an application of
4562 matrix theory to linear programming.
4564 * Unions and Intersections:
4565 The latex output syntax of UN and INT has been changed
4566 from "\Union x \in A. B" to "\Union_{x \in A} B"
4567 i.e. the index formulae has become a subscript.
4568 Similarly for "\Union x. B", and for \Inter instead of \Union.
4570 * Unions and Intersections over Intervals:
4571 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4572 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4573 like in normal math, and corresponding versions for < and for intersection.
4575 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4576 lexicographic dictonary ordering has been added as "lexord".
4578 * ML: the legacy theory structures Int and List have been removed. They had
4579 conflicted with ML Basis Library structures having the same names.
4581 * 'refute' command added to search for (finite) countermodels. Only works
4582 for a fragment of HOL. The installation of an external SAT solver is
4583 highly recommended. See "HOL/Refute.thy" for details.
4585 * 'quickcheck' command: Allows to find counterexamples by evaluating
4586 formulae under an assignment of free variables to random values.
4587 In contrast to 'refute', it can deal with inductive datatypes,
4588 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4594 * Streams now come with concatenation and are part of the HOLCF image
4598 New in Isabelle2003 (May 2003)
4599 ------------------------------
4603 * Provers/simplifier:
4605 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4606 Assumptions are now subject to complete mutual simplification,
4607 not just from left to right. The simplifier now preserves
4608 the order of assumptions.
4610 Potential INCOMPATIBILITY:
4612 -- simp sometimes diverges where the old version did
4613 not, e.g. invoking simp on the goal
4615 [| P (f x); y = x; f x = f y |] ==> Q
4617 now gives rise to the infinite reduction sequence
4619 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4621 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4624 -- Tactics combining classical reasoner and simplification (such as auto)
4625 are also affected by this change, because many of them rely on
4626 simp. They may sometimes diverge as well or yield a different numbers
4627 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4628 in case of problems. Sometimes subsequent calls to the classical
4629 reasoner will fail because a preceeding call to the simplifier too
4630 eagerly simplified the goal, e.g. deleted redundant premises.
4632 - The simplifier trace now shows the names of the applied rewrite rules
4634 - You can limit the number of recursive invocations of the simplifier
4635 during conditional rewriting (where the simplifie tries to solve the
4636 conditions before applying the rewrite rule):
4637 ML "simp_depth_limit := n"
4638 where n is an integer. Thus you can force termination where previously
4639 the simplifier would diverge.
4641 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4643 - No longer aborts on failed congruence proof. Instead, the
4644 congruence is ignored.
4646 * Pure: New generic framework for extracting programs from constructive
4647 proofs. See HOL/Extraction.thy for an example instantiation, as well
4648 as HOL/Extraction for some case studies.
4650 * Pure: The main goal of the proof state is no longer shown by default, only
4651 the subgoals. This behaviour is controlled by a new flag.
4652 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4653 (ML: Proof.show_main_goal).
4655 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4656 rules whose conclusion matches subgoal 1:
4657 PG menu: Isabelle/Isar -> Show me -> matching rules
4658 The rules are ordered by how closely they match the subgoal.
4659 In particular, rules that solve a subgoal outright are displayed first
4660 (or rather last, the way they are printed).
4661 (ML: ProofGeneral.print_intros())
4663 * Pure: New flag trace_unify_fail causes unification to print
4664 diagnostic information (PG: in trace buffer) when it fails. This is
4665 useful for figuring out why single step proofs like rule, erule or
4668 * Pure: Locale specifications now produce predicate definitions
4669 according to the body of text (covering assumptions modulo local
4670 definitions); predicate "loc_axioms" covers newly introduced text,
4671 while "loc" is cumulative wrt. all included locale expressions; the
4672 latter view is presented only on export into the global theory
4673 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4674 on the old view without predicates;
4676 * Pure: predefined locales "var" and "struct" are useful for sharing
4677 parameters (as in CASL, for example); just specify something like
4678 ``var x + var y + struct M'' as import;
4680 * Pure: improved thms_containing: proper indexing of facts instead of
4681 raw theorems; check validity of results wrt. current name space;
4682 include local facts of proof configuration (also covers active
4683 locales), cover fixed variables in index; may use "_" in term
4684 specification; an optional limit for the number of printed facts may
4685 be given (the default is 40);
4687 * Pure: disallow duplicate fact bindings within new-style theory files
4690 * Provers: improved induct method: assumptions introduced by case
4691 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4692 the goal statement); "foo" still refers to all facts collectively;
4694 * Provers: the function blast.overloaded has been removed: all constants
4695 are regarded as potentially overloaded, which improves robustness in exchange
4696 for slight decrease in efficiency;
4698 * Provers/linorder: New generic prover for transitivity reasoning over
4699 linear orders. Note: this prover is not efficient!
4701 * Isar: preview of problems to finish 'show' now produce an error
4702 rather than just a warning (in interactive mode);
4709 - Produces a counter example if it cannot prove a goal.
4710 Note that the counter example may be spurious if the goal is not a formula
4711 of quantifier-free linear arithmetic.
4712 In ProofGeneral the counter example appears in the trace buffer.
4714 - Knows about div k and mod k where k is a numeral of type nat or int.
4716 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4717 linear arithmetic fails. This takes account of quantifiers and divisibility.
4718 Presburger arithmetic can also be called explicitly via presburger(_tac).
4720 * simp's arithmetic capabilities have been enhanced a bit: it now
4721 takes ~= in premises into account (by performing a case split);
4723 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4724 are distributed over a sum of terms;
4726 * New tactic "trans_tac" and method "trans" instantiate
4727 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4730 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4731 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4733 * 'typedef' command has new option "open" to suppress the set
4736 * functions Min and Max on finite sets have been introduced (theory
4739 * attribute [symmetric] now works for relations as well; it turns
4740 (x,y) : R^-1 into (y,x) : R, and vice versa;
4742 * induct over a !!-quantified statement (say !!x1..xn):
4743 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4745 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4746 %x. None. Warning: empty_def now refers to the previously hidden definition
4749 * Algebra: formalization of classical algebra. Intended as base for
4750 any algebraic development in Isabelle. Currently covers group theory
4751 (up to Sylow's theorem) and ring theory (Universal Property of
4752 Univariate Polynomials). Contributions welcome;
4754 * GroupTheory: deleted, since its material has been moved to Algebra;
4756 * Complex: new directory of the complex numbers with numeric constants,
4757 nonstandard complex numbers, and some complex analysis, standard and
4758 nonstandard (Jacques Fleuriot);
4760 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4762 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4765 * Real/HahnBanach: updated and adapted to locales;
4767 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4770 * UNITY: added the Meier-Sanders theory of progress sets;
4772 * MicroJava: bytecode verifier and lightweight bytecode verifier
4773 as abstract algorithms, instantiated to the JVM;
4775 * Bali: Java source language formalization. Type system, operational
4776 semantics, axiomatic semantics. Supported language features:
4777 classes, interfaces, objects,virtual methods, static methods,
4778 static/instance fields, arrays, access modifiers, definite
4779 assignment, exceptions.
4784 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4787 * Main ZF: virtually all theories converted to new-style format;
4792 * Pure: Tactic.prove provides sane interface for internal proofs;
4793 omits the infamous "standard" operation, so this is more appropriate
4794 than prove_goalw_cterm in many situations (e.g. in simprocs);
4796 * Pure: improved error reporting of simprocs;
4798 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4802 *** Document preparation ***
4804 * uses \par instead of \\ for line breaks in theory text. This may
4805 shift some page breaks in large documents. To get the old behaviour
4806 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4808 * minimized dependencies of isabelle.sty and isabellesym.sty on
4811 * \<euro> now needs package babel/greek instead of marvosym (which
4814 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4819 New in Isabelle2002 (March 2002)
4820 --------------------------------
4822 *** Document preparation ***
4824 * greatly simplified document preparation setup, including more
4825 graceful interpretation of isatool usedir -i/-d/-D options, and more
4826 instructive isatool mkdir; users should basically be able to get
4827 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4828 users may run a separate document processing stage manually like this:
4829 "isatool usedir -D output HOL Test && isatool document Test/output";
4831 * theory dependency graph may now be incorporated into documents;
4832 isatool usedir -g true will produce session_graph.eps/.pdf for use
4833 with \includegraphics of LaTeX;
4835 * proper spacing of consecutive markup elements, especially text
4836 blocks after section headings;
4838 * support bold style (for single symbols only), input syntax is like
4839 this: "\<^bold>\<alpha>" or "\<^bold>A";
4841 * \<bullet> is now output as bold \cdot by default, which looks much
4842 better in printed text;
4844 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4845 note that these symbols are currently unavailable in Proof General /
4846 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4848 * isatool latex no longer depends on changed TEXINPUTS, instead
4849 isatool document copies the Isabelle style files to the target
4855 * Pure/Provers: improved proof by cases and induction;
4856 - 'case' command admits impromptu naming of parameters (such as
4858 - 'induct' method divinates rule instantiation from the inductive
4859 claim; no longer requires excessive ?P bindings for proper
4860 instantiation of cases;
4861 - 'induct' method properly enumerates all possibilities of set/type
4862 rules; as a consequence facts may be also passed through *type*
4863 rules without further ado;
4864 - 'induct' method now derives symbolic cases from the *rulified*
4865 rule (before it used to rulify cases stemming from the internal
4866 atomized version); this means that the context of a non-atomic
4867 statement becomes is included in the hypothesis, avoiding the
4868 slightly cumbersome show "PROP ?case" form;
4869 - 'induct' may now use elim-style induction rules without chaining
4870 facts, using ``missing'' premises from the goal state; this allows
4871 rules stemming from inductive sets to be applied in unstructured
4872 scripts, while still benefitting from proper handling of non-atomic
4873 statements; NB: major inductive premises need to be put first, all
4874 the rest of the goal is passed through the induction;
4875 - 'induct' proper support for mutual induction involving non-atomic
4876 rule statements (uses the new concept of simultaneous goals, see
4878 - append all possible rule selections, but only use the first
4879 success (no backtracking);
4880 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4881 - undeclared rule case names default to numbers 1, 2, 3, ...;
4882 - added 'print_induct_rules' (covered by help item in recent Proof
4884 - moved induct/cases attributes to Pure, methods to Provers;
4885 - generic method setup instantiated for FOL and HOL;
4887 * Pure: support multiple simultaneous goal statements, for example
4888 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4889 meta-level mechanism, this acts as if several individual goals had
4890 been stated separately; in particular common proof methods need to be
4891 repeated in order to cover all claims; note that a single elimination
4892 step is *not* sufficient to establish the two conjunctions, so this
4895 assume "A & B" then have A and B .. (*".." fails*)
4897 better use "obtain" in situations as above; alternative refer to
4898 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4900 * Pure: proper integration with ``locales''; unlike the original
4901 version by Florian Kammller, Isar locales package high-level proof
4902 contexts rather than raw logical ones (e.g. we admit to include
4903 attributes everywhere); operations on locales include merge and
4904 rename; support for implicit arguments (``structures''); simultaneous
4905 type-inference over imports and text; see also HOL/ex/Locales.thy for
4908 * Pure: the following commands have been ``localized'', supporting a
4909 target locale specification "(in name)": 'lemma', 'theorem',
4910 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4911 stored both within the locale and at the theory level (exported and
4912 qualified by the locale name);
4914 * Pure: theory goals may now be specified in ``long'' form, with
4915 ad-hoc contexts consisting of arbitrary locale elements. for example
4916 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4917 definitions may be given, too); the result is a meta-level rule with
4918 the context elements being discharged in the obvious way;
4920 * Pure: new proof command 'using' allows to augment currently used
4921 facts after a goal statement ('using' is syntactically analogous to
4922 'apply', but acts on the goal's facts only); this allows chained facts
4923 to be separated into parts given before and after a claim, as in
4924 ``from a and b have C using d and e <proof>'';
4926 * Pure: renamed "antecedent" case to "rule_context";
4928 * Pure: new 'judgment' command records explicit information about the
4929 object-logic embedding (used by several tools internally); no longer
4930 use hard-wired "Trueprop";
4932 * Pure: added 'corollary' command;
4934 * Pure: fixed 'token_translation' command;
4936 * Pure: removed obsolete 'exported' attribute;
4938 * Pure: dummy pattern "_" in is/let is now automatically lifted over
4939 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
4940 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
4942 * Pure: method 'atomize' presents local goal premises as object-level
4943 statements (atomic meta-level propositions); setup controlled via
4944 rewrite rules declarations of 'atomize' attribute; example
4945 application: 'induct' method with proper rule statements in improper
4948 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
4949 now consider the syntactic context of assumptions, giving a better
4950 chance to get type-inference of the arguments right (this is
4951 especially important for locales);
4953 * Pure: "sorry" no longer requires quick_and_dirty in interactive
4956 * Pure/obtain: the formal conclusion "thesis", being marked as
4957 ``internal'', may no longer be reference directly in the text;
4958 potential INCOMPATIBILITY, may need to use "?thesis" in rare
4961 * Pure: generic 'sym' attribute which declares a rule both as pure
4962 'elim?' and for the 'symmetric' operation;
4964 * Pure: marginal comments ``--'' may now occur just anywhere in the
4965 text; the fixed correlation with particular command syntax has been
4968 * Pure: new method 'rules' is particularly well-suited for proof
4969 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
4970 but often produces more compact proof terms with less detours;
4972 * Pure/Provers/classical: simplified integration with pure rule
4973 attributes and methods; the classical "intro?/elim?/dest?"
4974 declarations coincide with the pure ones; the "rule" method no longer
4975 includes classically swapped intros; "intro" and "elim" methods no
4976 longer pick rules from the context; also got rid of ML declarations
4977 AddXIs/AddXEs/AddXDs; all of this has some potential for
4980 * Provers/classical: attribute 'swapped' produces classical inversions
4981 of introduction rules;
4983 * Provers/simplifier: 'simplified' attribute may refer to explicit
4984 rules instead of full simplifier context; 'iff' attribute handles
4987 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
4989 * HOL: 'recdef' now fails on unfinished automated proofs, use
4990 "(permissive)" option to recover old behavior;
4992 * HOL: 'inductive' no longer features separate (collective) attributes
4993 for 'intros' (was found too confusing);
4995 * HOL: properly declared induction rules less_induct and
5001 * HOL: moved over to sane numeral syntax; the new policy is as
5004 - 0 and 1 are polymorphic constants, which are defined on any
5005 numeric type (nat, int, real etc.);
5007 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5008 binary representation internally;
5010 - type nat has special constructor Suc, and generally prefers Suc 0
5011 over 1::nat and Suc (Suc 0) over 2::nat;
5013 This change may cause significant problems of INCOMPATIBILITY; here
5014 are some hints on converting existing sources:
5016 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5017 entities, so expressions involving "-" (unary or binary minus) need
5018 to be spaced properly;
5020 - existing occurrences of "1" may need to be constraint "1::nat" or
5021 even replaced by Suc 0; similar for old "2";
5023 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5025 - remove all special provisions on numerals in proofs;
5027 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5028 representation (depends on bin_arith_simps in the default context);
5030 * HOL: symbolic syntax for x^2 (numeral 2);
5032 * HOL: the class of all HOL types is now called "type" rather than
5033 "term"; INCOMPATIBILITY, need to adapt references to this type class
5034 in axclass/classes, instance/arities, and (usually rare) occurrences
5035 in typings (of consts etc.); internally the class is called
5036 "HOL.type", ML programs should refer to HOLogic.typeS;
5038 * HOL/record package improvements:
5039 - new derived operations "fields" to build a partial record section,
5040 "extend" to promote a fixed record to a record scheme, and
5041 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5042 declared as simp by default;
5043 - shared operations ("more", "fields", etc.) now need to be always
5044 qualified) --- potential INCOMPATIBILITY;
5045 - removed "make_scheme" operations (use "make" with "extend") --
5047 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5048 - provides cases/induct rules for use with corresponding Isar
5049 methods (for concrete records, record schemes, concrete more
5050 parts, and schematic more parts -- in that order);
5051 - internal definitions directly based on a light-weight abstract
5052 theory of product types over typedef rather than datatype;
5054 * HOL: generic code generator for generating executable ML code from
5055 specifications; specific support for HOL constructs such as inductive
5056 datatypes and sets, as well as recursive functions; can be invoked
5057 via 'generate_code' theory section;
5059 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5061 * HOL: consolidated and renamed several theories. In particular:
5062 Ord.thy has been absorbed into HOL.thy
5063 String.thy has been absorbed into List.thy
5065 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5066 (beware of argument permutation!);
5068 * HOL: linorder_less_split superseded by linorder_cases;
5070 * HOL/List: "nodups" renamed to "distinct";
5072 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5073 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5074 - Ex_def has changed, now need to use some_eq_ex
5076 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5077 in this (rare) case use:
5079 delSWrapper "split_all_tac"
5080 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5082 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5085 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5086 Isabelle's type classes, ^ on functions and relations has too general
5087 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5088 necessary to attach explicit type constraints;
5090 * HOL/Relation: the prefix name of the infix "O" has been changed from
5091 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5092 renamed accordingly (eg "compI" -> "rel_compI").
5094 * HOL: syntax translations now work properly with numerals and records
5097 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5098 of "lam" -- INCOMPATIBILITY;
5100 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5101 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5102 renamed "Product_Type.unit";
5104 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5106 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5107 the "cases" method);
5109 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5112 * HOL/IMP: updated and converted to new-style theory format; several
5113 parts turned into readable document, with proper Isar proof texts and
5114 some explanations (by Gerwin Klein);
5116 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5118 * HOL-Hyperreal is now a logic image;
5123 * Isar: consts/constdefs supports mixfix syntax for continuous
5126 * Isar: domain package adapted to new-style theory format, e.g. see
5129 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5130 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5131 lift.induct_tac, always use UU instead of Undef;
5133 * HOLCF/IMP: updated and converted to new-style theory;
5138 * Isar: proper integration of logic-specific tools and packages,
5139 including theory commands '(co)inductive', '(co)datatype',
5140 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5141 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5143 * theory Main no longer includes AC; for the Axiom of Choice, base
5144 your theory on Main_ZFC;
5146 * the integer library now covers quotients and remainders, with many
5147 laws relating division to addition, multiplication, etc.;
5149 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5150 typeless version of the formalism;
5152 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5155 * ZF/Induct: new directory for examples of inductive definitions,
5156 including theory Multiset for multiset orderings; converted to
5157 new-style theory format;
5159 * ZF: many new theorems about lists, ordinals, etc.;
5164 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5165 variable proof controls level of detail: 0 = no proofs (only oracle
5166 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5167 also ref manual for further ML interfaces;
5169 * Pure/axclass: removed obsolete ML interface
5170 goal_subclass/goal_arity;
5172 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5173 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5174 separate tokens, so expressions involving minus need to be spaced
5177 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5178 rather than "infixl" or "infixr";
5180 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5181 sort constraint specifications in type inference; e.g. "x::_::foo"
5182 ensures that the type of "x" is of sort "foo" (but not necessarily a
5185 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5186 control output of nested => (types); the default behavior is
5189 * Pure/syntax: builtin parse translation for "_constify" turns valued
5190 tokens into AST constants;
5192 * Pure/syntax: prefer later declarations of translations and print
5193 translation functions; potential INCOMPATIBILITY: need to reverse
5194 multiple declarations for same syntax element constant;
5196 * Pure/show_hyps reset by default (in accordance to existing Isar
5199 * Provers/classical: renamed addaltern to addafter, addSaltern to
5202 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5205 * system: tested support for MacOS X; should be able to get Isabelle +
5206 Proof General to work in a plain Terminal after installing Poly/ML
5207 (e.g. from the Isabelle distribution area) and GNU bash alone
5208 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5209 support requires further installations, e.g. from
5210 http://fink.sourceforge.net/);
5212 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5214 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5215 of 40 MB), cf. ML_OPTIONS;
5217 * system: Proof General keywords specification is now part of the
5218 Isabelle distribution (see etc/isar-keywords.el);
5220 * system: support for persistent Proof General sessions (refrain from
5221 outdating all loaded theories on startup); user may create writable
5222 logic images like this: ``isabelle -q HOL Test'';
5224 * system: smart selection of Isabelle process versus Isabelle
5225 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5226 run both "isabelle" and "Isabelle" even if file names are badly
5227 damaged (executable inspects the case of the first letter of its own
5228 name); added separate "isabelle-process" and "isabelle-interface";
5230 * system: refrain from any attempt at filtering input streams; no
5231 longer support ``8bit'' encoding of old isabelle font, instead proper
5232 iso-latin characters may now be used; the related isatools
5233 "symbolinput" and "nonascii" have disappeared as well;
5235 * system: removed old "xterm" interface (the print modes "xterm" and
5236 "xterm_color" are still available for direct use in a suitable
5241 New in Isabelle99-2 (February 2001)
5242 -----------------------------------
5244 *** Overview of INCOMPATIBILITIES ***
5246 * HOL: please note that theories in the Library and elsewhere often use the
5247 new-style (Isar) format; to refer to their theorems in an ML script you must
5248 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5250 * HOL: inductive package no longer splits induction rule aggressively,
5251 but only as far as specified by the introductions given; the old
5252 format may be recovered via ML function complete_split_rule or attribute
5253 'split_rule (complete)';
5255 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5256 gfp_Tarski to gfp_unfold;
5258 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5260 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5261 relation); infix "^^" has been renamed "``"; infix "``" has been
5262 renamed "`"; "univalent" has been renamed "single_valued";
5264 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5267 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5269 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5271 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5272 consequence, it is no longer monotonic wrt. the local goal context
5273 (which is now passed through the inductive cases);
5275 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5276 \<gg> to \<ggreater>;
5279 *** Document preparation ***
5281 * \isabellestyle{NAME} selects version of Isabelle output (currently
5282 available: are "it" for near math-mode best-style output, "sl" for
5283 slanted text style, and "tt" for plain type-writer; if no
5284 \isabellestyle command is given, output is according to slanted
5287 * support sub/super scripts (for single symbols only), input syntax is
5288 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5290 * some more standard symbols; see Appendix A of the system manual for
5291 the complete list of symbols defined in isabellesym.sty;
5293 * improved isabelle style files; more abstract symbol implementation
5294 (should now use \isamath{...} and \isatext{...} in custom symbol
5297 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5298 state; Note that presentation of goal states does not conform to
5299 actual human-readable proof documents. Please do not include goal
5300 states into document output unless you really know what you are doing!
5302 * proper indentation of antiquoted output with proportional LaTeX
5305 * no_document ML operator temporarily disables LaTeX document
5308 * isatool unsymbolize tunes sources for plain ASCII communication;
5313 * Pure: Isar now suffers initial goal statements to contain unbound
5314 schematic variables (this does not conform to actual readable proof
5315 documents, due to unpredictable outcome and non-compositional proof
5316 checking); users who know what they are doing may use schematic goals
5317 for Prolog-style synthesis of proven results;
5319 * Pure: assumption method (an implicit finishing) now handles actual
5322 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5323 initial goal, declare "that" only as Pure intro (only for single
5324 steps); the "that" rule assumption may now be involved in implicit
5325 finishing, thus ".." becomes a feasible for trivial obtains;
5327 * Pure: default proof step now includes 'intro_classes'; thus trivial
5328 instance proofs may be performed by "..";
5330 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5333 * Pure: more robust selection of calculational rules;
5335 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5336 rule (as well as the assumption rule);
5338 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5339 lemmas, using the graph browser tool;
5341 * Pure: predict failure of "show" in interactive mode;
5343 * Pure: 'thms_containing' now takes actual terms as arguments;
5345 * HOL: improved method 'induct' --- now handles non-atomic goals
5346 (potential INCOMPATIBILITY); tuned error handling;
5348 * HOL: cases and induct rules now provide explicit hints about the
5349 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5350 any remaining facts are inserted into the goal verbatim;
5352 * HOL: local contexts (aka cases) may now contain term bindings as
5353 well; the 'cases' and 'induct' methods new provide a ?case binding for
5354 the result to be shown in each case;
5356 * HOL: added 'recdef_tc' command;
5358 * isatool convert assists in eliminating legacy ML scripts;
5363 * HOL/Library: a collection of generic theories to be used together
5364 with main HOL; the theory loader path already includes this directory
5365 by default; the following existing theories have been moved here:
5366 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5367 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5369 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5370 modelling and verification task performed in Isabelle/HOL +
5371 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5373 * HOL/Algebra: special summation operator SUM no longer exists, it has
5374 been replaced by setsum; infix 'assoc' now has priority 50 (like
5375 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5376 'domain', this makes the theory consistent with mathematical
5379 * HOL basics: added overloaded operations "inverse" and "divide"
5380 (infix "/"), syntax for generic "abs" operation, generic summation
5383 * HOL/typedef: simplified package, provide more useful rules (see also
5386 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5387 now expressed as a proper nested rule (old-style tactic scripts may
5388 require atomize_strip_tac to cope with non-atomic premises);
5390 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5391 to "split_conv" (old name still available for compatibility);
5393 * HOL: improved concrete syntax for strings (e.g. allows translation
5394 rules with string literals);
5396 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5397 and Fleuriot's mechanization of analysis, including the transcendental
5398 functions for the reals;
5400 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5405 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5406 "lam" is displayed as TWO lambda-symbols
5408 * CTT: theory Main now available, containing everything (that is, Bool
5414 * Pure: the Simplifier has been implemented properly as a derived rule
5415 outside of the actual kernel (at last!); the overall performance
5416 penalty in practical applications is about 50%, while reliability of
5417 the Isabelle inference kernel has been greatly improved;
5419 * print modes "brackets" and "no_brackets" control output of nested =>
5420 (types) and ==> (props); the default behaviour is "brackets";
5422 * Provers: fast_tac (and friends) now handle actual object-logic rules
5423 as assumptions as well;
5425 * system: support Poly/ML 4.0;
5427 * system: isatool install handles KDE version 1 or 2;
5431 New in Isabelle99-1 (October 2000)
5432 ----------------------------------
5434 *** Overview of INCOMPATIBILITIES ***
5436 * HOL: simplification of natural numbers is much changed; to partly
5437 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5438 issue the following ML commands:
5440 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5441 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5443 * HOL: simplification no longer dives into case-expressions; this is
5444 controlled by "t.weak_case_cong" for each datatype t;
5446 * HOL: nat_less_induct renamed to less_induct;
5448 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5449 fixsome to patch .thy and .ML sources automatically;
5451 select_equality -> some_equality
5452 select_eq_Ex -> some_eq_ex
5453 selectI2EX -> someI2_ex
5456 select1_equality -> some1_equality
5457 Eps_sym_eq -> some_sym_eq_trivial
5458 Eps_eq -> some_eq_trivial
5460 * HOL: exhaust_tac on datatypes superceded by new generic case_tac;
5462 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5465 * HOL: the recursion equations generated by 'recdef' are now called
5466 f.simps instead of f.rules;
5468 * HOL: qed_spec_mp now also handles bounded ALL as well;
5470 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5471 sometimes be needed;
5473 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5475 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5477 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5478 product is now "<*>" instead of "Times"; the lexicographic product is
5479 now "<*lex*>" instead of "**";
5481 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5482 of main HOL, but was unused); better use HOL's datatype package;
5484 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5485 the old syntax may be recovered as follows:
5488 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5489 (infixl "\\<oplus>" 100)
5491 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5493 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5494 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5497 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5498 changed from A/r to A//r;
5500 * ZF: new treatment of arithmetic (nat & int) may break some old
5503 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5504 rulify -> rule_format, elimify -> elim_format, ...);
5506 * Isar/Provers: intro/elim/dest attributes changed; renamed
5507 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5508 should have to change intro!! to intro? only); replaced "delrule" by
5511 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5513 * Provers: strengthened force_tac by using new first_best_tac;
5515 * LaTeX document preparation: several changes of isabelle.sty (see
5519 *** Document preparation ***
5521 * formal comments (text blocks etc.) in new-style theories may now
5522 contain antiquotations of thm/prop/term/typ/text to be presented
5523 according to latex print mode; concrete syntax is like this:
5524 @{term[show_types] "f(x) = a + x"};
5526 * isatool mkdir provides easy setup of Isabelle session directories,
5527 including proper document sources;
5529 * generated LaTeX sources are now deleted after successful run
5530 (isatool document -c); may retain a copy somewhere else via -D option
5533 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5534 style files, achieving self-contained LaTeX sources and simplifying
5537 * old-style theories now produce (crude) LaTeX output as well;
5539 * browser info session directories are now self-contained (may be put
5540 on WWW server seperately); improved graphs of nested sessions; removed
5541 graph for 'all sessions';
5543 * several improvements in isabelle style files; \isabellestyle{it}
5544 produces fake math mode output; \isamarkupheader is now \section by
5545 default; see lib/texinputs/isabelle.sty etc.;
5550 * Isar/Pure: local results and corresponding term bindings are now
5551 subject to Hindley-Milner polymorphism (similar to ML); this
5552 accommodates incremental type-inference very nicely;
5554 * Isar/Pure: new derived language element 'obtain' supports
5555 generalized existence reasoning;
5557 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5558 support accumulation of results, without applying any rules yet;
5559 useful to collect intermediate results without explicit name
5560 references, and for use with transitivity rules with more than 2
5563 * Isar/Pure: scalable support for case-analysis type proofs: new
5564 'case' language element refers to local contexts symbolically, as
5565 produced by certain proof methods; internally, case names are attached
5566 to theorems as "tags";
5568 * Isar/Pure: theory command 'hide' removes declarations from
5569 class/type/const name spaces;
5571 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5572 indicate potential overloading;
5574 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5576 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5577 "{a,b,c}" instead of {a,b,c};
5579 * Isar/Pure now provides its own version of intro/elim/dest
5580 attributes; useful for building new logics, but beware of confusion
5581 with the version in Provers/classical;
5583 * Isar/Pure: the local context of (non-atomic) goals is provided via
5584 case name 'antecedent';
5586 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5587 to the current context is now done automatically);
5589 * Isar/Pure: theory command 'method_setup' provides a simple interface
5590 for definining proof methods in ML;
5592 * Isar/Provers: intro/elim/dest attributes changed; renamed
5593 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5594 most cases, one should have to change intro!! to intro? only);
5595 replaced "delrule" by "rule del";
5597 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5598 'symmetric' attribute (the latter supercedes [RS sym]);
5600 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5601 method modifier); 'simp' method: 'only:' modifier removes loopers as
5602 well (including splits);
5604 * Isar/Provers: Simplifier and Classical methods now support all kind
5605 of modifiers used in the past, including 'cong', 'iff', etc.
5607 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5608 of Simplifier and Classical reasoner);
5610 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5611 now support named cases; major packages (inductive, datatype, primrec,
5612 recdef) support case names and properly name parameters;
5614 * Isar/HOL: new transitivity rules for substitution in inequalities --
5615 monotonicity conditions are extracted to be proven at end of
5618 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5621 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5622 split_if split_if_asm; datatype package provides theorems foo.splits =
5623 foo.split foo.split_asm for each datatype;
5625 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5626 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5627 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5628 use "(cases (simplified))" method in proper proof texts);
5630 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5632 * Isar: names of theorems etc. may be natural numbers as well;
5634 * Isar: 'pr' command: optional arguments for goals_limit and
5635 ProofContext.prems_limit; no longer prints theory contexts, but only
5638 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5639 additional print modes to be specified; e.g. "pr(latex)" will print
5640 proof state according to the Isabelle LaTeX style;
5642 * Isar: improved support for emulating tactic scripts, including proof
5643 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5644 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5645 (for HOL datatypes);
5647 * Isar: simplified (more robust) goal selection of proof methods: 1st
5648 goal, all goals, or explicit goal specifier (tactic emulation); thus
5649 'proof method scripts' have to be in depth-first order;
5651 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5653 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5654 should instead use individual commands for printing items
5655 (print_commands, print_methods etc.);
5657 * Isar: added 'nothing' --- the empty list of theorems;
5662 * HOL/MicroJava: formalization of a fragment of Java, together with a
5663 corresponding virtual machine and a specification of its bytecode
5664 verifier and a lightweight bytecode verifier, including proofs of
5665 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5666 Cornelia Pusch (see also the homepage of project Bali at
5667 http://isabelle.in.tum.de/Bali/);
5669 * HOL/Algebra: new theory of rings and univariate polynomials, by
5672 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5673 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5676 * HOL/Lattice: fundamental concepts of lattice theory and order
5677 structures, including duals, properties of bounds versus algebraic
5678 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5679 Theorem for complete lattices etc.; may also serve as a demonstration
5680 for abstract algebraic reasoning using axiomatic type classes, and
5681 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5683 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5686 * HOL/IMPP: extension of IMP with local variables and mutually
5687 recursive procedures, by David von Oheimb;
5689 * HOL/Lambda: converted into new-style theory and document;
5691 * HOL/ex/Multiquote: example of multiple nested quotations and
5692 anti-quotations -- basically a generalized version of de-Bruijn
5693 representation; very useful in avoiding lifting of operations;
5695 * HOL/record: added general record equality rule to simpset; fixed
5696 select-update simplification procedure to handle extended records as
5697 well; admit "r" as field name;
5699 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5700 other numeric types and also as the identity of groups, rings, etc.;
5702 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5703 Types nat and int belong to this axclass;
5705 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5706 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5707 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5708 two terms #m*u and #n*u are replaced by #(m+n)*u
5709 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5710 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5711 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5713 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5714 powerful prover for predicate logic but knows nothing of clasets; see
5715 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5717 * HOL: new version of "case_tac" subsumes both boolean case split and
5718 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5719 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5721 * HOL: simplification no longer dives into case-expressions: only the
5722 selector expression is simplified, but not the remaining arms; to
5723 enable full simplification of case-expressions for datatype t, you may
5724 remove t.weak_case_cong from the simpset, either globally (Delcongs
5725 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5727 * HOL/recdef: the recursion equations generated by 'recdef' for
5728 function 'f' are now called f.simps instead of f.rules; if all
5729 termination conditions are proved automatically, these simplification
5730 rules are added to the simpset, as in primrec; rules may be named
5731 individually as well, resulting in a separate list of theorems for
5734 * HOL/While is a new theory that provides a while-combinator. It
5735 permits the definition of tail-recursive functions without the
5736 provision of a termination measure. The latter is necessary once the
5737 invariant proof rule for while is applied.
5739 * HOL: new (overloaded) notation for the set of elements below/above
5740 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5742 * HOL: theorems impI, allI, ballI bound as "strip";
5744 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5745 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5746 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5748 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5750 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5751 main HOL, but was unused);
5753 * HOL: fewer consts declared as global (e.g. have to refer to
5754 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5756 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5757 in case of overlap with user translations (e.g. judgements over
5758 tuples); (note that the underlying logical represenation is still
5764 * ZF: simplification automatically cancels common terms in arithmetic
5765 expressions over nat and int;
5767 * ZF: new treatment of nat to minimize type-checking: all operators
5768 coerce their operands to a natural number using the function natify,
5769 making the algebraic laws unconditional;
5771 * ZF: as above, for int: operators coerce their operands to an integer
5772 using the function intify;
5774 * ZF: the integer library now contains many of the usual laws for the
5775 orderings, including $<=, and monotonicity laws for $+ and $*;
5777 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5780 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5781 to the simplifier and classical reasoner simultaneously;
5786 * Provers: blast_tac now handles actual object-logic rules as
5787 assumptions; note that auto_tac uses blast_tac internally as well;
5789 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5790 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5792 * Provers: delrules now handles destruct rules as well (no longer need
5793 explicit make_elim);
5795 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5796 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5797 use instead the strong form,
5798 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5799 in HOL, FOL and ZF the function cla_make_elim will create such rules
5800 from destruct-rules;
5802 * Provers: Simplifier.easy_setup provides a fast path to basic
5803 Simplifier setup for new object-logics;
5805 * Pure: AST translation rules no longer require constant head on LHS;
5807 * Pure: improved name spaces: ambiguous output is qualified; support
5808 for hiding of names;
5810 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5811 XSYMBOL_HOME; no longer need to do manual configuration in most
5814 * system: compression of ML heaps images may now be controlled via -c
5815 option of isabelle and isatool usedir (currently only observed by
5818 * system: isatool installfonts may handle X-Symbol fonts as well (very
5819 useful for remote X11);
5821 * system: provide TAGS file for Isabelle sources;
5823 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5826 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5827 timing flag supersedes proof_timing and Toplevel.trace;
5829 * ML: new combinators |>> and |>>> for incremental transformations
5830 with secondary results (e.g. certain theory extensions):
5832 * ML: PureThy.add_defs gets additional argument to indicate potential
5833 overloading (usually false);
5835 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5840 New in Isabelle99 (October 1999)
5841 --------------------------------
5843 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5845 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5846 are no longer simplified. (This allows the simplifier to unfold recursive
5847 functional programs.) To restore the old behaviour, declare
5849 Delcongs [if_weak_cong];
5851 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5854 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5856 * HOL/datatype: mutual_induct_tac no longer exists --
5857 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5859 * HOL/typedef: fixed type inference for representing set; type
5860 arguments now have to occur explicitly on the rhs as type constraints;
5862 * ZF: The con_defs part of an inductive definition may no longer refer
5863 to constants declared in the same theory;
5865 * HOL, ZF: the function mk_cases, generated by the inductive
5866 definition package, has lost an argument. To simplify its result, it
5867 uses the default simpset instead of a supplied list of theorems.
5869 * HOL/List: the constructors of type list are now Nil and Cons;
5871 * Simplifier: the type of the infix ML functions
5872 setSSolver addSSolver setSolver addSolver
5873 is now simpset * solver -> simpset where `solver' is a new abstract type
5874 for packaging solvers. A solver is created via
5875 mk_solver: string -> (thm list -> int -> tactic) -> solver
5876 where the string argument is only a comment.
5881 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5882 decision procedure for linear arithmetic. Currently it is used for
5883 types `nat', `int', and `real' in HOL (see below); it can, should and
5884 will be instantiated for other types and logics as well.
5886 * The simplifier now accepts rewrite rules with flexible heads, eg
5887 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5888 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5894 * New Isabelle/Isar subsystem provides an alternative to traditional
5895 tactical theorem proving; together with the ProofGeneral/isar user
5896 interface it offers an interactive environment for developing human
5897 readable proof documents (Isar == Intelligible semi-automated
5898 reasoning); for further information see isatool doc isar-ref,
5899 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5901 * improved and simplified presentation of theories: better HTML markup
5902 (including colors), graph views in several sizes; isatool usedir now
5903 provides a proper interface for user theories (via -P option); actual
5904 document preparation based on (PDF)LaTeX is available as well (for
5905 new-style theories only); see isatool doc system for more information;
5907 * native support for Proof General, both for classic Isabelle and
5910 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5911 using the graph browser tool;
5913 * Isabelle manuals now also available as PDF;
5915 * theory loader rewritten from scratch (may not be fully
5916 bug-compatible); old loadpath variable has been replaced by show_path,
5917 add_path, del_path, reset_path functions; new operations such as
5918 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5921 * improved isatool install: option -k creates KDE application icon,
5922 option -p DIR installs standalone binaries;
5924 * added ML_PLATFORM setting (useful for cross-platform installations);
5925 more robust handling of platform specific ML images for SML/NJ;
5927 * the settings environment is now statically scoped, i.e. it is never
5928 created again in sub-processes invoked from isabelle, isatool, or
5931 * path element specification '~~' refers to '$ISABELLE_HOME';
5933 * in locales, the "assumes" and "defines" parts may be omitted if
5936 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
5939 * new print_mode "HTML";
5941 * new flag show_tags controls display of tags of theorems (which are
5942 basically just comments that may be attached by some tools);
5944 * Isamode 2.6 requires patch to accomodate change of Isabelle font
5945 mode and goal output format:
5947 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
5949 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
5951 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
5952 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
5954 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
5956 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
5958 * function bind_thms stores lists of theorems (cf. bind_thm);
5960 * new shorthand tactics ftac, eatac, datac, fatac;
5962 * qed (and friends) now accept "" as result name; in that case the
5963 theorem is not stored, but proper checks and presentation of the
5966 * theorem database now also indexes constants "Trueprop", "all",
5967 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
5972 ** HOL arithmetic **
5974 * There are now decision procedures for linear arithmetic over nat and
5977 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
5978 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
5979 are treated as atomic; subformulae not involving type `nat' or `int'
5980 are ignored; quantified subformulae are ignored unless they are
5981 positive universal or negative existential. The tactic has to be
5982 invoked by hand and can be a little bit slow. In particular, the
5983 running time is exponential in the number of occurrences of `min' and
5984 `max', and `-' on `nat'.
5986 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
5987 (negated) (in)equalities among the premises and the conclusion into
5988 account (i.e. no compound formulae) and does not know about `min' and
5989 `max', and `-' on `nat'. It is fast and is used automatically by the
5992 NB: At the moment, these decision procedures do not cope with mixed
5993 nat/int formulae where the two parts interact, such as `m < n ==>
5996 * HOL/Numeral provides a generic theory of numerals (encoded
5997 efficiently as bit strings); setup for types nat/int/real is in place;
5998 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
5999 int, existing theories and proof scripts may require a few additional
6002 * integer division and remainder can now be performed on constant
6005 * many properties of integer multiplication, division and remainder
6008 * An interface to the Stanford Validity Checker (SVC) is available through the
6009 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6010 are proved automatically. SVC must be installed separately, and its results
6011 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6012 invocation of the underlying oracle). For SVC see
6013 http://verify.stanford.edu/SVC
6015 * IsaMakefile: the HOL-Real target now builds an actual image;
6020 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6021 (in Isabelle/Isar) -- by Gertrud Bauer;
6023 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6024 analysis for assembly languages with subtypes;
6026 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6027 -- avoids syntactic ambiguities and treats state, transition, and
6028 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6029 changed syntax and (many) tactics;
6031 * HOL/inductive: Now also handles more general introduction rules such
6032 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6033 theorems are now maintained within the theory (maintained via the
6036 * HOL/datatype: Now also handles arbitrarily branching datatypes
6037 (using function types) such as
6039 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6041 * HOL/record: record_simproc (part of the default simpset) takes care
6042 of selectors applied to updated records; record_split_tac is no longer
6043 part of the default claset; update_defs may now be removed from the
6044 simpset in many cases; COMPATIBILITY: old behavior achieved by
6046 claset_ref () := claset() addSWrapper record_split_wrapper;
6047 Delsimprocs [record_simproc]
6049 * HOL/typedef: fixed type inference for representing set; type
6050 arguments now have to occur explicitly on the rhs as type constraints;
6052 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6053 names rather than an ML expression;
6055 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6056 supplied later. Program schemes can be defined, such as
6057 "While B C s = (if B s then While B C (C s) else s)"
6058 where the well-founded relation can be chosen after B and C have been given.
6060 * HOL/List: the constructors of type list are now Nil and Cons;
6061 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6062 course, ML tools referring to List.list.op # etc. have to be adapted;
6064 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6065 disabled by default; run isabelle with option -m HOL to get back to
6066 the original Gordon/HOL-style output;
6068 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6069 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6071 * HOL basic syntax simplified (more orthogonal): all variants of
6072 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6073 Eps operator is provided as well: "SOME x. P[x]";
6075 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6077 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6078 thus available for user theories;
6080 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6081 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6084 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6085 several times and then mp;
6090 * the notation <<...>> is now available as a notation for sequences of
6093 * the simplifier is now installed
6095 * the axiom system has been generalized (thanks to Soren Heilmann)
6097 * the classical reasoner now has a default rule database
6102 * new primrec section allows primitive recursive functions to be given
6103 directly (as in HOL) over datatypes and the natural numbers;
6105 * new tactics induct_tac and exhaust_tac for induction (or case
6106 analysis) over datatypes and the natural numbers;
6108 * the datatype declaration of type T now defines the recursor T_rec;
6110 * simplification automatically does freeness reasoning for datatype
6113 * automatic type-inference, with AddTCs command to insert new
6114 type-checking rules;
6116 * datatype introduction rules are now added as Safe Introduction rules
6119 * the syntax "if P then x else y" is now available in addition to
6123 *** Internal programming interfaces ***
6125 * tuned simplifier trace output; new flag debug_simp;
6127 * structures Vartab / Termtab (instances of TableFun) offer efficient
6128 tables indexed by indexname_ord / term_ord (compatible with aconv);
6130 * AxClass.axclass_tac lost the theory argument;
6132 * tuned current_goals_markers semantics: begin / end goal avoids
6133 printing empty lines;
6135 * removed prs and prs_fn hook, which was broken because it did not
6136 include \n in its semantics, forcing writeln to add one
6137 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6138 string -> unit if you really want to output text without newline;
6140 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6141 plain output, interface builders may have to enable 'isabelle_font'
6142 mode to get Isabelle font glyphs as before;
6144 * refined token_translation interface; INCOMPATIBILITY: output length
6145 now of type real instead of int;
6147 * theory loader actions may be traced via new ThyInfo.add_hook
6148 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6149 your own database of information attached to *whole* theories -- as
6150 opposed to intra-theory data slots offered via TheoryDataFun;
6152 * proper handling of dangling sort hypotheses (at last!);
6153 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6154 extra sort hypotheses that can be witnessed from the type signature;
6155 the force_strip_shyps flag is gone, any remaining shyps are simply
6156 left in the theorem (with a warning issued by strip_shyps_warning);
6160 New in Isabelle98-1 (October 1998)
6161 ----------------------------------
6163 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6165 * several changes of automated proof tools;
6167 * HOL: major changes to the inductive and datatype packages, including
6168 some minor incompatibilities of theory syntax;
6170 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6173 * HOL: removed duplicate thms in Arith:
6174 less_imp_add_less should be replaced by trans_less_add1
6175 le_imp_add_le should be replaced by trans_le_add1
6177 * HOL: unary minus is now overloaded (new type constraints may be
6180 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6181 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6182 now taken as an integer constant.
6184 * Pure: ML function 'theory_of' renamed to 'theory';
6190 1. Asm_full_simp_tac is now more aggressive.
6191 1. It will sometimes reorient premises if that increases their power to
6193 2. It does no longer proceed strictly from left to right but may also
6194 rotate premises to achieve further simplification.
6195 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6196 old Asm_full_simp_tac in that it does not rotate premises.
6197 2. The simplifier now knows a little bit about nat-arithmetic.
6199 * Classical reasoner: wrapper mechanism for the classical reasoner now
6200 allows for selected deletion of wrappers, by introduction of names for
6201 wrapper functionals. This implies that addbefore, addSbefore,
6202 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6203 and that adding two tactics with the same name overwrites the first
6204 one (emitting a warning).
6205 type wrapper = (int -> tactic) -> (int -> tactic)
6206 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6207 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6208 delWrapper, delSWrapper: claset * string -> claset
6209 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6211 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6212 semantics; addbefore now affects only the unsafe part of step_tac
6213 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6214 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6217 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6218 compWrapper; added safe wrapper (and access functions for it);
6220 * HOL/split_all_tac is now much faster and fails if there is nothing
6221 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6222 and the names of the automatically generated variables have changed.
6223 split_all_tac has moved within claset() from unsafe wrappers to safe
6224 wrappers, which means that !!-bound variables are split much more
6225 aggressively, and safe_tac and clarify_tac now split such variables.
6226 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6227 Note: the same holds for record_split_tac, which does the job of
6228 split_all_tac for record fields.
6230 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6231 permanently to the default simpset using Addsplits just like
6232 Addsimps. They can be removed via Delsplits just like
6233 Delsimps. Lower-case versions are also available.
6235 * HOL/Simplifier: The rule split_if is now part of the default
6236 simpset. This means that the simplifier will eliminate all occurrences
6237 of if-then-else in the conclusion of a goal. To prevent this, you can
6238 either remove split_if completely from the default simpset by
6239 `Delsplits [split_if]' or remove it in a specific call of the
6240 simplifier using `... delsplits [split_if]'. You can also add/delete
6241 other case splitting rules to/from the default simpset: every datatype
6242 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6243 t is the name of the datatype).
6245 * Classical reasoner / Simplifier combination: new force_tac (and
6246 derivatives Force_tac, force) combines rewriting and classical
6247 reasoning (and whatever other tools) similarly to auto_tac, but is
6248 aimed to solve the given subgoal completely.
6253 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6254 and `goalw': the theory is no longer needed as an explicit argument -
6255 the current theory context is used; assumptions are no longer returned
6256 at the ML-level unless one of them starts with ==> or !!; it is
6257 recommended to convert to these new commands using isatool fixgoal
6258 (backup your sources first!);
6260 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6261 the current theory context, and 'theory' to lookup stored theories;
6263 * new theory section 'locale' for declaring constants, assumptions and
6264 definitions that have local scope;
6266 * new theory section 'nonterminals' for purely syntactic types;
6268 * new theory section 'setup' for generic ML setup functions
6269 (e.g. package initialization);
6271 * the distribution now includes Isabelle icons: see
6272 lib/logo/isabelle-{small,tiny}.xpm;
6274 * isatool install - install binaries with absolute references to
6277 * isatool logo -- create instances of the Isabelle logo (as EPS);
6279 * print mode 'emacs' reserved for Isamode;
6281 * support multiple print (ast) translations per constant name;
6283 * theorems involving oracles are now printed with a suffixed [!];
6288 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6290 * HOL/inductive package reorganized and improved: now supports mutual
6296 oddI "n : EVEN ==> Suc n : ODD"
6297 evenI "n : ODD ==> Suc n : EVEN"
6299 new theorem list "elims" contains an elimination rule for each of the
6300 recursive sets; inductive definitions now handle disjunctive premises
6301 correctly (also ZF);
6303 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6304 "mutual_induct" no longer exists - the induction rule is always
6305 contained in "induct";
6308 * HOL/datatype package re-implemented and greatly improved: now
6309 supports mutually recursive datatypes such as
6312 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6313 | SUM ('a aexp) ('a aexp)
6314 | DIFF ('a aexp) ('a aexp)
6317 'a bexp = LESS ('a aexp) ('a aexp)
6318 | AND ('a bexp) ('a bexp)
6319 | OR ('a bexp) ('a bexp)
6321 as well as indirectly recursive datatypes such as
6324 ('a, 'b) term = Var 'a
6325 | App 'b ((('a, 'b) term) list)
6327 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6328 induction on mutually / indirectly recursive datatypes.
6330 Primrec equations are now stored in theory and can be accessed via
6331 <function_name>.simps.
6335 - Theories using datatypes must now have theory Datatype as an
6337 - The specific <typename>.induct_tac no longer exists - use the
6338 generic induct_tac instead.
6339 - natE has been renamed to nat.exhaust - use exhaust_tac
6340 instead of res_inst_tac ... natE. Note that the variable
6341 names in nat.exhaust differ from the names in natE, this
6342 may cause some "fragile" proofs to fail.
6343 - The theorems split_<typename>_case and split_<typename>_case_asm
6344 have been renamed to <typename>.split and <typename>.split_asm.
6345 - Since default sorts of type variables are now handled correctly,
6346 some datatype definitions may have to be annotated with explicit
6348 - Primrec definitions no longer require function name and type
6349 of recursive argument.
6351 Consider using isatool fixdatatype to adapt your theories and proof
6352 scripts to the new package (backup your sources first!).
6355 * HOL/record package: considerably improved implementation; now
6356 includes concrete syntax for record types, terms, updates; theorems
6357 for surjective pairing and splitting !!-bound record variables; proof
6358 support is as follows:
6360 1) standard conversions (selectors or updates applied to record
6361 constructor terms) are part of the standard simpset;
6363 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6364 made part of standard simpset and claset via addIffs;
6366 3) a tactic for record field splitting (record_split_tac) is part of
6367 the standard claset (addSWrapper);
6369 To get a better idea about these rules you may retrieve them via
6370 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6371 the name of your record type.
6373 The split tactic 3) conceptually simplifies by the following rule:
6375 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6377 Thus any record variable that is bound by meta-all will automatically
6378 blow up into some record constructor term, consequently the
6379 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6380 solve record problems automatically.
6383 * reorganized the main HOL image: HOL/Integ and String loaded by
6384 default; theory Main includes everything;
6386 * automatic simplification of integer sums and comparisons, using cancellation;
6388 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6390 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6392 * many new identities for unions, intersections, set difference, etc.;
6394 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6395 called split_if, split_split, split_sum_case and split_nat_case (to go
6396 with add/delsplits);
6398 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6399 (?x::unit) = (); this is made part of the default simpset, which COULD
6400 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6401 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6402 unit_abs_eta_conv is added in order to counter the effect of
6403 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6406 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6409 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6410 It and 'sym RS equals0D' are now in the default claset, giving automatic
6411 disjointness reasoning but breaking a few old proofs.
6413 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6414 to 'converse' from 'inverse' (for compatibility with ZF and some
6417 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6418 the well-founded relation;
6420 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6421 Compl A. The "Compl" syntax remains available as input syntax for this
6424 * HOL/Update: new theory of function updates:
6425 f(a:=b) == %x. if x=a then b else f x
6426 may also be iterated as in f(a:=b,c:=d,...);
6428 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6431 - new function list_update written xs[i:=v] that updates the i-th
6432 list position. May also be iterated as in xs[i:=a,j:=b,...].
6433 - new function `upt' written [i..j(] which generates the list
6434 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6435 bound write [i..j], which is a shorthand for [i..j+1(].
6436 - new lexicographic orderings and corresponding wellfoundedness theorems.
6439 - removed 'pred' (predecessor) function;
6440 - generalized some theorems about n-1;
6441 - many new laws about "div" and "mod";
6442 - new laws about greatest common divisors (see theory ex/Primes);
6444 * HOL/Relation: renamed the relational operator r^-1 "converse"
6445 instead of "inverse";
6447 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6448 of the multiset ordering;
6450 * directory HOL/Real: a construction of the reals using Dedekind cuts
6451 (not included by default);
6453 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6455 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6456 programs, i.e. different program variables may have different types.
6458 * calling (stac rew i) now fails if "rew" has no effect on the goal
6459 [previously, this check worked only if the rewrite rule was unconditional]
6460 Now rew can involve either definitions or equalities (either == or =).
6465 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6466 only the theorems proved on ZF.ML;
6468 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6469 It and 'sym RS equals0D' are now in the default claset, giving automatic
6470 disjointness reasoning but breaking a few old proofs.
6472 * ZF/Update: new theory of function updates
6473 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6474 may also be iterated as in f(a:=b,c:=d,...);
6476 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6478 * calling (stac rew i) now fails if "rew" has no effect on the goal
6479 [previously, this check worked only if the rewrite rule was unconditional]
6480 Now rew can involve either definitions or equalities (either == or =).
6482 * case_tac provided for compatibility with HOL
6483 (like the old excluded_middle_tac, but with subgoals swapped)
6486 *** Internal programming interfaces ***
6488 * Pure: several new basic modules made available for general use, see
6489 also src/Pure/README;
6491 * improved the theory data mechanism to support encapsulation (data
6492 kind name replaced by private Object.kind, acting as authorization
6493 key); new type-safe user interface via functor TheoryDataFun; generic
6494 print_data function becomes basically useless;
6496 * removed global_names compatibility flag -- all theory declarations
6497 are qualified by default;
6499 * module Pure/Syntax now offers quote / antiquote translation
6500 functions (useful for Hoare logic etc. with implicit dependencies);
6501 see HOL/ex/Antiquote for an example use;
6503 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6506 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6509 * Display.print_goals function moved to Locale.print_goals;
6511 * standard print function for goals supports current_goals_markers
6512 variable for marking begin of proof, end of proof, start of goal; the
6513 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6514 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6519 New in Isabelle98 (January 1998)
6520 --------------------------------
6522 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6524 * changed lexical syntax of terms / types: dots made part of long
6525 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6527 * simpset (and claset) reference variable replaced by functions
6528 simpset / simpset_ref;
6530 * no longer supports theory aliases (via merge) and non-trivial
6531 implicit merge of thms' signatures;
6533 * most internal names of constants changed due to qualified names;
6535 * changed Pure/Sequence interface (see Pure/seq.ML);
6538 *** General Changes ***
6540 * hierachically structured name spaces (for consts, types, axms, thms
6541 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6542 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6543 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6544 long_names for fully qualified output names; NOTE: ML programs
6545 (special tactics, packages etc.) referring to internal names may have
6546 to be adapted to cope with fully qualified names; in case of severe
6547 backward campatibility problems try setting 'global_names' at compile
6548 time to have enrything declared within a flat name space; one may also
6549 fine tune name declarations in theories via the 'global' and 'local'
6552 * reimplemented the implicit simpset and claset using the new anytype
6553 data filed in signatures; references simpset:simpset ref etc. are
6554 replaced by functions simpset:unit->simpset and
6555 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6556 to patch your ML files accordingly;
6558 * HTML output now includes theory graph data for display with Java
6559 applet or isatool browser; data generated automatically via isatool
6560 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6562 * defs may now be conditional; improved rewrite_goals_tac to handle
6563 conditional equations;
6565 * defs now admits additional type arguments, using TYPE('a) syntax;
6567 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6568 creates a new theory node; implicit merge of thms' signatures is
6569 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6570 transfer:theory->thm->thm in (rare) cases;
6572 * improved handling of draft signatures / theories; draft thms (and
6573 ctyps, cterms) are automatically promoted to real ones;
6575 * slightly changed interfaces for oracles: admit many per theory, named
6576 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6578 * print_goals: optional output of const types (set show_consts and
6581 * improved output of warnings (###) and errors (***);
6583 * subgoal_tac displays a warning if the new subgoal has type variables;
6585 * removed old README and Makefiles;
6587 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6589 * removed obsolete init_pps and init_database;
6591 * deleted the obsolete tactical STATE, which was declared by
6592 fun STATE tacfun st = tacfun st st;
6594 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6595 (which abbreviates $HOME);
6597 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6598 use isatool fixseq to adapt your ML programs (this works for fully
6599 qualified references to the Sequence structure only!);
6601 * use_thy no longer requires writable current directory; it always
6602 reloads .ML *and* .thy file, if either one is out of date;
6605 *** Classical Reasoner ***
6607 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6608 tactics that use classical reasoning to simplify a subgoal without
6609 splitting it into several subgoals;
6611 * Safe_tac: like safe_tac but uses the default claset;
6616 * added simplification meta rules:
6617 (asm_)(full_)simplify: simpset -> thm -> thm;
6619 * simplifier.ML no longer part of Pure -- has to be loaded by object
6622 * added prems argument to simplification procedures;
6624 * HOL, FOL, ZF: added infix function `addsplits':
6625 instead of `<simpset> setloop (split_tac <thms>)'
6626 you can simply write `<simpset> addsplits <thms>'
6631 * TYPE('a) syntax for type reflection terms;
6633 * no longer handles consts with name "" -- declare as 'syntax' instead;
6635 * pretty printer: changed order of mixfix annotation preference (again!);
6637 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6642 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6643 with `addloop' of the simplifier to faciliate case splitting in premises.
6645 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6647 * HOL/Auth: new protocol proofs including some for the Internet
6650 * HOL/Map: new theory of `maps' a la VDM;
6652 * HOL/simplifier: simplification procedures nat_cancel_sums for
6653 cancelling out common nat summands from =, <, <= (in)equalities, or
6654 differences; simplification procedures nat_cancel_factor for
6655 cancelling common factor from =, <, <= (in)equalities over natural
6656 sums; nat_cancel contains both kinds of procedures, it is installed by
6657 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6659 * HOL/simplifier: terms of the form
6660 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6662 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6663 and those of the form
6664 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6666 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6669 Each datatype `t' now comes with a theorem `split_t_case' of the form
6671 P(t_case f1 ... fn x) =
6672 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6674 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6677 and a theorem `split_t_case_asm' of the form
6679 P(t_case f1 ... fn x) =
6680 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6682 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6684 which can be added to a simpset via `addsplits'. The existing theorems
6685 expand_list_case and expand_option_case have been renamed to
6686 split_list_case and split_option_case.
6689 - `pred n' is automatically converted to `n-1'.
6690 Users are strongly encouraged not to use `pred' any longer,
6691 because it will disappear altogether at some point.
6692 - Users are strongly encouraged to write "0 < n" rather than
6693 "n ~= 0". Theorems and proof tools have been modified towards this
6697 the function "set_of_list" has been renamed "set" (and its theorems too);
6698 the function "nth" now takes its arguments in the reverse order and
6699 has acquired the infix notation "!" as in "xs!n".
6701 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6703 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6704 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6706 * HOL/record: extensible records with schematic structural subtyping
6707 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6708 still lacks various theorems and concrete record syntax;
6713 * removed "axioms" and "generated by" sections;
6715 * replaced "ops" section by extended "consts" section, which is capable of
6716 handling the continuous function space "->" directly;
6719 . proves theorems immediately and stores them in the theory,
6720 . creates hierachical name space,
6721 . now uses normal mixfix annotations (instead of cinfix...),
6722 . minor changes to some names and values (for consistency),
6723 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6724 . separator between mutual domain defs: changed "," to "and",
6725 . improved handling of sort constraints; now they have to
6726 appear on the left-hand side of the equations only;
6728 * fixed LAM <x,y,zs>.b syntax;
6730 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6731 adm (%x. P (t x)), where P is chainfinite and t continuous;
6736 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6737 with `addloop' of the simplifier to faciliate case splitting in premises.
6739 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6740 in HOL, they strip ALL and --> from proved theorems;
6744 New in Isabelle94-8 (May 1997)
6745 ------------------------------
6747 *** General Changes ***
6749 * new utilities to build / run / maintain Isabelle etc. (in parts
6750 still somewhat experimental); old Makefiles etc. still functional;
6752 * new 'Isabelle System Manual';
6754 * INSTALL text, together with ./configure and ./build scripts;
6756 * reimplemented type inference for greater efficiency, better error
6757 messages and clean internal interface;
6759 * prlim command for dealing with lots of subgoals (an easier way of
6760 setting goals_limit);
6765 * supports alternative (named) syntax tables (parser and pretty
6766 printer); internal interface is provided by add_modesyntax(_i);
6768 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6769 be used in conjunction with the Isabelle symbol font; uses the
6770 "symbols" syntax table;
6772 * added token_translation interface (may translate name tokens in
6773 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6774 the current print_mode); IMPORTANT: user print translation functions
6775 are responsible for marking newly introduced bounds
6776 (Syntax.mark_boundT);
6778 * token translations for modes "xterm" and "xterm_color" that display
6779 names in bold, underline etc. or colors (which requires a color
6782 * infixes may now be declared with names independent of their syntax;
6784 * added typed_print_translation (like print_translation, but may
6785 access type of constant);
6788 *** Classical Reasoner ***
6790 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6791 some limitations. Blast_tac...
6792 + ignores addss, addbefore, addafter; this restriction is intrinsic
6793 + ignores elimination rules that don't have the correct format
6794 (the conclusion MUST be a formula variable)
6795 + ignores types, which can make HOL proofs fail
6796 + rules must not require higher-order unification, e.g. apply_type in ZF
6797 [message "Function Var's argument not a bound variable" relates to this]
6798 + its proof strategy is more general but can actually be slower
6800 * substitution with equality assumptions no longer permutes other
6803 * minor changes in semantics of addafter (now called addaltern); renamed
6804 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6805 (and access functions for it);
6807 * improved combination of classical reasoner and simplifier:
6808 + functions for handling clasimpsets
6809 + improvement of addss: now the simplifier is called _after_ the
6811 + safe variant of addss called addSss: uses safe simplifications
6812 _during_ the safe steps. It is more complete as it allows multiple
6813 instantiations of unknowns (e.g. with slow_tac).
6817 * added interface for simplification procedures (functions that
6818 produce *proven* rewrite rules on the fly, depending on current
6821 * ordering on terms as parameter (used for ordered rewriting);
6823 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6825 * the solver is now split into a safe and an unsafe part.
6826 This should be invisible for the normal user, except that the
6827 functions setsolver and addsolver have been renamed to setSolver and
6828 addSolver; added safe_asm_full_simp_tac;
6833 * a generic induction tactic `induct_tac' which works for all datatypes and
6834 also for type `nat';
6836 * a generic case distinction tactic `exhaust_tac' which works for all
6837 datatypes and also for type `nat';
6839 * each datatype comes with a function `size';
6841 * patterns in case expressions allow tuple patterns as arguments to
6842 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6844 * primrec now also works with type nat;
6846 * recdef: a new declaration form, allows general recursive functions to be
6847 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6849 * the constant for negation has been renamed from "not" to "Not" to
6850 harmonize with FOL, ZF, LK, etc.;
6852 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6855 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6857 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6858 problems in commutative rings, using axiomatic type classes for + and *;
6860 * more examples in HOL/MiniML and HOL/Auth;
6862 * more default rewrite rules for quantifiers, union/intersection;
6864 * a new constant `arbitrary == @x.False';
6866 * HOLCF/IOA replaces old HOL/IOA;
6868 * HOLCF changes: derived all rules and arities
6869 + axiomatic type classes instead of classes
6870 + typedef instead of faking type definitions
6871 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6872 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6873 + eliminated the types void, one, tr
6874 + use unit lift and bool lift (with translations) instead of one and tr
6875 + eliminated blift from Lift3.thy (use Def instead of blift)
6876 all eliminated rules are derived as theorems --> no visible changes ;
6881 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6882 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6883 as ZF_cs addSIs [equalityI];
6887 New in Isabelle94-7 (November 96)
6888 ---------------------------------
6890 * allowing negative levels (as offsets) in prlev and choplev;
6892 * super-linear speedup for large simplifications;
6894 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6895 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6896 FAIL); can suppress it using the command Delsimps (ex_simps @
6897 all_simps); De Morgan laws are also now included, by default;
6899 * improved printing of ==> : ~:
6901 * new object-logic "Sequents" adds linear logic, while replacing LK
6902 and Modal (thanks to Sara Kalvala);
6904 * HOL/Auth: correctness proofs for authentication protocols;
6906 * HOL: new auto_tac combines rewriting and classical reasoning (many
6907 examples on HOL/Auth);
6909 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6910 the rewriter and classical reasoner simultaneously;
6912 * function uresult no longer returns theorems in "standard" format;
6913 regain previous version by: val uresult = standard o uresult;
6920 * oracles -- these establish an interface between Isabelle and trusted
6921 external reasoners, which may deliver results as theorems;
6923 * proof objects (in particular record all uses of oracles);
6925 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6927 * "constdefs" section in theory files;
6929 * "primrec" section (HOL) no longer requires names;
6931 * internal type "tactic" now simply "thm -> thm Sequence.seq";
6938 * reduced space requirements;
6940 * automatic HTML generation from theories;
6942 * theory files no longer require "..." (quotes) around most types;
6944 * new examples, including two proofs of the Church-Rosser theorem;
6946 * non-curried (1994) version of HOL is no longer distributed;
6953 * greatly reduced space requirements;
6955 * theory files (.thy) no longer require \...\ escapes at line breaks;
6957 * searchable theorem database (see the section "Retrieving theorems" on
6958 page 8 of the Reference Manual);
6960 * new examples, including Grabczewski's monumental case study of the
6963 * The previous version of HOL renamed to Old_HOL;
6965 * The new version of HOL (previously called CHOL) uses a curried syntax
6966 for functions. Application looks like f a b instead of f(a,b);
6968 * Mutually recursive inductive definitions finally work in HOL;
6970 * In ZF, pattern-matching on tuples is now available in all abstractions and
6971 translates to the operator "split";
6978 * new infix operator, addss, allowing the classical reasoner to
6979 perform simplification at each step of its search. Example:
6980 fast_tac (cs addss ss)
6982 * a new logic, CHOL, the same as HOL, but with a curried syntax
6983 for functions. Application looks like f a b instead of f(a,b). Also pairs
6984 look like (a,b) instead of <a,b>;
6986 * PLEASE NOTE: CHOL will eventually replace HOL!
6988 * In CHOL, pattern-matching on tuples is now available in all abstractions.
6989 It translates to the operator "split". A new theory of integers is available;
6991 * In ZF, integer numerals now denote two's-complement binary integers.
6992 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
6994 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
6995 of the Axiom of Choice;
7002 * Significantly faster resolution;
7004 * the different sections in a .thy file can now be mixed and repeated
7007 * Database of theorems for FOL, HOL and ZF. New
7008 commands including qed, qed_goal and bind_thm store theorems in the database.
7010 * Simple database queries: return a named theorem (get_thm) or all theorems of
7011 a given theory (thms_of), or find out what theory a theorem was proved in
7014 * Bugs fixed in the inductive definition and datatype packages;
7016 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7017 and HOL_dup_cs obsolete;
7019 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7022 * Simpler definition of function space in ZF;
7024 * new results about cardinal and ordinal arithmetic in ZF;
7026 * 'subtype' facility in HOL for introducing new types as subsets of existing
7029 :mode=text:wrap=hard:maxLineLen=72: