1 Isabelle NEWS -- history user-relevant changes
2 ==============================================
4 New in this Isabelle version
5 ----------------------------
9 * Schematic theorem statements need to be explicitly markup as such,
10 via commands 'schematic_lemma', 'schematic_theorem',
11 'schematic_corollary'. Thus the relevance of the proof is made
12 syntactically clear, which impacts performance in a parallel or
13 asynchronous interactive environment. Minor INCOMPATIBILITY.
15 * Authentic syntax for *all* logical entities (type classes, type
16 constructors, term constants): provides simple and robust
17 correspondence between formal entities and concrete syntax. Within
18 the parse tree / AST representations, "constants" are decorated by
19 their category (class, type, const) and spelled out explicitly with
20 their full internal name.
22 Substantial INCOMPATIBILITY concerning low-level syntax declarations
23 and translations (translation rules and translation functions in ML).
24 Some hints on upgrading:
26 - Many existing uses of 'syntax' and 'translations' can be replaced
27 by more modern 'type_notation', 'notation' and 'abbreviation',
28 which are independent of this issue.
30 - 'translations' require markup within the AST; the term syntax
31 provides the following special forms:
33 CONST c -- produces syntax version of constant c from context
34 XCONST c -- literally c, checked as constant from context
35 c -- literally c, if declared by 'syntax'
37 Plain identifiers are treated as AST variables -- occasionally the
38 system indicates accidental variables via the error "rhs contains
41 Type classes and type constructors are marked according to their
42 concrete syntax. Some old translations rules need to be written
43 for the "type" category, using type constructor application
44 instead of pseudo-term application of the default category
47 - 'parse_translation' etc. in ML may use the following
50 @{class_syntax c} -- type class c within parse tree / AST
51 @{term_syntax c} -- type constructor c within parse tree / AST
52 @{const_syntax c} -- ML version of "CONST c" above
53 @{syntax_const c} -- literally c (checked wrt. 'syntax' declarations)
55 - Literal types within 'typed_print_translations', i.e. those *not*
56 represented as pseudo-terms are represented verbatim. Use @{class
57 c} or @{type_name c} here instead of the above syntax
60 Note that old non-authentic syntax was based on unqualified base
61 names, so all of the above "constant" names would coincide. Recall
62 that 'print_syntax' and ML_command "set Syntax.trace_ast" help to
63 diagnose syntax problems.
65 * Type constructors admit general mixfix syntax, not just infix.
67 * Concrete syntax may be attached to local entities without a proof
68 body, too. This works via regular mixfix annotations for 'fix',
69 'def', 'obtain' etc. or via the explicit 'write' command, which is
70 similar to the 'notation' command in theory specifications.
72 * Use of cumulative prems via "!" in some proof methods has been
73 discontinued (legacy feature).
75 * References 'trace_simp' and 'debug_simp' have been replaced by
76 configuration options stored in the context. Enabling tracing
77 (the case of debugging is similar) in proofs works via
79 using [[trace_simp=true]]
81 Tracing is then active for all invocations of the simplifier
82 in subsequent goal refinement steps. Tracing may also still be
83 enabled or disabled via the ProofGeneral settings menu.
85 * Separate commands 'hide_class', 'hide_type', 'hide_const',
86 'hide_fact' replace the former 'hide' KIND command. Minor
92 * Predicates of locales introduces by classes carry a mandatory "class"
93 prefix. INCOMPATIBILITY.
95 * 'code_reflect' allows to incorporate generated ML code into
96 runtime environment; replaces immature code_datatype antiquotation.
99 * Empty class specifications observe default sort. INCOMPATIBILITY.
101 * Old 'axclass' has been discontinued. Use 'class' instead. INCOMPATIBILITY.
103 * Code generator: simple concept for abstract datatypes obeying invariants.
105 * Local theory specifications may depend on extra type variables that
106 are not present in the result type -- arguments TYPE('a) :: 'a itself
107 are added internally. For example:
109 definition unitary :: bool where "unitary = (ALL (x::'a) y. x = y)"
111 * Code generator: details of internal data cache have no impact on
112 the user space functionality any longer.
114 * Methods unfold_locales and intro_locales ignore non-locale subgoals. This
115 is more appropriate for interpretations with 'where'. INCOMPATIBILITY.
117 * Discontinued unnamed infix syntax (legacy feature for many years) --
118 need to specify constant name and syntax separately. Internal ML
119 datatype constructors have been renamed from InfixName to Infix etc.
120 Minor INCOMPATIBILITY.
122 * Command 'example_proof' opens an empty proof body. This allows to
123 experiment with Isar, without producing any persistent result.
125 * Commands 'type_notation' and 'no_type_notation' declare type syntax
126 within a local theory context, with explicit checking of the
127 constructors involved (in contrast to the raw 'syntax' versions).
129 * Commands 'types' and 'typedecl' now work within a local theory
130 context -- without introducing dependencies on parameters or
131 assumptions, which is not possible in Isabelle/Pure.
133 * Command 'defaultsort' is renamed to 'default_sort', it works within
134 a local theory context. Minor INCOMPATIBILITY.
136 * Proof terms: Type substitutions on proof constants now use canonical
137 order of type variables. INCOMPATIBILITY: Tools working with proof
138 terms may need to be adapted.
143 * Theorem Int.int_induct renamed to Int.int_of_nat_induct and is
144 no longer shadowed. INCOMPATIBILITY.
146 * Dropped theorem duplicate comp_arith; use semiring_norm instead.
149 * Dropped theorem RealPow.real_sq_order; use power2_le_imp_le instead.
152 * Dropped normalizing_semiring etc; use the facts in semiring classes instead.
155 * Theory 'Finite_Set': various folding_* locales facilitate the application
156 of the various fold combinators on finite sets.
158 * Library theory 'RBT' renamed to 'RBT_Impl'; new library theory 'RBT'
159 provides abstract red-black tree type which is backed by RBT_Impl
160 as implementation. INCOMPATIBILTY.
162 * Command 'typedef' now works within a local theory context -- without
163 introducing dependencies on parameters or assumptions, which is not
164 possible in Isabelle/Pure/HOL. Note that the logical environment may
165 contain multiple interpretations of local typedefs (with different
166 non-emptiness proofs), even in a global theory context.
168 * Theory Library/Coinductive_List has been removed -- superseded by
169 AFP/thys/Coinductive.
171 * Theory PReal, including the type "preal" and related operations, has
172 been removed. INCOMPATIBILITY.
174 * Split off theory Big_Operators containing setsum, setprod, Inf_fin, Sup_fin,
175 Min, Max from theory Finite_Set. INCOMPATIBILITY.
177 * Theory "Rational" renamed to "Rat", for consistency with "Nat", "Int" etc.
180 * New set of rules "ac_simps" provides combined assoc / commute rewrites
181 for all interpretations of the appropriate generic locales.
183 * Renamed theory "OrderedGroup" to "Groups" and split theory "Ring_and_Field"
184 into theories "Rings" and "Fields"; for more appropriate and more
185 consistent names suitable for name prefixes within the HOL theories.
188 * Some generic constants have been put to appropriate theories:
189 * less_eq, less: Orderings
190 * zero, one, plus, minus, uminus, times, abs, sgn: Groups
191 * inverse, divide: Rings
194 * More consistent naming of type classes involving orderings (and lattices):
196 lower_semilattice ~> semilattice_inf
197 upper_semilattice ~> semilattice_sup
199 dense_linear_order ~> dense_linorder
201 pordered_ab_group_add ~> ordered_ab_group_add
202 pordered_ab_group_add_abs ~> ordered_ab_group_add_abs
203 pordered_ab_semigroup_add ~> ordered_ab_semigroup_add
204 pordered_ab_semigroup_add_imp_le ~> ordered_ab_semigroup_add_imp_le
205 pordered_cancel_ab_semigroup_add ~> ordered_cancel_ab_semigroup_add
206 pordered_cancel_comm_semiring ~> ordered_cancel_comm_semiring
207 pordered_cancel_semiring ~> ordered_cancel_semiring
208 pordered_comm_monoid_add ~> ordered_comm_monoid_add
209 pordered_comm_ring ~> ordered_comm_ring
210 pordered_comm_semiring ~> ordered_comm_semiring
211 pordered_ring ~> ordered_ring
212 pordered_ring_abs ~> ordered_ring_abs
213 pordered_semiring ~> ordered_semiring
215 ordered_ab_group_add ~> linordered_ab_group_add
216 ordered_ab_semigroup_add ~> linordered_ab_semigroup_add
217 ordered_cancel_ab_semigroup_add ~> linordered_cancel_ab_semigroup_add
218 ordered_comm_semiring_strict ~> linordered_comm_semiring_strict
219 ordered_field ~> linordered_field
220 ordered_field_no_lb ~> linordered_field_no_lb
221 ordered_field_no_ub ~> linordered_field_no_ub
222 ordered_field_dense_linear_order ~> dense_linordered_field
223 ordered_idom ~> linordered_idom
224 ordered_ring ~> linordered_ring
225 ordered_ring_le_cancel_factor ~> linordered_ring_le_cancel_factor
226 ordered_ring_less_cancel_factor ~> linordered_ring_less_cancel_factor
227 ordered_ring_strict ~> linordered_ring_strict
228 ordered_semidom ~> linordered_semidom
229 ordered_semiring ~> linordered_semiring
230 ordered_semiring_1 ~> linordered_semiring_1
231 ordered_semiring_1_strict ~> linordered_semiring_1_strict
232 ordered_semiring_strict ~> linordered_semiring_strict
234 The following slightly odd type classes have been moved to
235 a separate theory Library/Lattice_Algebras.thy:
237 lordered_ab_group_add ~> lattice_ab_group_add
238 lordered_ab_group_add_abs ~> lattice_ab_group_add_abs
239 lordered_ab_group_add_meet ~> semilattice_inf_ab_group_add
240 lordered_ab_group_add_join ~> semilattice_sup_ab_group_add
241 lordered_ring ~> lattice_ring
245 * Refined field classes:
246 * classes division_ring_inverse_zero, field_inverse_zero, linordered_field_inverse_zero
247 include rule inverse 0 = 0 -- subsumes former division_by_zero class.
248 * numerous lemmas have been ported from field to division_ring;
251 * Refined algebra theorem collections:
252 * dropped theorem group group_simps, use algebra_simps instead;
253 * dropped theorem group ring_simps, use field_simps instead;
254 * proper theorem collection field_simps subsumes former theorem groups field_eq_simps and field_simps;
255 * dropped lemma eq_minus_self_iff which is a duplicate for equal_neg_zero.
258 * Theory Finite_Set and List: some lemmas have been generalized from
261 fun_left_comm_idem_inter ~> fun_left_comm_idem_inf
262 fun_left_comm_idem_union ~> fun_left_comm_idem_sup
263 inter_Inter_fold_inter ~> inf_Inf_fold_inf
264 union_Union_fold_union ~> sup_Sup_fold_sup
265 Inter_fold_inter ~> Inf_fold_inf
266 Union_fold_union ~> Sup_fold_sup
267 inter_INTER_fold_inter ~> inf_INFI_fold_inf
268 union_UNION_fold_union ~> sup_SUPR_fold_sup
269 INTER_fold_inter ~> INFI_fold_inf
270 UNION_fold_union ~> SUPR_fold_sup
272 * Theory Complete_Lattice: lemmas top_def and bot_def have been
273 replaced by the more convenient lemmas Inf_empty and Sup_empty.
274 Dropped lemmas Inf_insert_simp and Sup_insert_simp, which are subsumed
275 by Inf_insert and Sup_insert. Lemmas Inf_UNIV and Sup_UNIV replace
276 former Inf_Univ and Sup_Univ. Lemmas inf_top_right and sup_bot_right
277 subsume inf_top and sup_bot respectively. INCOMPATIBILITY.
279 * HOLogic.strip_psplit: types are returned in syntactic order, similar
280 to other strip and tuple operations. INCOMPATIBILITY.
282 * Reorganized theory Multiset: swapped notation of pointwise and multiset order:
283 * pointwise ordering is instance of class order with standard syntax <= and <;
284 * multiset ordering has syntax <=# and <#; partial order properties are provided
285 by means of interpretation with prefix multiset_order;
286 * less duplication, less historical organization of sections,
287 conversion from associations lists to multisets, rudimentary code generation;
288 * use insert_DiffM2 [symmetric] instead of elem_imp_eq_diff_union, if needed.
291 * Code generation: ML and OCaml code is decorated with signatures.
293 * Theory List: added transpose.
295 * Renamed Library/Quotient.thy to Library/Quotient_Type.thy to avoid
296 clash with new theory Quotient in Main HOL.
298 * Library/Nat_Bijection.thy is a collection of bijective functions
299 between nat and other types, which supersedes the older libraries
300 Library/Nat_Int_Bij.thy and HOLCF/NatIso.thy. INCOMPATIBILITY.
303 Nat_Int_Bij.nat2_to_nat ~> prod_encode
304 Nat_Int_Bij.nat_to_nat2 ~> prod_decode
305 Nat_Int_Bij.int_to_nat_bij ~> int_encode
306 Nat_Int_Bij.nat_to_int_bij ~> int_decode
307 Countable.pair_encode ~> prod_encode
308 NatIso.prod2nat ~> prod_encode
309 NatIso.nat2prod ~> prod_decode
310 NatIso.sum2nat ~> sum_encode
311 NatIso.nat2sum ~> sum_decode
312 NatIso.list2nat ~> list_encode
313 NatIso.nat2list ~> list_decode
314 NatIso.set2nat ~> set_encode
315 NatIso.nat2set ~> set_decode
318 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_decode
319 Nat_Int_Bij.nat2_to_nat_inj ~> inj_prod_encode
320 Nat_Int_Bij.nat2_to_nat_surj ~> surj_prod_encode
321 Nat_Int_Bij.nat_to_nat2_inj ~> inj_prod_decode
322 Nat_Int_Bij.nat_to_nat2_surj ~> surj_prod_decode
323 Nat_Int_Bij.i2n_n2i_id ~> int_encode_inverse
324 Nat_Int_Bij.n2i_i2n_id ~> int_decode_inverse
325 Nat_Int_Bij.surj_nat_to_int_bij ~> surj_int_encode
326 Nat_Int_Bij.surj_int_to_nat_bij ~> surj_int_decode
327 Nat_Int_Bij.inj_nat_to_int_bij ~> inj_int_encode
328 Nat_Int_Bij.inj_int_to_nat_bij ~> inj_int_decode
329 Nat_Int_Bij.bij_nat_to_int_bij ~> bij_int_encode
330 Nat_Int_Bij.bij_int_to_nat_bij ~> bij_int_decode
335 * Variable names in lemmas generated by the domain package have
336 changed; the naming scheme is now consistent with the HOL datatype
337 package. Some proof scripts may be affected, INCOMPATIBILITY.
339 * The domain package no longer defines the function "foo_copy" for
340 recursive domain "foo". The reach lemma is now stated directly in
341 terms of "foo_take". Lemmas and proofs that mention "foo_copy" must
342 be reformulated in terms of "foo_take", INCOMPATIBILITY.
344 * Most definedness lemmas generated by the domain package (previously
345 of the form "x ~= UU ==> foo$x ~= UU") now have an if-and-only-if form
346 like "foo$x = UU <-> x = UU", which works better as a simp rule.
347 Proof scripts that used definedness lemmas as intro rules may break,
348 potential INCOMPATIBILITY.
350 * Induction and casedist rules generated by the domain package now
351 declare proper case_names (one called "bottom", and one named for each
352 constructor). INCOMPATIBILITY.
354 * For mutually-recursive domains, separate "reach" and "take_lemma"
355 rules are generated for each domain, INCOMPATIBILITY.
357 foo_bar.reach ~> foo.reach bar.reach
358 foo_bar.take_lemmas ~> foo.take_lemma bar.take_lemma
360 * Some lemmas generated by the domain package have been renamed for
361 consistency with the datatype package, INCOMPATIBILITY.
363 foo.ind ~> foo.induct
364 foo.finite_ind ~> foo.finite_induct
365 foo.coind ~> foo.coinduct
366 foo.casedist ~> foo.exhaust
367 foo.exhaust ~> foo.nchotomy
369 * For consistency with other definition packages, the fixrec package
370 now generates qualified theorem names, INCOMPATIBILITY.
372 foo_simps ~> foo.simps
373 foo_unfold ~> foo.unfold
374 foo_induct ~> foo.induct
376 * The "contlub" predicate has been removed. Proof scripts should use
377 lemma contI2 in place of monocontlub2cont, INCOMPATIBILITY.
379 * The "admw" predicate has been removed, INCOMPATIBILITY.
381 * The constants cpair, cfst, and csnd have been removed in favor of
382 Pair, fst, and snd from Isabelle/HOL, INCOMPATIBILITY.
387 * Sorts.certify_sort and derived "cert" operations for types and terms
388 no longer minimize sorts. Thus certification at the boundary of the
389 inference kernel becomes invariant under addition of class relations,
390 which is an important monotonicity principle. Sorts are now minimized
391 in the syntax layer only, at the boundary between the end-user and the
392 system. Subtle INCOMPATIBILITY, may have to use Sign.minimize_sort
393 explicitly in rare situations.
395 * Antiquotations for basic formal entities:
397 @{class NAME} -- type class
398 @{class_syntax NAME} -- syntax representation of the above
400 @{type_name NAME} -- logical type
401 @{type_abbrev NAME} -- type abbreviation
402 @{nonterminal NAME} -- type of concrete syntactic category
403 @{type_syntax NAME} -- syntax representation of any of the above
405 @{const_name NAME} -- logical constant (INCOMPATIBILITY)
406 @{const_abbrev NAME} -- abbreviated constant
407 @{const_syntax NAME} -- syntax representation of any of the above
409 * Antiquotation @{syntax_const NAME} ensures that NAME refers to a raw
410 syntax constant (cf. 'syntax' command).
412 * Antiquotation @{make_string} inlines a function to print arbitrary
413 values similar to the ML toplevel. The result is compiler dependent
414 and may fall back on "?" in certain situations.
416 * Renamed old-style Drule.standard to Drule.export_without_context, to
417 emphasize that this is in no way a standard operation.
420 * Curried take and drop in library.ML; negative length is interpreted
421 as infinity (as in chop). INCOMPATIBILITY.
423 * Subgoal.FOCUS (and variants): resulting goal state is normalized as
424 usual for resolution. Rare INCOMPATIBILITY.
426 * Discontinued old TheoryDataFun with its copy/init operation -- data
427 needs to be pure. Functor Theory_Data_PP retains the traditional
428 Pretty.pp argument to merge, which is absent in the standard
431 * Renamed varify/unvarify operations to varify_global/unvarify_global
432 to emphasize that these only work in a global situation (which is
435 * Configuration options now admit dynamic default values, depending on
436 the context or even global references.
438 * Most operations that refer to a global context are named
439 accordingly, e.g. Simplifier.global_context or
440 ProofContext.init_global. There are some situations where a global
441 context actually works, but under normal circumstances one needs to
442 pass the proper local context through the code!
447 * Discontinued special HOL_USEDIR_OPTIONS for the main HOL image;
448 ISABELLE_USEDIR_OPTIONS applies uniformly to all sessions. Note that
449 proof terms are enabled unconditionally in the new HOL-Proofs image.
451 * Discontinued old ISABELLE and ISATOOL environment settings (legacy
452 feature since Isabelle2009). Use ISABELLE_PROCESS and ISABELLE_TOOL,
455 * Old lib/scripts/polyml-platform is superseded by the
456 ISABELLE_PLATFORM setting variable, which defaults to the 32 bit
457 variant, even on a 64 bit machine. The following example setting
458 prefers 64 bit if available:
460 ML_PLATFORM="${ISABELLE_PLATFORM64:-$ISABELLE_PLATFORM}"
464 New in Isabelle2009-1 (December 2009)
465 -------------------------------------
469 * Discontinued old form of "escaped symbols" such as \\<forall>. Only
470 one backslash should be used, even in ML sources.
475 * Locale interpretation propagates mixins along the locale hierarchy.
476 The currently only available mixins are the equations used to map
477 local definitions to terms of the target domain of an interpretation.
479 * Reactivated diagnostic command 'print_interps'. Use "print_interps
480 loc" to print all interpretations of locale "loc" in the theory.
481 Interpretations in proofs are not shown.
483 * Thoroughly revised locales tutorial. New section on conditional
486 * On instantiation of classes, remaining undefined class parameters
487 are formally declared. INCOMPATIBILITY.
490 *** Document preparation ***
492 * New generalized style concept for printing terms: @{foo (style) ...}
493 instead of @{foo_style style ...} (old form is still retained for
494 backward compatibility). Styles can be also applied for
495 antiquotations prop, term_type and typeof.
500 * New proof method "smt" for a combination of first-order logic with
501 equality, linear and nonlinear (natural/integer/real) arithmetic, and
502 fixed-size bitvectors; there is also basic support for higher-order
503 features (esp. lambda abstractions). It is an incomplete decision
504 procedure based on external SMT solvers using the oracle mechanism;
505 for the SMT solver Z3, this method is proof-producing. Certificates
506 are provided to avoid calling the external solvers solely for
507 re-checking proofs. Due to a remote SMT service there is no need for
508 installing SMT solvers locally. See src/HOL/SMT.
510 * New commands to load and prove verification conditions generated by
511 the Boogie program verifier or derived systems (e.g. the Verifying C
512 Compiler (VCC) or Spec#). See src/HOL/Boogie.
514 * New counterexample generator tool 'nitpick' based on the Kodkod
515 relational model finder. See src/HOL/Tools/Nitpick and
516 src/HOL/Nitpick_Examples.
518 * New commands 'code_pred' and 'values' to invoke the predicate
519 compiler and to enumerate values of inductive predicates.
521 * A tabled implementation of the reflexive transitive closure.
523 * New implementation of quickcheck uses generic code generator;
524 default generators are provided for all suitable HOL types, records
525 and datatypes. Old quickcheck can be re-activated importing theory
526 Library/SML_Quickcheck.
528 * New testing tool Mirabelle for automated proof tools. Applies
529 several tools and tactics like sledgehammer, metis, or quickcheck, to
530 every proof step in a theory. To be used in batch mode via the
533 * New proof method "sos" (sum of squares) for nonlinear real
534 arithmetic (originally due to John Harison). It requires theory
535 Library/Sum_Of_Squares. It is not a complete decision procedure but
536 works well in practice on quantifier-free real arithmetic with +, -,
537 *, ^, =, <= and <, i.e. boolean combinations of equalities and
538 inequalities between polynomials. It makes use of external
539 semidefinite programming solvers. Method "sos" generates a
540 certificate that can be pasted into the proof thus avoiding the need
541 to call an external tool every time the proof is checked. See
542 src/HOL/Library/Sum_Of_Squares.
544 * New method "linarith" invokes existing linear arithmetic decision
547 * New command 'atp_minimal' reduces result produced by Sledgehammer.
549 * New Sledgehammer option "Full Types" in Proof General settings menu.
550 Causes full type information to be output to the ATPs. This slows
551 ATPs down considerably but eliminates a source of unsound "proofs"
554 * New method "metisFT": A version of metis that uses full type
555 information in order to avoid failures of proof reconstruction.
557 * New evaluator "approximate" approximates an real valued term using
558 the same method as the approximation method.
560 * Method "approximate" now supports arithmetic expressions as
561 boundaries of intervals and implements interval splitting and Taylor
564 * ML antiquotation @{code_datatype} inserts definition of a datatype
565 generated by the code generator; e.g. see src/HOL/Predicate.thy.
567 * New theory SupInf of the supremum and infimum operators for sets of
570 * New theory Probability, which contains a development of measure
571 theory, eventually leading to Lebesgue integration and probability.
573 * Extended Multivariate Analysis to include derivation and Brouwer's
576 * Reorganization of number theory, INCOMPATIBILITY:
577 - new number theory development for nat and int, in theories Divides
578 and GCD as well as in new session Number_Theory
579 - some constants and facts now suffixed with _nat and _int
581 - former session NumberTheory now named Old_Number_Theory, including
582 theories Legacy_GCD and Primes (prefer Number_Theory if possible)
583 - moved theory Pocklington from src/HOL/Library to
584 src/HOL/Old_Number_Theory
586 * Theory GCD includes functions Gcd/GCD and Lcm/LCM for the gcd and
587 lcm of finite and infinite sets. It is shown that they form a complete
590 * Class semiring_div requires superclass no_zero_divisors and proof of
591 div_mult_mult1; theorems div_mult_mult1, div_mult_mult2,
592 div_mult_mult1_if, div_mult_mult1 and div_mult_mult2 have been
593 generalized to class semiring_div, subsuming former theorems
594 zdiv_zmult_zmult1, zdiv_zmult_zmult1_if, zdiv_zmult_zmult1 and
595 zdiv_zmult_zmult2. div_mult_mult1 is now [simp] by default.
598 * Refinements to lattice classes and sets:
599 - less default intro/elim rules in locale variant, more default
600 intro/elim rules in class variant: more uniformity
601 - lemma ge_sup_conv renamed to le_sup_iff, in accordance with
603 - dropped lemma alias inf_ACI for inf_aci (same for sup_ACI and
605 - renamed ACI to inf_sup_aci
606 - new class "boolean_algebra"
607 - class "complete_lattice" moved to separate theory
608 "Complete_Lattice"; corresponding constants (and abbreviations)
609 renamed and with authentic syntax:
610 Set.Inf ~> Complete_Lattice.Inf
611 Set.Sup ~> Complete_Lattice.Sup
612 Set.INFI ~> Complete_Lattice.INFI
613 Set.SUPR ~> Complete_Lattice.SUPR
614 Set.Inter ~> Complete_Lattice.Inter
615 Set.Union ~> Complete_Lattice.Union
616 Set.INTER ~> Complete_Lattice.INTER
617 Set.UNION ~> Complete_Lattice.UNION
618 - authentic syntax for
621 - mere abbreviations:
624 Set.inter (for inf, formerly Set.Int)
625 Set.union (for sup, formerly Set.Un)
626 Complete_Lattice.Inter (for Inf)
627 Complete_Lattice.Union (for Sup)
628 Complete_Lattice.INTER (for INFI)
629 Complete_Lattice.UNION (for SUPR)
630 - object-logic definitions as far as appropriate
632 INCOMPATIBILITY. Care is required when theorems Int_subset_iff or
633 Un_subset_iff are explicitly deleted as default simp rules; then also
634 their lattice counterparts le_inf_iff and le_sup_iff have to be
635 deleted to achieve the desired effect.
637 * Rules inf_absorb1, inf_absorb2, sup_absorb1, sup_absorb2 are no simp
638 rules by default any longer; the same applies to min_max.inf_absorb1
639 etc. INCOMPATIBILITY.
641 * Rules sup_Int_eq and sup_Un_eq are no longer declared as
642 pred_set_conv by default. INCOMPATIBILITY.
644 * Power operations on relations and functions are now one dedicated
645 constant "compow" with infix syntax "^^". Power operation on
646 multiplicative monoids retains syntax "^" and is now defined generic
647 in class power. INCOMPATIBILITY.
649 * Relation composition "R O S" now has a more standard argument order:
650 "R O S = {(x, z). EX y. (x, y) : R & (y, z) : S}". INCOMPATIBILITY,
651 rewrite propositions with "S O R" --> "R O S". Proofs may occasionally
652 break, since the O_assoc rule was not rewritten like this. Fix using
653 O_assoc[symmetric]. The same applies to the curried version "R OO S".
655 * Function "Inv" is renamed to "inv_into" and function "inv" is now an
656 abbreviation for "inv_into UNIV". Lemmas are renamed accordingly.
659 * Most rules produced by inductive and datatype package have mandatory
660 prefixes. INCOMPATIBILITY.
662 * Changed "DERIV_intros" to a dynamic fact, which can be augmented by
663 the attribute of the same name. Each of the theorems in the list
664 DERIV_intros assumes composition with an additional function and
665 matches a variable to the derivative, which has to be solved by the
666 Simplifier. Hence (auto intro!: DERIV_intros) computes the derivative
667 of most elementary terms. Former Maclauren.DERIV_tac and
668 Maclauren.deriv_tac should be replaced by (auto intro!: DERIV_intros).
671 * Code generator attributes follow the usual underscore convention:
672 code_unfold replaces code unfold
673 code_post replaces code post
678 sizechange -> size_change
679 induct_scheme -> induction_schema
682 * Discontinued abbreviation "arbitrary" of constant "undefined".
683 INCOMPATIBILITY, use "undefined" directly.
686 Suc_eq_add_numeral_1 -> Suc_eq_plus1
687 Suc_eq_add_numeral_1_left -> Suc_eq_plus1_left
688 Suc_plus1 -> Suc_eq_plus1
689 *anti_sym -> *antisym*
690 vector_less_eq_def -> vector_le_def
693 * Added theorem List.map_map as [simp]. Removed List.map_compose.
696 * Removed predicate "M hassize n" (<--> card M = n & finite M).
702 * Theory Representable defines a class "rep" of domains that are
703 representable (via an ep-pair) in the universal domain type "udom".
704 Instances are provided for all type constructors defined in HOLCF.
706 * The 'new_domain' command is a purely definitional version of the
707 domain package, for representable domains. Syntax is identical to the
708 old domain package. The 'new_domain' package also supports indirect
709 recursion using previously-defined type constructors. See
710 src/HOLCF/ex/New_Domain.thy for examples.
712 * Method "fixrec_simp" unfolds one step of a fixrec-defined constant
713 on the left-hand side of an equation, and then performs
714 simplification. Rewriting is done using rules declared with the
715 "fixrec_simp" attribute. The "fixrec_simp" method is intended as a
716 replacement for "fixpat"; see src/HOLCF/ex/Fixrec_ex.thy for examples.
718 * The pattern-match compiler in 'fixrec' can now handle constructors
719 with HOL function types. Pattern-match combinators for the Pair
720 constructor are pre-configured.
722 * The 'fixrec' package now produces better fixed-point induction rules
723 for mutually-recursive definitions: Induction rules have conclusions
724 of the form "P foo bar" instead of "P <foo, bar>".
726 * The constant "sq_le" (with infix syntax "<<" or "\<sqsubseteq>") has
727 been renamed to "below". The name "below" now replaces "less" in many
728 theorem names. (Legacy theorem names using "less" are still supported
731 * The 'fixrec' package now supports "bottom patterns". Bottom
732 patterns can be used to generate strictness rules, or to make
733 functions more strict (much like the bang-patterns supported by the
734 Glasgow Haskell Compiler). See src/HOLCF/ex/Fixrec_ex.thy for
740 * Support for Poly/ML 5.3.0, with improved reporting of compiler
741 errors and run-time exceptions, including detailed source positions.
743 * Structure Name_Space (formerly NameSpace) now manages uniquely
744 identified entries, with some additional information such as source
745 position, logical grouping etc.
747 * Theory and context data is now introduced by the simplified and
748 modernized functors Theory_Data, Proof_Data, Generic_Data. Data needs
749 to be pure, but the old TheoryDataFun for mutable data (with explicit
750 copy operation) is still available for some time.
752 * Structure Synchronized (cf. src/Pure/Concurrent/synchronized.ML)
753 provides a high-level programming interface to synchronized state
754 variables with atomic update. This works via pure function
755 application within a critical section -- its runtime should be as
756 short as possible; beware of deadlocks if critical code is nested,
757 either directly or indirectly via other synchronized variables!
759 * Structure Unsynchronized (cf. src/Pure/ML-Systems/unsynchronized.ML)
760 wraps raw ML references, explicitly indicating their non-thread-safe
761 behaviour. The Isar toplevel keeps this structure open, to
762 accommodate Proof General as well as quick and dirty interactive
763 experiments with references.
765 * PARALLEL_CHOICE and PARALLEL_GOALS provide basic support for
766 parallel tactical reasoning.
768 * Tacticals Subgoal.FOCUS, Subgoal.FOCUS_PREMS, Subgoal.FOCUS_PARAMS
769 are similar to SUBPROOF, but are slightly more flexible: only the
770 specified parts of the subgoal are imported into the context, and the
771 body tactic may introduce new subgoals and schematic variables.
773 * Old tactical METAHYPS, which does not observe the proof context, has
774 been renamed to Old_Goals.METAHYPS and awaits deletion. Use SUBPROOF
775 or Subgoal.FOCUS etc.
777 * Renamed functor TableFun to Table, and GraphFun to Graph. (Since
778 functors have their own ML name space there is no point to mark them
779 separately.) Minor INCOMPATIBILITY.
781 * Renamed NamedThmsFun to Named_Thms. INCOMPATIBILITY.
783 * Renamed several structures FooBar to Foo_Bar. Occasional,
786 * Operations of structure Skip_Proof no longer require quick_and_dirty
787 mode, which avoids critical setmp.
789 * Eliminated old Attrib.add_attributes, Method.add_methods and related
790 combinators for "args". INCOMPATIBILITY, need to use simplified
791 Attrib/Method.setup introduced in Isabelle2009.
793 * Proper context for simpset_of, claset_of, clasimpset_of. May fall
794 back on global_simpset_of, global_claset_of, global_clasimpset_of as
795 last resort. INCOMPATIBILITY.
797 * Display.pretty_thm now requires a proper context (cf. former
798 ProofContext.pretty_thm). May fall back on Display.pretty_thm_global
799 or even Display.pretty_thm_without_context as last resort.
802 * Discontinued Display.pretty_ctyp/cterm etc. INCOMPATIBILITY, use
803 Syntax.pretty_typ/term directly, preferably with proper context
804 instead of global theory.
809 * Further fine tuning of parallel proof checking, scales up to 8 cores
810 (max. speedup factor 5.0). See also Goal.parallel_proofs in ML and
813 * Support for additional "Isabelle components" via etc/components, see
814 also the system manual.
816 * The isabelle makeall tool now operates on all components with
817 IsaMakefile, not just hardwired "logics".
819 * Removed "compress" option from isabelle-process and isabelle usedir;
820 this is always enabled.
822 * Discontinued support for Poly/ML 4.x versions.
824 * Isabelle tool "wwwfind" provides web interface for 'find_theorems'
825 on a given logic image. This requires the lighttpd webserver and is
826 currently supported on Linux only.
830 New in Isabelle2009 (April 2009)
831 --------------------------------
835 * Simplified main Isabelle executables, with less surprises on
836 case-insensitive file-systems (such as Mac OS).
838 - The main Isabelle tool wrapper is now called "isabelle" instead of
841 - The former "isabelle" alias for "isabelle-process" has been
842 removed (should rarely occur to regular users).
844 - The former "isabelle-interface" and its alias "Isabelle" have been
845 removed (interfaces are now regular Isabelle tools).
847 Within scripts and make files, the Isabelle environment variables
848 ISABELLE_TOOL and ISABELLE_PROCESS replace old ISATOOL and ISABELLE,
849 respectively. (The latter are still available as legacy feature.)
851 The old isabelle-interface wrapper could react in confusing ways if
852 the interface was uninstalled or changed otherwise. Individual
853 interface tool configuration is now more explicit, see also the
854 Isabelle system manual. In particular, Proof General is now available
855 via "isabelle emacs".
857 INCOMPATIBILITY, need to adapt derivative scripts. Users may need to
858 purge installed copies of Isabelle executables and re-run "isabelle
859 install -p ...", or use symlinks.
861 * The default for ISABELLE_HOME_USER is now ~/.isabelle instead of the
862 old ~/isabelle, which was slightly non-standard and apt to cause
863 surprises on case-insensitive file-systems (such as Mac OS).
865 INCOMPATIBILITY, need to move existing ~/isabelle/etc,
866 ~/isabelle/heaps, ~/isabelle/browser_info to the new place. Special
867 care is required when using older releases of Isabelle. Note that
868 ISABELLE_HOME_USER can be changed in Isabelle/etc/settings of any
869 Isabelle distribution, in order to use the new ~/.isabelle uniformly.
871 * Proofs of fully specified statements are run in parallel on
872 multi-core systems. A speedup factor of 2.5 to 3.2 can be expected on
873 a regular 4-core machine, if the initial heap space is made reasonably
874 large (cf. Poly/ML option -H). (Requires Poly/ML 5.2.1 or later.)
876 * The main reference manuals ("isar-ref", "implementation", and
877 "system") have been updated and extended. Formally checked references
878 as hyperlinks are now available uniformly.
883 * Complete re-implementation of locales. INCOMPATIBILITY in several
884 respects. The most important changes are listed below. See the
885 Tutorial on Locales ("locales" manual) for details.
887 - In locale expressions, instantiation replaces renaming. Parameters
888 must be declared in a for clause. To aid compatibility with previous
889 parameter inheritance, in locale declarations, parameters that are not
890 'touched' (instantiation position "_" or omitted) are implicitly added
891 with their syntax at the beginning of the for clause.
893 - Syntax from abbreviations and definitions in locales is available in
894 locale expressions and context elements. The latter is particularly
895 useful in locale declarations.
897 - More flexible mechanisms to qualify names generated by locale
898 expressions. Qualifiers (prefixes) may be specified in locale
899 expressions, and can be marked as mandatory (syntax: "name!:") or
900 optional (syntax "name?:"). The default depends for plain "name:"
901 depends on the situation where a locale expression is used: in
902 commands 'locale' and 'sublocale' prefixes are optional, in
903 'interpretation' and 'interpret' prefixes are mandatory. The old
904 implicit qualifiers derived from the parameter names of a locale are
907 - Command "sublocale l < e" replaces "interpretation l < e". The
908 instantiation clause in "interpretation" and "interpret" (square
909 brackets) is no longer available. Use locale expressions.
911 - When converting proof scripts, mandatory qualifiers in
912 'interpretation' and 'interpret' should be retained by default, even
913 if this is an INCOMPATIBILITY compared to former behavior. In the
914 worst case, use the "name?:" form for non-mandatory ones. Qualifiers
915 in locale expressions range over a single locale instance only.
917 - Dropped locale element "includes". This is a major INCOMPATIBILITY.
918 In existing theorem specifications replace the includes element by the
919 respective context elements of the included locale, omitting those
920 that are already present in the theorem specification. Multiple
921 assume elements of a locale should be replaced by a single one
922 involving the locale predicate. In the proof body, declarations (most
923 notably theorems) may be regained by interpreting the respective
924 locales in the proof context as required (command "interpret").
926 If using "includes" in replacement of a target solely because the
927 parameter types in the theorem are not as general as in the target,
928 consider declaring a new locale with additional type constraints on
929 the parameters (context element "constrains").
931 - Discontinued "locale (open)". INCOMPATIBILITY.
933 - Locale interpretation commands no longer attempt to simplify goal.
934 INCOMPATIBILITY: in rare situations the generated goal differs. Use
935 methods intro_locales and unfold_locales to clarify.
937 - Locale interpretation commands no longer accept interpretation
938 attributes. INCOMPATIBILITY.
940 * Class declaration: so-called "base sort" must not be given in import
941 list any longer, but is inferred from the specification. Particularly
948 class foo = type + ...
950 * Class target: global versions of theorems stemming do not carry a
951 parameter prefix any longer. INCOMPATIBILITY.
953 * Class 'instance' command no longer accepts attached definitions.
954 INCOMPATIBILITY, use proper 'instantiation' target instead.
956 * Recovered hiding of consts, which was accidentally broken in
957 Isabelle2007. Potential INCOMPATIBILITY, ``hide const c'' really
958 makes c inaccessible; consider using ``hide (open) const c'' instead.
960 * Slightly more coherent Pure syntax, with updated documentation in
961 isar-ref manual. Removed locales meta_term_syntax and
962 meta_conjunction_syntax: TERM and &&& (formerly &&) are now permanent,
963 INCOMPATIBILITY in rare situations. Note that &&& should not be used
964 directly in regular applications.
966 * There is a new syntactic category "float_const" for signed decimal
967 fractions (e.g. 123.45 or -123.45).
969 * Removed exotic 'token_translation' command. INCOMPATIBILITY, use ML
970 interface with 'setup' command instead.
972 * Command 'local_setup' is similar to 'setup', but operates on a local
975 * The 'axiomatization' command now only works within a global theory
976 context. INCOMPATIBILITY.
978 * Goal-directed proof now enforces strict proof irrelevance wrt. sort
979 hypotheses. Sorts required in the course of reasoning need to be
980 covered by the constraints in the initial statement, completed by the
981 type instance information of the background theory. Non-trivial sort
982 hypotheses, which rarely occur in practice, may be specified via
983 vacuous propositions of the form SORT_CONSTRAINT('a::c). For example:
985 lemma assumes "SORT_CONSTRAINT('a::empty)" shows False ...
987 The result contains an implicit sort hypotheses as before --
988 SORT_CONSTRAINT premises are eliminated as part of the canonical rule
991 * Generalized Isar history, with support for linear undo, direct state
994 * Changed defaults for unify configuration options:
996 unify_trace_bound = 50 (formerly 25)
997 unify_search_bound = 60 (formerly 30)
999 * Different bookkeeping for code equations (INCOMPATIBILITY):
1001 a) On theory merge, the last set of code equations for a particular
1002 constant is taken (in accordance with the policy applied by other
1003 parts of the code generator framework).
1005 b) Code equations stemming from explicit declarations (e.g. code
1006 attribute) gain priority over default code equations stemming
1007 from definition, primrec, fun etc.
1009 * Keyword 'code_exception' now named 'code_abort'. INCOMPATIBILITY.
1011 * Unified theorem tables for both code generators. Thus [code
1012 func] has disappeared and only [code] remains. INCOMPATIBILITY.
1014 * Command 'find_consts' searches for constants based on type and name
1017 find_consts "_ => bool"
1019 By default, matching is against subtypes, but it may be restricted to
1020 the whole type. Searching by name is possible. Multiple queries are
1021 conjunctive and queries may be negated by prefixing them with a
1024 find_consts strict: "_ => bool" name: "Int" -"int => int"
1026 * New 'find_theorems' criterion "solves" matches theorems that
1027 directly solve the current goal (modulo higher-order unification).
1029 * Auto solve feature for main theorem statements: whenever a new goal
1030 is stated, "find_theorems solves" is called; any theorems that could
1031 solve the lemma directly are listed as part of the goal state.
1032 Cf. associated options in Proof General Isabelle settings menu,
1033 enabled by default, with reasonable timeout for pathological cases of
1034 higher-order unification.
1037 *** Document preparation ***
1039 * Antiquotation @{lemma} now imitates a regular terminal proof,
1040 demanding keyword 'by' and supporting the full method expression
1041 syntax just like the Isar command 'by'.
1046 * Integrated main parts of former image HOL-Complex with HOL. Entry
1047 points Main and Complex_Main remain as before.
1049 * Logic image HOL-Plain provides a minimal HOL with the most important
1050 tools available (inductive, datatype, primrec, ...). This facilitates
1051 experimentation and tool development. Note that user applications
1052 (and library theories) should never refer to anything below theory
1055 * Logic image HOL-Main stops at theory Main, and thus facilitates
1056 experimentation due to shorter build times.
1058 * Logic image HOL-NSA contains theories of nonstandard analysis which
1059 were previously part of former HOL-Complex. Entry point Hyperreal
1060 remains valid, but theories formerly using Complex_Main should now use
1061 new entry point Hypercomplex.
1063 * Generic ATP manager for Sledgehammer, based on ML threads instead of
1064 Posix processes. Avoids potentially expensive forking of the ML
1065 process. New thread-based implementation also works on non-Unix
1066 platforms (Cygwin). Provers are no longer hardwired, but defined
1067 within the theory via plain ML wrapper functions. Basic Sledgehammer
1068 commands are covered in the isar-ref manual.
1070 * Wrapper scripts for remote SystemOnTPTP service allows to use
1071 sledgehammer without local ATP installation (Vampire etc.). Other
1072 provers may be included via suitable ML wrappers, see also
1073 src/HOL/ATP_Linkup.thy.
1075 * ATP selection (E/Vampire/Spass) is now via Proof General's settings
1078 * The metis method no longer fails because the theorem is too trivial
1079 (contains the empty clause).
1081 * The metis method now fails in the usual manner, rather than raising
1082 an exception, if it determines that it cannot prove the theorem.
1084 * Method "coherent" implements a prover for coherent logic (see also
1085 src/Tools/coherent.ML).
1087 * Constants "undefined" and "default" replace "arbitrary". Usually
1088 "undefined" is the right choice to replace "arbitrary", though
1089 logically there is no difference. INCOMPATIBILITY.
1091 * Command "value" now integrates different evaluation mechanisms. The
1092 result of the first successful evaluation mechanism is printed. In
1093 square brackets a particular named evaluation mechanisms may be
1094 specified (currently, [SML], [code] or [nbe]). See further
1095 src/HOL/ex/Eval_Examples.thy.
1097 * Normalization by evaluation now allows non-leftlinear equations.
1098 Declare with attribute [code nbe].
1100 * Methods "case_tac" and "induct_tac" now refer to the very same rules
1101 as the structured Isar versions "cases" and "induct", cf. the
1102 corresponding "cases" and "induct" attributes. Mutual induction rules
1103 are now presented as a list of individual projections
1104 (e.g. foo_bar.inducts for types foo and bar); the old format with
1105 explicit HOL conjunction is no longer supported. INCOMPATIBILITY, in
1106 rare situations a different rule is selected --- notably nested tuple
1107 elimination instead of former prod.exhaust: use explicit (case_tac t
1108 rule: prod.exhaust) here.
1110 * Attributes "cases", "induct", "coinduct" support "del" option.
1112 * Removed fact "case_split_thm", which duplicates "case_split".
1114 * The option datatype has been moved to a new theory Option. Renamed
1115 option_map to Option.map, and o2s to Option.set, INCOMPATIBILITY.
1117 * New predicate "strict_mono" classifies strict functions on partial
1118 orders. With strict functions on linear orders, reasoning about
1119 (in)equalities is facilitated by theorems "strict_mono_eq",
1120 "strict_mono_less_eq" and "strict_mono_less".
1122 * Some set operations are now proper qualified constants with
1123 authentic syntax. INCOMPATIBILITY:
1134 * Class complete_lattice with operations Inf, Sup, INFI, SUPR now in
1137 * Auxiliary class "itself" has disappeared -- classes without any
1138 parameter are treated as expected by the 'class' command.
1140 * Leibnitz's Series for Pi and the arcus tangens and logarithm series.
1142 * Common decision procedures (Cooper, MIR, Ferrack, Approximation,
1143 Dense_Linear_Order) are now in directory HOL/Decision_Procs.
1145 * Theory src/HOL/Decision_Procs/Approximation provides the new proof
1146 method "approximation". It proves formulas on real values by using
1147 interval arithmetic. In the formulas are also the transcendental
1148 functions sin, cos, tan, atan, ln, exp and the constant pi are
1149 allowed. For examples see
1150 src/HOL/Descision_Procs/ex/Approximation_Ex.thy.
1152 * Theory "Reflection" now resides in HOL/Library.
1154 * Entry point to Word library now simply named "Word".
1157 * Made source layout more coherent with logical distribution
1160 src/HOL/Library/RType.thy ~> src/HOL/Typerep.thy
1161 src/HOL/Library/Code_Message.thy ~> src/HOL/
1162 src/HOL/Library/GCD.thy ~> src/HOL/
1163 src/HOL/Library/Order_Relation.thy ~> src/HOL/
1164 src/HOL/Library/Parity.thy ~> src/HOL/
1165 src/HOL/Library/Univ_Poly.thy ~> src/HOL/
1166 src/HOL/Real/ContNotDenum.thy ~> src/HOL/Library/
1167 src/HOL/Real/Lubs.thy ~> src/HOL/
1168 src/HOL/Real/PReal.thy ~> src/HOL/
1169 src/HOL/Real/Rational.thy ~> src/HOL/
1170 src/HOL/Real/RComplete.thy ~> src/HOL/
1171 src/HOL/Real/RealDef.thy ~> src/HOL/
1172 src/HOL/Real/RealPow.thy ~> src/HOL/
1173 src/HOL/Real/Real.thy ~> src/HOL/
1174 src/HOL/Complex/Complex_Main.thy ~> src/HOL/
1175 src/HOL/Complex/Complex.thy ~> src/HOL/
1176 src/HOL/Complex/FrechetDeriv.thy ~> src/HOL/Library/
1177 src/HOL/Complex/Fundamental_Theorem_Algebra.thy ~> src/HOL/Library/
1178 src/HOL/Hyperreal/Deriv.thy ~> src/HOL/
1179 src/HOL/Hyperreal/Fact.thy ~> src/HOL/
1180 src/HOL/Hyperreal/Integration.thy ~> src/HOL/
1181 src/HOL/Hyperreal/Lim.thy ~> src/HOL/
1182 src/HOL/Hyperreal/Ln.thy ~> src/HOL/
1183 src/HOL/Hyperreal/Log.thy ~> src/HOL/
1184 src/HOL/Hyperreal/MacLaurin.thy ~> src/HOL/
1185 src/HOL/Hyperreal/NthRoot.thy ~> src/HOL/
1186 src/HOL/Hyperreal/Series.thy ~> src/HOL/
1187 src/HOL/Hyperreal/SEQ.thy ~> src/HOL/
1188 src/HOL/Hyperreal/Taylor.thy ~> src/HOL/
1189 src/HOL/Hyperreal/Transcendental.thy ~> src/HOL/
1190 src/HOL/Real/Float ~> src/HOL/Library/
1191 src/HOL/Real/HahnBanach ~> src/HOL/HahnBanach
1192 src/HOL/Real/RealVector.thy ~> src/HOL/
1194 src/HOL/arith_data.ML ~> src/HOL/Tools
1195 src/HOL/hologic.ML ~> src/HOL/Tools
1196 src/HOL/simpdata.ML ~> src/HOL/Tools
1197 src/HOL/int_arith1.ML ~> src/HOL/Tools/int_arith.ML
1198 src/HOL/int_factor_simprocs.ML ~> src/HOL/Tools
1199 src/HOL/nat_simprocs.ML ~> src/HOL/Tools
1200 src/HOL/Real/float_arith.ML ~> src/HOL/Tools
1201 src/HOL/Real/float_syntax.ML ~> src/HOL/Tools
1202 src/HOL/Real/rat_arith.ML ~> src/HOL/Tools
1203 src/HOL/Real/real_arith.ML ~> src/HOL/Tools
1205 src/HOL/Library/Array.thy ~> src/HOL/Imperative_HOL
1206 src/HOL/Library/Heap_Monad.thy ~> src/HOL/Imperative_HOL
1207 src/HOL/Library/Heap.thy ~> src/HOL/Imperative_HOL
1208 src/HOL/Library/Imperative_HOL.thy ~> src/HOL/Imperative_HOL
1209 src/HOL/Library/Ref.thy ~> src/HOL/Imperative_HOL
1210 src/HOL/Library/Relational.thy ~> src/HOL/Imperative_HOL
1212 * If methods "eval" and "evaluation" encounter a structured proof
1213 state with !!/==>, only the conclusion is evaluated to True (if
1214 possible), avoiding strange error messages.
1216 * Method "sizechange" automates termination proofs using (a
1217 modification of) the size-change principle. Requires SAT solver. See
1218 src/HOL/ex/Termination.thy for examples.
1220 * Simplifier: simproc for let expressions now unfolds if bound
1221 variable occurs at most once in let expression body. INCOMPATIBILITY.
1223 * Method "arith": Linear arithmetic now ignores all inequalities when
1224 fast_arith_neq_limit is exceeded, instead of giving up entirely.
1226 * New attribute "arith" for facts that should always be used
1227 automatically by arithmetic. It is intended to be used locally in
1230 assumes [arith]: "x > 0"
1232 Global usage is discouraged because of possible performance impact.
1234 * New classes "top" and "bot" with corresponding operations "top" and
1235 "bot" in theory Orderings; instantiation of class "complete_lattice"
1236 requires instantiation of classes "top" and "bot". INCOMPATIBILITY.
1238 * Changed definition lemma "less_fun_def" in order to provide an
1239 instance for preorders on functions; use lemma "less_le" instead.
1242 * Theory Orderings: class "wellorder" moved here, with explicit
1243 induction rule "less_induct" as assumption. For instantiation of
1244 "wellorder" by means of predicate "wf", use rule wf_wellorderI.
1247 * Theory Orderings: added class "preorder" as superclass of "order".
1248 INCOMPATIBILITY: Instantiation proofs for order, linorder
1249 etc. slightly changed. Some theorems named order_class.* now named
1252 * Theory Relation: renamed "refl" to "refl_on", "reflexive" to "refl,
1255 * Theory Finite_Set: added a new fold combinator of type
1257 ('a => 'b => 'b) => 'b => 'a set => 'b
1259 Occasionally this is more convenient than the old fold combinator
1260 which is now defined in terms of the new one and renamed to
1263 * Theories Ring_and_Field and OrderedGroup: The lemmas "group_simps"
1264 and "ring_simps" have been replaced by "algebra_simps" (which can be
1265 extended with further lemmas!). At the moment both still exist but
1266 the former will disappear at some point.
1268 * Theory Power: Lemma power_Suc is now declared as a simp rule in
1269 class recpower. Type-specific simp rules for various recpower types
1270 have been removed. INCOMPATIBILITY, rename old lemmas as follows:
1272 rat_power_0 -> power_0
1273 rat_power_Suc -> power_Suc
1274 realpow_0 -> power_0
1275 realpow_Suc -> power_Suc
1276 complexpow_0 -> power_0
1277 complexpow_Suc -> power_Suc
1278 power_poly_0 -> power_0
1279 power_poly_Suc -> power_Suc
1281 * Theories Ring_and_Field and Divides: Definition of "op dvd" has been
1282 moved to separate class dvd in Ring_and_Field; a couple of lemmas on
1283 dvd has been generalized to class comm_semiring_1. Likewise a bunch
1284 of lemmas from Divides has been generalized from nat to class
1285 semiring_div. INCOMPATIBILITY. This involves the following theorem
1286 renames resulting from duplicate elimination:
1288 dvd_def_mod ~> dvd_eq_mod_eq_0
1289 zero_dvd_iff ~> dvd_0_left_iff
1290 dvd_0 ~> dvd_0_right
1291 DIVISION_BY_ZERO_DIV ~> div_by_0
1292 DIVISION_BY_ZERO_MOD ~> mod_by_0
1293 mult_div ~> div_mult_self2_is_id
1294 mult_mod ~> mod_mult_self2_is_0
1296 * Theory IntDiv: removed many lemmas that are instances of class-based
1297 generalizations (from Divides and Ring_and_Field). INCOMPATIBILITY,
1298 rename old lemmas as follows:
1300 dvd_diff -> nat_dvd_diff
1301 dvd_zminus_iff -> dvd_minus_iff
1302 mod_add1_eq -> mod_add_eq
1303 mod_mult1_eq -> mod_mult_right_eq
1304 mod_mult1_eq' -> mod_mult_left_eq
1305 mod_mult_distrib_mod -> mod_mult_eq
1306 nat_mod_add_left_eq -> mod_add_left_eq
1307 nat_mod_add_right_eq -> mod_add_right_eq
1308 nat_mod_div_trivial -> mod_div_trivial
1309 nat_mod_mod_trivial -> mod_mod_trivial
1310 zdiv_zadd_self1 -> div_add_self1
1311 zdiv_zadd_self2 -> div_add_self2
1312 zdiv_zmult_self1 -> div_mult_self2_is_id
1313 zdiv_zmult_self2 -> div_mult_self1_is_id
1314 zdvd_triv_left -> dvd_triv_left
1315 zdvd_triv_right -> dvd_triv_right
1316 zdvd_zmult_cancel_disj -> dvd_mult_cancel_left
1317 zmod_eq0_zdvd_iff -> dvd_eq_mod_eq_0[symmetric]
1318 zmod_zadd_left_eq -> mod_add_left_eq
1319 zmod_zadd_right_eq -> mod_add_right_eq
1320 zmod_zadd_self1 -> mod_add_self1
1321 zmod_zadd_self2 -> mod_add_self2
1322 zmod_zadd1_eq -> mod_add_eq
1323 zmod_zdiff1_eq -> mod_diff_eq
1324 zmod_zdvd_zmod -> mod_mod_cancel
1325 zmod_zmod_cancel -> mod_mod_cancel
1326 zmod_zmult_self1 -> mod_mult_self2_is_0
1327 zmod_zmult_self2 -> mod_mult_self1_is_0
1330 zdvd_abs1 -> abs_dvd_iff
1331 zdvd_abs2 -> dvd_abs_iff
1332 zdvd_refl -> dvd_refl
1333 zdvd_trans -> dvd_trans
1334 zdvd_zadd -> dvd_add
1335 zdvd_zdiff -> dvd_diff
1336 zdvd_zminus_iff -> dvd_minus_iff
1337 zdvd_zminus2_iff -> minus_dvd_iff
1338 zdvd_zmultD -> dvd_mult_right
1339 zdvd_zmultD2 -> dvd_mult_left
1340 zdvd_zmult_mono -> mult_dvd_mono
1341 zdvd_0_right -> dvd_0_right
1342 zdvd_0_left -> dvd_0_left_iff
1343 zdvd_1_left -> one_dvd
1344 zminus_dvd_iff -> minus_dvd_iff
1346 * Theory Rational: 'Fract k 0' now equals '0'. INCOMPATIBILITY.
1348 * The real numbers offer decimal input syntax: 12.34 is translated
1349 into 1234/10^2. This translation is not reversed upon output.
1351 * Theory Library/Polynomial defines an abstract type 'a poly of
1352 univariate polynomials with coefficients of type 'a. In addition to
1353 the standard ring operations, it also supports div and mod. Code
1354 generation is also supported, using list-style constructors.
1356 * Theory Library/Inner_Product defines a class of real_inner for real
1357 inner product spaces, with an overloaded operation inner :: 'a => 'a
1358 => real. Class real_inner is a subclass of real_normed_vector from
1361 * Theory Library/Product_Vector provides instances for the product
1362 type 'a * 'b of several classes from RealVector and Inner_Product.
1363 Definitions of addition, subtraction, scalar multiplication, norms,
1364 and inner products are included.
1366 * Theory Library/Bit defines the field "bit" of integers modulo 2. In
1367 addition to the field operations, numerals and case syntax are also
1370 * Theory Library/Diagonalize provides constructive version of Cantor's
1371 first diagonalization argument.
1373 * Theory Library/GCD: Curried operations gcd, lcm (for nat) and zgcd,
1374 zlcm (for int); carried together from various gcd/lcm developements in
1375 the HOL Distribution. Constants zgcd and zlcm replace former igcd and
1376 ilcm; corresponding theorems renamed accordingly. INCOMPATIBILITY,
1377 may recover tupled syntax as follows:
1379 hide (open) const gcd
1380 abbreviation gcd where
1381 "gcd == (%(a, b). GCD.gcd a b)"
1383 GCD.gcd ("gcd '(_, _')")
1385 The same works for lcm, zgcd, zlcm.
1387 * Theory Library/Nat_Infinity: added addition, numeral syntax and more
1388 instantiations for algebraic structures. Removed some duplicate
1389 theorems. Changes in simp rules. INCOMPATIBILITY.
1391 * ML antiquotation @{code} takes a constant as argument and generates
1392 corresponding code in background and inserts name of the corresponding
1393 resulting ML value/function/datatype constructor binding in place.
1394 All occurrences of @{code} with a single ML block are generated
1395 simultaneously. Provides a generic and safe interface for
1396 instrumentalizing code generation. See
1397 src/HOL/Decision_Procs/Ferrack.thy for a more ambitious application.
1398 In future you ought to refrain from ad-hoc compiling generated SML
1399 code on the ML toplevel. Note that (for technical reasons) @{code}
1400 cannot refer to constants for which user-defined serializations are
1401 set. Refer to the corresponding ML counterpart directly in that
1404 * Command 'rep_datatype': instead of theorem names the command now
1405 takes a list of terms denoting the constructors of the type to be
1406 represented as datatype. The characteristic theorems have to be
1407 proven. INCOMPATIBILITY. Also observe that the following theorems
1408 have disappeared in favour of existing ones:
1410 unit_induct ~> unit.induct
1411 prod_induct ~> prod.induct
1412 sum_induct ~> sum.induct
1413 Suc_Suc_eq ~> nat.inject
1414 Suc_not_Zero Zero_not_Suc ~> nat.distinct
1419 * New locales for orders and lattices where the equivalence relation
1420 is not restricted to equality. INCOMPATIBILITY: all order and lattice
1421 locales use a record structure with field eq for the equivalence.
1423 * New theory of factorial domains.
1425 * Units_l_inv and Units_r_inv are now simp rules by default.
1426 INCOMPATIBILITY. Simplifier proof that require deletion of l_inv
1427 and/or r_inv will now also require deletion of these lemmas.
1429 * Renamed the following theorems, INCOMPATIBILITY:
1431 UpperD ~> Upper_memD
1432 LowerD ~> Lower_memD
1433 least_carrier ~> least_closed
1434 greatest_carrier ~> greatest_closed
1435 greatest_Lower_above ~> greatest_Lower_below
1436 one_zero ~> carrier_one_zero
1437 one_not_zero ~> carrier_one_not_zero (collision with assumption)
1442 * Nominal datatypes can now contain type-variables.
1444 * Commands 'nominal_inductive' and 'equivariance' work with local
1447 * Nominal primrec can now works with local theory targets and its
1448 specification syntax now conforms to the general format as seen in
1451 * Method "perm_simp" honours the standard simplifier attributes
1452 (no_asm), (no_asm_use) etc.
1454 * The new predicate #* is defined like freshness, except that on the
1455 left hand side can be a set or list of atoms.
1457 * Experimental command 'nominal_inductive2' derives strong induction
1458 principles for inductive definitions. In contrast to
1459 'nominal_inductive', which can only deal with a fixed number of
1460 binders, it can deal with arbitrary expressions standing for sets of
1461 atoms to be avoided. The only inductive definition we have at the
1462 moment that needs this generalisation is the typing rule for Lets in
1465 Gamma |- t1 : T1 (x,close Gamma T1)::Gamma |- t2 : T2 x#Gamma
1466 -----------------------------------------------------------------
1467 Gamma |- Let x be t1 in t2 : T2
1469 In this rule one wants to avoid all the binders that are introduced by
1470 "close Gamma T1". We are looking for other examples where this
1471 feature might be useful. Please let us know.
1476 * Reimplemented the simplification procedure for proving continuity
1477 subgoals. The new simproc is extensible; users can declare additional
1478 continuity introduction rules with the attribute [cont2cont].
1480 * The continuity simproc now uses a different introduction rule for
1481 solving continuity subgoals on terms with lambda abstractions. In
1482 some rare cases the new simproc may fail to solve subgoals that the
1483 old one could solve, and "simp add: cont2cont_LAM" may be necessary.
1484 Potential INCOMPATIBILITY.
1486 * Command 'fixrec': specification syntax now conforms to the general
1487 format as seen in 'inductive' etc. See src/HOLCF/ex/Fixrec_ex.thy for
1488 examples. INCOMPATIBILITY.
1493 * Proof of Zorn's Lemma for partial orders.
1498 * Multithreading for Poly/ML 5.1/5.2 is no longer supported, only for
1499 Poly/ML 5.2.1 or later. Important note: the TimeLimit facility
1500 depends on multithreading, so timouts will not work before Poly/ML
1503 * High-level support for concurrent ML programming, see
1504 src/Pure/Cuncurrent. The data-oriented model of "future values" is
1505 particularly convenient to organize independent functional
1506 computations. The concept of "synchronized variables" provides a
1507 higher-order interface for components with shared state, avoiding the
1508 delicate details of mutexes and condition variables. (Requires
1509 Poly/ML 5.2.1 or later.)
1511 * ML bindings produced via Isar commands are stored within the Isar
1512 context (theory or proof). Consequently, commands like 'use' and 'ML'
1513 become thread-safe and work with undo as expected (concerning
1514 top-level bindings, not side-effects on global references).
1515 INCOMPATIBILITY, need to provide proper Isar context when invoking the
1516 compiler at runtime; really global bindings need to be given outside a
1517 theory. (Requires Poly/ML 5.2 or later.)
1519 * Command 'ML_prf' is analogous to 'ML' but works within a proof
1520 context. Top-level ML bindings are stored within the proof context in
1521 a purely sequential fashion, disregarding the nested proof structure.
1522 ML bindings introduced by 'ML_prf' are discarded at the end of the
1523 proof. (Requires Poly/ML 5.2 or later.)
1525 * Simplified ML attribute and method setup, cf. functions Attrib.setup
1526 and Method.setup, as well as Isar commands 'attribute_setup' and
1527 'method_setup'. INCOMPATIBILITY for 'method_setup', need to simplify
1528 existing code accordingly, or use plain 'setup' together with old
1531 * Simplified ML oracle interface Thm.add_oracle promotes 'a -> cterm
1532 to 'a -> thm, while results are always tagged with an authentic oracle
1533 name. The Isar command 'oracle' is now polymorphic, no argument type
1534 is specified. INCOMPATIBILITY, need to simplify existing oracle code
1535 accordingly. Note that extra performance may be gained by producing
1536 the cterm carefully, avoiding slow Thm.cterm_of.
1538 * Simplified interface for defining document antiquotations via
1539 ThyOutput.antiquotation, ThyOutput.output, and optionally
1540 ThyOutput.maybe_pretty_source. INCOMPATIBILITY, need to simplify user
1541 antiquotations accordingly, see src/Pure/Thy/thy_output.ML for common
1544 * More systematic treatment of long names, abstract name bindings, and
1545 name space operations. Basic operations on qualified names have been
1546 move from structure NameSpace to Long_Name, e.g. Long_Name.base_name,
1547 Long_Name.append. Old type bstring has been mostly replaced by
1548 abstract type binding (see structure Binding), which supports precise
1549 qualification by packages and local theory targets, as well as proper
1550 tracking of source positions. INCOMPATIBILITY, need to wrap old
1551 bstring values into Binding.name, or better pass through abstract
1552 bindings everywhere. See further src/Pure/General/long_name.ML,
1553 src/Pure/General/binding.ML and src/Pure/General/name_space.ML
1555 * Result facts (from PureThy.note_thms, ProofContext.note_thms,
1556 LocalTheory.note etc.) now refer to the *full* internal name, not the
1557 bstring as before. INCOMPATIBILITY, not detected by ML type-checking!
1559 * Disposed old type and term read functions (Sign.read_def_typ,
1560 Sign.read_typ, Sign.read_def_terms, Sign.read_term,
1561 Thm.read_def_cterms, Thm.read_cterm etc.). INCOMPATIBILITY, should
1562 use regular Syntax.read_typ, Syntax.read_term, Syntax.read_typ_global,
1563 Syntax.read_term_global etc.; see also OldGoals.read_term as last
1564 resort for legacy applications.
1566 * Disposed old declarations, tactics, tactic combinators that refer to
1567 the simpset or claset of an implicit theory (such as Addsimps,
1568 Simp_tac, SIMPSET). INCOMPATIBILITY, should use @{simpset} etc. in
1569 embedded ML text, or local_simpset_of with a proper context passed as
1570 explicit runtime argument.
1572 * Rules and tactics that read instantiations (read_instantiate,
1573 res_inst_tac, thin_tac, subgoal_tac etc.) now demand a proper proof
1574 context, which is required for parsing and type-checking. Moreover,
1575 the variables are specified as plain indexnames, not string encodings
1576 thereof. INCOMPATIBILITY.
1578 * Generic Toplevel.add_hook interface allows to analyze the result of
1579 transactions. E.g. see src/Pure/ProofGeneral/proof_general_pgip.ML
1580 for theorem dependency output of transactions resulting in a new
1583 * ML antiquotations: block-structured compilation context indicated by
1584 \<lbrace> ... \<rbrace>; additional antiquotation forms:
1586 @{binding name} - basic name binding
1587 @{let ?pat = term} - term abbreviation (HO matching)
1588 @{note name = fact} - fact abbreviation
1589 @{thm fact} - singleton fact (with attributes)
1590 @{thms fact} - general fact (with attributes)
1591 @{lemma prop by method} - singleton goal
1592 @{lemma prop by meth1 meth2} - singleton goal
1593 @{lemma prop1 ... propN by method} - general goal
1594 @{lemma prop1 ... propN by meth1 meth2} - general goal
1595 @{lemma (open) ...} - open derivation
1600 * The Isabelle "emacs" tool provides a specific interface to invoke
1601 Proof General / Emacs, with more explicit failure if that is not
1602 installed (the old isabelle-interface script silently falls back on
1603 isabelle-process). The PROOFGENERAL_HOME setting determines the
1604 installation location of the Proof General distribution.
1606 * Isabelle/lib/classes/Pure.jar provides basic support to integrate
1607 the Isabelle process into a JVM/Scala application. See
1608 Isabelle/lib/jedit/plugin for a minimal example. (The obsolete Java
1609 process wrapper has been discontinued.)
1611 * Added homegrown Isabelle font with unicode layout, see lib/fonts.
1613 * Various status messages (with exact source position information) are
1614 emitted, if proper markup print mode is enabled. This allows
1615 user-interface components to provide detailed feedback on internal
1620 New in Isabelle2008 (June 2008)
1621 -------------------------------
1625 * The Isabelle/Isar Reference Manual (isar-ref) has been reorganized
1626 and updated, with formally checked references as hyperlinks.
1628 * Theory loader: use_thy (and similar operations) no longer set the
1629 implicit ML context, which was occasionally hard to predict and in
1630 conflict with concurrency. INCOMPATIBILITY, use ML within Isar which
1631 provides a proper context already.
1633 * Theory loader: old-style ML proof scripts being *attached* to a thy
1634 file are no longer supported. INCOMPATIBILITY, regular 'uses' and
1635 'use' within a theory file will do the job.
1637 * Name space merge now observes canonical order, i.e. the second space
1638 is inserted into the first one, while existing entries in the first
1639 space take precedence. INCOMPATIBILITY in rare situations, may try to
1640 swap theory imports.
1642 * Syntax: symbol \<chi> is now considered a letter. Potential
1643 INCOMPATIBILITY in identifier syntax etc.
1645 * Outer syntax: string tokens no longer admit escaped white space,
1646 which was an accidental (undocumented) feature. INCOMPATIBILITY, use
1647 white space without escapes.
1649 * Outer syntax: string tokens may contain arbitrary character codes
1650 specified via 3 decimal digits (as in SML). E.g. "foo\095bar" for
1656 * Context-dependent token translations. Default setup reverts locally
1657 fixed variables, and adds hilite markup for undeclared frees.
1659 * Unused theorems can be found using the new command 'unused_thms'.
1660 There are three ways of invoking it:
1663 Only finds unused theorems in the current theory.
1665 (2) unused_thms thy_1 ... thy_n -
1666 Finds unused theorems in the current theory and all of its ancestors,
1667 excluding the theories thy_1 ... thy_n and all of their ancestors.
1669 (3) unused_thms thy_1 ... thy_n - thy'_1 ... thy'_m
1670 Finds unused theorems in the theories thy'_1 ... thy'_m and all of
1671 their ancestors, excluding the theories thy_1 ... thy_n and all of
1674 In order to increase the readability of the list produced by
1675 unused_thms, theorems that have been created by a particular instance
1676 of a theory command such as 'inductive' or 'function' are considered
1677 to belong to the same "group", meaning that if at least one theorem in
1678 this group is used, the other theorems in the same group are no longer
1679 reported as unused. Moreover, if all theorems in the group are
1680 unused, only one theorem in the group is displayed.
1682 Note that proof objects have to be switched on in order for
1683 unused_thms to work properly (i.e. !proofs must be >= 1, which is
1684 usually the case when using Proof General with the default settings).
1686 * Authentic naming of facts disallows ad-hoc overwriting of previous
1687 theorems within the same name space. INCOMPATIBILITY, need to remove
1688 duplicate fact bindings, or even accidental fact duplications. Note
1689 that tools may maintain dynamically scoped facts systematically, using
1690 PureThy.add_thms_dynamic.
1692 * Command 'hide' now allows to hide from "fact" name space as well.
1694 * Eliminated destructive theorem database, simpset, claset, and
1695 clasimpset. Potential INCOMPATIBILITY, really need to observe linear
1696 update of theories within ML code.
1698 * Eliminated theory ProtoPure and CPure, leaving just one Pure theory.
1699 INCOMPATIBILITY, object-logics depending on former Pure require
1700 additional setup PureThy.old_appl_syntax_setup; object-logics
1701 depending on former CPure need to refer to Pure.
1703 * Commands 'use' and 'ML' are now purely functional, operating on
1704 theory/local_theory. Removed former 'ML_setup' (on theory), use 'ML'
1705 instead. Added 'ML_val' as mere diagnostic replacement for 'ML'.
1708 * Command 'setup': discontinued implicit version with ML reference.
1710 * Instantiation target allows for simultaneous specification of class
1711 instance operations together with an instantiation proof.
1712 Type-checking phase allows to refer to class operations uniformly.
1713 See src/HOL/Complex/Complex.thy for an Isar example and
1714 src/HOL/Library/Eval.thy for an ML example.
1716 * Indexing of literal facts: be more serious about including only
1717 facts from the visible specification/proof context, but not the
1718 background context (locale etc.). Affects `prop` notation and method
1719 "fact". INCOMPATIBILITY: need to name facts explicitly in rare
1722 * Method "cases", "induct", "coinduct": removed obsolete/undocumented
1723 "(open)" option, which used to expose internal bound variables to the
1726 * Isar statements: removed obsolete case "rule_context".
1727 INCOMPATIBILITY, better use explicit fixes/assumes.
1729 * Locale proofs: default proof step now includes 'unfold_locales';
1730 hence 'proof' without argument may be used to unfold locale
1734 *** Document preparation ***
1736 * Simplified pdfsetup.sty: color/hyperref is used unconditionally for
1737 both pdf and dvi (hyperlinks usually work in xdvi as well); removed
1738 obsolete thumbpdf setup (contemporary PDF viewers do this on the
1739 spot); renamed link color from "darkblue" to "linkcolor" (default
1740 value unchanged, can be redefined via \definecolor); no longer sets
1741 "a4paper" option (unnecessary or even intrusive).
1743 * Antiquotation @{lemma A method} proves proposition A by the given
1744 method (either a method name or a method name plus (optional) method
1745 arguments in parentheses) and prints A just like @{prop A}.
1750 * New primrec package. Specification syntax conforms in style to
1751 definition/function/.... No separate induction rule is provided. The
1752 "primrec" command distinguishes old-style and new-style specifications
1753 by syntax. The former primrec package is now named OldPrimrecPackage.
1754 When adjusting theories, beware: constants stemming from new-style
1755 primrec specifications have authentic syntax.
1757 * Metis prover is now an order of magnitude faster, and also works
1758 with multithreading.
1760 * Metis: the maximum number of clauses that can be produced from a
1761 theorem is now given by the attribute max_clauses. Theorems that
1762 exceed this number are ignored, with a warning printed.
1764 * Sledgehammer no longer produces structured proofs by default. To
1765 enable, declare [[sledgehammer_full = true]]. Attributes
1766 reconstruction_modulus, reconstruction_sorts renamed
1767 sledgehammer_modulus, sledgehammer_sorts. INCOMPATIBILITY.
1769 * Method "induct_scheme" derives user-specified induction rules
1770 from well-founded induction and completeness of patterns. This factors
1771 out some operations that are done internally by the function package
1772 and makes them available separately. See
1773 src/HOL/ex/Induction_Scheme.thy for examples.
1775 * More flexible generation of measure functions for termination
1776 proofs: Measure functions can be declared by proving a rule of the
1777 form "is_measure f" and giving it the [measure_function] attribute.
1778 The "is_measure" predicate is logically meaningless (always true), and
1779 just guides the heuristic. To find suitable measure functions, the
1780 termination prover sets up the goal "is_measure ?f" of the appropriate
1781 type and generates all solutions by prolog-style backwards proof using
1784 This setup also deals with rules like
1786 "is_measure f ==> is_measure (list_size f)"
1788 which accommodates nested datatypes that recurse through lists.
1789 Similar rules are predeclared for products and option types.
1791 * Turned the type of sets "'a set" into an abbreviation for "'a => bool"
1795 - Definitions of overloaded constants on sets have to be replaced by
1796 definitions on => and bool.
1798 - Some definitions of overloaded operators on sets can now be proved
1799 using the definitions of the operators on => and bool. Therefore,
1800 the following theorems have been renamed:
1802 subset_def -> subset_eq
1803 psubset_def -> psubset_eq
1804 set_diff_def -> set_diff_eq
1805 Compl_def -> Compl_eq
1806 Sup_set_def -> Sup_set_eq
1807 Inf_set_def -> Inf_set_eq
1808 sup_set_def -> sup_set_eq
1809 inf_set_def -> inf_set_eq
1811 - Due to the incompleteness of the HO unification algorithm, some
1812 rules such as subst may require manual instantiation, if some of
1813 the unknowns in the rule is a set.
1815 - Higher order unification and forward proofs:
1818 have "P (S::'a set)" <...>
1819 then have "EX S. P S" ..
1821 no longer works (due to the incompleteness of the HO unification
1822 algorithm) and must be replaced by the pattern
1829 - Calculational reasoning with subst (or similar rules):
1832 have "P (S::'a set)" <...>
1833 also have "S = T" <...>
1834 finally have "P T" .
1836 no longer works (for similar reasons as the previous example) and
1837 must be replaced by something like
1839 have "P (S::'a set)" <...>
1840 moreover have "S = T" <...>
1841 ultimately have "P T" by simp
1843 - Tactics or packages written in ML code:
1844 Code performing pattern matching on types via
1846 Type ("set", [T]) => ...
1848 must be rewritten. Moreover, functions like strip_type or
1849 binder_types no longer return the right value when applied to a
1852 T1 => ... => Tn => U => bool
1856 T1 => ... => Tn => U set
1858 * Merged theories Wellfounded_Recursion, Accessible_Part and
1859 Wellfounded_Relations to theory Wellfounded.
1861 * Explicit class "eq" for executable equality. INCOMPATIBILITY.
1863 * Class finite no longer treats UNIV as class parameter. Use class
1864 enum from theory Library/Enum instead to achieve a similar effect.
1867 * Theory List: rule list_induct2 now has explicitly named cases "Nil"
1868 and "Cons". INCOMPATIBILITY.
1870 * HOL (and FOL): renamed variables in rules imp_elim and swap.
1871 Potential INCOMPATIBILITY.
1873 * Theory Product_Type: duplicated lemmas split_Pair_apply and
1874 injective_fst_snd removed, use split_eta and prod_eqI instead.
1875 Renamed upd_fst to apfst and upd_snd to apsnd. INCOMPATIBILITY.
1877 * Theory Nat: removed redundant lemmas that merely duplicate lemmas of
1878 the same name in theory Orderings:
1888 Renamed less_imp_le to less_imp_le_nat, and less_irrefl to
1889 less_irrefl_nat. Potential INCOMPATIBILITY due to more general types
1890 and different variable names.
1892 * Library/Option_ord.thy: Canonical order on option type.
1894 * Library/RBT.thy: Red-black trees, an efficient implementation of
1897 * Library/Countable.thy: Type class for countable types.
1899 * Theory Int: The representation of numerals has changed. The infix
1900 operator BIT and the bit datatype with constructors B0 and B1 have
1901 disappeared. INCOMPATIBILITY, use "Int.Bit0 x" and "Int.Bit1 y" in
1902 place of "x BIT bit.B0" and "y BIT bit.B1", respectively. Theorems
1903 involving BIT, B0, or B1 have been renamed with "Bit0" or "Bit1"
1906 * Theory Nat: definition of <= and < on natural numbers no longer
1907 depend on well-founded relations. INCOMPATIBILITY. Definitions
1908 le_def and less_def have disappeared. Consider lemmas not_less
1909 [symmetric, where ?'a = nat] and less_eq [symmetric] instead.
1911 * Theory Finite_Set: locales ACf, ACe, ACIf, ACIfSL and ACIfSLlin
1912 (whose purpose mainly is for various fold_set functionals) have been
1913 abandoned in favor of the existing algebraic classes
1914 ab_semigroup_mult, comm_monoid_mult, ab_semigroup_idem_mult,
1915 lower_semilattice (resp. upper_semilattice) and linorder.
1918 * Theory Transitive_Closure: induct and cases rules now declare proper
1919 case_names ("base" and "step"). INCOMPATIBILITY.
1921 * Theorem Inductive.lfp_ordinal_induct generalized to complete
1922 lattices. The form set-specific version is available as
1923 Inductive.lfp_ordinal_induct_set.
1925 * Renamed theorems "power.simps" to "power_int.simps".
1928 * Class semiring_div provides basic abstract properties of semirings
1929 with division and modulo operations. Subsumes former class dvd_mod.
1931 * Merged theories IntDef, Numeral and IntArith into unified theory
1932 Int. INCOMPATIBILITY.
1934 * Theory Library/Code_Index: type "index" now represents natural
1935 numbers rather than integers. INCOMPATIBILITY.
1937 * New class "uminus" with operation "uminus" (split of from class
1938 "minus" which now only has operation "minus", binary).
1941 * Constants "card", "internal_split", "option_map" now with authentic
1942 syntax. INCOMPATIBILITY.
1944 * Definitions subset_def, psubset_def, set_diff_def, Compl_def,
1945 le_bool_def, less_bool_def, le_fun_def, less_fun_def, inf_bool_def,
1946 sup_bool_def, Inf_bool_def, Sup_bool_def, inf_fun_def, sup_fun_def,
1947 Inf_fun_def, Sup_fun_def, inf_set_def, sup_set_def, Inf_set_def,
1948 Sup_set_def, le_def, less_def, option_map_def now with object
1949 equality. INCOMPATIBILITY.
1951 * Records. Removed K_record, and replaced it by pure lambda term
1952 %x. c. The simplifier setup is now more robust against eta expansion.
1953 INCOMPATIBILITY: in cases explicitly referring to K_record.
1955 * Library/Multiset: {#a, b, c#} abbreviates {#a#} + {#b#} + {#c#}.
1957 * Library/ListVector: new theory of arithmetic vector operations.
1959 * Library/Order_Relation: new theory of various orderings as sets of
1960 pairs. Defines preorders, partial orders, linear orders and
1961 well-orders on sets and on types.
1966 * Renamed some theories to allow to loading both ZF and HOL in the
1969 Datatype -> Datatype_ZF
1970 Inductive -> Inductive_ZF
1977 INCOMPATIBILITY: ZF theories that import individual theories below
1978 Main might need to be adapted. Regular theory Main is still
1979 available, as trivial extension of Main_ZF.
1984 * ML within Isar: antiquotation @{const name} or @{const
1985 name(typargs)} produces statically-checked Const term.
1987 * Functor NamedThmsFun: data is available to the user as dynamic fact
1988 (of the same name). Removed obsolete print command.
1990 * Removed obsolete "use_legacy_bindings" function.
1992 * The ``print mode'' is now a thread-local value derived from a global
1993 template (the former print_mode reference), thus access becomes
1994 non-critical. The global print_mode reference is for session
1995 management only; user-code should use print_mode_value,
1996 print_mode_active, PrintMode.setmp etc. INCOMPATIBILITY.
1998 * Functions system/system_out provide a robust way to invoke external
1999 shell commands, with propagation of interrupts (requires Poly/ML
2000 5.2.1). Do not use OS.Process.system etc. from the basis library!
2005 * Default settings: PROOFGENERAL_OPTIONS no longer impose xemacs ---
2006 in accordance with Proof General 3.7, which prefers GNU emacs.
2008 * isatool tty runs Isabelle process with plain tty interaction;
2009 optional line editor may be specified via ISABELLE_LINE_EDITOR
2010 setting, the default settings attempt to locate "ledit" and "rlwrap".
2012 * isatool browser now works with Cygwin as well, using general
2013 "javapath" function defined in Isabelle process environment.
2015 * YXML notation provides a simple and efficient alternative to
2016 standard XML transfer syntax. See src/Pure/General/yxml.ML and
2017 isatool yxml as described in the Isabelle system manual.
2019 * JVM class isabelle.IsabelleProcess (located in Isabelle/lib/classes)
2020 provides general wrapper for managing an Isabelle process in a robust
2021 fashion, with ``cooked'' output from stdin/stderr.
2023 * Rudimentary Isabelle plugin for jEdit (see Isabelle/lib/jedit),
2024 based on Isabelle/JVM process wrapper (see Isabelle/lib/classes).
2026 * Removed obsolete THIS_IS_ISABELLE_BUILD feature. NB: the documented
2027 way of changing the user's settings is via
2028 ISABELLE_HOME_USER/etc/settings, which is a fully featured bash
2031 * Multithreading.max_threads := 0 refers to the number of actual CPU
2032 cores of the underlying machine, which is a good starting point for
2033 optimal performance tuning. The corresponding usedir option -M allows
2034 "max" as an alias for "0". WARNING: does not work on certain versions
2035 of Mac OS (with Poly/ML 5.1).
2037 * isabelle-process: non-ML sessions are run with "nice", to reduce the
2038 adverse effect of Isabelle flooding interactive front-ends (notably
2039 ProofGeneral / XEmacs).
2043 New in Isabelle2007 (November 2007)
2044 -----------------------------------
2048 * More uniform information about legacy features, notably a
2049 warning/error of "Legacy feature: ...", depending on the state of the
2050 tolerate_legacy_features flag (default true). FUTURE INCOMPATIBILITY:
2051 legacy features will disappear eventually.
2053 * Theory syntax: the header format ``theory A = B + C:'' has been
2054 discontinued in favour of ``theory A imports B C begin''. Use isatool
2055 fixheaders to convert existing theory files. INCOMPATIBILITY.
2057 * Theory syntax: the old non-Isar theory file format has been
2058 discontinued altogether. Note that ML proof scripts may still be used
2059 with Isar theories; migration is usually quite simple with the ML
2060 function use_legacy_bindings. INCOMPATIBILITY.
2062 * Theory syntax: some popular names (e.g. 'class', 'declaration',
2063 'fun', 'help', 'if') are now keywords. INCOMPATIBILITY, use double
2066 * Theory loader: be more serious about observing the static theory
2067 header specifications (including optional directories), but not the
2068 accidental file locations of previously successful loads. The strict
2069 update policy of former update_thy is now already performed by
2070 use_thy, so the former has been removed; use_thys updates several
2071 theories simultaneously, just as 'imports' within a theory header
2072 specification, but without merging the results. Potential
2073 INCOMPATIBILITY: may need to refine theory headers and commands
2074 ROOT.ML which depend on load order.
2076 * Theory loader: optional support for content-based file
2077 identification, instead of the traditional scheme of full physical
2078 path plus date stamp; configured by the ISABELLE_FILE_IDENT setting
2079 (cf. the system manual). The new scheme allows to work with
2080 non-finished theories in persistent session images, such that source
2081 files may be moved later on without requiring reloads.
2083 * Theory loader: old-style ML proof scripts being *attached* to a thy
2084 file (with the same base name as the theory) are considered a legacy
2085 feature, which will disappear eventually. Even now, the theory loader
2086 no longer maintains dependencies on such files.
2088 * Syntax: the scope for resolving ambiguities via type-inference is
2089 now limited to individual terms, instead of whole simultaneous
2090 specifications as before. This greatly reduces the complexity of the
2091 syntax module and improves flexibility by separating parsing and
2092 type-checking. INCOMPATIBILITY: additional type-constraints (explicit
2093 'fixes' etc.) are required in rare situations.
2095 * Syntax: constants introduced by new-style packages ('definition',
2096 'abbreviation' etc.) are passed through the syntax module in
2097 ``authentic mode''. This means that associated mixfix annotations
2098 really stick to such constants, independently of potential name space
2099 ambiguities introduced later on. INCOMPATIBILITY: constants in parse
2100 trees are represented slightly differently, may need to adapt syntax
2101 translations accordingly. Use CONST marker in 'translations' and
2102 @{const_syntax} antiquotation in 'parse_translation' etc.
2104 * Legacy goal package: reduced interface to the bare minimum required
2105 to keep existing proof scripts running. Most other user-level
2106 functions are now part of the OldGoals structure, which is *not* open
2107 by default (consider isatool expandshort before open OldGoals).
2108 Removed top_sg, prin, printyp, pprint_term/typ altogether, because
2109 these tend to cause confusion about the actual goal (!) context being
2110 used here, which is not necessarily the same as the_context().
2112 * Command 'find_theorems': supports "*" wild-card in "name:"
2113 criterion; "with_dups" option. Certain ProofGeneral versions might
2114 support a specific search form (see ProofGeneral/CHANGES).
2116 * The ``prems limit'' option (cf. ProofContext.prems_limit) is now -1
2117 by default, which means that "prems" (and also "fixed variables") are
2118 suppressed from proof state output. Note that the ProofGeneral
2119 settings mechanism allows to change and save options persistently, but
2120 older versions of Isabelle will fail to start up if a negative prems
2123 * Local theory targets may be specified by non-nested blocks of
2124 ``context/locale/class ... begin'' followed by ``end''. The body may
2125 contain definitions, theorems etc., including any derived mechanism
2126 that has been implemented on top of these primitives. This concept
2127 generalizes the existing ``theorem (in ...)'' towards more versatility
2130 * Proof General interface: proper undo of final 'end' command;
2131 discontinued Isabelle/classic mode (ML proof scripts).
2134 *** Document preparation ***
2136 * Added antiquotation @{theory name} which prints the given name,
2137 after checking that it refers to a valid ancestor theory in the
2140 * Added antiquotations @{ML_type text} and @{ML_struct text} which
2141 check the given source text as ML type/structure, printing verbatim.
2143 * Added antiquotation @{abbrev "c args"} which prints the abbreviation
2144 "c args == rhs" given in the current context. (Any number of
2145 arguments may be given on the LHS.)
2150 * The 'class' package offers a combination of axclass and locale to
2151 achieve Haskell-like type classes in Isabelle. Definitions and
2152 theorems within a class context produce both relative results (with
2153 implicit parameters according to the locale context), and polymorphic
2154 constants with qualified polymorphism (according to the class
2155 context). Within the body context of a 'class' target, a separate
2156 syntax layer ("user space type system") takes care of converting
2157 between global polymorphic consts and internal locale representation.
2158 See src/HOL/ex/Classpackage.thy for examples (as well as main HOL).
2159 "isatool doc classes" provides a tutorial.
2161 * Generic code generator framework allows to generate executable
2162 code for ML and Haskell (including Isabelle classes). A short usage
2165 internal compilation:
2166 export_code <list of constants (term syntax)> in SML
2167 writing SML code to a file:
2168 export_code <list of constants (term syntax)> in SML <filename>
2169 writing OCaml code to a file:
2170 export_code <list of constants (term syntax)> in OCaml <filename>
2171 writing Haskell code to a bunch of files:
2172 export_code <list of constants (term syntax)> in Haskell <filename>
2174 evaluating closed propositions to True/False using code generation:
2177 Reasonable default setup of framework in HOL.
2179 Theorem attributs for selecting and transforming function equations theorems:
2181 [code fun]: select a theorem as function equation for a specific constant
2182 [code fun del]: deselect a theorem as function equation for a specific constant
2183 [code inline]: select an equation theorem for unfolding (inlining) in place
2184 [code inline del]: deselect an equation theorem for unfolding (inlining) in place
2186 User-defined serializations (target in {SML, OCaml, Haskell}):
2188 code_const <and-list of constants (term syntax)>
2189 {(target) <and-list of const target syntax>}+
2191 code_type <and-list of type constructors>
2192 {(target) <and-list of type target syntax>}+
2194 code_instance <and-list of instances>
2196 where instance ::= <type constructor> :: <class>
2198 code_class <and_list of classes>
2199 {(target) <and-list of class target syntax>}+
2200 where class target syntax ::= <class name> {where {<classop> == <target syntax>}+}?
2202 code_instance and code_class only are effective to target Haskell.
2204 For example usage see src/HOL/ex/Codegenerator.thy and
2205 src/HOL/ex/Codegenerator_Pretty.thy. A separate tutorial on code
2206 generation from Isabelle/HOL theories is available via "isatool doc
2209 * Code generator: consts in 'consts_code' Isar commands are now
2210 referred to by usual term syntax (including optional type
2213 * Command 'no_translations' removes translation rules from theory
2216 * Overloaded definitions are now actually checked for acyclic
2217 dependencies. The overloading scheme is slightly more general than
2218 that of Haskell98, although Isabelle does not demand an exact
2219 correspondence to type class and instance declarations.
2220 INCOMPATIBILITY, use ``defs (unchecked overloaded)'' to admit more
2221 exotic versions of overloading -- at the discretion of the user!
2223 Polymorphic constants are represented via type arguments, i.e. the
2224 instantiation that matches an instance against the most general
2225 declaration given in the signature. For example, with the declaration
2226 c :: 'a => 'a => 'a, an instance c :: nat => nat => nat is represented
2227 as c(nat). Overloading is essentially simultaneous structural
2228 recursion over such type arguments. Incomplete specification patterns
2229 impose global constraints on all occurrences, e.g. c('a * 'a) on the
2230 LHS means that more general c('a * 'b) will be disallowed on any RHS.
2231 Command 'print_theory' outputs the normalized system of recursive
2232 equations, see section "definitions".
2234 * Configuration options are maintained within the theory or proof
2235 context (with name and type bool/int/string), providing a very simple
2236 interface to a poor-man's version of general context data. Tools may
2237 declare options in ML (e.g. using Attrib.config_int) and then refer to
2238 these values using Config.get etc. Users may change options via an
2239 associated attribute of the same name. This form of context
2240 declaration works particularly well with commands 'declare' or
2241 'using', for example ``declare [[foo = 42]]''. Thus it has become
2242 very easy to avoid global references, which would not observe Isar
2243 toplevel undo/redo and fail to work with multithreading.
2245 Various global ML references of Pure and HOL have been turned into
2246 configuration options:
2248 Unify.search_bound unify_search_bound
2249 Unify.trace_bound unify_trace_bound
2250 Unify.trace_simp unify_trace_simp
2251 Unify.trace_types unify_trace_types
2252 Simplifier.simp_depth_limit simp_depth_limit
2253 Blast.depth_limit blast_depth_limit
2254 DatatypeProp.dtK datatype_distinctness_limit
2255 fast_arith_neq_limit fast_arith_neq_limit
2256 fast_arith_split_limit fast_arith_split_limit
2258 * Named collections of theorems may be easily installed as context
2259 data using the functor NamedThmsFun (see also
2260 src/Pure/Tools/named_thms.ML). The user may add or delete facts via
2261 attributes; there is also a toplevel print command. This facility is
2262 just a common case of general context data, which is the preferred way
2263 for anything more complex than just a list of facts in canonical
2266 * Isar: command 'declaration' augments a local theory by generic
2267 declaration functions written in ML. This enables arbitrary content
2268 being added to the context, depending on a morphism that tells the
2269 difference of the original declaration context wrt. the application
2270 context encountered later on.
2272 * Isar: proper interfaces for simplification procedures. Command
2273 'simproc_setup' declares named simprocs (with match patterns, and body
2274 text in ML). Attribute "simproc" adds/deletes simprocs in the current
2275 context. ML antiquotation @{simproc name} retrieves named simprocs.
2277 * Isar: an extra pair of brackets around attribute declarations
2278 abbreviates a theorem reference involving an internal dummy fact,
2279 which will be ignored later --- only the effect of the attribute on
2280 the background context will persist. This form of in-place
2281 declarations is particularly useful with commands like 'declare' and
2282 'using', for example ``have A using [[simproc a]] by simp''.
2284 * Isar: method "assumption" (and implicit closing of subproofs) now
2285 takes simple non-atomic goal assumptions into account: after applying
2286 an assumption as a rule the resulting subgoals are solved by atomic
2287 assumption steps. This is particularly useful to finish 'obtain'
2288 goals, such as "!!x. (!!x. P x ==> thesis) ==> P x ==> thesis",
2289 without referring to the original premise "!!x. P x ==> thesis" in the
2290 Isar proof context. POTENTIAL INCOMPATIBILITY: method "assumption" is
2293 * Isar: implicit use of prems from the Isar proof context is
2294 considered a legacy feature. Common applications like ``have A .''
2295 may be replaced by ``have A by fact'' or ``note `A`''. In general,
2296 referencing facts explicitly here improves readability and
2297 maintainability of proof texts.
2299 * Isar: improper proof element 'guess' is like 'obtain', but derives
2300 the obtained context from the course of reasoning! For example:
2302 assume "EX x y. A x & B y" -- "any previous fact"
2303 then guess x and y by clarify
2305 This technique is potentially adventurous, depending on the facts and
2306 proof tools being involved here.
2308 * Isar: known facts from the proof context may be specified as literal
2309 propositions, using ASCII back-quote syntax. This works wherever
2310 named facts used to be allowed so far, in proof commands, proof
2311 methods, attributes etc. Literal facts are retrieved from the context
2312 according to unification of type and term parameters. For example,
2313 provided that "A" and "A ==> B" and "!!x. P x ==> Q x" are known
2314 theorems in the current context, then these are valid literal facts:
2315 `A` and `A ==> B` and `!!x. P x ==> Q x" as well as `P a ==> Q a` etc.
2317 There is also a proof method "fact" which does the same composition
2318 for explicit goal states, e.g. the following proof texts coincide with
2319 certain special cases of literal facts:
2321 have "A" by fact == note `A`
2322 have "A ==> B" by fact == note `A ==> B`
2323 have "!!x. P x ==> Q x" by fact == note `!!x. P x ==> Q x`
2324 have "P a ==> Q a" by fact == note `P a ==> Q a`
2326 * Isar: ":" (colon) is no longer a symbolic identifier character in
2327 outer syntax. Thus symbolic identifiers may be used without
2328 additional white space in declarations like this: ``assume *: A''.
2330 * Isar: 'print_facts' prints all local facts of the current context,
2331 both named and unnamed ones.
2333 * Isar: 'def' now admits simultaneous definitions, e.g.:
2335 def x == "t" and y == "u"
2337 * Isar: added command 'unfolding', which is structurally similar to
2338 'using', but affects both the goal state and facts by unfolding given
2339 rewrite rules. Thus many occurrences of the 'unfold' method or
2340 'unfolded' attribute may be replaced by first-class proof text.
2342 * Isar: methods 'unfold' / 'fold', attributes 'unfolded' / 'folded',
2343 and command 'unfolding' now all support object-level equalities
2344 (potentially conditional). The underlying notion of rewrite rule is
2345 analogous to the 'rule_format' attribute, but *not* that of the
2346 Simplifier (which is usually more generous).
2348 * Isar: the new attribute [rotated n] (default n = 1) rotates the
2349 premises of a theorem by n. Useful in conjunction with drule.
2351 * Isar: the goal restriction operator [N] (default N = 1) evaluates a
2352 method expression within a sandbox consisting of the first N
2353 sub-goals, which need to exist. For example, ``simp_all [3]''
2354 simplifies the first three sub-goals, while (rule foo, simp_all)[]
2355 simplifies all new goals that emerge from applying rule foo to the
2356 originally first one.
2358 * Isar: schematic goals are no longer restricted to higher-order
2359 patterns; e.g. ``lemma "?P(?x)" by (rule TrueI)'' now works as
2362 * Isar: the conclusion of a long theorem statement is now either
2363 'shows' (a simultaneous conjunction, as before), or 'obtains'
2364 (essentially a disjunction of cases with local parameters and
2365 assumptions). The latter allows to express general elimination rules
2366 adequately; in this notation common elimination rules look like this:
2368 lemma exE: -- "EX x. P x ==> (!!x. P x ==> thesis) ==> thesis"
2370 obtains x where "P x"
2372 lemma conjE: -- "A & B ==> (A ==> B ==> thesis) ==> thesis"
2376 lemma disjE: -- "A | B ==> (A ==> thesis) ==> (B ==> thesis) ==> thesis"
2382 The subsequent classical rules even refer to the formal "thesis"
2385 lemma classical: -- "(~ thesis ==> thesis) ==> thesis"
2388 lemma Peirce's_Law: -- "((thesis ==> something) ==> thesis) ==> thesis"
2389 obtains "thesis ==> something"
2391 The actual proof of an 'obtains' statement is analogous to that of the
2392 Isar proof element 'obtain', only that there may be several cases.
2393 Optional case names may be specified in parentheses; these will be
2394 available both in the present proof and as annotations in the
2395 resulting rule, for later use with the 'cases' method (cf. attribute
2398 * Isar: the assumptions of a long theorem statement are available as
2399 "assms" fact in the proof context. This is more appropriate than the
2400 (historical) "prems", which refers to all assumptions of the current
2401 context, including those from the target locale, proof body etc.
2403 * Isar: 'print_statement' prints theorems from the current theory or
2404 proof context in long statement form, according to the syntax of a
2407 * Isar: 'obtain' takes an optional case name for the local context
2408 introduction rule (default "that").
2410 * Isar: removed obsolete 'concl is' patterns. INCOMPATIBILITY, use
2411 explicit (is "_ ==> ?foo") in the rare cases where this still happens
2414 * Pure: syntax "CONST name" produces a fully internalized constant
2415 according to the current context. This is particularly useful for
2416 syntax translations that should refer to internal constant
2417 representations independently of name spaces.
2419 * Pure: syntax constant for foo (binder "FOO ") is called "foo_binder"
2420 instead of "FOO ". This allows multiple binder declarations to coexist
2421 in the same context. INCOMPATIBILITY.
2423 * Isar/locales: 'notation' provides a robust interface to the 'syntax'
2424 primitive that also works in a locale context (both for constants and
2425 fixed variables). Type declaration and internal syntactic representation
2426 of given constants retrieved from the context. Likewise, the
2427 'no_notation' command allows to remove given syntax annotations from the
2430 * Isar/locales: new derived specification elements 'axiomatization',
2431 'definition', 'abbreviation', which support type-inference, admit
2432 object-level specifications (equality, equivalence). See also the
2433 isar-ref manual. Examples:
2436 eq (infix "===" 50) where
2437 eq_refl: "x === x" and eq_subst: "x === y ==> P x ==> P y"
2439 definition "f x y = x + y + 1"
2440 definition g where "g x = f x x"
2443 neq (infix "=!=" 50) where
2444 "x =!= y == ~ (x === y)"
2446 These specifications may be also used in a locale context. Then the
2447 constants being introduced depend on certain fixed parameters, and the
2448 constant name is qualified by the locale base name. An internal
2449 abbreviation takes care for convenient input and output, making the
2450 parameters implicit and using the original short name. See also
2451 src/HOL/ex/Abstract_NAT.thy for an example of deriving polymorphic
2452 entities from a monomorphic theory.
2454 Presently, abbreviations are only available 'in' a target locale, but
2455 not inherited by general import expressions. Also note that
2456 'abbreviation' may be used as a type-safe replacement for 'syntax' +
2457 'translations' in common applications. The "no_abbrevs" print mode
2458 prevents folding of abbreviations in term output.
2460 Concrete syntax is attached to specified constants in internal form,
2461 independently of name spaces. The parse tree representation is
2462 slightly different -- use 'notation' instead of raw 'syntax', and
2463 'translations' with explicit "CONST" markup to accommodate this.
2465 * Pure/Isar: unified syntax for new-style specification mechanisms
2466 (e.g. 'definition', 'abbreviation', or 'inductive' in HOL) admits
2467 full type inference and dummy patterns ("_"). For example:
2469 definition "K x _ = x"
2471 inductive conj for A B
2472 where "A ==> B ==> conj A B"
2474 * Pure: command 'print_abbrevs' prints all constant abbreviations of
2475 the current context. Print mode "no_abbrevs" prevents inversion of
2476 abbreviations on output.
2478 * Isar/locales: improved parameter handling: use of locales "var" and
2479 "struct" no longer necessary; - parameter renamings are no longer
2480 required to be injective. For example, this allows to define
2481 endomorphisms as locale endom = homom mult mult h.
2483 * Isar/locales: changed the way locales with predicates are defined.
2484 Instead of accumulating the specification, the imported expression is
2485 now an interpretation. INCOMPATIBILITY: different normal form of
2486 locale expressions. In particular, in interpretations of locales with
2487 predicates, goals repesenting already interpreted fragments are not
2488 removed automatically. Use methods `intro_locales' and
2489 `unfold_locales'; see below.
2491 * Isar/locales: new methods `intro_locales' and `unfold_locales'
2492 provide backward reasoning on locales predicates. The methods are
2493 aware of interpretations and discharge corresponding goals.
2494 `intro_locales' is less aggressive then `unfold_locales' and does not
2495 unfold predicates to assumptions.
2497 * Isar/locales: the order in which locale fragments are accumulated
2498 has changed. This enables to override declarations from fragments due
2499 to interpretations -- for example, unwanted simp rules.
2501 * Isar/locales: interpretation in theories and proof contexts has been
2502 extended. One may now specify (and prove) equations, which are
2503 unfolded in interpreted theorems. This is useful for replacing
2504 defined concepts (constants depending on locale parameters) by
2505 concepts already existing in the target context. Example:
2507 interpretation partial_order ["op <= :: [int, int] => bool"]
2508 where "partial_order.less (op <=) (x::int) y = (x < y)"
2510 Typically, the constant `partial_order.less' is created by a
2511 definition specification element in the context of locale
2514 * Method "induct": improved internal context management to support
2515 local fixes and defines on-the-fly. Thus explicit meta-level
2516 connectives !! and ==> are rarely required anymore in inductive goals
2517 (using object-logic connectives for this purpose has been long
2518 obsolete anyway). Common proof patterns are explained in
2519 src/HOL/Induct/Common_Patterns.thy, see also
2520 src/HOL/Isar_examples/Puzzle.thy and src/HOL/Lambda for realistic
2523 * Method "induct": improved handling of simultaneous goals. Instead of
2524 introducing object-level conjunction, the statement is now split into
2525 several conclusions, while the corresponding symbolic cases are nested
2526 accordingly. INCOMPATIBILITY, proofs need to be structured explicitly,
2527 see src/HOL/Induct/Common_Patterns.thy, for example.
2529 * Method "induct": mutual induction rules are now specified as a list
2530 of rule sharing the same induction cases. HOL packages usually provide
2531 foo_bar.inducts for mutually defined items foo and bar (e.g. inductive
2532 predicates/sets or datatypes). INCOMPATIBILITY, users need to specify
2533 mutual induction rules differently, i.e. like this:
2535 (induct rule: foo_bar.inducts)
2536 (induct set: foo bar)
2537 (induct pred: foo bar)
2538 (induct type: foo bar)
2540 The ML function ProjectRule.projections turns old-style rules into the
2543 * Method "coinduct": dual of induction, see
2544 src/HOL/Library/Coinductive_List.thy for various examples.
2546 * Method "cases", "induct", "coinduct": the ``(open)'' option is
2547 considered a legacy feature.
2549 * Attribute "symmetric" produces result with standardized schematic
2550 variables (index 0). Potential INCOMPATIBILITY.
2552 * Simplifier: by default the simplifier trace only shows top level
2553 rewrites now. That is, trace_simp_depth_limit is set to 1 by
2554 default. Thus there is less danger of being flooded by the trace. The
2555 trace indicates where parts have been suppressed.
2557 * Provers/classical: removed obsolete classical version of elim_format
2558 attribute; classical elim/dest rules are now treated uniformly when
2559 manipulating the claset.
2561 * Provers/classical: stricter checks to ensure that supplied intro,
2562 dest and elim rules are well-formed; dest and elim rules must have at
2565 * Provers/classical: attributes dest/elim/intro take an optional
2566 weight argument for the rule (just as the Pure versions). Weights are
2567 ignored by automated tools, but determine the search order of single
2570 * Syntax: input syntax now supports dummy variable binding "%_. b",
2571 where the body does not mention the bound variable. Note that dummy
2572 patterns implicitly depend on their context of bounds, which makes
2573 "{_. _}" match any set comprehension as expected. Potential
2574 INCOMPATIBILITY -- parse translations need to cope with syntactic
2575 constant "_idtdummy" in the binding position.
2577 * Syntax: removed obsolete syntactic constant "_K" and its associated
2578 parse translation. INCOMPATIBILITY -- use dummy abstraction instead,
2579 for example "A -> B" => "Pi A (%_. B)".
2581 * Pure: 'class_deps' command visualizes the subclass relation, using
2582 the graph browser tool.
2584 * Pure: 'print_theory' now suppresses certain internal declarations by
2585 default; use '!' option for full details.
2590 * Method "metis" proves goals by applying the Metis general-purpose
2591 resolution prover (see also http://gilith.com/software/metis/).
2592 Examples are in the directory MetisExamples. WARNING: the
2593 Isabelle/HOL-Metis integration does not yet work properly with
2596 * Command 'sledgehammer' invokes external automatic theorem provers as
2597 background processes. It generates calls to the "metis" method if
2598 successful. These can be pasted into the proof. Users do not have to
2599 wait for the automatic provers to return. WARNING: does not really
2600 work with multi-threading.
2602 * New "auto_quickcheck" feature tests outermost goal statements for
2603 potential counter-examples. Controlled by ML references
2604 auto_quickcheck (default true) and auto_quickcheck_time_limit (default
2605 5000 milliseconds). Fails silently if statements is outside of
2606 executable fragment, or any other codgenerator problem occurs.
2608 * New constant "undefined" with axiom "undefined x = undefined".
2610 * Added class "HOL.eq", allowing for code generation with polymorphic
2613 * Some renaming of class constants due to canonical name prefixing in
2614 the new 'class' package:
2616 HOL.abs ~> HOL.abs_class.abs
2617 HOL.divide ~> HOL.divide_class.divide
2618 0 ~> HOL.zero_class.zero
2619 1 ~> HOL.one_class.one
2620 op + ~> HOL.plus_class.plus
2621 op - ~> HOL.minus_class.minus
2622 uminus ~> HOL.minus_class.uminus
2623 op * ~> HOL.times_class.times
2624 op < ~> HOL.ord_class.less
2625 op <= > HOL.ord_class.less_eq
2626 Nat.power ~> Power.power_class.power
2627 Nat.size ~> Nat.size_class.size
2628 Numeral.number_of ~> Numeral.number_class.number_of
2629 FixedPoint.Inf ~> Lattices.complete_lattice_class.Inf
2630 FixedPoint.Sup ~> Lattices.complete_lattice_class.Sup
2631 Orderings.min ~> Orderings.ord_class.min
2632 Orderings.max ~> Orderings.ord_class.max
2633 Divides.op div ~> Divides.div_class.div
2634 Divides.op mod ~> Divides.div_class.mod
2635 Divides.op dvd ~> Divides.div_class.dvd
2637 INCOMPATIBILITY. Adaptions may be required in the following cases:
2639 a) User-defined constants using any of the names "plus", "minus",
2640 "times", "less" or "less_eq". The standard syntax translations for
2641 "+", "-" and "*" may go wrong. INCOMPATIBILITY: use more specific
2644 b) Variables named "plus", "minus", "times", "less", "less_eq"
2645 INCOMPATIBILITY: use more specific names.
2647 c) Permutative equations (e.g. "a + b = b + a")
2648 Since the change of names also changes the order of terms, permutative
2649 rewrite rules may get applied in a different order. Experience shows
2650 that this is rarely the case (only two adaptions in the whole Isabelle
2651 distribution). INCOMPATIBILITY: rewrite proofs
2653 d) ML code directly refering to constant names
2654 This in general only affects hand-written proof tactics, simprocs and
2655 so on. INCOMPATIBILITY: grep your sourcecode and replace names.
2656 Consider using @{const_name} antiquotation.
2658 * New class "default" with associated constant "default".
2660 * Function "sgn" is now overloaded and available on int, real, complex
2661 (and other numeric types), using class "sgn". Two possible defs of
2662 sgn are given as equational assumptions in the classes sgn_if and
2663 sgn_div_norm; ordered_idom now also inherits from sgn_if.
2666 * Locale "partial_order" now unified with class "order" (cf. theory
2667 Orderings), added parameter "less". INCOMPATIBILITY.
2669 * Renamings in classes "order" and "linorder": facts "refl", "trans" and
2670 "cases" to "order_refl", "order_trans" and "linorder_cases", to avoid
2671 clashes with HOL "refl" and "trans". INCOMPATIBILITY.
2673 * Classes "order" and "linorder": potential INCOMPATIBILITY due to
2674 changed order of proof goals in instance proofs.
2676 * The transitivity reasoner for partial and linear orders is set up
2677 for classes "order" and "linorder". Instances of the reasoner are available
2678 in all contexts importing or interpreting the corresponding locales.
2679 Method "order" invokes the reasoner separately; the reasoner
2680 is also integrated with the Simplifier as a solver. Diagnostic
2681 command 'print_orders' shows the available instances of the reasoner
2682 in the current context.
2684 * Localized monotonicity predicate in theory "Orderings"; integrated
2685 lemmas max_of_mono and min_of_mono with this predicate.
2688 * Formulation of theorem "dense" changed slightly due to integration
2689 with new class dense_linear_order.
2691 * Uniform lattice theory development in HOL.
2693 constants "meet" and "join" now named "inf" and "sup"
2694 constant "Meet" now named "Inf"
2696 classes "meet_semilorder" and "join_semilorder" now named
2697 "lower_semilattice" and "upper_semilattice"
2698 class "lorder" now named "lattice"
2699 class "comp_lat" now named "complete_lattice"
2701 Instantiation of lattice classes allows explicit definitions
2702 for "inf" and "sup" operations (or "Inf" and "Sup" for complete lattices).
2704 INCOMPATIBILITY. Theorem renames:
2706 meet_left_le ~> inf_le1
2707 meet_right_le ~> inf_le2
2708 join_left_le ~> sup_ge1
2709 join_right_le ~> sup_ge2
2710 meet_join_le ~> inf_sup_ord
2713 le_meet ~> le_inf_iff
2714 le_join ~> ge_sup_conv
2715 meet_idempotent ~> inf_idem
2716 join_idempotent ~> sup_idem
2717 meet_comm ~> inf_commute
2718 join_comm ~> sup_commute
2719 meet_leI1 ~> le_infI1
2720 meet_leI2 ~> le_infI2
2721 le_joinI1 ~> le_supI1
2722 le_joinI2 ~> le_supI2
2723 meet_assoc ~> inf_assoc
2724 join_assoc ~> sup_assoc
2725 meet_left_comm ~> inf_left_commute
2726 meet_left_idempotent ~> inf_left_idem
2727 join_left_comm ~> sup_left_commute
2728 join_left_idempotent ~> sup_left_idem
2731 le_def_meet ~> le_iff_inf
2732 le_def_join ~> le_iff_sup
2733 join_absorp2 ~> sup_absorb2
2734 join_absorp1 ~> sup_absorb1
2735 meet_absorp1 ~> inf_absorb1
2736 meet_absorp2 ~> inf_absorb2
2737 meet_join_absorp ~> inf_sup_absorb
2738 join_meet_absorp ~> sup_inf_absorb
2739 distrib_join_le ~> distrib_sup_le
2740 distrib_meet_le ~> distrib_inf_le
2742 add_meet_distrib_left ~> add_inf_distrib_left
2743 add_join_distrib_left ~> add_sup_distrib_left
2744 is_join_neg_meet ~> is_join_neg_inf
2745 is_meet_neg_join ~> is_meet_neg_sup
2746 add_meet_distrib_right ~> add_inf_distrib_right
2747 add_join_distrib_right ~> add_sup_distrib_right
2748 add_meet_join_distribs ~> add_sup_inf_distribs
2749 join_eq_neg_meet ~> sup_eq_neg_inf
2750 meet_eq_neg_join ~> inf_eq_neg_sup
2751 add_eq_meet_join ~> add_eq_inf_sup
2752 meet_0_imp_0 ~> inf_0_imp_0
2753 join_0_imp_0 ~> sup_0_imp_0
2754 meet_0_eq_0 ~> inf_0_eq_0
2755 join_0_eq_0 ~> sup_0_eq_0
2756 neg_meet_eq_join ~> neg_inf_eq_sup
2757 neg_join_eq_meet ~> neg_sup_eq_inf
2758 join_eq_if ~> sup_eq_if
2760 mono_meet ~> mono_inf
2761 mono_join ~> mono_sup
2762 meet_bool_eq ~> inf_bool_eq
2763 join_bool_eq ~> sup_bool_eq
2764 meet_fun_eq ~> inf_fun_eq
2765 join_fun_eq ~> sup_fun_eq
2766 meet_set_eq ~> inf_set_eq
2767 join_set_eq ~> sup_set_eq
2768 meet1_iff ~> inf1_iff
2769 meet2_iff ~> inf2_iff
2778 join1_iff ~> sup1_iff
2779 join2_iff ~> sup2_iff
2789 is_meet_Meet ~> is_meet_Inf
2790 Meet_bool_def ~> Inf_bool_def
2791 Meet_fun_def ~> Inf_fun_def
2792 Meet_greatest ~> Inf_greatest
2793 Meet_lower ~> Inf_lower
2794 Meet_set_def ~> Inf_set_def
2797 Sup_bool_eq ~> Sup_bool_def
2798 Sup_fun_eq ~> Sup_fun_def
2799 Sup_set_eq ~> Sup_set_def
2801 listsp_meetI ~> listsp_infI
2802 listsp_meet_eq ~> listsp_inf_eq
2807 * Added syntactic class "size"; overloaded constant "size" now has
2808 type "'a::size ==> bool"
2810 * Internal reorganisation of `size' of datatypes: size theorems
2811 "foo.size" are no longer subsumed by "foo.simps" (but are still
2812 simplification rules by default!); theorems "prod.size" now named
2815 * Class "div" now inherits from class "times" rather than "type".
2818 * HOL/Finite_Set: "name-space" locales Lattice, Distrib_lattice,
2819 Linorder etc. have disappeared; operations defined in terms of
2820 fold_set now are named Inf_fin, Sup_fin. INCOMPATIBILITY.
2822 * HOL/Nat: neq0_conv no longer declared as iff. INCOMPATIBILITY.
2824 * HOL-Word: New extensive library and type for generic, fixed size
2825 machine words, with arithemtic, bit-wise, shifting and rotating
2826 operations, reflection into int, nat, and bool lists, automation for
2827 linear arithmetic (by automatic reflection into nat or int), including
2828 lemmas on overflow and monotonicity. Instantiated to all appropriate
2829 arithmetic type classes, supporting automatic simplification of
2830 numerals on all operations.
2832 * Library/Boolean_Algebra: locales for abstract boolean algebras.
2834 * Library/Numeral_Type: numbers as types, e.g. TYPE(32).
2836 * Code generator library theories:
2837 - Code_Integer represents HOL integers by big integer literals in target
2839 - Code_Char represents HOL characters by character literals in target
2841 - Code_Char_chr like Code_Char, but also offers treatment of character
2842 codes; includes Code_Integer.
2843 - Executable_Set allows to generate code for finite sets using lists.
2844 - Executable_Rat implements rational numbers as triples (sign, enumerator,
2846 - Executable_Real implements a subset of real numbers, namly those
2847 representable by rational numbers.
2848 - Efficient_Nat implements natural numbers by integers, which in general will
2849 result in higher efficency; pattern matching with 0/Suc is eliminated;
2850 includes Code_Integer.
2851 - Code_Index provides an additional datatype index which is mapped to
2852 target-language built-in integers.
2853 - Code_Message provides an additional datatype message_string which is isomorphic to
2854 strings; messages are mapped to target-language strings.
2856 * New package for inductive predicates
2858 An n-ary predicate p with m parameters z_1, ..., z_m can now be defined via
2861 p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2862 for z_1 :: U_1 and ... and z_n :: U_m
2864 rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2867 with full support for type-inference, rather than
2869 consts s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2871 abbreviation p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2872 where "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2874 inductive "s z_1 ... z_m"
2876 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2879 For backward compatibility, there is a wrapper allowing inductive
2880 sets to be defined with the new package via
2883 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2884 for z_1 :: U_1 and ... and z_n :: U_m
2886 rule_1: "... ==> (t_1_1, ..., t_1_n) : s z_1 ... z_m"
2892 s :: "U_1 => ... => U_m => (T_1 * ... * T_n) set"
2893 and p :: "U_1 => ... => U_m => T_1 => ... => T_n => bool"
2894 for z_1 :: U_1 and ... and z_n :: U_m
2896 "p z_1 ... z_m x_1 ... x_n == (x_1, ..., x_n) : s z_1 ... z_m"
2897 | rule_1: "... ==> p z_1 ... z_m t_1_1 ... t_1_n"
2900 if the additional syntax "p ..." is required.
2902 Numerous examples can be found in the subdirectories src/HOL/Auth,
2903 src/HOL/Bali, src/HOL/Induct, and src/HOL/MicroJava.
2907 - Since declaration and definition of inductive sets or predicates
2908 is no longer separated, abbreviations involving the newly
2909 introduced sets or predicates must be specified together with the
2910 introduction rules after the 'where' keyword (see above), rather
2911 than before the actual inductive definition.
2913 - The variables in induction and elimination rules are now
2914 quantified in the order of their occurrence in the introduction
2915 rules, rather than in alphabetical order. Since this may break
2916 some proofs, these proofs either have to be repaired, e.g. by
2917 reordering the variables a_i_1 ... a_i_{k_i} in Isar 'case'
2918 statements of the form
2920 case (rule_i a_i_1 ... a_i_{k_i})
2922 or the old order of quantification has to be restored by explicitly adding
2923 meta-level quantifiers in the introduction rules, i.e.
2925 | rule_i: "!!a_i_1 ... a_i_{k_i}. ... ==> p z_1 ... z_m t_i_1 ... t_i_n"
2927 - The format of the elimination rules is now
2929 p z_1 ... z_m x_1 ... x_n ==>
2930 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2935 (x_1, ..., x_n) : s z_1 ... z_m ==>
2936 (!!a_1_1 ... a_1_{k_1}. x_1 = t_1_1 ==> ... ==> x_n = t_1_n ==> ... ==> P)
2939 for sets rather than
2941 x : s z_1 ... z_m ==>
2942 (!!a_1_1 ... a_1_{k_1}. x = (t_1_1, ..., t_1_n) ==> ... ==> P)
2945 This may require terms in goals to be expanded to n-tuples
2946 (e.g. using case_tac or simplification with the split_paired_all
2947 rule) before the above elimination rule is applicable.
2949 - The elimination or case analysis rules for (mutually) inductive
2950 sets or predicates are now called "p_1.cases" ... "p_k.cases". The
2951 list of rules "p_1_..._p_k.elims" is no longer available.
2953 * New package "function"/"fun" for general recursive functions,
2954 supporting mutual and nested recursion, definitions in local contexts,
2955 more general pattern matching and partiality. See HOL/ex/Fundefs.thy
2956 for small examples, and the separate tutorial on the function
2957 package. The old recdef "package" is still available as before, but
2958 users are encouraged to use the new package.
2960 * Method "lexicographic_order" automatically synthesizes termination
2961 relations as lexicographic combinations of size measures.
2963 * Case-expressions allow arbitrary constructor-patterns (including
2964 "_") and take their order into account, like in functional
2965 programming. Internally, this is translated into nested
2966 case-expressions; missing cases are added and mapped to the predefined
2967 constant "undefined". In complicated cases printing may no longer show
2968 the original input but the internal form. Lambda-abstractions allow
2969 the same form of pattern matching: "% pat1 => e1 | ..." is an
2970 abbreviation for "%x. case x of pat1 => e1 | ..." where x is a new
2973 * IntDef: The constant "int :: nat => int" has been removed; now "int"
2974 is an abbreviation for "of_nat :: nat => int". The simplification
2975 rules for "of_nat" have been changed to work like "int" did
2976 previously. Potential INCOMPATIBILITY:
2977 - "of_nat (Suc m)" simplifies to "1 + of_nat m" instead of "of_nat m + 1"
2978 - of_nat_diff and of_nat_mult are no longer default simp rules
2980 * Method "algebra" solves polynomial equations over (semi)rings using
2981 Groebner bases. The (semi)ring structure is defined by locales and the
2982 tool setup depends on that generic context. Installing the method for
2983 a specific type involves instantiating the locale and possibly adding
2984 declarations for computation on the coefficients. The method is
2985 already instantiated for natural numbers and for the axiomatic class
2986 of idoms with numerals. See also the paper by Chaieb and Wenzel at
2987 CALCULEMUS 2007 for the general principles underlying this
2988 architecture of context-aware proof-tools.
2990 * Method "ferrack" implements quantifier elimination over
2991 special-purpose dense linear orders using locales (analogous to
2992 "algebra"). The method is already installed for class
2993 {ordered_field,recpower,number_ring} which subsumes real, hyperreal,
2996 * Former constant "List.op @" now named "List.append". Use ML
2997 antiquotations @{const_name List.append} or @{term " ... @ ... "} to
2998 circumvent possible incompatibilities when working on ML level.
3000 * primrec: missing cases mapped to "undefined" instead of "arbitrary".
3002 * New function listsum :: 'a list => 'a for arbitrary monoids.
3003 Special syntax: "SUM x <- xs. f x" (and latex variants)
3005 * New syntax for Haskell-like list comprehension (input only), eg.
3006 [(x,y). x <- xs, y <- ys, x ~= y], see also src/HOL/List.thy.
3008 * The special syntax for function "filter" has changed from [x :
3009 xs. P] to [x <- xs. P] to avoid an ambiguity caused by list
3010 comprehension syntax, and for uniformity. INCOMPATIBILITY.
3012 * [a..b] is now defined for arbitrary linear orders. It used to be
3013 defined on nat only, as an abbreviation for [a..<Suc b]
3016 * Renamed lemma "set_take_whileD" to "set_takeWhileD".
3018 * New functions "sorted" and "sort" in src/HOL/List.thy.
3020 * New lemma collection field_simps (an extension of ring_simps) for
3021 manipulating (in)equations involving division. Multiplies with all
3022 denominators that can be proved to be non-zero (in equations) or
3023 positive/negative (in inequations).
3025 * Lemma collections ring_eq_simps, group_eq_simps and ring_distrib
3026 have been improved and renamed to ring_simps, group_simps and
3027 ring_distribs. Removed lemmas field_xyz in theory Ring_and_Field
3028 because they were subsumed by lemmas xyz. INCOMPATIBILITY.
3030 * Theory Library/Commutative_Ring: switched from recdef to function
3031 package; constants add, mul, pow now curried. Infix syntax for
3032 algebraic operations.
3034 * Dropped redundant lemma def_imp_eq in favor of meta_eq_to_obj_eq.
3037 * Dropped redundant lemma if_def2 in favor of if_bool_eq_conj.
3040 * HOL/records: generalised field-update to take a function on the
3041 field rather than the new value: r(|A := x|) is translated to A_update
3042 (K x) r The K-combinator that is internally used is called K_record.
3043 INCOMPATIBILITY: Usage of the plain update functions has to be
3046 * Class "semiring_0" now contains annihilation axioms x * 0 = 0 and 0
3047 * x = 0, which are required for a semiring. Richer structures do not
3048 inherit from semiring_0 anymore, because this property is a theorem
3049 there, not an axiom. INCOMPATIBILITY: In instances of semiring_0,
3050 there is more to prove, but this is mostly trivial.
3052 * Class "recpower" is generalized to arbitrary monoids, not just
3053 commutative semirings. INCOMPATIBILITY: may need to incorporate
3054 commutativity or semiring properties additionally.
3056 * Constant "List.list_all2" in List.thy now uses authentic syntax.
3057 INCOMPATIBILITY: translations containing list_all2 may go wrong,
3058 better use 'abbreviation'.
3060 * Renamed constant "List.op mem" to "List.member". INCOMPATIBILITY.
3062 * Numeral syntax: type 'bin' which was a mere type copy of 'int' has
3063 been abandoned in favour of plain 'int'. INCOMPATIBILITY --
3064 significant changes for setting up numeral syntax for types:
3065 - New constants Numeral.pred and Numeral.succ instead
3066 of former Numeral.bin_pred and Numeral.bin_succ.
3067 - Use integer operations instead of bin_add, bin_mult and so on.
3068 - Numeral simplification theorems named Numeral.numeral_simps instead of Bin_simps.
3069 - ML structure Bin_Simprocs now named Int_Numeral_Base_Simprocs.
3071 See src/HOL/Integ/IntArith.thy for an example setup.
3073 * Command 'normal_form' computes the normal form of a term that may
3074 contain free variables. For example ``normal_form "rev [a, b, c]"''
3075 produces ``[b, c, a]'' (without proof). This command is suitable for
3076 heavy-duty computations because the functions are compiled to ML
3077 first. Correspondingly, a method "normalization" is provided. See
3078 further src/HOL/ex/NormalForm.thy and src/Tools/nbe.ML.
3080 * Alternative iff syntax "A <-> B" for equality on bool (with priority
3081 25 like -->); output depends on the "iff" print_mode, the default is
3082 "A = B" (with priority 50).
3084 * Relations less (<) and less_eq (<=) are also available on type bool.
3085 Modified syntax to disallow nesting without explicit parentheses,
3086 e.g. "(x < y) < z" or "x < (y < z)", but NOT "x < y < z". Potential
3089 * "LEAST x:A. P" expands to "LEAST x. x:A & P" (input only).
3091 * Relation composition operator "op O" now has precedence 75 and binds
3092 stronger than union and intersection. INCOMPATIBILITY.
3094 * The old set interval syntax "{m..n(}" (and relatives) has been
3095 removed. Use "{m..<n}" (and relatives) instead.
3097 * In the context of the assumption "~(s = t)" the Simplifier rewrites
3098 "t = s" to False (by simproc "neq"). INCOMPATIBILITY, consider using
3099 ``declare [[simproc del: neq]]''.
3101 * Simplifier: "m dvd n" where m and n are numbers is evaluated to
3104 * Theorem Cons_eq_map_conv no longer declared as "simp".
3106 * Theorem setsum_mult renamed to setsum_right_distrib.
3108 * Prefer ex1I over ex_ex1I in single-step reasoning, e.g. by the
3111 * Reimplemented methods "sat" and "satx", with several improvements:
3112 goals no longer need to be stated as "<prems> ==> False", equivalences
3113 (i.e. "=" on type bool) are handled, variable names of the form
3114 "lit_<n>" are no longer reserved, significant speedup.
3116 * Methods "sat" and "satx" can now replay MiniSat proof traces.
3117 zChaff is still supported as well.
3119 * 'inductive' and 'datatype': provide projections of mutual rules,
3120 bundled as foo_bar.inducts;
3122 * Library: moved theories Parity, GCD, Binomial, Infinite_Set to
3125 * Library: moved theory Accessible_Part to main HOL.
3127 * Library: added theory Coinductive_List of potentially infinite lists
3128 as greatest fixed-point.
3130 * Library: added theory AssocList which implements (finite) maps as
3133 * Method "evaluation" solves goals (i.e. a boolean expression)
3134 efficiently by compiling it to ML. The goal is "proved" (via an
3135 oracle) if it evaluates to True.
3137 * Linear arithmetic now splits certain operators (e.g. min, max, abs)
3138 also when invoked by the simplifier. This results in the Simplifier
3139 being more powerful on arithmetic goals. INCOMPATIBILITY.
3140 Configuration option fast_arith_split_limit=0 recovers the old
3143 * Support for hex (0x20) and binary (0b1001) numerals.
3145 * New method: reify eqs (t), where eqs are equations for an
3146 interpretation I :: 'a list => 'b => 'c and t::'c is an optional
3147 parameter, computes a term s::'b and a list xs::'a list and proves the
3148 theorem I xs s = t. This is also known as reification or quoting. The
3149 resulting theorem is applied to the subgoal to substitute t with I xs
3150 s. If t is omitted, the subgoal itself is reified.
3152 * New method: reflection corr_thm eqs (t). The parameters eqs and (t)
3153 are as explained above. corr_thm is a theorem for I vs (f t) = I vs t,
3154 where f is supposed to be a computable function (in the sense of code
3155 generattion). The method uses reify to compute s and xs as above then
3156 applies corr_thm and uses normalization by evaluation to "prove" f s =
3157 r and finally gets the theorem t = r, which is again applied to the
3158 subgoal. An Example is available in src/HOL/ex/ReflectionEx.thy.
3160 * Reflection: Automatic reification now handels binding, an example is
3161 available in src/HOL/ex/ReflectionEx.thy
3163 * HOL-Statespace: ``State Spaces: The Locale Way'' introduces a
3164 command 'statespace' that is similar to 'record', but introduces an
3165 abstract specification based on the locale infrastructure instead of
3166 HOL types. This leads to extra flexibility in composing state spaces,
3167 in particular multiple inheritance and renaming of components.
3172 * Hyperreal: Functions root and sqrt are now defined on negative real
3173 inputs so that root n (- x) = - root n x and sqrt (- x) = - sqrt x.
3174 Nonnegativity side conditions have been removed from many lemmas, so
3175 that more subgoals may now be solved by simplification; potential
3178 * Real: new type classes formalize real normed vector spaces and
3179 algebras, using new overloaded constants scaleR :: real => 'a => 'a
3180 and norm :: 'a => real.
3182 * Real: constant of_real :: real => 'a::real_algebra_1 injects from
3183 reals into other types. The overloaded constant Reals :: 'a set is now
3184 defined as range of_real; potential INCOMPATIBILITY.
3186 * Real: proper support for ML code generation, including 'quickcheck'.
3187 Reals are implemented as arbitrary precision rationals.
3189 * Hyperreal: Several constants that previously worked only for the
3190 reals have been generalized, so they now work over arbitrary vector
3191 spaces. Type annotations may need to be added in some cases; potential
3194 Infinitesimal :: ('a::real_normed_vector) star set
3195 HFinite :: ('a::real_normed_vector) star set
3196 HInfinite :: ('a::real_normed_vector) star set
3197 approx :: ('a::real_normed_vector) star => 'a star => bool
3198 monad :: ('a::real_normed_vector) star => 'a star set
3199 galaxy :: ('a::real_normed_vector) star => 'a star set
3200 (NS)LIMSEQ :: [nat => 'a::real_normed_vector, 'a] => bool
3201 (NS)convergent :: (nat => 'a::real_normed_vector) => bool
3202 (NS)Bseq :: (nat => 'a::real_normed_vector) => bool
3203 (NS)Cauchy :: (nat => 'a::real_normed_vector) => bool
3204 (NS)LIM :: ['a::real_normed_vector => 'b::real_normed_vector, 'a, 'b] => bool
3205 is(NS)Cont :: ['a::real_normed_vector => 'b::real_normed_vector, 'a] => bool
3206 deriv :: ['a::real_normed_field => 'a, 'a, 'a] => bool
3207 sgn :: 'a::real_normed_vector => 'a
3208 exp :: 'a::{recpower,real_normed_field,banach} => 'a
3210 * Complex: Some complex-specific constants are now abbreviations for
3211 overloaded ones: complex_of_real = of_real, cmod = norm, hcmod =
3212 hnorm. Other constants have been entirely removed in favor of the
3213 polymorphic versions (INCOMPATIBILITY):
3217 HInfinite <-- CInfinite
3218 Infinitesimal <-- CInfinitesimal
3221 (NS)LIM <-- (NS)CLIM, (NS)CRLIM
3222 is(NS)Cont <-- is(NS)Contc, is(NS)contCR
3223 (ns)deriv <-- (ns)cderiv
3228 * Formalisation of ideals and the quotient construction over rings.
3230 * Order and lattice theory no longer based on records.
3233 * Renamed lemmas least_carrier -> least_closed and greatest_carrier ->
3234 greatest_closed. INCOMPATIBILITY.
3236 * Method algebra is now set up via an attribute. For examples see
3237 Ring.thy. INCOMPATIBILITY: the method is now weaker on combinations
3238 of algebraic structures.
3240 * Renamed theory CRing to Ring.
3245 * Substantial, yet incomplete support for nominal datatypes (binding
3246 structures) based on HOL-Nominal logic. See src/HOL/Nominal and
3247 src/HOL/Nominal/Examples. Prospective users should consult
3248 http://isabelle.in.tum.de/nominal/
3253 * ML basics: just one true type int, which coincides with IntInf.int
3256 * ML within Isar: antiquotations allow to embed statically-checked
3257 formal entities in the source, referring to the context available at
3258 compile-time. For example:
3260 ML {* @{sort "{zero,one}"} *}
3261 ML {* @{typ "'a => 'b"} *}
3262 ML {* @{term "%x. x"} *}
3263 ML {* @{prop "x == y"} *}
3264 ML {* @{ctyp "'a => 'b"} *}
3265 ML {* @{cterm "%x. x"} *}
3266 ML {* @{cprop "x == y"} *}
3267 ML {* @{thm asm_rl} *}
3268 ML {* @{thms asm_rl} *}
3269 ML {* @{type_name c} *}
3270 ML {* @{type_syntax c} *}
3271 ML {* @{const_name c} *}
3272 ML {* @{const_syntax c} *}
3275 ML {* @{theory Pure} *}
3276 ML {* @{theory_ref} *}
3277 ML {* @{theory_ref Pure} *}
3280 ML {* @{clasimpset} *}
3282 The same works for sources being ``used'' within an Isar context.
3284 * ML in Isar: improved error reporting; extra verbosity with
3285 ML_Context.trace enabled.
3287 * Pure/General/table.ML: the join operations now works via exceptions
3288 DUP/SAME instead of type option. This is simpler in simple cases, and
3289 admits slightly more efficient complex applications.
3291 * Pure: 'advanced' translation functions (parse_translation etc.) now
3292 use Context.generic instead of just theory.
3294 * Pure: datatype Context.generic joins theory/Proof.context and
3295 provides some facilities for code that works in either kind of
3296 context, notably GenericDataFun for uniform theory and proof data.
3298 * Pure: simplified internal attribute type, which is now always
3299 Context.generic * thm -> Context.generic * thm. Global (theory) vs.
3300 local (Proof.context) attributes have been discontinued, while
3301 minimizing code duplication. Thm.rule_attribute and
3302 Thm.declaration_attribute build canonical attributes; see also structure
3303 Context for further operations on Context.generic, notably
3304 GenericDataFun. INCOMPATIBILITY, need to adapt attribute type
3305 declarations and definitions.
3307 * Context data interfaces (Theory/Proof/GenericDataFun): removed
3308 name/print, uninitialized data defaults to ad-hoc copy of empty value,
3309 init only required for impure data. INCOMPATIBILITY: empty really need
3310 to be empty (no dependencies on theory content!)
3312 * Pure/kernel: consts certification ignores sort constraints given in
3313 signature declarations. (This information is not relevant to the
3314 logic, but only for type inference.) SIGNIFICANT INTERNAL CHANGE,
3315 potential INCOMPATIBILITY.
3317 * Pure: axiomatic type classes are now purely definitional, with
3318 explicit proofs of class axioms and super class relations performed
3319 internally. See Pure/axclass.ML for the main internal interfaces --
3320 notably AxClass.define_class supersedes AxClass.add_axclass, and
3321 AxClass.axiomatize_class/classrel/arity supersede
3322 Sign.add_classes/classrel/arities.
3324 * Pure/Isar: Args/Attrib parsers operate on Context.generic --
3325 global/local versions on theory vs. Proof.context have been
3326 discontinued; Attrib.syntax and Method.syntax have been adapted
3327 accordingly. INCOMPATIBILITY, need to adapt parser expressions for
3328 attributes, methods, etc.
3330 * Pure: several functions of signature "... -> theory -> theory * ..."
3331 have been reoriented to "... -> theory -> ... * theory" in order to
3332 allow natural usage in combination with the ||>, ||>>, |-> and
3333 fold_map combinators.
3335 * Pure: official theorem names (closed derivations) and additional
3336 comments (tags) are now strictly separate. Name hints -- which are
3337 maintained as tags -- may be attached any time without affecting the
3340 * Pure: primitive rule lift_rule now takes goal cterm instead of an
3341 actual goal state (thm). Use Thm.lift_rule (Thm.cprem_of st i) to
3342 achieve the old behaviour.
3344 * Pure: the "Goal" constant is now called "prop", supporting a
3345 slightly more general idea of ``protecting'' meta-level rule
3348 * Pure: Logic.(un)varify only works in a global context, which is now
3349 enforced instead of silently assumed. INCOMPATIBILITY, may use
3350 Logic.legacy_(un)varify as temporary workaround.
3352 * Pure: structure Name provides scalable operations for generating
3353 internal variable names, notably Name.variants etc. This replaces
3354 some popular functions from term.ML:
3356 Term.variant -> Name.variant
3357 Term.variantlist -> Name.variant_list
3358 Term.invent_names -> Name.invent_list
3360 Note that low-level renaming rarely occurs in new code -- operations
3361 from structure Variable are used instead (see below).
3363 * Pure: structure Variable provides fundamental operations for proper
3364 treatment of fixed/schematic variables in a context. For example,
3365 Variable.import introduces fixes for schematics of given facts and
3366 Variable.export reverses the effect (up to renaming) -- this replaces
3367 various freeze_thaw operations.
3369 * Pure: structure Goal provides simple interfaces for
3370 init/conclude/finish and tactical prove operations (replacing former
3371 Tactic.prove). Goal.prove is the canonical way to prove results
3372 within a given context; Goal.prove_global is a degraded version for
3373 theory level goals, including a global Drule.standard. Note that
3374 OldGoals.prove_goalw_cterm has long been obsolete, since it is
3375 ill-behaved in a local proof context (e.g. with local fixes/assumes or
3376 in a locale context).
3378 * Pure/Syntax: generic interfaces for parsing (Syntax.parse_term etc.)
3379 and type checking (Syntax.check_term etc.), with common combinations
3380 (Syntax.read_term etc.). These supersede former Sign.read_term etc.
3381 which are considered legacy and await removal.
3383 * Pure/Syntax: generic interfaces for type unchecking
3384 (Syntax.uncheck_terms etc.) and unparsing (Syntax.unparse_term etc.),
3385 with common combinations (Syntax.pretty_term, Syntax.string_of_term
3386 etc.). Former Sign.pretty_term, Sign.string_of_term etc. are still
3387 available for convenience, but refer to the very same operations using
3388 a mere theory instead of a full context.
3390 * Isar: simplified treatment of user-level errors, using exception
3391 ERROR of string uniformly. Function error now merely raises ERROR,
3392 without any side effect on output channels. The Isar toplevel takes
3393 care of proper display of ERROR exceptions. ML code may use plain
3394 handle/can/try; cat_error may be used to concatenate errors like this:
3396 ... handle ERROR msg => cat_error msg "..."
3398 Toplevel ML code (run directly or through the Isar toplevel) may be
3399 embedded into the Isar toplevel with exception display/debug like
3402 Isar.toplevel (fn () => ...)
3404 INCOMPATIBILITY, removed special transform_error facilities, removed
3405 obsolete variants of user-level exceptions (ERROR_MESSAGE,
3406 Context.PROOF, ProofContext.CONTEXT, Proof.STATE, ProofHistory.FAIL)
3407 -- use plain ERROR instead.
3409 * Isar: theory setup now has type (theory -> theory), instead of a
3410 list. INCOMPATIBILITY, may use #> to compose setup functions.
3412 * Isar: ML toplevel pretty printer for type Proof.context, subject to
3413 ProofContext.debug/verbose flags.
3415 * Isar: Toplevel.theory_to_proof admits transactions that modify the
3416 theory before entering a proof state. Transactions now always see a
3417 quasi-functional intermediate checkpoint, both in interactive and
3420 * Isar: simplified interfaces for outer syntax. Renamed
3421 OuterSyntax.add_keywords to OuterSyntax.keywords. Removed
3422 OuterSyntax.add_parsers -- this functionality is now included in
3423 OuterSyntax.command etc. INCOMPATIBILITY.
3425 * Simplifier: the simpset of a running simplification process now
3426 contains a proof context (cf. Simplifier.the_context), which is the
3427 very context that the initial simpset has been retrieved from (by
3428 simpset_of/local_simpset_of). Consequently, all plug-in components
3429 (solver, looper etc.) may depend on arbitrary proof data.
3431 * Simplifier.inherit_context inherits the proof context (plus the
3432 local bounds) of the current simplification process; any simproc
3433 etc. that calls the Simplifier recursively should do this! Removed
3434 former Simplifier.inherit_bounds, which is already included here --
3435 INCOMPATIBILITY. Tools based on low-level rewriting may even have to
3436 specify an explicit context using Simplifier.context/theory_context.
3438 * Simplifier/Classical Reasoner: more abstract interfaces
3439 change_simpset/claset for modifying the simpset/claset reference of a
3440 theory; raw versions simpset/claset_ref etc. have been discontinued --
3443 * Provers: more generic wrt. syntax of object-logics, avoid hardwired
3449 * settings: the default heap location within ISABELLE_HOME_USER now
3450 includes ISABELLE_IDENTIFIER. This simplifies use of multiple
3451 Isabelle installations.
3453 * isabelle-process: option -S (secure mode) disables some critical
3454 operations, notably runtime compilation and evaluation of ML source
3457 * Basic Isabelle mode for jEdit, see Isabelle/lib/jedit/.
3459 * Support for parallel execution, using native multicore support of
3460 Poly/ML 5.1. The theory loader exploits parallelism when processing
3461 independent theories, according to the given theory header
3462 specifications. The maximum number of worker threads is specified via
3463 usedir option -M or the "max-threads" setting in Proof General. A
3464 speedup factor of 1.5--3.5 can be expected on a 4-core machine, and up
3465 to 6 on a 8-core machine. User-code needs to observe certain
3466 guidelines for thread-safe programming, see appendix A in the Isar
3467 Implementation manual.
3471 New in Isabelle2005 (October 2005)
3472 ----------------------------------
3476 * Theory headers: the new header syntax for Isar theories is
3479 imports <theory1> ... <theoryN>
3480 uses <file1> ... <fileM>
3483 where the 'uses' part is optional. The previous syntax
3485 theory <name> = <theory1> + ... + <theoryN>:
3487 will disappear in the next release. Use isatool fixheaders to convert
3488 existing theory files. Note that there is no change in ancient
3489 non-Isar theories now, but these will disappear soon.
3491 * Theory loader: parent theories can now also be referred to via
3492 relative and absolute paths.
3494 * Command 'find_theorems' searches for a list of criteria instead of a
3495 list of constants. Known criteria are: intro, elim, dest, name:string,
3496 simp:term, and any term. Criteria can be preceded by '-' to select
3497 theorems that do not match. Intro, elim, dest select theorems that
3498 match the current goal, name:s selects theorems whose fully qualified
3499 name contain s, and simp:term selects all simplification rules whose
3500 lhs match term. Any other term is interpreted as pattern and selects
3501 all theorems matching the pattern. Available in ProofGeneral under
3502 'ProofGeneral -> Find Theorems' or C-c C-f. Example:
3504 C-c C-f (100) "(_::nat) + _ + _" intro -name: "HOL."
3506 prints the last 100 theorems matching the pattern "(_::nat) + _ + _",
3507 matching the current goal as introduction rule and not having "HOL."
3508 in their name (i.e. not being defined in theory HOL).
3510 * Command 'thms_containing' has been discontinued in favour of
3511 'find_theorems'; INCOMPATIBILITY.
3513 * Communication with Proof General is now 8bit clean, which means that
3514 Unicode text in UTF-8 encoding may be used within theory texts (both
3515 formal and informal parts). Cf. option -U of the Isabelle Proof
3516 General interface. Here are some simple examples (cf. src/HOL/ex):
3518 http://isabelle.in.tum.de/library/HOL/ex/Hebrew.html
3519 http://isabelle.in.tum.de/library/HOL/ex/Chinese.html
3521 * Improved efficiency of the Simplifier and, to a lesser degree, the
3522 Classical Reasoner. Typical big applications run around 2 times
3526 *** Document preparation ***
3528 * Commands 'display_drafts' and 'print_drafts' perform simple output
3529 of raw sources. Only those symbols that do not require additional
3530 LaTeX packages (depending on comments in isabellesym.sty) are
3531 displayed properly, everything else is left verbatim. isatool display
3532 and isatool print are used as front ends (these are subject to the
3533 DVI/PDF_VIEWER and PRINT_COMMAND settings, respectively).
3535 * Command tags control specific markup of certain regions of text,
3536 notably folding and hiding. Predefined tags include "theory" (for
3537 theory begin and end), "proof" for proof commands, and "ML" for
3538 commands involving ML code; the additional tags "visible" and
3539 "invisible" are unused by default. Users may give explicit tag
3540 specifications in the text, e.g. ''by %invisible (auto)''. The
3541 interpretation of tags is determined by the LaTeX job during document
3542 preparation: see option -V of isatool usedir, or options -n and -t of
3543 isatool document, or even the LaTeX macros \isakeeptag, \isafoldtag,
3546 Several document versions may be produced at the same time via isatool
3547 usedir (the generated index.html will link all of them). Typical
3548 specifications include ''-V document=theory,proof,ML'' to present
3549 theory/proof/ML parts faithfully, ''-V outline=/proof,/ML'' to fold
3550 proof and ML commands, and ''-V mutilated=-theory,-proof,-ML'' to omit
3551 these parts without any formal replacement text. The Isabelle site
3552 default settings produce ''document'' and ''outline'' versions as
3555 * Several new antiquotations:
3557 @{term_type term} prints a term with its type annotated;
3559 @{typeof term} prints the type of a term;
3561 @{const const} is the same as @{term const}, but checks that the
3562 argument is a known logical constant;
3564 @{term_style style term} and @{thm_style style thm} print a term or
3565 theorem applying a "style" to it
3569 Predefined styles are 'lhs' and 'rhs' printing the lhs/rhs of
3570 definitions, equations, inequations etc., 'concl' printing only the
3571 conclusion of a meta-logical statement theorem, and 'prem1' .. 'prem19'
3572 to print the specified premise. TermStyle.add_style provides an ML
3573 interface for introducing further styles. See also the "LaTeX Sugar"
3574 document practical applications. The ML antiquotation prints
3575 type-checked ML expressions verbatim.
3577 * Markup commands 'chapter', 'section', 'subsection', 'subsubsection',
3578 and 'text' support optional locale specification '(in loc)', which
3579 specifies the default context for interpreting antiquotations. For
3580 example: 'text (in lattice) {* @{thm inf_assoc}*}'.
3582 * Option 'locale=NAME' of antiquotations specifies an alternative
3583 context interpreting the subsequent argument. For example: @{thm
3584 [locale=lattice] inf_assoc}.
3586 * Proper output of proof terms (@{prf ...} and @{full_prf ...}) within
3589 * Proper output of antiquotations for theory commands involving a
3590 proof context (such as 'locale' or 'theorem (in loc) ...').
3592 * Delimiters of outer tokens (string etc.) now produce separate LaTeX
3593 macros (\isachardoublequoteopen, isachardoublequoteclose etc.).
3595 * isatool usedir: new option -C (default true) controls whether option
3596 -D should include a copy of the original document directory; -C false
3597 prevents unwanted effects such as copying of administrative CVS data.
3602 * Considerably improved version of 'constdefs' command. Now performs
3603 automatic type-inference of declared constants; additional support for
3604 local structure declarations (cf. locales and HOL records), see also
3605 isar-ref manual. Potential INCOMPATIBILITY: need to observe strictly
3606 sequential dependencies of definitions within a single 'constdefs'
3607 section; moreover, the declared name needs to be an identifier. If
3608 all fails, consider to fall back on 'consts' and 'defs' separately.
3610 * Improved indexed syntax and implicit structures. First of all,
3611 indexed syntax provides a notational device for subscripted
3612 application, using the new syntax \<^bsub>term\<^esub> for arbitrary
3613 expressions. Secondly, in a local context with structure
3614 declarations, number indexes \<^sub>n or the empty index (default
3615 number 1) refer to a certain fixed variable implicitly; option
3616 show_structs controls printing of implicit structures. Typical
3617 applications of these concepts involve record types and locales.
3619 * New command 'no_syntax' removes grammar declarations (and
3620 translations) resulting from the given syntax specification, which is
3621 interpreted in the same manner as for the 'syntax' command.
3623 * 'Advanced' translation functions (parse_translation etc.) may depend
3624 on the signature of the theory context being presently used for
3625 parsing/printing, see also isar-ref manual.
3627 * Improved 'oracle' command provides a type-safe interface to turn an
3628 ML expression of type theory -> T -> term into a primitive rule of
3629 type theory -> T -> thm (i.e. the functionality of Thm.invoke_oracle
3630 is already included here); see also FOL/ex/IffExample.thy;
3633 * axclass: name space prefix for class "c" is now "c_class" (was "c"
3634 before); "cI" is no longer bound, use "c.intro" instead.
3635 INCOMPATIBILITY. This change avoids clashes of fact bindings for
3636 axclasses vs. locales.
3638 * Improved internal renaming of symbolic identifiers -- attach primes
3639 instead of base 26 numbers.
3641 * New flag show_question_marks controls printing of leading question
3642 marks in schematic variable names.
3644 * In schematic variable names, *any* symbol following \<^isub> or
3645 \<^isup> is now treated as part of the base name. For example, the
3646 following works without printing of awkward ".0" indexes:
3648 lemma "x\<^isub>1 = x\<^isub>2 ==> x\<^isub>2 = x\<^isub>1"
3651 * Inner syntax includes (*(*nested*) comments*).
3653 * Pretty printer now supports unbreakable blocks, specified in mixfix
3654 annotations as "(00...)".
3656 * Clear separation of logical types and nonterminals, where the latter
3657 may only occur in 'syntax' specifications or type abbreviations.
3658 Before that distinction was only partially implemented via type class
3659 "logic" vs. "{}". Potential INCOMPATIBILITY in rare cases of improper
3660 use of 'types'/'consts' instead of 'nonterminals'/'syntax'. Some very
3661 exotic syntax specifications may require further adaption
3662 (e.g. Cube/Cube.thy).
3664 * Removed obsolete type class "logic", use the top sort {} instead.
3665 Note that non-logical types should be declared as 'nonterminals'
3666 rather than 'types'. INCOMPATIBILITY for new object-logic
3669 * Attributes 'induct' and 'cases': type or set names may now be
3670 locally fixed variables as well.
3672 * Simplifier: can now control the depth to which conditional rewriting
3673 is traced via the PG menu Isabelle -> Settings -> Trace Simp Depth
3676 * Simplifier: simplification procedures may now take the current
3677 simpset into account (cf. Simplifier.simproc(_i) / mk_simproc
3678 interface), which is very useful for calling the Simplifier
3679 recursively. Minor INCOMPATIBILITY: the 'prems' argument of simprocs
3680 is gone -- use prems_of_ss on the simpset instead. Moreover, the
3681 low-level mk_simproc no longer applies Logic.varify internally, to
3682 allow for use in a context of fixed variables.
3684 * thin_tac now works even if the assumption being deleted contains !!
3685 or ==>. More generally, erule now works even if the major premise of
3686 the elimination rule contains !! or ==>.
3688 * Method 'rules' has been renamed to 'iprover'. INCOMPATIBILITY.
3690 * Reorganized bootstrapping of the Pure theories; CPure is now derived
3691 from Pure, which contains all common declarations already. Both
3692 theories are defined via plain Isabelle/Isar .thy files.
3693 INCOMPATIBILITY: elements of CPure (such as the CPure.intro /
3694 CPure.elim / CPure.dest attributes) now appear in the Pure name space;
3695 use isatool fixcpure to adapt your theory and ML sources.
3697 * New syntax 'name(i-j, i-, i, ...)' for referring to specific
3698 selections of theorems in named facts via index ranges.
3700 * 'print_theorems': in theory mode, really print the difference
3701 wrt. the last state (works for interactive theory development only),
3702 in proof mode print all local facts (cf. 'print_facts');
3704 * 'hide': option '(open)' hides only base names.
3706 * More efficient treatment of intermediate checkpoints in interactive
3709 * Code generator is now invoked via code_module (incremental code
3710 generation) and code_library (modular code generation, ML structures
3711 for each theory). INCOMPATIBILITY: new keywords 'file' and 'contains'
3712 must be quoted when used as identifiers.
3714 * New 'value' command for reading, evaluating and printing terms using
3715 the code generator. INCOMPATIBILITY: command keyword 'value' must be
3716 quoted when used as identifier.
3721 * New commands for the interpretation of locale expressions in
3722 theories (1), locales (2) and proof contexts (3). These generate
3723 proof obligations from the expression specification. After the
3724 obligations have been discharged, theorems of the expression are added
3725 to the theory, target locale or proof context. The synopsis of the
3726 commands is a follows:
3728 (1) interpretation expr inst
3729 (2) interpretation target < expr
3730 (3) interpret expr inst
3732 Interpretation in theories and proof contexts require a parameter
3733 instantiation of terms from the current context. This is applied to
3734 specifications and theorems of the interpreted expression.
3735 Interpretation in locales only permits parameter renaming through the
3736 locale expression. Interpretation is smart in that interpretations
3737 that are active already do not occur in proof obligations, neither are
3738 instantiated theorems stored in duplicate. Use 'print_interps' to
3739 inspect active interpretations of a particular locale. For details,
3740 see the Isar Reference manual. Examples can be found in
3741 HOL/Finite_Set.thy and HOL/Algebra/UnivPoly.thy.
3743 INCOMPATIBILITY: former 'instantiate' has been withdrawn, use
3744 'interpret' instead.
3746 * New context element 'constrains' for adding type constraints to
3749 * Context expressions: renaming of parameters with syntax
3752 * Locale declaration: 'includes' disallowed.
3754 * Proper static binding of attribute syntax -- i.e. types / terms /
3755 facts mentioned as arguments are always those of the locale definition
3756 context, independently of the context of later invocations. Moreover,
3757 locale operations (renaming and type / term instantiation) are applied
3758 to attribute arguments as expected.
3760 INCOMPATIBILITY of the ML interface: always pass Attrib.src instead of
3761 actual attributes; rare situations may require Attrib.attribute to
3762 embed those attributes into Attrib.src that lack concrete syntax.
3763 Attribute implementations need to cooperate properly with the static
3764 binding mechanism. Basic parsers Args.XXX_typ/term/prop and
3765 Attrib.XXX_thm etc. already do the right thing without further
3766 intervention. Only unusual applications -- such as "where" or "of"
3767 (cf. src/Pure/Isar/attrib.ML), which process arguments depending both
3768 on the context and the facts involved -- may have to assign parsed
3769 values to argument tokens explicitly.
3771 * Changed parameter management in theorem generation for long goal
3772 statements with 'includes'. INCOMPATIBILITY: produces a different
3773 theorem statement in rare situations.
3775 * Locale inspection command 'print_locale' omits notes elements. Use
3776 'print_locale!' to have them included in the output.
3781 * Provers/hypsubst.ML: improved version of the subst method, for
3782 single-step rewriting: it now works in bound variable contexts. New is
3783 'subst (asm)', for rewriting an assumption. INCOMPATIBILITY: may
3784 rewrite a different subterm than the original subst method, which is
3785 still available as 'simplesubst'.
3787 * Provers/quasi.ML: new transitivity reasoners for transitivity only
3790 * Provers/trancl.ML: new transitivity reasoner for transitive and
3791 reflexive-transitive closure of relations.
3793 * Provers/blast.ML: new reference depth_limit to make blast's depth
3794 limit (previously hard-coded with a value of 20) user-definable.
3796 * Provers/simplifier.ML has been moved to Pure, where Simplifier.setup
3797 is peformed already. Object-logics merely need to finish their
3798 initial simpset configuration as before. INCOMPATIBILITY.
3803 * Symbolic syntax of Hilbert Choice Operator is now as follows:
3806 "_Eps" :: "[pttrn, bool] => 'a" ("(3\<some>_./ _)" [0, 10] 10)
3808 The symbol \<some> is displayed as the alternative epsilon of LaTeX
3809 and x-symbol; use option '-m epsilon' to get it actually printed.
3810 Moreover, the mathematically important symbolic identifier \<epsilon>
3811 becomes available as variable, constant etc. INCOMPATIBILITY,
3813 * "x > y" abbreviates "y < x" and "x >= y" abbreviates "y <= x".
3814 Similarly for all quantifiers: "ALL x > y" etc. The x-symbol for >=
3815 is \<ge>. New transitivity rules have been added to HOL/Orderings.thy to
3816 support corresponding Isar calculations.
3818 * "{x:A. P}" abbreviates "{x. x:A & P}", and similarly for "\<in>"
3821 * theory SetInterval: changed the syntax for open intervals:
3830 The old syntax is still supported but will disappear in the next
3831 release. For conversion use the following Emacs search and replace
3832 patterns (these are not perfect but work quite well):
3834 {)\([^\.]*\)\.\. -> {\1<\.\.}
3835 \.\.\([^(}]*\)(} -> \.\.<\1}
3837 * Theory Commutative_Ring (in Library): method comm_ring for proving
3838 equalities in commutative rings; method 'algebra' provides a generic
3841 * Theory Finite_Set: changed the syntax for 'setsum', summation over
3842 finite sets: "setsum (%x. e) A", which used to be "\<Sum>x:A. e", is
3843 now either "SUM x:A. e" or "\<Sum>x \<in> A. e". The bound variable can
3846 Some new syntax forms are available:
3848 "\<Sum>x | P. e" for "setsum (%x. e) {x. P}"
3849 "\<Sum>x = a..b. e" for "setsum (%x. e) {a..b}"
3850 "\<Sum>x = a..<b. e" for "setsum (%x. e) {a..<b}"
3851 "\<Sum>x < k. e" for "setsum (%x. e) {..<k}"
3853 The latter form "\<Sum>x < k. e" used to be based on a separate
3854 function "Summation", which has been discontinued.
3856 * theory Finite_Set: in structured induction proofs, the insert case
3857 is now 'case (insert x F)' instead of the old counterintuitive 'case
3860 * The 'refute' command has been extended to support a much larger
3861 fragment of HOL, including axiomatic type classes, constdefs and
3862 typedefs, inductive datatypes and recursion.
3864 * New tactics 'sat' and 'satx' to prove propositional tautologies.
3865 Requires zChaff with proof generation to be installed. See
3866 HOL/ex/SAT_Examples.thy for examples.
3868 * Datatype induction via method 'induct' now preserves the name of the
3869 induction variable. For example, when proving P(xs::'a list) by
3870 induction on xs, the induction step is now P(xs) ==> P(a#xs) rather
3871 than P(list) ==> P(a#list) as previously. Potential INCOMPATIBILITY
3872 in unstructured proof scripts.
3874 * Reworked implementation of records. Improved scalability for
3875 records with many fields, avoiding performance problems for type
3876 inference. Records are no longer composed of nested field types, but
3877 of nested extension types. Therefore the record type only grows linear
3878 in the number of extensions and not in the number of fields. The
3879 top-level (users) view on records is preserved. Potential
3880 INCOMPATIBILITY only in strange cases, where the theory depends on the
3881 old record representation. The type generated for a record is called
3882 <record_name>_ext_type.
3884 Flag record_quick_and_dirty_sensitive can be enabled to skip the
3885 proofs triggered by a record definition or a simproc (if
3886 quick_and_dirty is enabled). Definitions of large records can take
3889 New simproc record_upd_simproc for simplification of multiple record
3890 updates enabled by default. Moreover, trivial updates are also
3891 removed: r(|x := x r|) = r. INCOMPATIBILITY: old proofs break
3892 occasionally, since simplification is more powerful by default.
3894 * typedef: proper support for polymorphic sets, which contain extra
3895 type-variables in the term.
3897 * Simplifier: automatically reasons about transitivity chains
3898 involving "trancl" (r^+) and "rtrancl" (r^*) by setting up tactics
3899 provided by Provers/trancl.ML as additional solvers. INCOMPATIBILITY:
3900 old proofs break occasionally as simplification may now solve more
3901 goals than previously.
3903 * Simplifier: converts x <= y into x = y if assumption y <= x is
3904 present. Works for all partial orders (class "order"), in particular
3905 numbers and sets. For linear orders (e.g. numbers) it treats ~ x < y
3908 * Simplifier: new simproc for "let x = a in f x". If a is a free or
3909 bound variable or a constant then the let is unfolded. Otherwise
3910 first a is simplified to b, and then f b is simplified to g. If
3911 possible we abstract b from g arriving at "let x = b in h x",
3912 otherwise we unfold the let and arrive at g. The simproc can be
3913 enabled/disabled by the reference use_let_simproc. Potential
3914 INCOMPATIBILITY since simplification is more powerful by default.
3916 * Classical reasoning: the meson method now accepts theorems as arguments.
3918 * Prover support: pre-release of the Isabelle-ATP linkup, which runs background
3919 jobs to provide advice on the provability of subgoals.
3921 * Theory OrderedGroup and Ring_and_Field: various additions and
3922 improvements to faciliate calculations involving equalities and
3925 The following theorems have been eliminated or modified
3928 abs_eq now named abs_of_nonneg
3929 abs_of_ge_0 now named abs_of_nonneg
3930 abs_minus_eq now named abs_of_nonpos
3931 imp_abs_id now named abs_of_nonneg
3932 imp_abs_neg_id now named abs_of_nonpos
3933 mult_pos now named mult_pos_pos
3934 mult_pos_le now named mult_nonneg_nonneg
3935 mult_pos_neg_le now named mult_nonneg_nonpos
3936 mult_pos_neg2_le now named mult_nonneg_nonpos2
3937 mult_neg now named mult_neg_neg
3938 mult_neg_le now named mult_nonpos_nonpos
3940 * The following lemmas in Ring_and_Field have been added to the simplifier:
3943 not_square_less_zero
3945 The following lemmas have been deleted from Real/RealPow:
3955 * Theory Parity: added rules for simplifying exponents.
3959 The following theorems have been eliminated or modified
3962 list_all_Nil now named list_all.simps(1)
3963 list_all_Cons now named list_all.simps(2)
3964 list_all_conv now named list_all_iff
3965 set_mem_eq now named mem_iff
3967 * Theories SetsAndFunctions and BigO (see HOL/Library) support
3968 asymptotic "big O" calculations. See the notes in BigO.thy.
3973 * Theory RealDef: better support for embedding natural numbers and
3974 integers in the reals.
3976 The following theorems have been eliminated or modified
3979 exp_ge_add_one_self now requires no hypotheses
3980 real_of_int_add reversed direction of equality (use [symmetric])
3981 real_of_int_minus reversed direction of equality (use [symmetric])
3982 real_of_int_diff reversed direction of equality (use [symmetric])
3983 real_of_int_mult reversed direction of equality (use [symmetric])
3985 * Theory RComplete: expanded support for floor and ceiling functions.
3987 * Theory Ln is new, with properties of the natural logarithm
3989 * Hyperreal: There is a new type constructor "star" for making
3990 nonstandard types. The old type names are now type synonyms:
3994 hcomplex = complex star
3996 * Hyperreal: Many groups of similarly-defined constants have been
3997 replaced by polymorphic versions (INCOMPATIBILITY):
3999 star_of <-- hypreal_of_real, hypnat_of_nat, hcomplex_of_complex
4001 starset <-- starsetNat, starsetC
4002 *s* <-- *sNat*, *sc*
4003 starset_n <-- starsetNat_n, starsetC_n
4004 *sn* <-- *sNatn*, *scn*
4005 InternalSets <-- InternalNatSets, InternalCSets
4007 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4008 *f* <-- *fNat*, *fNat2*, *fc*, *fRc*, *fcR*
4009 starfun_n <-- starfun{Nat,Nat2,C,RC,CR}_n
4010 *fn* <-- *fNatn*, *fNat2n*, *fcn*, *fRcn*, *fcRn*
4011 InternalFuns <-- InternalNatFuns, InternalNatFuns2, Internal{C,RC,CR}Funs
4013 * Hyperreal: Many type-specific theorems have been removed in favor of
4014 theorems specific to various axiomatic type classes (INCOMPATIBILITY):
4016 add_commute <-- {hypreal,hypnat,hcomplex}_add_commute
4017 add_assoc <-- {hypreal,hypnat,hcomplex}_add_assocs
4018 OrderedGroup.add_0 <-- {hypreal,hypnat,hcomplex}_add_zero_left
4019 OrderedGroup.add_0_right <-- {hypreal,hcomplex}_add_zero_right
4020 right_minus <-- hypreal_add_minus
4021 left_minus <-- {hypreal,hcomplex}_add_minus_left
4022 mult_commute <-- {hypreal,hypnat,hcomplex}_mult_commute
4023 mult_assoc <-- {hypreal,hypnat,hcomplex}_mult_assoc
4024 mult_1_left <-- {hypreal,hypnat}_mult_1, hcomplex_mult_one_left
4025 mult_1_right <-- hcomplex_mult_one_right
4026 mult_zero_left <-- hcomplex_mult_zero_left
4027 left_distrib <-- {hypreal,hypnat,hcomplex}_add_mult_distrib
4028 right_distrib <-- hypnat_add_mult_distrib2
4029 zero_neq_one <-- {hypreal,hypnat,hcomplex}_zero_not_eq_one
4030 right_inverse <-- hypreal_mult_inverse
4031 left_inverse <-- hypreal_mult_inverse_left, hcomplex_mult_inv_left
4032 order_refl <-- {hypreal,hypnat}_le_refl
4033 order_trans <-- {hypreal,hypnat}_le_trans
4034 order_antisym <-- {hypreal,hypnat}_le_anti_sym
4035 order_less_le <-- {hypreal,hypnat}_less_le
4036 linorder_linear <-- {hypreal,hypnat}_le_linear
4037 add_left_mono <-- {hypreal,hypnat}_add_left_mono
4038 mult_strict_left_mono <-- {hypreal,hypnat}_mult_less_mono2
4039 add_nonneg_nonneg <-- hypreal_le_add_order
4041 * Hyperreal: Separate theorems having to do with type-specific
4042 versions of constants have been merged into theorems that apply to the
4043 new polymorphic constants (INCOMPATIBILITY):
4045 STAR_UNIV_set <-- {STAR_real,NatStar_real,STARC_complex}_set
4046 STAR_empty_set <-- {STAR,NatStar,STARC}_empty_set
4047 STAR_Un <-- {STAR,NatStar,STARC}_Un
4048 STAR_Int <-- {STAR,NatStar,STARC}_Int
4049 STAR_Compl <-- {STAR,NatStar,STARC}_Compl
4050 STAR_subset <-- {STAR,NatStar,STARC}_subset
4051 STAR_mem <-- {STAR,NatStar,STARC}_mem
4052 STAR_mem_Compl <-- {STAR,STARC}_mem_Compl
4053 STAR_diff <-- {STAR,STARC}_diff
4054 STAR_star_of_image_subset <-- {STAR_hypreal_of_real, NatStar_hypreal_of_real,
4055 STARC_hcomplex_of_complex}_image_subset
4056 starset_n_Un <-- starset{Nat,C}_n_Un
4057 starset_n_Int <-- starset{Nat,C}_n_Int
4058 starset_n_Compl <-- starset{Nat,C}_n_Compl
4059 starset_n_diff <-- starset{Nat,C}_n_diff
4060 InternalSets_Un <-- Internal{Nat,C}Sets_Un
4061 InternalSets_Int <-- Internal{Nat,C}Sets_Int
4062 InternalSets_Compl <-- Internal{Nat,C}Sets_Compl
4063 InternalSets_diff <-- Internal{Nat,C}Sets_diff
4064 InternalSets_UNIV_diff <-- Internal{Nat,C}Sets_UNIV_diff
4065 InternalSets_starset_n <-- Internal{Nat,C}Sets_starset{Nat,C}_n
4066 starset_starset_n_eq <-- starset{Nat,C}_starset{Nat,C}_n_eq
4067 starset_n_starset <-- starset{Nat,C}_n_starset{Nat,C}
4068 starfun_n_starfun <-- starfun{Nat,Nat2,C,RC,CR}_n_starfun{Nat,Nat2,C,RC,CR}
4069 starfun <-- starfun{Nat,Nat2,C,RC,CR}
4070 starfun_mult <-- starfun{Nat,Nat2,C,RC,CR}_mult
4071 starfun_add <-- starfun{Nat,Nat2,C,RC,CR}_add
4072 starfun_minus <-- starfun{Nat,Nat2,C,RC,CR}_minus
4073 starfun_diff <-- starfun{C,RC,CR}_diff
4074 starfun_o <-- starfun{NatNat2,Nat2,_stafunNat,C,C_starfunRC,_starfunCR}_o
4075 starfun_o2 <-- starfun{NatNat2,_stafunNat,C,C_starfunRC,_starfunCR}_o2
4076 starfun_const_fun <-- starfun{Nat,Nat2,C,RC,CR}_const_fun
4077 starfun_inverse <-- starfun{Nat,C,RC,CR}_inverse
4078 starfun_eq <-- starfun{Nat,Nat2,C,RC,CR}_eq
4079 starfun_eq_iff <-- starfun{C,RC,CR}_eq_iff
4080 starfun_Id <-- starfunC_Id
4081 starfun_approx <-- starfun{Nat,CR}_approx
4082 starfun_capprox <-- starfun{C,RC}_capprox
4083 starfun_abs <-- starfunNat_rabs
4084 starfun_lambda_cancel <-- starfun{C,CR,RC}_lambda_cancel
4085 starfun_lambda_cancel2 <-- starfun{C,CR,RC}_lambda_cancel2
4086 starfun_mult_HFinite_approx <-- starfunCR_mult_HFinite_capprox
4087 starfun_mult_CFinite_capprox <-- starfun{C,RC}_mult_CFinite_capprox
4088 starfun_add_capprox <-- starfun{C,RC}_add_capprox
4089 starfun_add_approx <-- starfunCR_add_approx
4090 starfun_inverse_inverse <-- starfunC_inverse_inverse
4091 starfun_divide <-- starfun{C,CR,RC}_divide
4092 starfun_n <-- starfun{Nat,C}_n
4093 starfun_n_mult <-- starfun{Nat,C}_n_mult
4094 starfun_n_add <-- starfun{Nat,C}_n_add
4095 starfun_n_add_minus <-- starfunNat_n_add_minus
4096 starfun_n_const_fun <-- starfun{Nat,C}_n_const_fun
4097 starfun_n_minus <-- starfun{Nat,C}_n_minus
4098 starfun_n_eq <-- starfun{Nat,C}_n_eq
4100 star_n_add <-- {hypreal,hypnat,hcomplex}_add
4101 star_n_minus <-- {hypreal,hcomplex}_minus
4102 star_n_diff <-- {hypreal,hcomplex}_diff
4103 star_n_mult <-- {hypreal,hcomplex}_mult
4104 star_n_inverse <-- {hypreal,hcomplex}_inverse
4105 star_n_le <-- {hypreal,hypnat}_le
4106 star_n_less <-- {hypreal,hypnat}_less
4107 star_n_zero_num <-- {hypreal,hypnat,hcomplex}_zero_num
4108 star_n_one_num <-- {hypreal,hypnat,hcomplex}_one_num
4109 star_n_abs <-- hypreal_hrabs
4110 star_n_divide <-- hcomplex_divide
4112 star_of_add <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_add
4113 star_of_minus <-- {hypreal_of_real,hcomplex_of_complex}_minus
4114 star_of_diff <-- hypreal_of_real_diff
4115 star_of_mult <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_mult
4116 star_of_one <-- {hypreal_of_real,hcomplex_of_complex}_one
4117 star_of_zero <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_zero
4118 star_of_le <-- {hypreal_of_real,hypnat_of_nat}_le_iff
4119 star_of_less <-- {hypreal_of_real,hypnat_of_nat}_less_iff
4120 star_of_eq <-- {hypreal_of_real,hypnat_of_nat,hcomplex_of_complex}_eq_iff
4121 star_of_inverse <-- {hypreal_of_real,hcomplex_of_complex}_inverse
4122 star_of_divide <-- {hypreal_of_real,hcomplex_of_complex}_divide
4123 star_of_of_nat <-- {hypreal_of_real,hcomplex_of_complex}_of_nat
4124 star_of_of_int <-- {hypreal_of_real,hcomplex_of_complex}_of_int
4125 star_of_number_of <-- {hypreal,hcomplex}_number_of
4126 star_of_number_less <-- number_of_less_hypreal_of_real_iff
4127 star_of_number_le <-- number_of_le_hypreal_of_real_iff
4128 star_of_eq_number <-- hypreal_of_real_eq_number_of_iff
4129 star_of_less_number <-- hypreal_of_real_less_number_of_iff
4130 star_of_le_number <-- hypreal_of_real_le_number_of_iff
4131 star_of_power <-- hypreal_of_real_power
4132 star_of_eq_0 <-- hcomplex_of_complex_zero_iff
4134 * Hyperreal: new method "transfer" that implements the transfer
4135 principle of nonstandard analysis. With a subgoal that mentions
4136 nonstandard types like "'a star", the command "apply transfer"
4137 replaces it with an equivalent one that mentions only standard types.
4138 To be successful, all free variables must have standard types; non-
4139 standard variables must have explicit universal quantifiers.
4141 * Hyperreal: A theory of Taylor series.
4146 * Discontinued special version of 'constdefs' (which used to support
4147 continuous functions) in favor of the general Pure one with full
4150 * New simplification procedure for solving continuity conditions; it
4151 is much faster on terms with many nested lambda abstractions (cubic
4152 instead of exponential time).
4154 * New syntax for domain package: selector names are now optional.
4155 Parentheses should be omitted unless argument is lazy, for example:
4157 domain 'a stream = cons "'a" (lazy "'a stream")
4159 * New command 'fixrec' for defining recursive functions with pattern
4160 matching; defining multiple functions with mutual recursion is also
4161 supported. Patterns may include the constants cpair, spair, up, sinl,
4162 sinr, or any data constructor defined by the domain package. The given
4163 equations are proven as rewrite rules. See HOLCF/ex/Fixrec_ex.thy for
4164 syntax and examples.
4166 * New commands 'cpodef' and 'pcpodef' for defining predicate subtypes
4167 of cpo and pcpo types. Syntax is exactly like the 'typedef' command,
4168 but the proof obligation additionally includes an admissibility
4169 requirement. The packages generate instances of class cpo or pcpo,
4170 with continuity and strictness theorems for Rep and Abs.
4172 * HOLCF: Many theorems have been renamed according to a more standard naming
4173 scheme (INCOMPATIBILITY):
4175 foo_inject: "foo$x = foo$y ==> x = y"
4176 foo_eq: "(foo$x = foo$y) = (x = y)"
4177 foo_less: "(foo$x << foo$y) = (x << y)"
4178 foo_strict: "foo$UU = UU"
4179 foo_defined: "... ==> foo$x ~= UU"
4180 foo_defined_iff: "(foo$x = UU) = (x = UU)"
4185 * ZF/ex: theories Group and Ring provide examples in abstract algebra,
4186 including the First Isomorphism Theorem (on quotienting by the kernel
4189 * ZF/Simplifier: install second copy of type solver that actually
4190 makes use of TC rules declared to Isar proof contexts (or locales);
4191 the old version is still required for ML proof scripts.
4196 * Converted to Isar theory format; use locales instead of axiomatic
4202 * Pure/library.ML: added ##>, ##>>, #>> -- higher-order counterparts
4205 * Pure/library.ML no longer defines its own option datatype, but uses
4206 that of the SML basis, which has constructors NONE and SOME instead of
4207 None and Some, as well as exception Option.Option instead of OPTION.
4208 The functions the, if_none, is_some, is_none have been adapted
4209 accordingly, while Option.map replaces apsome.
4211 * Pure/library.ML: the exception LIST has been given up in favour of
4212 the standard exceptions Empty and Subscript, as well as
4213 Library.UnequalLengths. Function like Library.hd and Library.tl are
4214 superseded by the standard hd and tl functions etc.
4216 A number of basic list functions are no longer exported to the ML
4217 toplevel, as they are variants of predefined functions. The following
4218 suggests how one can translate existing code:
4220 rev_append xs ys = List.revAppend (xs, ys)
4221 nth_elem (i, xs) = List.nth (xs, i)
4222 last_elem xs = List.last xs
4223 flat xss = List.concat xss
4224 seq fs = List.app fs
4225 partition P xs = List.partition P xs
4226 mapfilter f xs = List.mapPartial f xs
4228 * Pure/library.ML: several combinators for linear functional
4229 transformations, notably reverse application and composition:
4232 (x, y) |-> f f #-> g
4234 * Pure/library.ML: introduced/changed precedence of infix operators:
4236 infix 1 |> |-> ||> ||>> |>> |>>> #> #->;
4238 infix 3 o oo ooo oooo;
4239 infix 4 ~~ upto downto;
4241 Maybe INCOMPATIBILITY when any of those is used in conjunction with other
4244 * Pure/library.ML: natural list combinators fold, fold_rev, and
4245 fold_map support linear functional transformations and nesting. For
4248 fold f [x1, ..., xN] y =
4249 y |> f x1 |> ... |> f xN
4251 (fold o fold) f [xs1, ..., xsN] y =
4252 y |> fold f xs1 |> ... |> fold f xsN
4254 fold f [x1, ..., xN] =
4257 (fold o fold) f [xs1, ..., xsN] =
4258 fold f xs1 #> ... #> fold f xsN
4260 * Pure/library.ML: the following selectors on type 'a option are
4263 the: 'a option -> 'a (*partial*)
4264 these: 'a option -> 'a where 'a = 'b list
4265 the_default: 'a -> 'a option -> 'a
4266 the_list: 'a option -> 'a list
4268 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4269 basic operations for association lists, following natural argument
4270 order; moreover the explicit equality predicate passed here avoids
4271 potentially expensive polymorphic runtime equality checks.
4272 The old functions may be expressed as follows:
4274 assoc = uncurry (AList.lookup (op =))
4275 assocs = these oo AList.lookup (op =)
4276 overwrite = uncurry (AList.update (op =)) o swap
4278 * Pure/General: structure AList (cf. Pure/General/alist.ML) provides
4280 val make: ('a -> 'b) -> 'a list -> ('a * 'b) list
4281 val find: ('a * 'b -> bool) -> ('c * 'b) list -> 'a -> 'c list
4283 replacing make_keylist and keyfilter (occassionally used)
4286 make_keylist = AList.make
4287 keyfilter = AList.find (op =)
4289 * eq_fst and eq_snd now take explicit equality parameter, thus
4290 avoiding eqtypes. Naive rewrites:
4292 eq_fst = eq_fst (op =)
4293 eq_snd = eq_snd (op =)
4295 * Removed deprecated apl and apr (rarely used).
4298 apl (n, op) =>>= curry op n
4299 apr (op, m) =>>= fn n => op (n, m)
4301 * Pure/General: structure OrdList (cf. Pure/General/ord_list.ML)
4302 provides a reasonably efficient light-weight implementation of sets as
4305 * Pure/General: generic tables (cf. Pure/General/table.ML) provide a
4306 few new operations; existing lookup and update are now curried to
4307 follow natural argument order (for use with fold etc.);
4308 INCOMPATIBILITY, use (uncurry Symtab.lookup) etc. as last resort.
4310 * Pure/General: output via the Isabelle channels of
4311 writeln/warning/error etc. is now passed through Output.output, with a
4312 hook for arbitrary transformations depending on the print_mode
4313 (cf. Output.add_mode -- the first active mode that provides a output
4314 function wins). Already formatted output may be embedded into further
4315 text via Output.raw; the result of Pretty.string_of/str_of and derived
4316 functions (string_of_term/cterm/thm etc.) is already marked raw to
4317 accommodate easy composition of diagnostic messages etc. Programmers
4318 rarely need to care about Output.output or Output.raw at all, with
4319 some notable exceptions: Output.output is required when bypassing the
4320 standard channels (writeln etc.), or in token translations to produce
4321 properly formatted results; Output.raw is required when capturing
4322 already output material that will eventually be presented to the user
4323 a second time. For the default print mode, both Output.output and
4324 Output.raw have no effect.
4326 * Pure/General: Output.time_accumulator NAME creates an operator ('a
4327 -> 'b) -> 'a -> 'b to measure runtime and count invocations; the
4328 cumulative results are displayed at the end of a batch session.
4330 * Pure/General: File.sysify_path and File.quote_sysify path have been
4331 replaced by File.platform_path and File.shell_path (with appropriate
4332 hooks). This provides a clean interface for unusual systems where the
4333 internal and external process view of file names are different.
4335 * Pure: more efficient orders for basic syntactic entities: added
4336 fast_string_ord, fast_indexname_ord, fast_term_ord; changed sort_ord
4337 and typ_ord to use fast_string_ord and fast_indexname_ord (term_ord is
4338 NOT affected); structures Symtab, Vartab, Typtab, Termtab use the fast
4339 orders now -- potential INCOMPATIBILITY for code that depends on a
4340 particular order for Symtab.keys, Symtab.dest, etc. (consider using
4341 Library.sort_strings on result).
4343 * Pure/term.ML: combinators fold_atyps, fold_aterms, fold_term_types,
4344 fold_types traverse types/terms from left to right, observing natural
4345 argument order. Supersedes previous foldl_XXX versions, add_frees,
4346 add_vars etc. have been adapted as well: INCOMPATIBILITY.
4348 * Pure: name spaces have been refined, with significant changes of the
4349 internal interfaces -- INCOMPATIBILITY. Renamed cond_extern(_table)
4350 to extern(_table). The plain name entry path is superseded by a
4351 general 'naming' context, which also includes the 'policy' to produce
4352 a fully qualified name and external accesses of a fully qualified
4353 name; NameSpace.extend is superseded by context dependent
4354 Sign.declare_name. Several theory and proof context operations modify
4355 the naming context. Especially note Theory.restore_naming and
4356 ProofContext.restore_naming to get back to a sane state; note that
4357 Theory.add_path is no longer sufficient to recover from
4358 Theory.absolute_path in particular.
4360 * Pure: new flags short_names (default false) and unique_names
4361 (default true) for controlling output of qualified names. If
4362 short_names is set, names are printed unqualified. If unique_names is
4363 reset, the name prefix is reduced to the minimum required to achieve
4364 the original result when interning again, even if there is an overlap
4365 with earlier declarations.
4367 * Pure/TheoryDataFun: change of the argument structure; 'prep_ext' is
4368 now 'extend', and 'merge' gets an additional Pretty.pp argument
4369 (useful for printing error messages). INCOMPATIBILITY.
4371 * Pure: major reorganization of the theory context. Type Sign.sg and
4372 Theory.theory are now identified, referring to the universal
4373 Context.theory (see Pure/context.ML). Actual signature and theory
4374 content is managed as theory data. The old code and interfaces were
4375 spread over many files and structures; the new arrangement introduces
4376 considerable INCOMPATIBILITY to gain more clarity:
4378 Context -- theory management operations (name, identity, inclusion,
4379 parents, ancestors, merge, etc.), plus generic theory data;
4381 Sign -- logical signature and syntax operations (declaring consts,
4382 types, etc.), plus certify/read for common entities;
4384 Theory -- logical theory operations (stating axioms, definitions,
4385 oracles), plus a copy of logical signature operations (consts,
4386 types, etc.); also a few basic management operations (Theory.copy,
4389 The most basic sign_of operations (Theory.sign_of, Thm.sign_of_thm
4390 etc.) as well as the sign field in Thm.rep_thm etc. have been retained
4391 for convenience -- they merely return the theory.
4393 * Pure: type Type.tsig is superseded by theory in most interfaces.
4395 * Pure: the Isar proof context type is already defined early in Pure
4396 as Context.proof (note that ProofContext.context and Proof.context are
4397 aliases, where the latter is the preferred name). This enables other
4398 Isabelle components to refer to that type even before Isar is present.
4400 * Pure/sign/theory: discontinued named name spaces (i.e. classK,
4401 typeK, constK, axiomK, oracleK), but provide explicit operations for
4402 any of these kinds. For example, Sign.intern typeK is now
4403 Sign.intern_type, Theory.hide_space Sign.typeK is now
4404 Theory.hide_types. Also note that former
4405 Theory.hide_classes/types/consts are now
4406 Theory.hide_classes_i/types_i/consts_i, while the non '_i' versions
4407 internalize their arguments! INCOMPATIBILITY.
4409 * Pure: get_thm interface (of PureThy and ProofContext) expects
4410 datatype thmref (with constructors Name and NameSelection) instead of
4411 plain string -- INCOMPATIBILITY;
4413 * Pure: cases produced by proof methods specify options, where NONE
4414 means to remove case bindings -- INCOMPATIBILITY in
4417 * Pure: the following operations retrieve axioms or theorems from a
4418 theory node or theory hierarchy, respectively:
4420 Theory.axioms_of: theory -> (string * term) list
4421 Theory.all_axioms_of: theory -> (string * term) list
4422 PureThy.thms_of: theory -> (string * thm) list
4423 PureThy.all_thms_of: theory -> (string * thm) list
4425 * Pure: print_tac now outputs the goal through the trace channel.
4427 * Isar toplevel: improved diagnostics, mostly for Poly/ML only.
4428 Reference Toplevel.debug (default false) controls detailed printing
4429 and tracing of low-level exceptions; Toplevel.profiling (default 0)
4430 controls execution profiling -- set to 1 for time and 2 for space
4431 (both increase the runtime).
4433 * Isar session: The initial use of ROOT.ML is now always timed,
4434 i.e. the log will show the actual process times, in contrast to the
4435 elapsed wall-clock time that the outer shell wrapper produces.
4437 * Simplifier: improved handling of bound variables (nameless
4438 representation, avoid allocating new strings). Simprocs that invoke
4439 the Simplifier recursively should use Simplifier.inherit_bounds to
4440 avoid local name clashes. Failure to do so produces warnings
4441 "Simplifier: renamed bound variable ..."; set Simplifier.debug_bounds
4442 for further details.
4444 * ML functions legacy_bindings and use_legacy_bindings produce ML fact
4445 bindings for all theorems stored within a given theory; this may help
4446 in porting non-Isar theories to Isar ones, while keeping ML proof
4447 scripts for the time being.
4449 * ML operator HTML.with_charset specifies the charset begin used for
4450 generated HTML files. For example:
4452 HTML.with_charset "utf-8" use_thy "Hebrew";
4453 HTML.with_charset "utf-8" use_thy "Chinese";
4458 * Allow symlinks to all proper Isabelle executables (Isabelle,
4459 isabelle, isatool etc.).
4461 * ISABELLE_DOC_FORMAT setting specifies preferred document format (for
4462 isatool doc, isatool mkdir, display_drafts etc.).
4464 * isatool usedir: option -f allows specification of the ML file to be
4465 used by Isabelle; default is ROOT.ML.
4467 * New isatool version outputs the version identifier of the Isabelle
4468 distribution being used.
4470 * HOL: new isatool dimacs2hol converts files in DIMACS CNF format
4471 (containing Boolean satisfiability problems) into Isabelle/HOL
4476 New in Isabelle2004 (April 2004)
4477 --------------------------------
4481 * Provers/order.ML: new efficient reasoner for partial and linear orders.
4482 Replaces linorder.ML.
4484 * Pure: Greek letters (except small lambda, \<lambda>), as well as Gothic
4485 (\<aa>...\<zz>\<AA>...\<ZZ>), calligraphic (\<A>...\<Z>), and Euler
4486 (\<a>...\<z>), are now considered normal letters, and can therefore
4487 be used anywhere where an ASCII letter (a...zA...Z) has until
4488 now. COMPATIBILITY: This obviously changes the parsing of some
4489 terms, especially where a symbol has been used as a binder, say
4490 '\<Pi>x. ...', which is now a type error since \<Pi>x will be parsed
4491 as an identifier. Fix it by inserting a space around former
4492 symbols. Call 'isatool fixgreek' to try to fix parsing errors in
4493 existing theory and ML files.
4495 * Pure: Macintosh and Windows line-breaks are now allowed in theory files.
4497 * Pure: single letter sub/superscripts (\<^isub> and \<^isup>) are now
4498 allowed in identifiers. Similar to Greek letters \<^isub> is now considered
4499 a normal (but invisible) letter. For multiple letter subscripts repeat
4500 \<^isub> like this: x\<^isub>1\<^isub>2.
4502 * Pure: There are now sub-/superscripts that can span more than one
4503 character. Text between \<^bsub> and \<^esub> is set in subscript in
4504 ProofGeneral and LaTeX, text between \<^bsup> and \<^esup> in
4505 superscript. The new control characters are not identifier parts.
4507 * Pure: Control-symbols of the form \<^raw:...> will literally print the
4508 content of "..." to the latex file instead of \isacntrl... . The "..."
4509 may consist of any printable characters excluding the end bracket >.
4511 * Pure: Using new Isar command "finalconsts" (or the ML functions
4512 Theory.add_finals or Theory.add_finals_i) it is now possible to
4513 declare constants "final", which prevents their being given a definition
4514 later. It is useful for constants whose behaviour is fixed axiomatically
4515 rather than definitionally, such as the meta-logic connectives.
4517 * Pure: 'instance' now handles general arities with general sorts
4518 (i.e. intersections of classes),
4520 * Presentation: generated HTML now uses a CSS style sheet to make layout
4521 (somewhat) independent of content. It is copied from lib/html/isabelle.css.
4522 It can be changed to alter the colors/layout of generated pages.
4527 * Tactic emulation methods rule_tac, erule_tac, drule_tac, frule_tac,
4528 cut_tac, subgoal_tac and thin_tac:
4529 - Now understand static (Isar) contexts. As a consequence, users of Isar
4530 locales are no longer forced to write Isar proof scripts.
4531 For details see Isar Reference Manual, paragraph 4.3.2: Further tactic
4533 - INCOMPATIBILITY: names of variables to be instantiated may no
4534 longer be enclosed in quotes. Instead, precede variable name with `?'.
4535 This is consistent with the instantiation attribute "where".
4537 * Attributes "where" and "of":
4538 - Now take type variables of instantiated theorem into account when reading
4539 the instantiation string. This fixes a bug that caused instantiated
4540 theorems to have too special types in some circumstances.
4541 - "where" permits explicit instantiations of type variables.
4543 * Calculation commands "moreover" and "also" no longer interfere with
4544 current facts ("this"), admitting arbitrary combinations with "then"
4548 - Goal statements involving the context element "includes" no longer
4549 generate theorems with internal delta predicates (those ending on
4550 "_axioms") in the premise.
4551 Resolve particular premise with <locale>.intro to obtain old form.
4552 - Fixed bug in type inference ("unify_frozen") that prevented mix of target
4553 specification and "includes" elements in goal statement.
4554 - Rule sets <locale>.intro and <locale>.axioms no longer declared as
4555 [intro?] and [elim?] (respectively) by default.
4556 - Experimental command for instantiation of locales in proof contexts:
4557 instantiate <label>[<attrs>]: <loc>
4558 Instantiates locale <loc> and adds all its theorems to the current context
4559 taking into account their attributes. Label and attrs are optional
4560 modifiers, like in theorem declarations. If present, names of
4561 instantiated theorems are qualified with <label>, and the attributes
4562 <attrs> are applied after any attributes these theorems might have already.
4563 If the locale has assumptions, a chained fact of the form
4564 "<loc> t1 ... tn" is expected from which instantiations of the parameters
4565 are derived. The command does not support old-style locales declared
4566 with "locale (open)".
4567 A few (very simple) examples can be found in FOL/ex/LocaleInst.thy.
4569 * HOL: Tactic emulation methods induct_tac and case_tac understand static
4575 * Proof import: new image HOL4 contains the imported library from
4576 the HOL4 system with about 2500 theorems. It is imported by
4577 replaying proof terms produced by HOL4 in Isabelle. The HOL4 image
4578 can be used like any other Isabelle image. See
4579 HOL/Import/HOL/README for more information.
4582 - Much improved handling of linear and partial orders.
4583 Reasoners for linear and partial orders are set up for type classes
4584 "linorder" and "order" respectively, and are added to the default simpset
4585 as solvers. This means that the simplifier can build transitivity chains
4586 to solve goals from the assumptions.
4587 - INCOMPATIBILITY: old proofs break occasionally. Typically, applications
4588 of blast or auto after simplification become unnecessary because the goal
4589 is solved by simplification already.
4591 * Numerics: new theory Ring_and_Field contains over 250 basic numerical laws,
4592 all proved in axiomatic type classes for semirings, rings and fields.
4595 - Numeric types (nat, int, and in HOL-Complex rat, real, complex, etc.) are
4596 now formalized using the Ring_and_Field theory mentioned above.
4597 - INCOMPATIBILITY: simplification and arithmetic behaves somewhat differently
4598 than before, because now they are set up once in a generic manner.
4599 - INCOMPATIBILITY: many type-specific arithmetic laws have gone.
4600 Look for the general versions in Ring_and_Field (and Power if they concern
4603 * Type "rat" of the rational numbers is now available in HOL-Complex.
4606 - Record types are now by default printed with their type abbreviation
4607 instead of the list of all field types. This can be configured via
4608 the reference "print_record_type_abbr".
4609 - Simproc "record_upd_simproc" for simplification of multiple updates added
4610 (not enabled by default).
4611 - Simproc "record_ex_sel_eq_simproc" to simplify EX x. sel r = x resp.
4612 EX x. x = sel r to True (not enabled by default).
4613 - Tactic "record_split_simp_tac" to split and simplify records added.
4615 * 'specification' command added, allowing for definition by
4616 specification. There is also an 'ax_specification' command that
4617 introduces the new constants axiomatically.
4619 * arith(_tac) is now able to generate counterexamples for reals as well.
4621 * HOL-Algebra: new locale "ring" for non-commutative rings.
4623 * HOL-ex: InductiveInvariant_examples illustrates advanced recursive function
4624 definitions, thanks to Sava Krsti\'{c} and John Matthews.
4626 * HOL-Matrix: a first theory for matrices in HOL with an application of
4627 matrix theory to linear programming.
4629 * Unions and Intersections:
4630 The latex output syntax of UN and INT has been changed
4631 from "\Union x \in A. B" to "\Union_{x \in A} B"
4632 i.e. the index formulae has become a subscript.
4633 Similarly for "\Union x. B", and for \Inter instead of \Union.
4635 * Unions and Intersections over Intervals:
4636 There is new short syntax "UN i<=n. A" for "UN i:{0..n}. A". There is
4637 also an x-symbol version with subscripts "\<Union>\<^bsub>i <= n\<^esub>. A"
4638 like in normal math, and corresponding versions for < and for intersection.
4640 * HOL/List: Ordering "lexico" is renamed "lenlex" and the standard
4641 lexicographic dictonary ordering has been added as "lexord".
4643 * ML: the legacy theory structures Int and List have been removed. They had
4644 conflicted with ML Basis Library structures having the same names.
4646 * 'refute' command added to search for (finite) countermodels. Only works
4647 for a fragment of HOL. The installation of an external SAT solver is
4648 highly recommended. See "HOL/Refute.thy" for details.
4650 * 'quickcheck' command: Allows to find counterexamples by evaluating
4651 formulae under an assignment of free variables to random values.
4652 In contrast to 'refute', it can deal with inductive datatypes,
4653 but cannot handle quantifiers. See "HOL/ex/Quickcheck_Examples.thy"
4659 * Streams now come with concatenation and are part of the HOLCF image
4663 New in Isabelle2003 (May 2003)
4664 ------------------------------
4668 * Provers/simplifier:
4670 - Completely reimplemented method simp (ML: Asm_full_simp_tac):
4671 Assumptions are now subject to complete mutual simplification,
4672 not just from left to right. The simplifier now preserves
4673 the order of assumptions.
4675 Potential INCOMPATIBILITY:
4677 -- simp sometimes diverges where the old version did
4678 not, e.g. invoking simp on the goal
4680 [| P (f x); y = x; f x = f y |] ==> Q
4682 now gives rise to the infinite reduction sequence
4684 P(f x) --(f x = f y)--> P(f y) --(y = x)--> P(f x) --(f x = f y)--> ...
4686 Using "simp (asm_lr)" (ML: Asm_lr_simp_tac) instead often solves this
4689 -- Tactics combining classical reasoner and simplification (such as auto)
4690 are also affected by this change, because many of them rely on
4691 simp. They may sometimes diverge as well or yield a different numbers
4692 of subgoals. Try to use e.g. force, fastsimp, or safe instead of auto
4693 in case of problems. Sometimes subsequent calls to the classical
4694 reasoner will fail because a preceeding call to the simplifier too
4695 eagerly simplified the goal, e.g. deleted redundant premises.
4697 - The simplifier trace now shows the names of the applied rewrite rules
4699 - You can limit the number of recursive invocations of the simplifier
4700 during conditional rewriting (where the simplifie tries to solve the
4701 conditions before applying the rewrite rule):
4702 ML "simp_depth_limit := n"
4703 where n is an integer. Thus you can force termination where previously
4704 the simplifier would diverge.
4706 - Accepts free variables as head terms in congruence rules. Useful in Isar.
4708 - No longer aborts on failed congruence proof. Instead, the
4709 congruence is ignored.
4711 * Pure: New generic framework for extracting programs from constructive
4712 proofs. See HOL/Extraction.thy for an example instantiation, as well
4713 as HOL/Extraction for some case studies.
4715 * Pure: The main goal of the proof state is no longer shown by default, only
4716 the subgoals. This behaviour is controlled by a new flag.
4717 PG menu: Isabelle/Isar -> Settings -> Show Main Goal
4718 (ML: Proof.show_main_goal).
4720 * Pure: You can find all matching introduction rules for subgoal 1, i.e. all
4721 rules whose conclusion matches subgoal 1:
4722 PG menu: Isabelle/Isar -> Show me -> matching rules
4723 The rules are ordered by how closely they match the subgoal.
4724 In particular, rules that solve a subgoal outright are displayed first
4725 (or rather last, the way they are printed).
4726 (ML: ProofGeneral.print_intros())
4728 * Pure: New flag trace_unify_fail causes unification to print
4729 diagnostic information (PG: in trace buffer) when it fails. This is
4730 useful for figuring out why single step proofs like rule, erule or
4733 * Pure: Locale specifications now produce predicate definitions
4734 according to the body of text (covering assumptions modulo local
4735 definitions); predicate "loc_axioms" covers newly introduced text,
4736 while "loc" is cumulative wrt. all included locale expressions; the
4737 latter view is presented only on export into the global theory
4738 context; potential INCOMPATIBILITY, use "(open)" option to fall back
4739 on the old view without predicates;
4741 * Pure: predefined locales "var" and "struct" are useful for sharing
4742 parameters (as in CASL, for example); just specify something like
4743 ``var x + var y + struct M'' as import;
4745 * Pure: improved thms_containing: proper indexing of facts instead of
4746 raw theorems; check validity of results wrt. current name space;
4747 include local facts of proof configuration (also covers active
4748 locales), cover fixed variables in index; may use "_" in term
4749 specification; an optional limit for the number of printed facts may
4750 be given (the default is 40);
4752 * Pure: disallow duplicate fact bindings within new-style theory files
4755 * Provers: improved induct method: assumptions introduced by case
4756 "foo" are split into "foo.hyps" (from the rule) and "foo.prems" (from
4757 the goal statement); "foo" still refers to all facts collectively;
4759 * Provers: the function blast.overloaded has been removed: all constants
4760 are regarded as potentially overloaded, which improves robustness in exchange
4761 for slight decrease in efficiency;
4763 * Provers/linorder: New generic prover for transitivity reasoning over
4764 linear orders. Note: this prover is not efficient!
4766 * Isar: preview of problems to finish 'show' now produce an error
4767 rather than just a warning (in interactive mode);
4774 - Produces a counter example if it cannot prove a goal.
4775 Note that the counter example may be spurious if the goal is not a formula
4776 of quantifier-free linear arithmetic.
4777 In ProofGeneral the counter example appears in the trace buffer.
4779 - Knows about div k and mod k where k is a numeral of type nat or int.
4781 - Calls full Presburger arithmetic (by Amine Chaieb) if quantifier-free
4782 linear arithmetic fails. This takes account of quantifiers and divisibility.
4783 Presburger arithmetic can also be called explicitly via presburger(_tac).
4785 * simp's arithmetic capabilities have been enhanced a bit: it now
4786 takes ~= in premises into account (by performing a case split);
4788 * simp reduces "m*(n div m) + n mod m" to n, even if the two summands
4789 are distributed over a sum of terms;
4791 * New tactic "trans_tac" and method "trans" instantiate
4792 Provers/linorder.ML for axclasses "order" and "linorder" (predicates
4795 * function INCOMPATIBILITIES: Pi-sets have been redefined and moved from main
4796 HOL to Library/FuncSet; constant "Fun.op o" is now called "Fun.comp";
4798 * 'typedef' command has new option "open" to suppress the set
4801 * functions Min and Max on finite sets have been introduced (theory
4804 * attribute [symmetric] now works for relations as well; it turns
4805 (x,y) : R^-1 into (y,x) : R, and vice versa;
4807 * induct over a !!-quantified statement (say !!x1..xn):
4808 each "case" automatically performs "fix x1 .. xn" with exactly those names.
4810 * Map: `empty' is no longer a constant but a syntactic abbreviation for
4811 %x. None. Warning: empty_def now refers to the previously hidden definition
4814 * Algebra: formalization of classical algebra. Intended as base for
4815 any algebraic development in Isabelle. Currently covers group theory
4816 (up to Sylow's theorem) and ring theory (Universal Property of
4817 Univariate Polynomials). Contributions welcome;
4819 * GroupTheory: deleted, since its material has been moved to Algebra;
4821 * Complex: new directory of the complex numbers with numeric constants,
4822 nonstandard complex numbers, and some complex analysis, standard and
4823 nonstandard (Jacques Fleuriot);
4825 * HOL-Complex: new image for analysis, replacing HOL-Real and HOL-Hyperreal;
4827 * Hyperreal: introduced Gauge integration and hyperreal logarithms (Jacques
4830 * Real/HahnBanach: updated and adapted to locales;
4832 * NumberTheory: added Gauss's law of quadratic reciprocity (by Avigad,
4835 * UNITY: added the Meier-Sanders theory of progress sets;
4837 * MicroJava: bytecode verifier and lightweight bytecode verifier
4838 as abstract algorithms, instantiated to the JVM;
4840 * Bali: Java source language formalization. Type system, operational
4841 semantics, axiomatic semantics. Supported language features:
4842 classes, interfaces, objects,virtual methods, static methods,
4843 static/instance fields, arrays, access modifiers, definite
4844 assignment, exceptions.
4849 * ZF/Constructible: consistency proof for AC (Gdel's constructible
4852 * Main ZF: virtually all theories converted to new-style format;
4857 * Pure: Tactic.prove provides sane interface for internal proofs;
4858 omits the infamous "standard" operation, so this is more appropriate
4859 than prove_goalw_cterm in many situations (e.g. in simprocs);
4861 * Pure: improved error reporting of simprocs;
4863 * Provers: Simplifier.simproc(_i) provides sane interface for setting
4867 *** Document preparation ***
4869 * uses \par instead of \\ for line breaks in theory text. This may
4870 shift some page breaks in large documents. To get the old behaviour
4871 use \renewcommand{\isanewline}{\mbox{}\\\mbox{}} in root.tex.
4873 * minimized dependencies of isabelle.sty and isabellesym.sty on
4876 * \<euro> now needs package babel/greek instead of marvosym (which
4879 * normal size for \<zero>...\<nine> (uses \mathbf instead of
4884 New in Isabelle2002 (March 2002)
4885 --------------------------------
4887 *** Document preparation ***
4889 * greatly simplified document preparation setup, including more
4890 graceful interpretation of isatool usedir -i/-d/-D options, and more
4891 instructive isatool mkdir; users should basically be able to get
4892 started with "isatool mkdir HOL Test && isatool make"; alternatively,
4893 users may run a separate document processing stage manually like this:
4894 "isatool usedir -D output HOL Test && isatool document Test/output";
4896 * theory dependency graph may now be incorporated into documents;
4897 isatool usedir -g true will produce session_graph.eps/.pdf for use
4898 with \includegraphics of LaTeX;
4900 * proper spacing of consecutive markup elements, especially text
4901 blocks after section headings;
4903 * support bold style (for single symbols only), input syntax is like
4904 this: "\<^bold>\<alpha>" or "\<^bold>A";
4906 * \<bullet> is now output as bold \cdot by default, which looks much
4907 better in printed text;
4909 * added default LaTeX bindings for \<tturnstile> and \<TTurnstile>;
4910 note that these symbols are currently unavailable in Proof General /
4911 X-Symbol; new symbols \<zero>, \<one>, ..., \<nine>, and \<euro>;
4913 * isatool latex no longer depends on changed TEXINPUTS, instead
4914 isatool document copies the Isabelle style files to the target
4920 * Pure/Provers: improved proof by cases and induction;
4921 - 'case' command admits impromptu naming of parameters (such as
4923 - 'induct' method divinates rule instantiation from the inductive
4924 claim; no longer requires excessive ?P bindings for proper
4925 instantiation of cases;
4926 - 'induct' method properly enumerates all possibilities of set/type
4927 rules; as a consequence facts may be also passed through *type*
4928 rules without further ado;
4929 - 'induct' method now derives symbolic cases from the *rulified*
4930 rule (before it used to rulify cases stemming from the internal
4931 atomized version); this means that the context of a non-atomic
4932 statement becomes is included in the hypothesis, avoiding the
4933 slightly cumbersome show "PROP ?case" form;
4934 - 'induct' may now use elim-style induction rules without chaining
4935 facts, using ``missing'' premises from the goal state; this allows
4936 rules stemming from inductive sets to be applied in unstructured
4937 scripts, while still benefitting from proper handling of non-atomic
4938 statements; NB: major inductive premises need to be put first, all
4939 the rest of the goal is passed through the induction;
4940 - 'induct' proper support for mutual induction involving non-atomic
4941 rule statements (uses the new concept of simultaneous goals, see
4943 - append all possible rule selections, but only use the first
4944 success (no backtracking);
4945 - removed obsolete "(simplified)" and "(stripped)" options of methods;
4946 - undeclared rule case names default to numbers 1, 2, 3, ...;
4947 - added 'print_induct_rules' (covered by help item in recent Proof
4949 - moved induct/cases attributes to Pure, methods to Provers;
4950 - generic method setup instantiated for FOL and HOL;
4952 * Pure: support multiple simultaneous goal statements, for example
4953 "have a: A and b: B" (same for 'theorem' etc.); being a pure
4954 meta-level mechanism, this acts as if several individual goals had
4955 been stated separately; in particular common proof methods need to be
4956 repeated in order to cover all claims; note that a single elimination
4957 step is *not* sufficient to establish the two conjunctions, so this
4960 assume "A & B" then have A and B .. (*".." fails*)
4962 better use "obtain" in situations as above; alternative refer to
4963 multi-step methods like 'auto', 'simp_all', 'blast+' etc.;
4965 * Pure: proper integration with ``locales''; unlike the original
4966 version by Florian Kammller, Isar locales package high-level proof
4967 contexts rather than raw logical ones (e.g. we admit to include
4968 attributes everywhere); operations on locales include merge and
4969 rename; support for implicit arguments (``structures''); simultaneous
4970 type-inference over imports and text; see also HOL/ex/Locales.thy for
4973 * Pure: the following commands have been ``localized'', supporting a
4974 target locale specification "(in name)": 'lemma', 'theorem',
4975 'corollary', 'lemmas', 'theorems', 'declare'; the results will be
4976 stored both within the locale and at the theory level (exported and
4977 qualified by the locale name);
4979 * Pure: theory goals may now be specified in ``long'' form, with
4980 ad-hoc contexts consisting of arbitrary locale elements. for example
4981 ``lemma foo: fixes x assumes "A x" shows "B x"'' (local syntax and
4982 definitions may be given, too); the result is a meta-level rule with
4983 the context elements being discharged in the obvious way;
4985 * Pure: new proof command 'using' allows to augment currently used
4986 facts after a goal statement ('using' is syntactically analogous to
4987 'apply', but acts on the goal's facts only); this allows chained facts
4988 to be separated into parts given before and after a claim, as in
4989 ``from a and b have C using d and e <proof>'';
4991 * Pure: renamed "antecedent" case to "rule_context";
4993 * Pure: new 'judgment' command records explicit information about the
4994 object-logic embedding (used by several tools internally); no longer
4995 use hard-wired "Trueprop";
4997 * Pure: added 'corollary' command;
4999 * Pure: fixed 'token_translation' command;
5001 * Pure: removed obsolete 'exported' attribute;
5003 * Pure: dummy pattern "_" in is/let is now automatically lifted over
5004 bound variables: "ALL x. P x --> Q x" (is "ALL x. _ --> ?C x")
5005 supersedes more cumbersome ... (is "ALL x. _ x --> ?C x");
5007 * Pure: method 'atomize' presents local goal premises as object-level
5008 statements (atomic meta-level propositions); setup controlled via
5009 rewrite rules declarations of 'atomize' attribute; example
5010 application: 'induct' method with proper rule statements in improper
5013 * Pure: emulation of instantiation tactics (rule_tac, cut_tac, etc.)
5014 now consider the syntactic context of assumptions, giving a better
5015 chance to get type-inference of the arguments right (this is
5016 especially important for locales);
5018 * Pure: "sorry" no longer requires quick_and_dirty in interactive
5021 * Pure/obtain: the formal conclusion "thesis", being marked as
5022 ``internal'', may no longer be reference directly in the text;
5023 potential INCOMPATIBILITY, may need to use "?thesis" in rare
5026 * Pure: generic 'sym' attribute which declares a rule both as pure
5027 'elim?' and for the 'symmetric' operation;
5029 * Pure: marginal comments ``--'' may now occur just anywhere in the
5030 text; the fixed correlation with particular command syntax has been
5033 * Pure: new method 'rules' is particularly well-suited for proof
5034 search in intuitionistic logic; a bit slower than 'blast' or 'fast',
5035 but often produces more compact proof terms with less detours;
5037 * Pure/Provers/classical: simplified integration with pure rule
5038 attributes and methods; the classical "intro?/elim?/dest?"
5039 declarations coincide with the pure ones; the "rule" method no longer
5040 includes classically swapped intros; "intro" and "elim" methods no
5041 longer pick rules from the context; also got rid of ML declarations
5042 AddXIs/AddXEs/AddXDs; all of this has some potential for
5045 * Provers/classical: attribute 'swapped' produces classical inversions
5046 of introduction rules;
5048 * Provers/simplifier: 'simplified' attribute may refer to explicit
5049 rules instead of full simplifier context; 'iff' attribute handles
5052 * HOL: 'typedef' now allows alternative names for Rep/Abs morphisms;
5054 * HOL: 'recdef' now fails on unfinished automated proofs, use
5055 "(permissive)" option to recover old behavior;
5057 * HOL: 'inductive' no longer features separate (collective) attributes
5058 for 'intros' (was found too confusing);
5060 * HOL: properly declared induction rules less_induct and
5066 * HOL: moved over to sane numeral syntax; the new policy is as
5069 - 0 and 1 are polymorphic constants, which are defined on any
5070 numeric type (nat, int, real etc.);
5072 - 2, 3, 4, ... and -1, -2, -3, ... are polymorphic numerals, based
5073 binary representation internally;
5075 - type nat has special constructor Suc, and generally prefers Suc 0
5076 over 1::nat and Suc (Suc 0) over 2::nat;
5078 This change may cause significant problems of INCOMPATIBILITY; here
5079 are some hints on converting existing sources:
5081 - due to the new "num" token, "-0" and "-1" etc. are now atomic
5082 entities, so expressions involving "-" (unary or binary minus) need
5083 to be spaced properly;
5085 - existing occurrences of "1" may need to be constraint "1::nat" or
5086 even replaced by Suc 0; similar for old "2";
5088 - replace "#nnn" by "nnn", and "#-nnn" by "-nnn";
5090 - remove all special provisions on numerals in proofs;
5092 * HOL: simp rules nat_number expand numerals on nat to Suc/0
5093 representation (depends on bin_arith_simps in the default context);
5095 * HOL: symbolic syntax for x^2 (numeral 2);
5097 * HOL: the class of all HOL types is now called "type" rather than
5098 "term"; INCOMPATIBILITY, need to adapt references to this type class
5099 in axclass/classes, instance/arities, and (usually rare) occurrences
5100 in typings (of consts etc.); internally the class is called
5101 "HOL.type", ML programs should refer to HOLogic.typeS;
5103 * HOL/record package improvements:
5104 - new derived operations "fields" to build a partial record section,
5105 "extend" to promote a fixed record to a record scheme, and
5106 "truncate" for the reverse; cf. theorems "xxx.defs", which are *not*
5107 declared as simp by default;
5108 - shared operations ("more", "fields", etc.) now need to be always
5109 qualified) --- potential INCOMPATIBILITY;
5110 - removed "make_scheme" operations (use "make" with "extend") --
5112 - removed "more" class (simply use "term") -- INCOMPATIBILITY;
5113 - provides cases/induct rules for use with corresponding Isar
5114 methods (for concrete records, record schemes, concrete more
5115 parts, and schematic more parts -- in that order);
5116 - internal definitions directly based on a light-weight abstract
5117 theory of product types over typedef rather than datatype;
5119 * HOL: generic code generator for generating executable ML code from
5120 specifications; specific support for HOL constructs such as inductive
5121 datatypes and sets, as well as recursive functions; can be invoked
5122 via 'generate_code' theory section;
5124 * HOL: canonical cases/induct rules for n-tuples (n = 3..7);
5126 * HOL: consolidated and renamed several theories. In particular:
5127 Ord.thy has been absorbed into HOL.thy
5128 String.thy has been absorbed into List.thy
5130 * HOL: concrete setsum syntax "\<Sum>i:A. b" == "setsum (%i. b) A"
5131 (beware of argument permutation!);
5133 * HOL: linorder_less_split superseded by linorder_cases;
5135 * HOL/List: "nodups" renamed to "distinct";
5137 * HOL: added "The" definite description operator; move Hilbert's "Eps"
5138 to peripheral theory "Hilbert_Choice"; some INCOMPATIBILITIES:
5139 - Ex_def has changed, now need to use some_eq_ex
5141 * HOL: made split_all_tac safe; EXISTING PROOFS MAY FAIL OR LOOP, so
5142 in this (rare) case use:
5144 delSWrapper "split_all_tac"
5145 addSbefore ("unsafe_split_all_tac", unsafe_split_all_tac)
5147 * HOL: added safe wrapper "split_conv_tac" to claset; EXISTING PROOFS
5150 * HOL: introduced f^n = f o ... o f; warning: due to the limits of
5151 Isabelle's type classes, ^ on functions and relations has too general
5152 a domain, namely ('a * 'b) set and 'a => 'b; this means that it may be
5153 necessary to attach explicit type constraints;
5155 * HOL/Relation: the prefix name of the infix "O" has been changed from
5156 "comp" to "rel_comp"; INCOMPATIBILITY: a few theorems have been
5157 renamed accordingly (eg "compI" -> "rel_compI").
5159 * HOL: syntax translations now work properly with numerals and records
5162 * HOL: bounded abstraction now uses syntax "%" / "\<lambda>" instead
5163 of "lam" -- INCOMPATIBILITY;
5165 * HOL: got rid of some global declarations (potential INCOMPATIBILITY
5166 for ML tools): const "()" renamed "Product_Type.Unity", type "unit"
5167 renamed "Product_Type.unit";
5169 * HOL: renamed rtrancl_into_rtrancl2 to converse_rtrancl_into_rtrancl
5171 * HOL: removed obsolete theorem "optionE" (use "option.exhaust", or
5172 the "cases" method);
5174 * HOL/GroupTheory: group theory examples including Sylow's theorem (by
5177 * HOL/IMP: updated and converted to new-style theory format; several
5178 parts turned into readable document, with proper Isar proof texts and
5179 some explanations (by Gerwin Klein);
5181 * HOL-Real: added Complex_Numbers (by Gertrud Bauer);
5183 * HOL-Hyperreal is now a logic image;
5188 * Isar: consts/constdefs supports mixfix syntax for continuous
5191 * Isar: domain package adapted to new-style theory format, e.g. see
5194 * theory Lift: proper use of rep_datatype lift instead of ML hacks --
5195 potential INCOMPATIBILITY; now use plain induct_tac instead of former
5196 lift.induct_tac, always use UU instead of Undef;
5198 * HOLCF/IMP: updated and converted to new-style theory;
5203 * Isar: proper integration of logic-specific tools and packages,
5204 including theory commands '(co)inductive', '(co)datatype',
5205 'rep_datatype', 'inductive_cases', as well as methods 'ind_cases',
5206 'induct_tac', 'case_tac', and 'typecheck' (with attribute 'TC');
5208 * theory Main no longer includes AC; for the Axiom of Choice, base
5209 your theory on Main_ZFC;
5211 * the integer library now covers quotients and remainders, with many
5212 laws relating division to addition, multiplication, etc.;
5214 * ZF/UNITY: Chandy and Misra's UNITY is now available in ZF, giving a
5215 typeless version of the formalism;
5217 * ZF/AC, Coind, IMP, Resid: updated and converted to new-style theory
5220 * ZF/Induct: new directory for examples of inductive definitions,
5221 including theory Multiset for multiset orderings; converted to
5222 new-style theory format;
5224 * ZF: many new theorems about lists, ordinals, etc.;
5229 * Pure/kernel: meta-level proof terms (by Stefan Berghofer); reference
5230 variable proof controls level of detail: 0 = no proofs (only oracle
5231 dependencies), 1 = lemma dependencies, 2 = compact proof terms; see
5232 also ref manual for further ML interfaces;
5234 * Pure/axclass: removed obsolete ML interface
5235 goal_subclass/goal_arity;
5237 * Pure/syntax: new token syntax "num" for plain numerals (without "#"
5238 of "xnum"); potential INCOMPATIBILITY, since -0, -1 etc. are now
5239 separate tokens, so expressions involving minus need to be spaced
5242 * Pure/syntax: support non-oriented infixes, using keyword "infix"
5243 rather than "infixl" or "infixr";
5245 * Pure/syntax: concrete syntax for dummy type variables admits genuine
5246 sort constraint specifications in type inference; e.g. "x::_::foo"
5247 ensures that the type of "x" is of sort "foo" (but not necessarily a
5250 * Pure/syntax: print modes "type_brackets" and "no_type_brackets"
5251 control output of nested => (types); the default behavior is
5254 * Pure/syntax: builtin parse translation for "_constify" turns valued
5255 tokens into AST constants;
5257 * Pure/syntax: prefer later declarations of translations and print
5258 translation functions; potential INCOMPATIBILITY: need to reverse
5259 multiple declarations for same syntax element constant;
5261 * Pure/show_hyps reset by default (in accordance to existing Isar
5264 * Provers/classical: renamed addaltern to addafter, addSaltern to
5267 * Provers/clasimp: ``iff'' declarations now handle conditional rules
5270 * system: tested support for MacOS X; should be able to get Isabelle +
5271 Proof General to work in a plain Terminal after installing Poly/ML
5272 (e.g. from the Isabelle distribution area) and GNU bash alone
5273 (e.g. from http://www.apple.com); full X11, XEmacs and X-Symbol
5274 support requires further installations, e.g. from
5275 http://fink.sourceforge.net/);
5277 * system: support Poly/ML 4.1.1 (able to manage larger heaps);
5279 * system: reduced base memory usage by Poly/ML (approx. 20 MB instead
5280 of 40 MB), cf. ML_OPTIONS;
5282 * system: Proof General keywords specification is now part of the
5283 Isabelle distribution (see etc/isar-keywords.el);
5285 * system: support for persistent Proof General sessions (refrain from
5286 outdating all loaded theories on startup); user may create writable
5287 logic images like this: ``isabelle -q HOL Test'';
5289 * system: smart selection of Isabelle process versus Isabelle
5290 interface, accommodates case-insensitive file systems (e.g. HFS+); may
5291 run both "isabelle" and "Isabelle" even if file names are badly
5292 damaged (executable inspects the case of the first letter of its own
5293 name); added separate "isabelle-process" and "isabelle-interface";
5295 * system: refrain from any attempt at filtering input streams; no
5296 longer support ``8bit'' encoding of old isabelle font, instead proper
5297 iso-latin characters may now be used; the related isatools
5298 "symbolinput" and "nonascii" have disappeared as well;
5300 * system: removed old "xterm" interface (the print modes "xterm" and
5301 "xterm_color" are still available for direct use in a suitable
5306 New in Isabelle99-2 (February 2001)
5307 -----------------------------------
5309 *** Overview of INCOMPATIBILITIES ***
5311 * HOL: please note that theories in the Library and elsewhere often use the
5312 new-style (Isar) format; to refer to their theorems in an ML script you must
5313 bind them to ML identifers by e.g. val thm_name = thm "thm_name";
5315 * HOL: inductive package no longer splits induction rule aggressively,
5316 but only as far as specified by the introductions given; the old
5317 format may be recovered via ML function complete_split_rule or attribute
5318 'split_rule (complete)';
5320 * HOL: induct renamed to lfp_induct, lfp_Tarski to lfp_unfold,
5321 gfp_Tarski to gfp_unfold;
5323 * HOL: contrapos, contrapos2 renamed to contrapos_nn, contrapos_pp;
5325 * HOL: infix "dvd" now has priority 50 rather than 70 (because it is a
5326 relation); infix "^^" has been renamed "``"; infix "``" has been
5327 renamed "`"; "univalent" has been renamed "single_valued";
5329 * HOL/Real: "rinv" and "hrinv" replaced by overloaded "inverse"
5332 * HOLCF: infix "`" has been renamed "$"; the symbol syntax is \<cdot>;
5334 * Isar: 'obtain' no longer declares "that" fact as simp/intro;
5336 * Isar/HOL: method 'induct' now handles non-atomic goals; as a
5337 consequence, it is no longer monotonic wrt. the local goal context
5338 (which is now passed through the inductive cases);
5340 * Document preparation: renamed standard symbols \<ll> to \<lless> and
5341 \<gg> to \<ggreater>;
5344 *** Document preparation ***
5346 * \isabellestyle{NAME} selects version of Isabelle output (currently
5347 available: are "it" for near math-mode best-style output, "sl" for
5348 slanted text style, and "tt" for plain type-writer; if no
5349 \isabellestyle command is given, output is according to slanted
5352 * support sub/super scripts (for single symbols only), input syntax is
5353 like this: "A\<^sup>*" or "A\<^sup>\<star>";
5355 * some more standard symbols; see Appendix A of the system manual for
5356 the complete list of symbols defined in isabellesym.sty;
5358 * improved isabelle style files; more abstract symbol implementation
5359 (should now use \isamath{...} and \isatext{...} in custom symbol
5362 * antiquotation @{goals} and @{subgoals} for output of *dynamic* goals
5363 state; Note that presentation of goal states does not conform to
5364 actual human-readable proof documents. Please do not include goal
5365 states into document output unless you really know what you are doing!
5367 * proper indentation of antiquoted output with proportional LaTeX
5370 * no_document ML operator temporarily disables LaTeX document
5373 * isatool unsymbolize tunes sources for plain ASCII communication;
5378 * Pure: Isar now suffers initial goal statements to contain unbound
5379 schematic variables (this does not conform to actual readable proof
5380 documents, due to unpredictable outcome and non-compositional proof
5381 checking); users who know what they are doing may use schematic goals
5382 for Prolog-style synthesis of proven results;
5384 * Pure: assumption method (an implicit finishing) now handles actual
5387 * Pure: improved 'obtain' --- moved to Pure, insert "that" into
5388 initial goal, declare "that" only as Pure intro (only for single
5389 steps); the "that" rule assumption may now be involved in implicit
5390 finishing, thus ".." becomes a feasible for trivial obtains;
5392 * Pure: default proof step now includes 'intro_classes'; thus trivial
5393 instance proofs may be performed by "..";
5395 * Pure: ?thesis / ?this / "..." now work for pure meta-level
5398 * Pure: more robust selection of calculational rules;
5400 * Pure: the builtin notion of 'finished' goal now includes the ==-refl
5401 rule (as well as the assumption rule);
5403 * Pure: 'thm_deps' command visualizes dependencies of theorems and
5404 lemmas, using the graph browser tool;
5406 * Pure: predict failure of "show" in interactive mode;
5408 * Pure: 'thms_containing' now takes actual terms as arguments;
5410 * HOL: improved method 'induct' --- now handles non-atomic goals
5411 (potential INCOMPATIBILITY); tuned error handling;
5413 * HOL: cases and induct rules now provide explicit hints about the
5414 number of facts to be consumed (0 for "type" and 1 for "set" rules);
5415 any remaining facts are inserted into the goal verbatim;
5417 * HOL: local contexts (aka cases) may now contain term bindings as
5418 well; the 'cases' and 'induct' methods new provide a ?case binding for
5419 the result to be shown in each case;
5421 * HOL: added 'recdef_tc' command;
5423 * isatool convert assists in eliminating legacy ML scripts;
5428 * HOL/Library: a collection of generic theories to be used together
5429 with main HOL; the theory loader path already includes this directory
5430 by default; the following existing theories have been moved here:
5431 HOL/Induct/Multiset, HOL/Induct/Acc (as Accessible_Part), HOL/While
5432 (as While_Combinator), HOL/Lex/Prefix (as List_Prefix);
5434 * HOL/Unix: "Some aspects of Unix file-system security", a typical
5435 modelling and verification task performed in Isabelle/HOL +
5436 Isabelle/Isar + Isabelle document preparation (by Markus Wenzel).
5438 * HOL/Algebra: special summation operator SUM no longer exists, it has
5439 been replaced by setsum; infix 'assoc' now has priority 50 (like
5440 'dvd'); axiom 'one_not_zero' has been moved from axclass 'ring' to
5441 'domain', this makes the theory consistent with mathematical
5444 * HOL basics: added overloaded operations "inverse" and "divide"
5445 (infix "/"), syntax for generic "abs" operation, generic summation
5448 * HOL/typedef: simplified package, provide more useful rules (see also
5451 * HOL/datatype: induction rule for arbitrarily branching datatypes is
5452 now expressed as a proper nested rule (old-style tactic scripts may
5453 require atomize_strip_tac to cope with non-atomic premises);
5455 * HOL: renamed theory "Prod" to "Product_Type", renamed "split" rule
5456 to "split_conv" (old name still available for compatibility);
5458 * HOL: improved concrete syntax for strings (e.g. allows translation
5459 rules with string literals);
5461 * HOL-Real-Hyperreal: this extends HOL-Real with the hyperreals
5462 and Fleuriot's mechanization of analysis, including the transcendental
5463 functions for the reals;
5465 * HOL/Real, HOL/Hyperreal: improved arithmetic simplification;
5470 * CTT: x-symbol support for Pi, Sigma, -->, : (membership); note that
5471 "lam" is displayed as TWO lambda-symbols
5473 * CTT: theory Main now available, containing everything (that is, Bool
5479 * Pure: the Simplifier has been implemented properly as a derived rule
5480 outside of the actual kernel (at last!); the overall performance
5481 penalty in practical applications is about 50%, while reliability of
5482 the Isabelle inference kernel has been greatly improved;
5484 * print modes "brackets" and "no_brackets" control output of nested =>
5485 (types) and ==> (props); the default behaviour is "brackets";
5487 * Provers: fast_tac (and friends) now handle actual object-logic rules
5488 as assumptions as well;
5490 * system: support Poly/ML 4.0;
5492 * system: isatool install handles KDE version 1 or 2;
5496 New in Isabelle99-1 (October 2000)
5497 ----------------------------------
5499 *** Overview of INCOMPATIBILITIES ***
5501 * HOL: simplification of natural numbers is much changed; to partly
5502 recover the old behaviour (e.g. to prevent n+n rewriting to #2*n)
5503 issue the following ML commands:
5505 Delsimprocs Nat_Numeral_Simprocs.cancel_numerals;
5506 Delsimprocs [Nat_Numeral_Simprocs.combine_numerals];
5508 * HOL: simplification no longer dives into case-expressions; this is
5509 controlled by "t.weak_case_cong" for each datatype t;
5511 * HOL: nat_less_induct renamed to less_induct;
5513 * HOL: systematic renaming of the SOME (Eps) rules, may use isatool
5514 fixsome to patch .thy and .ML sources automatically;
5516 select_equality -> some_equality
5517 select_eq_Ex -> some_eq_ex
5518 selectI2EX -> someI2_ex
5521 select1_equality -> some1_equality
5522 Eps_sym_eq -> some_sym_eq_trivial
5523 Eps_eq -> some_eq_trivial
5525 * HOL: exhaust_tac on datatypes superseded by new generic case_tac;
5527 * HOL: removed obsolete theorem binding expand_if (refer to split_if
5530 * HOL: the recursion equations generated by 'recdef' are now called
5531 f.simps instead of f.rules;
5533 * HOL: qed_spec_mp now also handles bounded ALL as well;
5535 * HOL: 0 is now overloaded, so the type constraint ":: nat" may
5536 sometimes be needed;
5538 * HOL: the constant for "f``x" is now "image" rather than "op ``";
5540 * HOL: the constant for "f-``x" is now "vimage" rather than "op -``";
5542 * HOL: the disjoint sum is now "<+>" instead of "Plus"; the cartesian
5543 product is now "<*>" instead of "Times"; the lexicographic product is
5544 now "<*lex*>" instead of "**";
5546 * HOL: theory Sexp is now in HOL/Induct examples (it used to be part
5547 of main HOL, but was unused); better use HOL's datatype package;
5549 * HOL: removed "symbols" syntax for constant "override" of theory Map;
5550 the old syntax may be recovered as follows:
5553 override :: "('a ~=> 'b) => ('a ~=> 'b) => ('a ~=> 'b)"
5554 (infixl "\\<oplus>" 100)
5556 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5558 * HOL/ML: even fewer consts are declared as global (see theories Ord,
5559 Lfp, Gfp, WF); this only affects ML packages that refer to const names
5562 * HOL and ZF: syntax for quotienting wrt an equivalence relation
5563 changed from A/r to A//r;
5565 * ZF: new treatment of arithmetic (nat & int) may break some old
5568 * Isar: renamed some attributes (RS -> THEN, simplify -> simplified,
5569 rulify -> rule_format, elimify -> elim_format, ...);
5571 * Isar/Provers: intro/elim/dest attributes changed; renamed
5572 intro/intro!/intro!! flags to intro!/intro/intro? (in most cases, one
5573 should have to change intro!! to intro? only); replaced "delrule" by
5576 * Isar/HOL: renamed "intrs" to "intros" in inductive definitions;
5578 * Provers: strengthened force_tac by using new first_best_tac;
5580 * LaTeX document preparation: several changes of isabelle.sty (see
5584 *** Document preparation ***
5586 * formal comments (text blocks etc.) in new-style theories may now
5587 contain antiquotations of thm/prop/term/typ/text to be presented
5588 according to latex print mode; concrete syntax is like this:
5589 @{term[show_types] "f(x) = a + x"};
5591 * isatool mkdir provides easy setup of Isabelle session directories,
5592 including proper document sources;
5594 * generated LaTeX sources are now deleted after successful run
5595 (isatool document -c); may retain a copy somewhere else via -D option
5598 * isatool usedir -D now lets isatool latex -o sty update the Isabelle
5599 style files, achieving self-contained LaTeX sources and simplifying
5602 * old-style theories now produce (crude) LaTeX output as well;
5604 * browser info session directories are now self-contained (may be put
5605 on WWW server seperately); improved graphs of nested sessions; removed
5606 graph for 'all sessions';
5608 * several improvements in isabelle style files; \isabellestyle{it}
5609 produces fake math mode output; \isamarkupheader is now \section by
5610 default; see lib/texinputs/isabelle.sty etc.;
5615 * Isar/Pure: local results and corresponding term bindings are now
5616 subject to Hindley-Milner polymorphism (similar to ML); this
5617 accommodates incremental type-inference very nicely;
5619 * Isar/Pure: new derived language element 'obtain' supports
5620 generalized existence reasoning;
5622 * Isar/Pure: new calculational elements 'moreover' and 'ultimately'
5623 support accumulation of results, without applying any rules yet;
5624 useful to collect intermediate results without explicit name
5625 references, and for use with transitivity rules with more than 2
5628 * Isar/Pure: scalable support for case-analysis type proofs: new
5629 'case' language element refers to local contexts symbolically, as
5630 produced by certain proof methods; internally, case names are attached
5631 to theorems as "tags";
5633 * Isar/Pure: theory command 'hide' removes declarations from
5634 class/type/const name spaces;
5636 * Isar/Pure: theory command 'defs' supports option "(overloaded)" to
5637 indicate potential overloading;
5639 * Isar/Pure: changed syntax of local blocks from {{ }} to { };
5641 * Isar/Pure: syntax of sorts made 'inner', i.e. have to write
5642 "{a,b,c}" instead of {a,b,c};
5644 * Isar/Pure now provides its own version of intro/elim/dest
5645 attributes; useful for building new logics, but beware of confusion
5646 with the version in Provers/classical;
5648 * Isar/Pure: the local context of (non-atomic) goals is provided via
5649 case name 'antecedent';
5651 * Isar/Pure: removed obsolete 'transfer' attribute (transfer of thms
5652 to the current context is now done automatically);
5654 * Isar/Pure: theory command 'method_setup' provides a simple interface
5655 for definining proof methods in ML;
5657 * Isar/Provers: intro/elim/dest attributes changed; renamed
5658 intro/intro!/intro!! flags to intro!/intro/intro? (INCOMPATIBILITY, in
5659 most cases, one should have to change intro!! to intro? only);
5660 replaced "delrule" by "rule del";
5662 * Isar/Provers: new 'hypsubst' method, plain 'subst' method and
5663 'symmetric' attribute (the latter supersedes [RS sym]);
5665 * Isar/Provers: splitter support (via 'split' attribute and 'simp'
5666 method modifier); 'simp' method: 'only:' modifier removes loopers as
5667 well (including splits);
5669 * Isar/Provers: Simplifier and Classical methods now support all kind
5670 of modifiers used in the past, including 'cong', 'iff', etc.
5672 * Isar/Provers: added 'fastsimp' and 'clarsimp' methods (combination
5673 of Simplifier and Classical reasoner);
5675 * Isar/HOL: new proof method 'cases' and improved version of 'induct'
5676 now support named cases; major packages (inductive, datatype, primrec,
5677 recdef) support case names and properly name parameters;
5679 * Isar/HOL: new transitivity rules for substitution in inequalities --
5680 monotonicity conditions are extracted to be proven at end of
5683 * Isar/HOL: removed 'case_split' thm binding, should use 'cases' proof
5686 * Isar/HOL: removed old expand_if = split_if; theorems if_splits =
5687 split_if split_if_asm; datatype package provides theorems foo.splits =
5688 foo.split foo.split_asm for each datatype;
5690 * Isar/HOL: tuned inductive package, rename "intrs" to "intros"
5691 (potential INCOMPATIBILITY), emulation of mk_cases feature for proof
5692 scripts: new 'inductive_cases' command and 'ind_cases' method; (Note:
5693 use "(cases (simplified))" method in proper proof texts);
5695 * Isar/HOL: added global 'arith_split' attribute for 'arith' method;
5697 * Isar: names of theorems etc. may be natural numbers as well;
5699 * Isar: 'pr' command: optional arguments for goals_limit and
5700 ProofContext.prems_limit; no longer prints theory contexts, but only
5703 * Isar: diagnostic commands 'pr', 'thm', 'prop', 'term', 'typ' admit
5704 additional print modes to be specified; e.g. "pr(latex)" will print
5705 proof state according to the Isabelle LaTeX style;
5707 * Isar: improved support for emulating tactic scripts, including proof
5708 methods 'rule_tac' etc., 'cut_tac', 'thin_tac', 'subgoal_tac',
5709 'rename_tac', 'rotate_tac', 'tactic', and 'case_tac' / 'induct_tac'
5710 (for HOL datatypes);
5712 * Isar: simplified (more robust) goal selection of proof methods: 1st
5713 goal, all goals, or explicit goal specifier (tactic emulation); thus
5714 'proof method scripts' have to be in depth-first order;
5716 * Isar: tuned 'let' syntax: replaced 'as' keyword by 'and';
5718 * Isar: removed 'help' command, which hasn't been too helpful anyway;
5719 should instead use individual commands for printing items
5720 (print_commands, print_methods etc.);
5722 * Isar: added 'nothing' --- the empty list of theorems;
5727 * HOL/MicroJava: formalization of a fragment of Java, together with a
5728 corresponding virtual machine and a specification of its bytecode
5729 verifier and a lightweight bytecode verifier, including proofs of
5730 type-safety; by Gerwin Klein, Tobias Nipkow, David von Oheimb, and
5731 Cornelia Pusch (see also the homepage of project Bali at
5732 http://isabelle.in.tum.de/Bali/);
5734 * HOL/Algebra: new theory of rings and univariate polynomials, by
5737 * HOL/NumberTheory: fundamental Theorem of Arithmetic, Chinese
5738 Remainder Theorem, Fermat/Euler Theorem, Wilson's Theorem, by Thomas M
5741 * HOL/Lattice: fundamental concepts of lattice theory and order
5742 structures, including duals, properties of bounds versus algebraic
5743 laws, lattice operations versus set-theoretic ones, the Knaster-Tarski
5744 Theorem for complete lattices etc.; may also serve as a demonstration
5745 for abstract algebraic reasoning using axiomatic type classes, and
5746 mathematics-style proof in Isabelle/Isar; by Markus Wenzel;
5748 * HOL/Prolog: a (bare-bones) implementation of Lambda-Prolog, by David
5751 * HOL/IMPP: extension of IMP with local variables and mutually
5752 recursive procedures, by David von Oheimb;
5754 * HOL/Lambda: converted into new-style theory and document;
5756 * HOL/ex/Multiquote: example of multiple nested quotations and
5757 anti-quotations -- basically a generalized version of de-Bruijn
5758 representation; very useful in avoiding lifting of operations;
5760 * HOL/record: added general record equality rule to simpset; fixed
5761 select-update simplification procedure to handle extended records as
5762 well; admit "r" as field name;
5764 * HOL: 0 is now overloaded over the new sort "zero", allowing its use with
5765 other numeric types and also as the identity of groups, rings, etc.;
5767 * HOL: new axclass plus_ac0 for addition with the AC-laws and 0 as identity.
5768 Types nat and int belong to this axclass;
5770 * HOL: greatly improved simplification involving numerals of type nat, int, real:
5771 (i + #8 + j) = Suc k simplifies to #7 + (i + j) = k
5772 i*j + k + j*#3*i simplifies to #4*(i*j) + k
5773 two terms #m*u and #n*u are replaced by #(m+n)*u
5774 (where #m, #n and u can implicitly be 1; this is simproc combine_numerals)
5775 and the term/formula #m*u+x ~~ #n*u+y simplifies simplifies to #(m-n)+x ~~ y
5776 or x ~~ #(n-m)+y, where ~~ is one of = < <= or - (simproc cancel_numerals);
5778 * HOL: meson_tac is available (previously in ex/meson.ML); it is a
5779 powerful prover for predicate logic but knows nothing of clasets; see
5780 ex/mesontest.ML and ex/mesontest2.ML for example applications;
5782 * HOL: new version of "case_tac" subsumes both boolean case split and
5783 "exhaust_tac" on datatypes; INCOMPATIBILITY: exhaust_tac no longer
5784 exists, may define val exhaust_tac = case_tac for ad-hoc portability;
5786 * HOL: simplification no longer dives into case-expressions: only the
5787 selector expression is simplified, but not the remaining arms; to
5788 enable full simplification of case-expressions for datatype t, you may
5789 remove t.weak_case_cong from the simpset, either globally (Delcongs
5790 [thm"t.weak_case_cong"];) or locally (delcongs [...]).
5792 * HOL/recdef: the recursion equations generated by 'recdef' for
5793 function 'f' are now called f.simps instead of f.rules; if all
5794 termination conditions are proved automatically, these simplification
5795 rules are added to the simpset, as in primrec; rules may be named
5796 individually as well, resulting in a separate list of theorems for
5799 * HOL/While is a new theory that provides a while-combinator. It
5800 permits the definition of tail-recursive functions without the
5801 provision of a termination measure. The latter is necessary once the
5802 invariant proof rule for while is applied.
5804 * HOL: new (overloaded) notation for the set of elements below/above
5805 some element: {..u}, {..u(}, {l..}, {)l..}. See theory SetInterval.
5807 * HOL: theorems impI, allI, ballI bound as "strip";
5809 * HOL: new tactic induct_thm_tac: thm -> string -> int -> tactic
5810 induct_tac th "x1 ... xn" expects th to have a conclusion of the form
5811 P v1 ... vn and abbreviates res_inst_tac [("v1","x1"),...,("vn","xn")] th;
5813 * HOL/Real: "rabs" replaced by overloaded "abs" function;
5815 * HOL: theory Sexp now in HOL/Induct examples (it used to be part of
5816 main HOL, but was unused);
5818 * HOL: fewer consts declared as global (e.g. have to refer to
5819 "Lfp.lfp" instead of "lfp" internally; affects ML packages only);
5821 * HOL: tuned AST representation of nested pairs, avoiding bogus output
5822 in case of overlap with user translations (e.g. judgements over
5823 tuples); (note that the underlying logical represenation is still
5829 * ZF: simplification automatically cancels common terms in arithmetic
5830 expressions over nat and int;
5832 * ZF: new treatment of nat to minimize type-checking: all operators
5833 coerce their operands to a natural number using the function natify,
5834 making the algebraic laws unconditional;
5836 * ZF: as above, for int: operators coerce their operands to an integer
5837 using the function intify;
5839 * ZF: the integer library now contains many of the usual laws for the
5840 orderings, including $<=, and monotonicity laws for $+ and $*;
5842 * ZF: new example ZF/ex/NatSum to demonstrate integer arithmetic
5845 * FOL and ZF: AddIffs now available, giving theorems of the form P<->Q
5846 to the simplifier and classical reasoner simultaneously;
5851 * Provers: blast_tac now handles actual object-logic rules as
5852 assumptions; note that auto_tac uses blast_tac internally as well;
5854 * Provers: new functions rulify/rulify_no_asm: thm -> thm for turning
5855 outer -->/All/Ball into ==>/!!; qed_spec_mp now uses rulify_no_asm;
5857 * Provers: delrules now handles destruct rules as well (no longer need
5858 explicit make_elim);
5860 * Provers: Blast_tac now warns of and ignores "weak elimination rules" e.g.
5861 [| inj ?f; ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5862 use instead the strong form,
5863 [| inj ?f; ~ ?W ==> ?f ?x = ?f ?y; ?x = ?y ==> ?W |] ==> ?W
5864 in HOL, FOL and ZF the function cla_make_elim will create such rules
5865 from destruct-rules;
5867 * Provers: Simplifier.easy_setup provides a fast path to basic
5868 Simplifier setup for new object-logics;
5870 * Pure: AST translation rules no longer require constant head on LHS;
5872 * Pure: improved name spaces: ambiguous output is qualified; support
5873 for hiding of names;
5875 * system: smart setup of canonical ML_HOME, ISABELLE_INTERFACE, and
5876 XSYMBOL_HOME; no longer need to do manual configuration in most
5879 * system: compression of ML heaps images may now be controlled via -c
5880 option of isabelle and isatool usedir (currently only observed by
5883 * system: isatool installfonts may handle X-Symbol fonts as well (very
5884 useful for remote X11);
5886 * system: provide TAGS file for Isabelle sources;
5888 * ML: infix 'OF' is a version of 'MRS' with more appropriate argument
5891 * ML: renamed flags Syntax.trace_norm_ast to Syntax.trace_ast; global
5892 timing flag supersedes proof_timing and Toplevel.trace;
5894 * ML: new combinators |>> and |>>> for incremental transformations
5895 with secondary results (e.g. certain theory extensions):
5897 * ML: PureThy.add_defs gets additional argument to indicate potential
5898 overloading (usually false);
5900 * ML: PureThy.add_thms/add_axioms/add_defs now return theorems as
5905 New in Isabelle99 (October 1999)
5906 --------------------------------
5908 *** Overview of INCOMPATIBILITIES (see below for more details) ***
5910 * HOL: The THEN and ELSE parts of conditional expressions (if P then x else y)
5911 are no longer simplified. (This allows the simplifier to unfold recursive
5912 functional programs.) To restore the old behaviour, declare
5914 Delcongs [if_weak_cong];
5916 * HOL: Removed the obsolete syntax "Compl A"; use -A for set
5919 * HOL: the predicate "inj" is now defined by translation to "inj_on";
5921 * HOL/datatype: mutual_induct_tac no longer exists --
5922 use induct_tac "x_1 ... x_n" instead of mutual_induct_tac ["x_1", ..., "x_n"]
5924 * HOL/typedef: fixed type inference for representing set; type
5925 arguments now have to occur explicitly on the rhs as type constraints;
5927 * ZF: The con_defs part of an inductive definition may no longer refer
5928 to constants declared in the same theory;
5930 * HOL, ZF: the function mk_cases, generated by the inductive
5931 definition package, has lost an argument. To simplify its result, it
5932 uses the default simpset instead of a supplied list of theorems.
5934 * HOL/List: the constructors of type list are now Nil and Cons;
5936 * Simplifier: the type of the infix ML functions
5937 setSSolver addSSolver setSolver addSolver
5938 is now simpset * solver -> simpset where `solver' is a new abstract type
5939 for packaging solvers. A solver is created via
5940 mk_solver: string -> (thm list -> int -> tactic) -> solver
5941 where the string argument is only a comment.
5946 * Provers/Arith/fast_lin_arith.ML contains a functor for creating a
5947 decision procedure for linear arithmetic. Currently it is used for
5948 types `nat', `int', and `real' in HOL (see below); it can, should and
5949 will be instantiated for other types and logics as well.
5951 * The simplifier now accepts rewrite rules with flexible heads, eg
5952 hom ?f ==> ?f(?x+?y) = ?f ?x + ?f ?y
5953 They are applied like any rule with a non-pattern lhs, i.e. by first-order
5959 * New Isabelle/Isar subsystem provides an alternative to traditional
5960 tactical theorem proving; together with the ProofGeneral/isar user
5961 interface it offers an interactive environment for developing human
5962 readable proof documents (Isar == Intelligible semi-automated
5963 reasoning); for further information see isatool doc isar-ref,
5964 src/HOL/Isar_examples and http://isabelle.in.tum.de/Isar/
5966 * improved and simplified presentation of theories: better HTML markup
5967 (including colors), graph views in several sizes; isatool usedir now
5968 provides a proper interface for user theories (via -P option); actual
5969 document preparation based on (PDF)LaTeX is available as well (for
5970 new-style theories only); see isatool doc system for more information;
5972 * native support for Proof General, both for classic Isabelle and
5975 * ML function thm_deps visualizes dependencies of theorems and lemmas,
5976 using the graph browser tool;
5978 * Isabelle manuals now also available as PDF;
5980 * theory loader rewritten from scratch (may not be fully
5981 bug-compatible); old loadpath variable has been replaced by show_path,
5982 add_path, del_path, reset_path functions; new operations such as
5983 update_thy, touch_thy, remove_thy, use/update_thy_only (see also
5986 * improved isatool install: option -k creates KDE application icon,
5987 option -p DIR installs standalone binaries;
5989 * added ML_PLATFORM setting (useful for cross-platform installations);
5990 more robust handling of platform specific ML images for SML/NJ;
5992 * the settings environment is now statically scoped, i.e. it is never
5993 created again in sub-processes invoked from isabelle, isatool, or
5996 * path element specification '~~' refers to '$ISABELLE_HOME';
5998 * in locales, the "assumes" and "defines" parts may be omitted if
6001 * new print_mode "xsymbols" for extended symbol support (e.g. genuine
6004 * new print_mode "HTML";
6006 * new flag show_tags controls display of tags of theorems (which are
6007 basically just comments that may be attached by some tools);
6009 * Isamode 2.6 requires patch to accomodate change of Isabelle font
6010 mode and goal output format:
6012 diff -r Isamode-2.6/elisp/isa-load.el Isamode/elisp/isa-load.el
6014 < (list (isa-getenv "ISABELLE") "-msymbols" logic-name)
6016 > (list (isa-getenv "ISABELLE") "-misabelle_font" "-msymbols" logic-name)
6017 diff -r Isabelle-2.6/elisp/isa-proofstate.el Isamode/elisp/isa-proofstate.el
6019 < (defconst proofstate-proofstart-regexp "^Level [0-9]+$"
6021 > (defconst proofstate-proofstart-regexp "^Level [0-9]+"
6023 * function bind_thms stores lists of theorems (cf. bind_thm);
6025 * new shorthand tactics ftac, eatac, datac, fatac;
6027 * qed (and friends) now accept "" as result name; in that case the
6028 theorem is not stored, but proper checks and presentation of the
6031 * theorem database now also indexes constants "Trueprop", "all",
6032 "==>", "=="; thus thms_containing, findI etc. may retrieve more rules;
6037 ** HOL arithmetic **
6039 * There are now decision procedures for linear arithmetic over nat and
6042 1. arith_tac copes with arbitrary formulae involving `=', `<', `<=',
6043 `+', `-', `Suc', `min', `max' and numerical constants; other subterms
6044 are treated as atomic; subformulae not involving type `nat' or `int'
6045 are ignored; quantified subformulae are ignored unless they are
6046 positive universal or negative existential. The tactic has to be
6047 invoked by hand and can be a little bit slow. In particular, the
6048 running time is exponential in the number of occurrences of `min' and
6049 `max', and `-' on `nat'.
6051 2. fast_arith_tac is a cut-down version of arith_tac: it only takes
6052 (negated) (in)equalities among the premises and the conclusion into
6053 account (i.e. no compound formulae) and does not know about `min' and
6054 `max', and `-' on `nat'. It is fast and is used automatically by the
6057 NB: At the moment, these decision procedures do not cope with mixed
6058 nat/int formulae where the two parts interact, such as `m < n ==>
6061 * HOL/Numeral provides a generic theory of numerals (encoded
6062 efficiently as bit strings); setup for types nat/int/real is in place;
6063 INCOMPATIBILITY: since numeral syntax is now polymorphic, rather than
6064 int, existing theories and proof scripts may require a few additional
6067 * integer division and remainder can now be performed on constant
6070 * many properties of integer multiplication, division and remainder
6073 * An interface to the Stanford Validity Checker (SVC) is available through the
6074 tactic svc_tac. Propositional tautologies and theorems of linear arithmetic
6075 are proved automatically. SVC must be installed separately, and its results
6076 must be TAKEN ON TRUST (Isabelle does not check the proofs, but tags any
6077 invocation of the underlying oracle). For SVC see
6078 http://verify.stanford.edu/SVC
6080 * IsaMakefile: the HOL-Real target now builds an actual image;
6085 * HOL/Real/HahnBanach: the Hahn-Banach theorem for real vector spaces
6086 (in Isabelle/Isar) -- by Gertrud Bauer;
6088 * HOL/BCV: generic model of bytecode verification, i.e. data-flow
6089 analysis for assembly languages with subtypes;
6091 * HOL/TLA (Lamport's Temporal Logic of Actions): major reorganization
6092 -- avoids syntactic ambiguities and treats state, transition, and
6093 temporal levels more uniformly; introduces INCOMPATIBILITIES due to
6094 changed syntax and (many) tactics;
6096 * HOL/inductive: Now also handles more general introduction rules such
6097 as "ALL y. (y, x) : r --> y : acc r ==> x : acc r"; monotonicity
6098 theorems are now maintained within the theory (maintained via the
6101 * HOL/datatype: Now also handles arbitrarily branching datatypes
6102 (using function types) such as
6104 datatype 'a tree = Atom 'a | Branch "nat => 'a tree"
6106 * HOL/record: record_simproc (part of the default simpset) takes care
6107 of selectors applied to updated records; record_split_tac is no longer
6108 part of the default claset; update_defs may now be removed from the
6109 simpset in many cases; COMPATIBILITY: old behavior achieved by
6111 claset_ref () := claset() addSWrapper record_split_wrapper;
6112 Delsimprocs [record_simproc]
6114 * HOL/typedef: fixed type inference for representing set; type
6115 arguments now have to occur explicitly on the rhs as type constraints;
6117 * HOL/recdef (TFL): 'congs' syntax now expects comma separated list of theorem
6118 names rather than an ML expression;
6120 * HOL/defer_recdef (TFL): like recdef but the well-founded relation can be
6121 supplied later. Program schemes can be defined, such as
6122 "While B C s = (if B s then While B C (C s) else s)"
6123 where the well-founded relation can be chosen after B and C have been given.
6125 * HOL/List: the constructors of type list are now Nil and Cons;
6126 INCOMPATIBILITY: while [] and infix # syntax is still there, of
6127 course, ML tools referring to List.list.op # etc. have to be adapted;
6129 * HOL_quantifiers flag superseded by "HOL" print mode, which is
6130 disabled by default; run isabelle with option -m HOL to get back to
6131 the original Gordon/HOL-style output;
6133 * HOL/Ord.thy: new bounded quantifier syntax (input only): ALL x<y. P,
6134 ALL x<=y. P, EX x<y. P, EX x<=y. P;
6136 * HOL basic syntax simplified (more orthogonal): all variants of
6137 All/Ex now support plain / symbolic / HOL notation; plain syntax for
6138 Eps operator is provided as well: "SOME x. P[x]";
6140 * HOL/Sum.thy: sum_case has been moved to HOL/Datatype;
6142 * HOL/Univ.thy: infix syntax <*>, <+>, <**>, <+> eliminated and made
6143 thus available for user theories;
6145 * HOLCF/IOA/Sequents: renamed 'Cons' to 'Consq' to avoid clash with
6146 HOL/List; hardly an INCOMPATIBILITY since '>>' syntax is used all the
6149 * HOL: new tactic smp_tac: int -> int -> tactic, which applies spec
6150 several times and then mp;
6155 * the notation <<...>> is now available as a notation for sequences of
6158 * the simplifier is now installed
6160 * the axiom system has been generalized (thanks to Soren Heilmann)
6162 * the classical reasoner now has a default rule database
6167 * new primrec section allows primitive recursive functions to be given
6168 directly (as in HOL) over datatypes and the natural numbers;
6170 * new tactics induct_tac and exhaust_tac for induction (or case
6171 analysis) over datatypes and the natural numbers;
6173 * the datatype declaration of type T now defines the recursor T_rec;
6175 * simplification automatically does freeness reasoning for datatype
6178 * automatic type-inference, with AddTCs command to insert new
6179 type-checking rules;
6181 * datatype introduction rules are now added as Safe Introduction rules
6184 * the syntax "if P then x else y" is now available in addition to
6188 *** Internal programming interfaces ***
6190 * tuned simplifier trace output; new flag debug_simp;
6192 * structures Vartab / Termtab (instances of TableFun) offer efficient
6193 tables indexed by indexname_ord / term_ord (compatible with aconv);
6195 * AxClass.axclass_tac lost the theory argument;
6197 * tuned current_goals_markers semantics: begin / end goal avoids
6198 printing empty lines;
6200 * removed prs and prs_fn hook, which was broken because it did not
6201 include \n in its semantics, forcing writeln to add one
6202 uncoditionally; replaced prs_fn by writeln_fn; consider std_output:
6203 string -> unit if you really want to output text without newline;
6205 * Symbol.output subject to print mode; INCOMPATIBILITY: defaults to
6206 plain output, interface builders may have to enable 'isabelle_font'
6207 mode to get Isabelle font glyphs as before;
6209 * refined token_translation interface; INCOMPATIBILITY: output length
6210 now of type real instead of int;
6212 * theory loader actions may be traced via new ThyInfo.add_hook
6213 interface (see src/Pure/Thy/thy_info.ML); example application: keep
6214 your own database of information attached to *whole* theories -- as
6215 opposed to intra-theory data slots offered via TheoryDataFun;
6217 * proper handling of dangling sort hypotheses (at last!);
6218 Thm.strip_shyps and Drule.strip_shyps_warning take care of removing
6219 extra sort hypotheses that can be witnessed from the type signature;
6220 the force_strip_shyps flag is gone, any remaining shyps are simply
6221 left in the theorem (with a warning issued by strip_shyps_warning);
6225 New in Isabelle98-1 (October 1998)
6226 ----------------------------------
6228 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6230 * several changes of automated proof tools;
6232 * HOL: major changes to the inductive and datatype packages, including
6233 some minor incompatibilities of theory syntax;
6235 * HOL: renamed r^-1 to 'converse' from 'inverse'; 'inj_onto' is now
6238 * HOL: removed duplicate thms in Arith:
6239 less_imp_add_less should be replaced by trans_less_add1
6240 le_imp_add_le should be replaced by trans_le_add1
6242 * HOL: unary minus is now overloaded (new type constraints may be
6245 * HOL and ZF: unary minus for integers is now #- instead of #~. In
6246 ZF, expressions such as n#-1 must be changed to n#- 1, since #-1 is
6247 now taken as an integer constant.
6249 * Pure: ML function 'theory_of' renamed to 'theory';
6255 1. Asm_full_simp_tac is now more aggressive.
6256 1. It will sometimes reorient premises if that increases their power to
6258 2. It does no longer proceed strictly from left to right but may also
6259 rotate premises to achieve further simplification.
6260 For compatibility reasons there is now Asm_lr_simp_tac which is like the
6261 old Asm_full_simp_tac in that it does not rotate premises.
6262 2. The simplifier now knows a little bit about nat-arithmetic.
6264 * Classical reasoner: wrapper mechanism for the classical reasoner now
6265 allows for selected deletion of wrappers, by introduction of names for
6266 wrapper functionals. This implies that addbefore, addSbefore,
6267 addaltern, and addSaltern now take a pair (name, tactic) as argument,
6268 and that adding two tactics with the same name overwrites the first
6269 one (emitting a warning).
6270 type wrapper = (int -> tactic) -> (int -> tactic)
6271 setWrapper, setSWrapper, compWrapper and compSWrapper are replaced by
6272 addWrapper, addSWrapper: claset * (string * wrapper) -> claset
6273 delWrapper, delSWrapper: claset * string -> claset
6274 getWrapper is renamed to appWrappers, getSWrapper to appSWrappers;
6276 * Classical reasoner: addbefore/addSbefore now have APPEND/ORELSE
6277 semantics; addbefore now affects only the unsafe part of step_tac
6278 etc.; this affects addss/auto_tac/force_tac, so EXISTING PROOFS MAY
6279 FAIL, but proofs should be fixable easily, e.g. by replacing Auto_tac
6282 * Classical reasoner: setwrapper to setWrapper and compwrapper to
6283 compWrapper; added safe wrapper (and access functions for it);
6285 * HOL/split_all_tac is now much faster and fails if there is nothing
6286 to split. Some EXISTING PROOFS MAY REQUIRE ADAPTION because the order
6287 and the names of the automatically generated variables have changed.
6288 split_all_tac has moved within claset() from unsafe wrappers to safe
6289 wrappers, which means that !!-bound variables are split much more
6290 aggressively, and safe_tac and clarify_tac now split such variables.
6291 If this splitting is not appropriate, use delSWrapper "split_all_tac".
6292 Note: the same holds for record_split_tac, which does the job of
6293 split_all_tac for record fields.
6295 * HOL/Simplifier: Rewrite rules for case distinctions can now be added
6296 permanently to the default simpset using Addsplits just like
6297 Addsimps. They can be removed via Delsplits just like
6298 Delsimps. Lower-case versions are also available.
6300 * HOL/Simplifier: The rule split_if is now part of the default
6301 simpset. This means that the simplifier will eliminate all occurrences
6302 of if-then-else in the conclusion of a goal. To prevent this, you can
6303 either remove split_if completely from the default simpset by
6304 `Delsplits [split_if]' or remove it in a specific call of the
6305 simplifier using `... delsplits [split_if]'. You can also add/delete
6306 other case splitting rules to/from the default simpset: every datatype
6307 generates suitable rules `split_t_case' and `split_t_case_asm' (where
6308 t is the name of the datatype).
6310 * Classical reasoner / Simplifier combination: new force_tac (and
6311 derivatives Force_tac, force) combines rewriting and classical
6312 reasoning (and whatever other tools) similarly to auto_tac, but is
6313 aimed to solve the given subgoal completely.
6318 * new top-level commands `Goal' and `Goalw' that improve upon `goal'
6319 and `goalw': the theory is no longer needed as an explicit argument -
6320 the current theory context is used; assumptions are no longer returned
6321 at the ML-level unless one of them starts with ==> or !!; it is
6322 recommended to convert to these new commands using isatool fixgoal
6323 (backup your sources first!);
6325 * new top-level commands 'thm' and 'thms' for retrieving theorems from
6326 the current theory context, and 'theory' to lookup stored theories;
6328 * new theory section 'locale' for declaring constants, assumptions and
6329 definitions that have local scope;
6331 * new theory section 'nonterminals' for purely syntactic types;
6333 * new theory section 'setup' for generic ML setup functions
6334 (e.g. package initialization);
6336 * the distribution now includes Isabelle icons: see
6337 lib/logo/isabelle-{small,tiny}.xpm;
6339 * isatool install - install binaries with absolute references to
6342 * isatool logo -- create instances of the Isabelle logo (as EPS);
6344 * print mode 'emacs' reserved for Isamode;
6346 * support multiple print (ast) translations per constant name;
6348 * theorems involving oracles are now printed with a suffixed [!];
6353 * there is now a tutorial on Isabelle/HOL (do 'isatool doc tutorial');
6355 * HOL/inductive package reorganized and improved: now supports mutual
6361 oddI "n : EVEN ==> Suc n : ODD"
6362 evenI "n : ODD ==> Suc n : EVEN"
6364 new theorem list "elims" contains an elimination rule for each of the
6365 recursive sets; inductive definitions now handle disjunctive premises
6366 correctly (also ZF);
6368 INCOMPATIBILITIES: requires Inductive as an ancestor; component
6369 "mutual_induct" no longer exists - the induction rule is always
6370 contained in "induct";
6373 * HOL/datatype package re-implemented and greatly improved: now
6374 supports mutually recursive datatypes such as
6377 'a aexp = IF_THEN_ELSE ('a bexp) ('a aexp) ('a aexp)
6378 | SUM ('a aexp) ('a aexp)
6379 | DIFF ('a aexp) ('a aexp)
6382 'a bexp = LESS ('a aexp) ('a aexp)
6383 | AND ('a bexp) ('a bexp)
6384 | OR ('a bexp) ('a bexp)
6386 as well as indirectly recursive datatypes such as
6389 ('a, 'b) term = Var 'a
6390 | App 'b ((('a, 'b) term) list)
6392 The new tactic mutual_induct_tac [<var_1>, ..., <var_n>] i performs
6393 induction on mutually / indirectly recursive datatypes.
6395 Primrec equations are now stored in theory and can be accessed via
6396 <function_name>.simps.
6400 - Theories using datatypes must now have theory Datatype as an
6402 - The specific <typename>.induct_tac no longer exists - use the
6403 generic induct_tac instead.
6404 - natE has been renamed to nat.exhaust - use exhaust_tac
6405 instead of res_inst_tac ... natE. Note that the variable
6406 names in nat.exhaust differ from the names in natE, this
6407 may cause some "fragile" proofs to fail.
6408 - The theorems split_<typename>_case and split_<typename>_case_asm
6409 have been renamed to <typename>.split and <typename>.split_asm.
6410 - Since default sorts of type variables are now handled correctly,
6411 some datatype definitions may have to be annotated with explicit
6413 - Primrec definitions no longer require function name and type
6414 of recursive argument.
6416 Consider using isatool fixdatatype to adapt your theories and proof
6417 scripts to the new package (backup your sources first!).
6420 * HOL/record package: considerably improved implementation; now
6421 includes concrete syntax for record types, terms, updates; theorems
6422 for surjective pairing and splitting !!-bound record variables; proof
6423 support is as follows:
6425 1) standard conversions (selectors or updates applied to record
6426 constructor terms) are part of the standard simpset;
6428 2) inject equations of the form ((x, y) = (x', y')) == x=x' & y=y' are
6429 made part of standard simpset and claset via addIffs;
6431 3) a tactic for record field splitting (record_split_tac) is part of
6432 the standard claset (addSWrapper);
6434 To get a better idea about these rules you may retrieve them via
6435 something like 'thms "foo.simps"' or 'thms "foo.iffs"', where "foo" is
6436 the name of your record type.
6438 The split tactic 3) conceptually simplifies by the following rule:
6440 "(!!x. PROP ?P x) == (!!a b. PROP ?P (a, b))"
6442 Thus any record variable that is bound by meta-all will automatically
6443 blow up into some record constructor term, consequently the
6444 simplifications of 1), 2) apply. Thus force_tac, auto_tac etc. shall
6445 solve record problems automatically.
6448 * reorganized the main HOL image: HOL/Integ and String loaded by
6449 default; theory Main includes everything;
6451 * automatic simplification of integer sums and comparisons, using cancellation;
6453 * added option_map_eq_Some and not_Some_eq to the default simpset and claset;
6455 * added disj_not1 = "(~P | Q) = (P --> Q)" to the default simpset;
6457 * many new identities for unions, intersections, set difference, etc.;
6459 * expand_if, expand_split, expand_sum_case and expand_nat_case are now
6460 called split_if, split_split, split_sum_case and split_nat_case (to go
6461 with add/delsplits);
6463 * HOL/Prod introduces simplification procedure unit_eq_proc rewriting
6464 (?x::unit) = (); this is made part of the default simpset, which COULD
6465 MAKE EXISTING PROOFS FAIL under rare circumstances (consider
6466 'Delsimprocs [unit_eq_proc];' as last resort); also note that
6467 unit_abs_eta_conv is added in order to counter the effect of
6468 unit_eq_proc on (%u::unit. f u), replacing it by f rather than by
6471 * HOL/Fun INCOMPATIBILITY: `inj_onto' is now called `inj_on' (which
6474 * HOL/Set INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6475 It and 'sym RS equals0D' are now in the default claset, giving automatic
6476 disjointness reasoning but breaking a few old proofs.
6478 * HOL/Relation INCOMPATIBILITY: renamed the relational operator r^-1
6479 to 'converse' from 'inverse' (for compatibility with ZF and some
6482 * HOL/recdef can now declare non-recursive functions, with {} supplied as
6483 the well-founded relation;
6485 * HOL/Set INCOMPATIBILITY: the complement of set A is now written -A instead of
6486 Compl A. The "Compl" syntax remains available as input syntax for this
6489 * HOL/Update: new theory of function updates:
6490 f(a:=b) == %x. if x=a then b else f x
6491 may also be iterated as in f(a:=b,c:=d,...);
6493 * HOL/Vimage: new theory for inverse image of a function, syntax f-``B;
6496 - new function list_update written xs[i:=v] that updates the i-th
6497 list position. May also be iterated as in xs[i:=a,j:=b,...].
6498 - new function `upt' written [i..j(] which generates the list
6499 [i,i+1,...,j-1], i.e. the upper bound is excluded. To include the upper
6500 bound write [i..j], which is a shorthand for [i..j+1(].
6501 - new lexicographic orderings and corresponding wellfoundedness theorems.
6504 - removed 'pred' (predecessor) function;
6505 - generalized some theorems about n-1;
6506 - many new laws about "div" and "mod";
6507 - new laws about greatest common divisors (see theory ex/Primes);
6509 * HOL/Relation: renamed the relational operator r^-1 "converse"
6510 instead of "inverse";
6512 * HOL/Induct/Multiset: a theory of multisets, including the wellfoundedness
6513 of the multiset ordering;
6515 * directory HOL/Real: a construction of the reals using Dedekind cuts
6516 (not included by default);
6518 * directory HOL/UNITY: Chandy and Misra's UNITY formalism;
6520 * directory HOL/Hoare: a new version of Hoare logic which permits many-sorted
6521 programs, i.e. different program variables may have different types.
6523 * calling (stac rew i) now fails if "rew" has no effect on the goal
6524 [previously, this check worked only if the rewrite rule was unconditional]
6525 Now rew can involve either definitions or equalities (either == or =).
6530 * theory Main includes everything; INCOMPATIBILITY: theory ZF.thy contains
6531 only the theorems proved on ZF.ML;
6533 * ZF INCOMPATIBILITY: rule `equals0D' is now a well-formed destruct rule;
6534 It and 'sym RS equals0D' are now in the default claset, giving automatic
6535 disjointness reasoning but breaking a few old proofs.
6537 * ZF/Update: new theory of function updates
6538 with default rewrite rule f(x:=y) ` z = if(z=x, y, f`z)
6539 may also be iterated as in f(a:=b,c:=d,...);
6541 * in let x=t in u(x), neither t nor u(x) has to be an FOL term.
6543 * calling (stac rew i) now fails if "rew" has no effect on the goal
6544 [previously, this check worked only if the rewrite rule was unconditional]
6545 Now rew can involve either definitions or equalities (either == or =).
6547 * case_tac provided for compatibility with HOL
6548 (like the old excluded_middle_tac, but with subgoals swapped)
6551 *** Internal programming interfaces ***
6553 * Pure: several new basic modules made available for general use, see
6554 also src/Pure/README;
6556 * improved the theory data mechanism to support encapsulation (data
6557 kind name replaced by private Object.kind, acting as authorization
6558 key); new type-safe user interface via functor TheoryDataFun; generic
6559 print_data function becomes basically useless;
6561 * removed global_names compatibility flag -- all theory declarations
6562 are qualified by default;
6564 * module Pure/Syntax now offers quote / antiquote translation
6565 functions (useful for Hoare logic etc. with implicit dependencies);
6566 see HOL/ex/Antiquote for an example use;
6568 * Simplifier now offers conversions (asm_)(full_)rewrite: simpset ->
6571 * new tactical CHANGED_GOAL for checking that a tactic modifies a
6574 * Display.print_goals function moved to Locale.print_goals;
6576 * standard print function for goals supports current_goals_markers
6577 variable for marking begin of proof, end of proof, start of goal; the
6578 default is ("", "", ""); setting current_goals_markers := ("<proof>",
6579 "</proof>", "<goal>") causes SGML like tagged proof state printing,
6584 New in Isabelle98 (January 1998)
6585 --------------------------------
6587 *** Overview of INCOMPATIBILITIES (see below for more details) ***
6589 * changed lexical syntax of terms / types: dots made part of long
6590 identifiers, e.g. "%x.x" no longer possible, should be "%x. x";
6592 * simpset (and claset) reference variable replaced by functions
6593 simpset / simpset_ref;
6595 * no longer supports theory aliases (via merge) and non-trivial
6596 implicit merge of thms' signatures;
6598 * most internal names of constants changed due to qualified names;
6600 * changed Pure/Sequence interface (see Pure/seq.ML);
6603 *** General Changes ***
6605 * hierachically structured name spaces (for consts, types, axms, thms
6606 etc.); new lexical class 'longid' (e.g. Foo.bar.x) may render much of
6607 old input syntactically incorrect (e.g. "%x.x"); COMPATIBILITY:
6608 isatool fixdots ensures space after dots (e.g. "%x. x"); set
6609 long_names for fully qualified output names; NOTE: ML programs
6610 (special tactics, packages etc.) referring to internal names may have
6611 to be adapted to cope with fully qualified names; in case of severe
6612 backward campatibility problems try setting 'global_names' at compile
6613 time to have enrything declared within a flat name space; one may also
6614 fine tune name declarations in theories via the 'global' and 'local'
6617 * reimplemented the implicit simpset and claset using the new anytype
6618 data filed in signatures; references simpset:simpset ref etc. are
6619 replaced by functions simpset:unit->simpset and
6620 simpset_ref:unit->simpset ref; COMPATIBILITY: use isatool fixclasimp
6621 to patch your ML files accordingly;
6623 * HTML output now includes theory graph data for display with Java
6624 applet or isatool browser; data generated automatically via isatool
6625 usedir (see -i option, ISABELLE_USEDIR_OPTIONS);
6627 * defs may now be conditional; improved rewrite_goals_tac to handle
6628 conditional equations;
6630 * defs now admits additional type arguments, using TYPE('a) syntax;
6632 * theory aliases via merge (e.g. M=A+B+C) no longer supported, always
6633 creates a new theory node; implicit merge of thms' signatures is
6634 restricted to 'trivial' ones; COMPATIBILITY: one may have to use
6635 transfer:theory->thm->thm in (rare) cases;
6637 * improved handling of draft signatures / theories; draft thms (and
6638 ctyps, cterms) are automatically promoted to real ones;
6640 * slightly changed interfaces for oracles: admit many per theory, named
6641 (e.g. oracle foo = mlfun), additional name argument for invoke_oracle;
6643 * print_goals: optional output of const types (set show_consts and
6646 * improved output of warnings (###) and errors (***);
6648 * subgoal_tac displays a warning if the new subgoal has type variables;
6650 * removed old README and Makefiles;
6652 * replaced print_goals_ref hook by print_current_goals_fn and result_error_fn;
6654 * removed obsolete init_pps and init_database;
6656 * deleted the obsolete tactical STATE, which was declared by
6657 fun STATE tacfun st = tacfun st st;
6659 * cd and use now support path variables, e.g. $ISABELLE_HOME, or ~
6660 (which abbreviates $HOME);
6662 * changed Pure/Sequence interface (see Pure/seq.ML); COMPATIBILITY:
6663 use isatool fixseq to adapt your ML programs (this works for fully
6664 qualified references to the Sequence structure only!);
6666 * use_thy no longer requires writable current directory; it always
6667 reloads .ML *and* .thy file, if either one is out of date;
6670 *** Classical Reasoner ***
6672 * Clarify_tac, clarify_tac, clarify_step_tac, Clarify_step_tac: new
6673 tactics that use classical reasoning to simplify a subgoal without
6674 splitting it into several subgoals;
6676 * Safe_tac: like safe_tac but uses the default claset;
6681 * added simplification meta rules:
6682 (asm_)(full_)simplify: simpset -> thm -> thm;
6684 * simplifier.ML no longer part of Pure -- has to be loaded by object
6687 * added prems argument to simplification procedures;
6689 * HOL, FOL, ZF: added infix function `addsplits':
6690 instead of `<simpset> setloop (split_tac <thms>)'
6691 you can simply write `<simpset> addsplits <thms>'
6696 * TYPE('a) syntax for type reflection terms;
6698 * no longer handles consts with name "" -- declare as 'syntax' instead;
6700 * pretty printer: changed order of mixfix annotation preference (again!);
6702 * Pure: fixed idt/idts vs. pttrn/pttrns syntactic categories;
6707 * HOL: there is a new splitter `split_asm_tac' that can be used e.g.
6708 with `addloop' of the simplifier to faciliate case splitting in premises.
6710 * HOL/TLA: Stephan Merz's formalization of Lamport's Temporal Logic of Actions;
6712 * HOL/Auth: new protocol proofs including some for the Internet
6715 * HOL/Map: new theory of `maps' a la VDM;
6717 * HOL/simplifier: simplification procedures nat_cancel_sums for
6718 cancelling out common nat summands from =, <, <= (in)equalities, or
6719 differences; simplification procedures nat_cancel_factor for
6720 cancelling common factor from =, <, <= (in)equalities over natural
6721 sums; nat_cancel contains both kinds of procedures, it is installed by
6722 default in Arith.thy -- this COULD MAKE EXISTING PROOFS FAIL;
6724 * HOL/simplifier: terms of the form
6725 `? x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x)' (or t=x)
6727 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t)',
6728 and those of the form
6729 `! x. P1(x) & ... & Pn(x) & x=t & Q1(x) & ... Qn(x) --> R(x)' (or t=x)
6731 `P1(t) & ... & Pn(t) & Q1(t) & ... Qn(t) --> R(t)',
6734 Each datatype `t' now comes with a theorem `split_t_case' of the form
6736 P(t_case f1 ... fn x) =
6737 ( (!y1 ... ym1. x = C1 y1 ... ym1 --> P(f1 y1 ... ym1)) &
6739 (!y1 ... ymn. x = Cn y1 ... ymn --> P(f1 y1 ... ymn))
6742 and a theorem `split_t_case_asm' of the form
6744 P(t_case f1 ... fn x) =
6745 ~( (? y1 ... ym1. x = C1 y1 ... ym1 & ~P(f1 y1 ... ym1)) |
6747 (? y1 ... ymn. x = Cn y1 ... ymn & ~P(f1 y1 ... ymn))
6749 which can be added to a simpset via `addsplits'. The existing theorems
6750 expand_list_case and expand_option_case have been renamed to
6751 split_list_case and split_option_case.
6754 - `pred n' is automatically converted to `n-1'.
6755 Users are strongly encouraged not to use `pred' any longer,
6756 because it will disappear altogether at some point.
6757 - Users are strongly encouraged to write "0 < n" rather than
6758 "n ~= 0". Theorems and proof tools have been modified towards this
6762 the function "set_of_list" has been renamed "set" (and its theorems too);
6763 the function "nth" now takes its arguments in the reverse order and
6764 has acquired the infix notation "!" as in "xs!n".
6766 * HOL/Set: UNIV is now a constant and is no longer translated to Compl{};
6768 * HOL/Set: The operator (UN x.B x) now abbreviates (UN x:UNIV. B x) and its
6769 specialist theorems (like UN1_I) are gone. Similarly for (INT x.B x);
6771 * HOL/record: extensible records with schematic structural subtyping
6772 (single inheritance); EXPERIMENTAL version demonstrating the encoding,
6773 still lacks various theorems and concrete record syntax;
6778 * removed "axioms" and "generated by" sections;
6780 * replaced "ops" section by extended "consts" section, which is capable of
6781 handling the continuous function space "->" directly;
6784 . proves theorems immediately and stores them in the theory,
6785 . creates hierachical name space,
6786 . now uses normal mixfix annotations (instead of cinfix...),
6787 . minor changes to some names and values (for consistency),
6788 . e.g. cases -> casedist, dists_eq -> dist_eqs, [take_lemma] -> take_lemmas,
6789 . separator between mutual domain defs: changed "," to "and",
6790 . improved handling of sort constraints; now they have to
6791 appear on the left-hand side of the equations only;
6793 * fixed LAM <x,y,zs>.b syntax;
6795 * added extended adm_tac to simplifier in HOLCF -- can now discharge
6796 adm (%x. P (t x)), where P is chainfinite and t continuous;
6801 * FOL: there is a new splitter `split_asm_tac' that can be used e.g.
6802 with `addloop' of the simplifier to faciliate case splitting in premises.
6804 * qed_spec_mp, qed_goal_spec_mp, qed_goalw_spec_mp are available, as
6805 in HOL, they strip ALL and --> from proved theorems;
6809 New in Isabelle94-8 (May 1997)
6810 ------------------------------
6812 *** General Changes ***
6814 * new utilities to build / run / maintain Isabelle etc. (in parts
6815 still somewhat experimental); old Makefiles etc. still functional;
6817 * new 'Isabelle System Manual';
6819 * INSTALL text, together with ./configure and ./build scripts;
6821 * reimplemented type inference for greater efficiency, better error
6822 messages and clean internal interface;
6824 * prlim command for dealing with lots of subgoals (an easier way of
6825 setting goals_limit);
6830 * supports alternative (named) syntax tables (parser and pretty
6831 printer); internal interface is provided by add_modesyntax(_i);
6833 * Pure, FOL, ZF, HOL, HOLCF now support symbolic input and output; to
6834 be used in conjunction with the Isabelle symbol font; uses the
6835 "symbols" syntax table;
6837 * added token_translation interface (may translate name tokens in
6838 arbitrary ways, dependent on their type (free, bound, tfree, ...) and
6839 the current print_mode); IMPORTANT: user print translation functions
6840 are responsible for marking newly introduced bounds
6841 (Syntax.mark_boundT);
6843 * token translations for modes "xterm" and "xterm_color" that display
6844 names in bold, underline etc. or colors (which requires a color
6847 * infixes may now be declared with names independent of their syntax;
6849 * added typed_print_translation (like print_translation, but may
6850 access type of constant);
6853 *** Classical Reasoner ***
6855 Blast_tac: a new tactic! It is often more powerful than fast_tac, but has
6856 some limitations. Blast_tac...
6857 + ignores addss, addbefore, addafter; this restriction is intrinsic
6858 + ignores elimination rules that don't have the correct format
6859 (the conclusion MUST be a formula variable)
6860 + ignores types, which can make HOL proofs fail
6861 + rules must not require higher-order unification, e.g. apply_type in ZF
6862 [message "Function Var's argument not a bound variable" relates to this]
6863 + its proof strategy is more general but can actually be slower
6865 * substitution with equality assumptions no longer permutes other
6868 * minor changes in semantics of addafter (now called addaltern); renamed
6869 setwrapper to setWrapper and compwrapper to compWrapper; added safe wrapper
6870 (and access functions for it);
6872 * improved combination of classical reasoner and simplifier:
6873 + functions for handling clasimpsets
6874 + improvement of addss: now the simplifier is called _after_ the
6876 + safe variant of addss called addSss: uses safe simplifications
6877 _during_ the safe steps. It is more complete as it allows multiple
6878 instantiations of unknowns (e.g. with slow_tac).
6882 * added interface for simplification procedures (functions that
6883 produce *proven* rewrite rules on the fly, depending on current
6886 * ordering on terms as parameter (used for ordered rewriting);
6888 * new functions delcongs, deleqcongs, and Delcongs. richer rep_ss;
6890 * the solver is now split into a safe and an unsafe part.
6891 This should be invisible for the normal user, except that the
6892 functions setsolver and addsolver have been renamed to setSolver and
6893 addSolver; added safe_asm_full_simp_tac;
6898 * a generic induction tactic `induct_tac' which works for all datatypes and
6899 also for type `nat';
6901 * a generic case distinction tactic `exhaust_tac' which works for all
6902 datatypes and also for type `nat';
6904 * each datatype comes with a function `size';
6906 * patterns in case expressions allow tuple patterns as arguments to
6907 constructors, for example `case x of [] => ... | (x,y,z)#ps => ...';
6909 * primrec now also works with type nat;
6911 * recdef: a new declaration form, allows general recursive functions to be
6912 defined in theory files. See HOL/ex/Fib, HOL/ex/Primes, HOL/Subst/Unify.
6914 * the constant for negation has been renamed from "not" to "Not" to
6915 harmonize with FOL, ZF, LK, etc.;
6917 * HOL/ex/LFilter theory of a corecursive "filter" functional for
6920 * HOL/Modelcheck demonstrates invocation of model checker oracle;
6922 * HOL/ex/Ring.thy declares cring_simp, which solves equational
6923 problems in commutative rings, using axiomatic type classes for + and *;
6925 * more examples in HOL/MiniML and HOL/Auth;
6927 * more default rewrite rules for quantifiers, union/intersection;
6929 * a new constant `arbitrary == @x.False';
6931 * HOLCF/IOA replaces old HOL/IOA;
6933 * HOLCF changes: derived all rules and arities
6934 + axiomatic type classes instead of classes
6935 + typedef instead of faking type definitions
6936 + eliminated the internal constants less_fun, less_cfun, UU_fun, UU_cfun etc.
6937 + new axclasses cpo, chfin, flat with flat < chfin < pcpo < cpo < po
6938 + eliminated the types void, one, tr
6939 + use unit lift and bool lift (with translations) instead of one and tr
6940 + eliminated blift from Lift3.thy (use Def instead of blift)
6941 all eliminated rules are derived as theorems --> no visible changes ;
6946 * ZF now has Fast_tac, Simp_tac and Auto_tac. Union_iff is a now a default
6947 rewrite rule; this may affect some proofs. eq_cs is gone but can be put back
6948 as ZF_cs addSIs [equalityI];
6952 New in Isabelle94-7 (November 96)
6953 ---------------------------------
6955 * allowing negative levels (as offsets) in prlev and choplev;
6957 * super-linear speedup for large simplifications;
6959 * FOL, ZF and HOL now use miniscoping: rewriting pushes
6960 quantifications in as far as possible (COULD MAKE EXISTING PROOFS
6961 FAIL); can suppress it using the command Delsimps (ex_simps @
6962 all_simps); De Morgan laws are also now included, by default;
6964 * improved printing of ==> : ~:
6966 * new object-logic "Sequents" adds linear logic, while replacing LK
6967 and Modal (thanks to Sara Kalvala);
6969 * HOL/Auth: correctness proofs for authentication protocols;
6971 * HOL: new auto_tac combines rewriting and classical reasoning (many
6972 examples on HOL/Auth);
6974 * HOL: new command AddIffs for declaring theorems of the form P=Q to
6975 the rewriter and classical reasoner simultaneously;
6977 * function uresult no longer returns theorems in "standard" format;
6978 regain previous version by: val uresult = standard o uresult;
6985 * oracles -- these establish an interface between Isabelle and trusted
6986 external reasoners, which may deliver results as theorems;
6988 * proof objects (in particular record all uses of oracles);
6990 * Simp_tac, Fast_tac, etc. that refer to implicit simpset / claset;
6992 * "constdefs" section in theory files;
6994 * "primrec" section (HOL) no longer requires names;
6996 * internal type "tactic" now simply "thm -> thm Sequence.seq";
7003 * reduced space requirements;
7005 * automatic HTML generation from theories;
7007 * theory files no longer require "..." (quotes) around most types;
7009 * new examples, including two proofs of the Church-Rosser theorem;
7011 * non-curried (1994) version of HOL is no longer distributed;
7018 * greatly reduced space requirements;
7020 * theory files (.thy) no longer require \...\ escapes at line breaks;
7022 * searchable theorem database (see the section "Retrieving theorems" on
7023 page 8 of the Reference Manual);
7025 * new examples, including Grabczewski's monumental case study of the
7028 * The previous version of HOL renamed to Old_HOL;
7030 * The new version of HOL (previously called CHOL) uses a curried syntax
7031 for functions. Application looks like f a b instead of f(a,b);
7033 * Mutually recursive inductive definitions finally work in HOL;
7035 * In ZF, pattern-matching on tuples is now available in all abstractions and
7036 translates to the operator "split";
7043 * new infix operator, addss, allowing the classical reasoner to
7044 perform simplification at each step of its search. Example:
7045 fast_tac (cs addss ss)
7047 * a new logic, CHOL, the same as HOL, but with a curried syntax
7048 for functions. Application looks like f a b instead of f(a,b). Also pairs
7049 look like (a,b) instead of <a,b>;
7051 * PLEASE NOTE: CHOL will eventually replace HOL!
7053 * In CHOL, pattern-matching on tuples is now available in all abstractions.
7054 It translates to the operator "split". A new theory of integers is available;
7056 * In ZF, integer numerals now denote two's-complement binary integers.
7057 Arithmetic operations can be performed by rewriting. See ZF/ex/Bin.ML;
7059 * Many new examples: I/O automata, Church-Rosser theorem, equivalents
7060 of the Axiom of Choice;
7067 * Significantly faster resolution;
7069 * the different sections in a .thy file can now be mixed and repeated
7072 * Database of theorems for FOL, HOL and ZF. New
7073 commands including qed, qed_goal and bind_thm store theorems in the database.
7075 * Simple database queries: return a named theorem (get_thm) or all theorems of
7076 a given theory (thms_of), or find out what theory a theorem was proved in
7079 * Bugs fixed in the inductive definition and datatype packages;
7081 * The classical reasoner provides deepen_tac and depth_tac, making FOL_dup_cs
7082 and HOL_dup_cs obsolete;
7084 * Syntactic ambiguities caused by the new treatment of syntax in Isabelle94-1
7087 * Simpler definition of function space in ZF;
7089 * new results about cardinal and ordinal arithmetic in ZF;
7091 * 'subtype' facility in HOL for introducing new types as subsets of existing
7094 :mode=text:wrap=hard:maxLineLen=72: